{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QZH7QRHP43GV7TUGGETOWEVUDV","short_pith_number":"pith:QZH7QRHP","schema_version":"1.0","canonical_sha256":"864ff844efe6cd5fce863126eb12b41d4ee75f9205c575b037ee16b22fc020e3","source":{"kind":"arxiv","id":"2606.02312","version":1},"attestation_state":"computed","paper":{"title":"Arithmetic regularity as an alternative to transference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Sam Chow, Santiago Vazquez, Sean Prendiville","submitted_at":"2026-06-01T14:30:26Z","abstract_excerpt":"Since Green (2005), the Fourier-analytic transference principle has dominated the landscape of combinatorial theorems relative to sparse arithmetic sets. We demonstrate a different approach using arithmetic regularity. This is more versatile and has the potential to succeed when no obvious `dense model' is forthcoming. Moreover, we contend that, just as the traditional circle method disassembles an arithmetic problem into real and $p$-adic parts which can be solved individually, the arithmetic regularity method generalises this to yield an additional `combinatorial' factor. This framework lead"},"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":"2606.02312","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-06-01T14:30:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a12319b467d4a99553c87c0fba15826259dc437a41b119a2c93d3309d58dbf7","abstract_canon_sha256":"3de4dafb1f412125211b3ae6e44ff97f66d6879bd973a740b54ac6870707da2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:55.796015Z","signature_b64":"JTxP3crc5Kgbdg4fZm5FQr6UFKQjwBd1NYX0WihNV+jE8pEyrEE16JJ3M1ECITfw1V1n+IR8gwCM19/D49jACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"864ff844efe6cd5fce863126eb12b41d4ee75f9205c575b037ee16b22fc020e3","last_reissued_at":"2026-06-02T03:04:55.795638Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:55.795638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Arithmetic regularity as an alternative to transference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Sam Chow, Santiago Vazquez, Sean Prendiville","submitted_at":"2026-06-01T14:30:26Z","abstract_excerpt":"Since Green (2005), the Fourier-analytic transference principle has dominated the landscape of combinatorial theorems relative to sparse arithmetic sets. We demonstrate a different approach using arithmetic regularity. This is more versatile and has the potential to succeed when no obvious `dense model' is forthcoming. Moreover, we contend that, just as the traditional circle method disassembles an arithmetic problem into real and $p$-adic parts which can be solved individually, the arithmetic regularity method generalises this to yield an additional `combinatorial' factor. This framework lead"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02312","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/2606.02312/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":"2606.02312","created_at":"2026-06-02T03:04:55.795693+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02312v1","created_at":"2026-06-02T03:04:55.795693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02312","created_at":"2026-06-02T03:04:55.795693+00:00"},{"alias_kind":"pith_short_12","alias_value":"QZH7QRHP43GV","created_at":"2026-06-02T03:04:55.795693+00:00"},{"alias_kind":"pith_short_16","alias_value":"QZH7QRHP43GV7TUG","created_at":"2026-06-02T03:04:55.795693+00:00"},{"alias_kind":"pith_short_8","alias_value":"QZH7QRHP","created_at":"2026-06-02T03:04:55.795693+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/QZH7QRHP43GV7TUGGETOWEVUDV","json":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV.json","graph_json":"https://pith.science/api/pith-number/QZH7QRHP43GV7TUGGETOWEVUDV/graph.json","events_json":"https://pith.science/api/pith-number/QZH7QRHP43GV7TUGGETOWEVUDV/events.json","paper":"https://pith.science/paper/QZH7QRHP"},"agent_actions":{"view_html":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV","download_json":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV.json","view_paper":"https://pith.science/paper/QZH7QRHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02312&json=true","fetch_graph":"https://pith.science/api/pith-number/QZH7QRHP43GV7TUGGETOWEVUDV/graph.json","fetch_events":"https://pith.science/api/pith-number/QZH7QRHP43GV7TUGGETOWEVUDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV/action/storage_attestation","attest_author":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV/action/author_attestation","sign_citation":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV/action/citation_signature","submit_replication":"https://pith.science/pith/QZH7QRHP43GV7TUGGETOWEVUDV/action/replication_record"}},"created_at":"2026-06-02T03:04:55.795693+00:00","updated_at":"2026-06-02T03:04:55.795693+00:00"}