{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZO5U3SR7V5NBPVLE2AFO4HBSV7","short_pith_number":"pith:ZO5U3SR7","schema_version":"1.0","canonical_sha256":"cbbb4dca3faf5a17d564d00aee1c32afdd7798e05c422ba8cc3caac056401ece","source":{"kind":"arxiv","id":"2605.21221","version":1},"attestation_state":"computed","paper":{"title":"Binomial coefficients with divisors avoiding an interval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexandru Zaharescu, Hung M. Bui, Kyle Pratt","submitted_at":"2026-05-20T14:14:12Z","abstract_excerpt":"We investigate a fifty-year-old conjecture of Erd\\H{o}s and Graham concerning whether the binomial coefficient ${n \\choose k}$ with $1 \\leq k \\leq \\frac{n}{2}$ must always have a divisor $\\leq n$ that is ``close'' to $n$: that is, bigger than a constant times $n$. We show this is the case when $k$ is sufficiently large as a function of $n$. However, we show (under the Generalized Riemann Hypothesis) it is possible to find binomial coefficients ${n \\choose k}$, where $k$ is small compared to $n$, such that ${n \\choose k}$ does not have divisors $\\leq n$ close to $n$. This settles the conjecture"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.21221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-20T14:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"0ff70d86b5803f29c537aa723ab282e330482f2f4d19a009a8b50252eecc3d5c","abstract_canon_sha256":"1282bdf7eece5e7d2616681cdf0da86e7b52f927079aecb20638ba31871698d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:44.171515Z","signature_b64":"kd4+K3+3E//3qm98qFg4xLr8snkMBAWyKsC+fAIDwfu4Vp9sA5Ixam4Z+sVatwknRSS6gJiQIR8YU6Hyd3+gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbbb4dca3faf5a17d564d00aee1c32afdd7798e05c422ba8cc3caac056401ece","last_reissued_at":"2026-05-21T01:05:44.170795Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:44.170795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binomial coefficients with divisors avoiding an interval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alexandru Zaharescu, Hung M. Bui, Kyle Pratt","submitted_at":"2026-05-20T14:14:12Z","abstract_excerpt":"We investigate a fifty-year-old conjecture of Erd\\H{o}s and Graham concerning whether the binomial coefficient ${n \\choose k}$ with $1 \\leq k \\leq \\frac{n}{2}$ must always have a divisor $\\leq n$ that is ``close'' to $n$: that is, bigger than a constant times $n$. We show this is the case when $k$ is sufficiently large as a function of $n$. However, we show (under the Generalized Riemann Hypothesis) it is possible to find binomial coefficients ${n \\choose k}$, where $k$ is small compared to $n$, such that ${n \\choose k}$ does not have divisors $\\leq n$ close to $n$. This settles the conjecture"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21221","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21221/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21221","created_at":"2026-05-21T01:05:44.170918+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21221v1","created_at":"2026-05-21T01:05:44.170918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21221","created_at":"2026-05-21T01:05:44.170918+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZO5U3SR7V5NB","created_at":"2026-05-21T01:05:44.170918+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZO5U3SR7V5NBPVLE","created_at":"2026-05-21T01:05:44.170918+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZO5U3SR7","created_at":"2026-05-21T01:05:44.170918+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7","json":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7.json","graph_json":"https://pith.science/api/pith-number/ZO5U3SR7V5NBPVLE2AFO4HBSV7/graph.json","events_json":"https://pith.science/api/pith-number/ZO5U3SR7V5NBPVLE2AFO4HBSV7/events.json","paper":"https://pith.science/paper/ZO5U3SR7"},"agent_actions":{"view_html":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7","download_json":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7.json","view_paper":"https://pith.science/paper/ZO5U3SR7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21221&json=true","fetch_graph":"https://pith.science/api/pith-number/ZO5U3SR7V5NBPVLE2AFO4HBSV7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZO5U3SR7V5NBPVLE2AFO4HBSV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7/action/storage_attestation","attest_author":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7/action/author_attestation","sign_citation":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7/action/citation_signature","submit_replication":"https://pith.science/pith/ZO5U3SR7V5NBPVLE2AFO4HBSV7/action/replication_record"}},"created_at":"2026-05-21T01:05:44.170918+00:00","updated_at":"2026-05-21T01:05:44.170918+00:00"}