{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DSHKI22R3FAONEDCRYQXJBJOW4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b081ffbaa491fd57f996191f8ae2b4b6b2af9ae84383a348a8c8b110e9ac13b0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-15T17:29:24Z","title_canon_sha256":"ada7c1b45f35afc48b4a46069770661ce3eba1b174fae53ff7e215eb9e09204c"},"schema_version":"1.0","source":{"id":"2605.16216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16216","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16216v1","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16216","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"DSHKI22R3FAO","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"DSHKI22R3FAONEDC","created_at":"2026-05-20T00:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"DSHKI22R","created_at":"2026-05-20T00:01:58Z"}],"graph_snapshots":[{"event_id":"sha256:51afa09e162b7b3846f1ed8862e10af27a55130d3766ff53038960cd64db830d","target":"graph","created_at":"2026-05-20T00:01:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We adapt their method to general intersective polynomials h∈Z[x] and obtain an analogous quasipolynomial upper bound for the largest subset of {1,2,…,X} whose difference set contains no nonzero element of the form h(n) with n∈Z."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The arithmetic level-d inequality remains effective uniformly across all auxiliary polynomials arising in the iteration."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Extends Furstenberg-Sárközy to general intersective polynomials h via uniform arithmetic level-d inequality, yielding the best known quasipolynomial density bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For any intersective polynomial h the largest subset of {1,...,X} without nonzero h(n) differences has a quasipolynomial upper bound on size."}],"snapshot_sha256":"85c3d1ddae52dc8e435031c0485bbd71a0ce4fd06833a6b04b933ece387c3bea"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.879111Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T18:40:53.147500Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T17:49:44.669110Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T17:49:44.158729Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:24.782416Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"external_links","ran_at":"2026-05-19T17:31:33.196841Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T17:22:06.226459Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.388848Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16216/integrity.json","findings":[],"snapshot_sha256":"5f543e25500c8321b86f5fac8c79c1cd3ccac193f9078e2094aa3670b84a68a7","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Very recently, Green and Sawhney obtained a quasipolynomial bound in the Furstenberg--S\\'ark\\\"ozy theorem for square differences by proving an ''arithmetic level-$d$'' inequality, thereby yielding a greatly improved density increment scheme. We adapt their method to general intersective polynomials $h\\in\\mathbb{Z}[x]$ and obtain an analogous quasipolynomial upper bound for the largest subset of $\\{1,2,\\dots,X\\}$ whose difference set contains no nonzero element of the form $h(n)$ with $n\\in \\mathbb{Z}$. This is the best quantitative upper bound presently known for sets lacking intersective poly","authors_text":"Andrew Lott, Carlo Francisco E. Adajar, Chian Yeong Chuah, Krishnamohan Nandakumar, Mukul Rai Choudhuri, Nagendar Reddy Ponagandla, Rishika Agrawal, Steve Fan, Swaroop Hegde","cross_cats":["math.CO"],"headline":"For any intersective polynomial h the largest subset of {1,...,X} without nonzero h(n) differences has a quasipolynomial upper bound on size.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-15T17:29:24Z","title":"Extensions of the Furstenberg-S\\'ark\\\"ozy theorem via the arithmetic level-$d$ inequality"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Arala,A maximal extension of the Bloom–Maynard bound for sets without square differences, Funct","work_id":"a70de516-ef89-4f8d-9e05-3ec07304e681","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A. Balog, J. Pelik´ an, J. Pintz, and E. Szemer´ edi,Difference sets withoutκth powers, Acta Math. Hungar. 65(1994), 165–187","work_id":"6f253410-6478-41a3-b2a3-17eaf0386e35","year":1994},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"T. F. Bloom and J. Maynard,A new upper bound for sets with no square differences, Compos. Math. 158(2022), 1777–1798","work_id":"217afe16-d671-4298-a3e4-e922bf84aa66","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Davenport,Analytic methods for diophantine equations and diophantine inequalities, 2nd ed., Cam- bridge Mathematical Library, Cambridge University Press, 2005","work_id":"e2edd969-6d69-4157-9fb8-19ce50c4f332","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"R. Doyle, J. and A. Rice,Multivariate polynomial values in difference sets, Discrete Anal. (2021), no. 11, 46 pp","work_id":"577aef4d-3b7e-445a-a305-746c19a3301f","year":2021}],"snapshot_sha256":"1bce3b2c848b743cea8f9599288e690f5d559825abbe9ec1e067832688a88f4f"},"source":{"id":"2605.16216","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:27:12.380056Z","id":"9809a34e-c3d3-4d1c-8a65-ee134b8e1583","model_set":{"reader":"grok-4.3"},"one_line_summary":"Extends Furstenberg-Sárközy to general intersective polynomials h via uniform arithmetic level-d inequality, yielding the best known quasipolynomial density bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For any intersective polynomial h the largest subset of {1,...,X} without nonzero h(n) differences has a quasipolynomial upper bound on size.","strongest_claim":"We adapt their method to general intersective polynomials h∈Z[x] and obtain an analogous quasipolynomial upper bound for the largest subset of {1,2,…,X} whose difference set contains no nonzero element of the form h(n) with n∈Z.","weakest_assumption":"The arithmetic level-d inequality remains effective uniformly across all auxiliary polynomials arising in the iteration."}},"verdict_id":"9809a34e-c3d3-4d1c-8a65-ee134b8e1583"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6aff7eaf63f953bc175c857423fd8d04fe6e733a0162f84315c91b44a8b30ed4","target":"record","created_at":"2026-05-20T00:01:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b081ffbaa491fd57f996191f8ae2b4b6b2af9ae84383a348a8c8b110e9ac13b0","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-15T17:29:24Z","title_canon_sha256":"ada7c1b45f35afc48b4a46069770661ce3eba1b174fae53ff7e215eb9e09204c"},"schema_version":"1.0","source":{"id":"2605.16216","kind":"arxiv","version":1}},"canonical_sha256":"1c8ea46b51d940e690628e2174852eb72163d1dcb6034b166b5282e6afdeaa59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c8ea46b51d940e690628e2174852eb72163d1dcb6034b166b5282e6afdeaa59","first_computed_at":"2026-05-20T00:01:58.498795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:58.498795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cep7n6UhkeaNrXTWic+sk6pR3WWZhLV9p9GWl3BSGL17JYKJdFx6/U8SGtGF8XBefLB3iQRsSB6jkPJETA2VDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:58.499674Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6aff7eaf63f953bc175c857423fd8d04fe6e733a0162f84315c91b44a8b30ed4","sha256:51afa09e162b7b3846f1ed8862e10af27a55130d3766ff53038960cd64db830d"],"state_sha256":"c2571d0894dffc814fa5b4db4a4ba717677803a8fb003cc6d335138a528b2ec9"}