{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LRYGSSCPTRY57K4MZ4EIXMQJCN","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":"7936f937e5be26f5beff9b67ebb35bf84b21e87237382f191cf61d7fd3aed9da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T09:25:33Z","title_canon_sha256":"7242d1037449f5ff28993de9f32f6c309ab145989975900941539ee48388ed26"},"schema_version":"1.0","source":{"id":"1710.01936","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.01936","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"arxiv_version","alias_value":"1710.01936v4","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.01936","created_at":"2026-05-17T23:51:34Z"},{"alias_kind":"pith_short_12","alias_value":"LRYGSSCPTRY5","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LRYGSSCPTRY57K4M","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LRYGSSCP","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:d1862594a477051ea58e5193a6225dad4688406f6e030eea0f172c92e02701a4","target":"graph","created_at":"2026-05-17T23:51:34Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"For a prime number $p$ and a sequence of integers $a_0,\\dots,a_k\\in \\{0,1,\\dots,p\\}$, let $s(a_0,\\dots,a_k)$ be the minimum number of $(k+1)$-tuples $(x_0,\\dots,x_k)\\in A_0\\times\\dots\\times A_k$ with $x_0=x_1+\\dots + x_k$, over subsets $A_0,\\dots,A_k\\subseteq\\mathbb{Z}_p$ of sizes $a_0,\\dots,a_k$ respectively. An elegant argument of Lev (independently rediscovered by Samotij and Sudakov) shows that there exists an extremal configuration with all sets $A_i$ being intervals of appropriate length, and that the same conclusion also holds for the related problem, reposed by Bajnok, when $a_0=\\dots=","authors_text":"Katherine Staden, Oleg Pikhurko, Ostap Chervak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T09:25:33Z","title":"Minimum number of additive tuples in groups of prime order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.01936","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dc60085db936b33c3311e0e31d9d51503f8ccbcd085490ae09dafb951a9c788b","target":"record","created_at":"2026-05-17T23:51:34Z","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":"7936f937e5be26f5beff9b67ebb35bf84b21e87237382f191cf61d7fd3aed9da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-05T09:25:33Z","title_canon_sha256":"7242d1037449f5ff28993de9f32f6c309ab145989975900941539ee48388ed26"},"schema_version":"1.0","source":{"id":"1710.01936","kind":"arxiv","version":4}},"canonical_sha256":"5c7069484f9c71dfab8ccf088bb209136b3a41b9a43edcd4b695826b3048a179","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c7069484f9c71dfab8ccf088bb209136b3a41b9a43edcd4b695826b3048a179","first_computed_at":"2026-05-17T23:51:34.401355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:34.401355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G3n602ycAS80RrgQwlqdDrdsEIyuXbl9pu7PPsxY1XbEs+0j7vWGCU25syti3UitV71vEUEvFD3cjHYW/RwvCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:34.402084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.01936","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc60085db936b33c3311e0e31d9d51503f8ccbcd085490ae09dafb951a9c788b","sha256:d1862594a477051ea58e5193a6225dad4688406f6e030eea0f172c92e02701a4"],"state_sha256":"015a9e455dce8e98754ce1c4627bf175834a291bbc84f7050ed6927957e95132"}