{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:22VNV2RR2NEISPCDS3ADCK6SR4","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":"e9a0c4e3f4003d48a15bc56a57e55a47ffac50877d3ba844469c4c446514c763","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T16:01:19Z","title_canon_sha256":"96b59bcb54f165d046c2ac57ab9c3ca088b41ca98f6ebf7e04902983a002cec1"},"schema_version":"1.0","source":{"id":"1511.08435","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08435","created_at":"2026-05-18T01:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08435v3","created_at":"2026-05-18T01:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08435","created_at":"2026-05-18T01:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"22VNV2RR2NEI","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"22VNV2RR2NEISPCD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"22VNV2RR","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:f41f240e42f0d152029366086e7528c1ad80bcb3525131e2f786095de8fe5d81","target":"graph","created_at":"2026-05-18T01:11:35Z","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":"Given two identical linear codes $\\mathcal C$ over $\\mathbb F_q$ of length $n$, we independently pick one codeword from each codebook uniformly at random. A $\\textit{sumset}$ is formed by adding these two codewords entry-wise as integer vectors and a sumset is called $\\textit{typical}$, if the sum falls inside this set with high probability. We ask the question: how large is the typical sumset for most codes? In this paper we characterize the asymptotic size of such typical sumset. We show that when the rate $R$ of the linear code is below a certain threshold $D$, the typical sumset size is ro","authors_text":"Jingge Zhu, Michael Gastpar","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T16:01:19Z","title":"Typical sumsets of linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08435","kind":"arxiv","version":3},"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:06eddb089611fc6d5fbe42704584de1b0bfe1eec3f531836791c05d6a5d4841a","target":"record","created_at":"2026-05-18T01:11:35Z","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":"e9a0c4e3f4003d48a15bc56a57e55a47ffac50877d3ba844469c4c446514c763","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T16:01:19Z","title_canon_sha256":"96b59bcb54f165d046c2ac57ab9c3ca088b41ca98f6ebf7e04902983a002cec1"},"schema_version":"1.0","source":{"id":"1511.08435","kind":"arxiv","version":3}},"canonical_sha256":"d6aadaea31d348893c4396c0312bd28f20fcf5c8635ee2d4ce7532560a21bfa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6aadaea31d348893c4396c0312bd28f20fcf5c8635ee2d4ce7532560a21bfa3","first_computed_at":"2026-05-18T01:11:35.172382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:35.172382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TX1k9P1/2qgMKXoE5TjLWr18jWQCDb698MxyJIQp9yp8WC65jM09mfzYwsUBxxSGtsjwMbTC4ToitEqERSkIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:35.172755Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08435","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06eddb089611fc6d5fbe42704584de1b0bfe1eec3f531836791c05d6a5d4841a","sha256:f41f240e42f0d152029366086e7528c1ad80bcb3525131e2f786095de8fe5d81"],"state_sha256":"037f0eb1de11a2dd5ce83b718f20d8956bf9b6e877254a0c1f15f432078d78c9"}