{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VJZRGZC3GFCWFK33BKGKLMEHDD","short_pith_number":"pith:VJZRGZC3","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"},"canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","source":{"kind":"arxiv","id":"1009.3657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3657","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3657v1","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3657","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"VJZRGZC3GFCW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VJZRGZC3GFCWFK33","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VJZRGZC3","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VJZRGZC3GFCWFK33BKGKLMEHDD","target":"record","payload":{"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"},"canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","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"},"source_kind":"arxiv","source_id":"1009.3657","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1KwZ1Uja5fM1lMCT3OPMYfDRdfi/YN2QvDzp/n0ghBbz73/iZprdpwy1BeNUcUmVEVBbq7PkHKsVavTJF3KJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:19.426307Z"},"content_sha256":"cab55aca111007f064175135db6ef83ccf56be4ad4836243587d7ec648b830e3","schema_version":"1.0","event_id":"sha256:cab55aca111007f064175135db6ef83ccf56be4ad4836243587d7ec648b830e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VJZRGZC3GFCWFK33BKGKLMEHDD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfgjU/fo71RiC2Y9wn0l2itEgITSC/2vqD3VV3wYi6eMqtbTGYgiqlKNFkB6QR1Ia0irOYOAhjoRqS+cZgl1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:49:19.427018Z"},"content_sha256":"58c8ddd557ae1f003db0778a9697291d55dcc5b335512e23ab7fa500ebeae927","schema_version":"1.0","event_id":"sha256:58c8ddd557ae1f003db0778a9697291d55dcc5b335512e23ab7fa500ebeae927"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/bundle.json","state_url":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T16:49:19Z","links":{"resolver":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD","bundle":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/bundle.json","state":"https://pith.science/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJZRGZC3GFCWFK33BKGKLMEHDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VJZRGZC3GFCWFK33BKGKLMEHDD","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":"5074858534a094c8207f5feeefa6cd8f3cd047188912059ee6378d81edb91c34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-19T19:38:40Z","title_canon_sha256":"60937df3287d4a8972260453b4ea1c1a88b052a57f73ebb13a2e64db50929290"},"schema_version":"1.0","source":{"id":"1009.3657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3657","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3657v1","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3657","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"VJZRGZC3GFCW","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VJZRGZC3GFCWFK33","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VJZRGZC3","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:58c8ddd557ae1f003db0778a9697291d55dcc5b335512e23ab7fa500ebeae927","target":"graph","created_at":"2026-05-18T04:40:44Z","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":"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 ","authors_text":"Aslan Tchamkerten, Christine Bachoc, Gerard Cohen, Patrick Sole, Venkat Chandar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-19T19:38:40Z","title":"On Bounded Weight Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3657","kind":"arxiv","version":1},"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:cab55aca111007f064175135db6ef83ccf56be4ad4836243587d7ec648b830e3","target":"record","created_at":"2026-05-18T04:40:44Z","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":"5074858534a094c8207f5feeefa6cd8f3cd047188912059ee6378d81edb91c34","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-09-19T19:38:40Z","title_canon_sha256":"60937df3287d4a8972260453b4ea1c1a88b052a57f73ebb13a2e64db50929290"},"schema_version":"1.0","source":{"id":"1009.3657","kind":"arxiv","version":1}},"canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa7313645b314562ab7b0a8ca5b08718ebcb517d6a2ec7f1d491ee59ee2ee93d","first_computed_at":"2026-05-18T04:40:44.272449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:44.272449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K1qSSZIL5lvfx6G8EmdJ8Af0QS4flWpNF53jn5cCWa5cmk4BEUgjH13zrbXp84ZxSv9i0on6Y8S2Kmru7JMYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:44.273194Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab55aca111007f064175135db6ef83ccf56be4ad4836243587d7ec648b830e3","sha256:58c8ddd557ae1f003db0778a9697291d55dcc5b335512e23ab7fa500ebeae927"],"state_sha256":"89e616e0fe84753f16de52cd9b0c66ff2e0f96f02197808e046defe73f650909"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTA1gEGA5AwTZiNSHiQzOewcWqxpfmUJJeX1WGZ38qp7KJvhfJecXO7jKK0O4p/xymbZfADPqy7YGalD0+i+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:49:19.430632Z","bundle_sha256":"a3eedd51c2ab3a7fc5d0b5cc3a7fffb8797e4dac147da6e2bed1daa3295a5130"}}