{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VJZRGZC3GFCWFK33BKGKLMEHDD","short_pith_number":"pith:VJZRGZC3","schema_version":"1.0","canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","source":{"kind":"arxiv","id":"1009.3657","version":1},"attestation_state":"computed","paper":{"title":"On Bounded Weight Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aslan Tchamkerten, Christine Bachoc, Gerard Cohen, Patrick Sole, Venkat Chandar","submitted_at":"2010-09-19T19:38:40Z","abstract_excerpt":"The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a "},"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":"1009.3657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-19T19:38:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60937df3287d4a8972260453b4ea1c1a88b052a57f73ebb13a2e64db50929290","abstract_canon_sha256":"5074858534a094c8207f5feeefa6cd8f3cd047188912059ee6378d81edb91c34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:44.273194Z","signature_b64":"K1qSSZIL5lvfx6G8EmdJ8Af0QS4flWpNF53jn5cCWa5cmk4BEUgjH13zrbXp84ZxSv9i0on6Y8S2Kmru7JMYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","last_reissued_at":"2026-05-18T04:40:44.272449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:44.272449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Bounded Weight Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aslan Tchamkerten, Christine Bachoc, Gerard Cohen, Patrick Sole, Venkat Chandar","submitted_at":"2010-09-19T19:38:40Z","abstract_excerpt":"The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to infinity for fixed d=D/N and w=W/N. The exponential growth rate of B(N,D,W) is shown to be equal to the exponential growth rate of A(N,D) for w <= 1/2, and equal to the exponential growth rate of A(N,D,W) for 1/2< w <= 1. Second, analytic and numerical upper bounds on B(N,D,W) are derived using the semidefinite programming (SDP) method. These bounds yield a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3657","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":""},"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":"1009.3657","created_at":"2026-05-18T04:40:44.272579+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3657v1","created_at":"2026-05-18T04:40:44.272579+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3657","created_at":"2026-05-18T04:40:44.272579+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJZRGZC3GFCW","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJZRGZC3GFCWFK33","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJZRGZC3","created_at":"2026-05-18T12:26:15.391820+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/VJZRGZC3GFCWFK33BKGKLMEHDD","json":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD.json","graph_json":"https://pith.science/api/pith-number/VJZRGZC3GFCWFK33BKGKLMEHDD/graph.json","events_json":"https://pith.science/api/pith-number/VJZRGZC3GFCWFK33BKGKLMEHDD/events.json","paper":"https://pith.science/paper/VJZRGZC3"},"agent_actions":{"view_html":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD","download_json":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD.json","view_paper":"https://pith.science/paper/VJZRGZC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3657&json=true","fetch_graph":"https://pith.science/api/pith-number/VJZRGZC3GFCWFK33BKGKLMEHDD/graph.json","fetch_events":"https://pith.science/api/pith-number/VJZRGZC3GFCWFK33BKGKLMEHDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/action/storage_attestation","attest_author":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/action/author_attestation","sign_citation":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/action/citation_signature","submit_replication":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/action/replication_record"}},"created_at":"2026-05-18T04:40:44.272579+00:00","updated_at":"2026-05-18T04:40:44.272579+00:00"}