{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CU73EPPBKLOW5ZU4KX2TDO45IQ","short_pith_number":"pith:CU73EPPB","schema_version":"1.0","canonical_sha256":"153fb23de152dd6ee69c55f531bb9d440406e0d1cb29d1b753aea94cefdbdb2e","source":{"kind":"arxiv","id":"2605.21753","version":1},"attestation_state":"computed","paper":{"title":"Finding a Solution to the Erd\\H{o}s-Ginzburg-Ziv Theorem in Linear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Sunghyeon Jo","submitted_at":"2026-05-20T21:26:09Z","abstract_excerpt":"The Erd\\H{o}s-Ginzburg-Ziv theorem states that every sequence of 2n - 1 integers contains a subsequence of length n whose sum is divisible by n. Choi, Kang, and Lim gave a simple deterministic O(n log n) algorithm for finding such a subsequence, and Leung recently improved this to O(n log log log n). We give a deterministic linear-time algorithm. The core is a linear-time algorithm for the following prime target subset-sum problem: given p - 1 nonzero residues in Z_p and a target residue, find a subset with the prescribed sum. Our algorithm maintains a compact arithmetic-progression representa"},"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.21753","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-20T21:26:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d9af45cf04a6658d3e49037d166d3573993ca9cf5026307f437c66739c3fb655","abstract_canon_sha256":"609506b340bcb6e2369dbb9d47f89170bd1764de512edaa9e35b339a1b63c395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:30.584398Z","signature_b64":"+7dQHbruGrbVxFJM/U9mFjd01TbH3LOIT4VNTKBzrOstq0FaBaC4QwlsCpC98s5NmW7ByqZM9gjdzIY1xlPLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"153fb23de152dd6ee69c55f531bb9d440406e0d1cb29d1b753aea94cefdbdb2e","last_reissued_at":"2026-05-22T01:03:30.583698Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:30.583698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a Solution to the Erd\\H{o}s-Ginzburg-Ziv Theorem in Linear Time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Sunghyeon Jo","submitted_at":"2026-05-20T21:26:09Z","abstract_excerpt":"The Erd\\H{o}s-Ginzburg-Ziv theorem states that every sequence of 2n - 1 integers contains a subsequence of length n whose sum is divisible by n. Choi, Kang, and Lim gave a simple deterministic O(n log n) algorithm for finding such a subsequence, and Leung recently improved this to O(n log log log n). We give a deterministic linear-time algorithm. The core is a linear-time algorithm for the following prime target subset-sum problem: given p - 1 nonzero residues in Z_p and a target residue, find a subset with the prescribed sum. Our algorithm maintains a compact arithmetic-progression representa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21753","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.21753/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.21753","created_at":"2026-05-22T01:03:30.583812+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21753v1","created_at":"2026-05-22T01:03:30.583812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21753","created_at":"2026-05-22T01:03:30.583812+00:00"},{"alias_kind":"pith_short_12","alias_value":"CU73EPPBKLOW","created_at":"2026-05-22T01:03:30.583812+00:00"},{"alias_kind":"pith_short_16","alias_value":"CU73EPPBKLOW5ZU4","created_at":"2026-05-22T01:03:30.583812+00:00"},{"alias_kind":"pith_short_8","alias_value":"CU73EPPB","created_at":"2026-05-22T01:03:30.583812+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/CU73EPPBKLOW5ZU4KX2TDO45IQ","json":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ.json","graph_json":"https://pith.science/api/pith-number/CU73EPPBKLOW5ZU4KX2TDO45IQ/graph.json","events_json":"https://pith.science/api/pith-number/CU73EPPBKLOW5ZU4KX2TDO45IQ/events.json","paper":"https://pith.science/paper/CU73EPPB"},"agent_actions":{"view_html":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ","download_json":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ.json","view_paper":"https://pith.science/paper/CU73EPPB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21753&json=true","fetch_graph":"https://pith.science/api/pith-number/CU73EPPBKLOW5ZU4KX2TDO45IQ/graph.json","fetch_events":"https://pith.science/api/pith-number/CU73EPPBKLOW5ZU4KX2TDO45IQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ/action/storage_attestation","attest_author":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ/action/author_attestation","sign_citation":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ/action/citation_signature","submit_replication":"https://pith.science/pith/CU73EPPBKLOW5ZU4KX2TDO45IQ/action/replication_record"}},"created_at":"2026-05-22T01:03:30.583812+00:00","updated_at":"2026-05-22T01:03:30.583812+00:00"}