{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:22VNV2RR2NEISPCDS3ADCK6SR4","short_pith_number":"pith:22VNV2RR","schema_version":"1.0","canonical_sha256":"d6aadaea31d348893c4396c0312bd28f20fcf5c8635ee2d4ce7532560a21bfa3","source":{"kind":"arxiv","id":"1511.08435","version":3},"attestation_state":"computed","paper":{"title":"Typical sumsets of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Michael Gastpar","submitted_at":"2015-11-26T16:01:19Z","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"},"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":"1511.08435","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-11-26T16:01:19Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"96b59bcb54f165d046c2ac57ab9c3ca088b41ca98f6ebf7e04902983a002cec1","abstract_canon_sha256":"e9a0c4e3f4003d48a15bc56a57e55a47ffac50877d3ba844469c4c446514c763"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:35.172755Z","signature_b64":"TX1k9P1/2qgMKXoE5TjLWr18jWQCDb698MxyJIQp9yp8WC65jM09mfzYwsUBxxSGtsjwMbTC4ToitEqERSkIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6aadaea31d348893c4396c0312bd28f20fcf5c8635ee2d4ce7532560a21bfa3","last_reissued_at":"2026-05-18T01:11:35.172382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:35.172382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typical sumsets of linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Michael Gastpar","submitted_at":"2015-11-26T16:01:19Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08435","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1511.08435","created_at":"2026-05-18T01:11:35.172439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08435v3","created_at":"2026-05-18T01:11:35.172439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08435","created_at":"2026-05-18T01:11:35.172439+00:00"},{"alias_kind":"pith_short_12","alias_value":"22VNV2RR2NEI","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"22VNV2RR2NEISPCD","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"22VNV2RR","created_at":"2026-05-18T12:28:59.999130+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/22VNV2RR2NEISPCDS3ADCK6SR4","json":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4.json","graph_json":"https://pith.science/api/pith-number/22VNV2RR2NEISPCDS3ADCK6SR4/graph.json","events_json":"https://pith.science/api/pith-number/22VNV2RR2NEISPCDS3ADCK6SR4/events.json","paper":"https://pith.science/paper/22VNV2RR"},"agent_actions":{"view_html":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4","download_json":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4.json","view_paper":"https://pith.science/paper/22VNV2RR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08435&json=true","fetch_graph":"https://pith.science/api/pith-number/22VNV2RR2NEISPCDS3ADCK6SR4/graph.json","fetch_events":"https://pith.science/api/pith-number/22VNV2RR2NEISPCDS3ADCK6SR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4/action/storage_attestation","attest_author":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4/action/author_attestation","sign_citation":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4/action/citation_signature","submit_replication":"https://pith.science/pith/22VNV2RR2NEISPCDS3ADCK6SR4/action/replication_record"}},"created_at":"2026-05-18T01:11:35.172439+00:00","updated_at":"2026-05-18T01:11:35.172439+00:00"}