{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HZIM2IZCI6SPEAQ7LDVMHJNQ4N","short_pith_number":"pith:HZIM2IZC","canonical_record":{"source":{"id":"1408.5681","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T08:38:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9368ae614394ba4d8e044f15dfefe18942eaa19c21791379183b9bfee12d3ac","abstract_canon_sha256":"033fcf1dce0ca68f2811764f768d8ff53a6ad96f44a446d521bba30d48579308"},"schema_version":"1.0"},"canonical_sha256":"3e50cd232247a4f2021f58eac3a5b0e37bee22f5911f970a577b05162ccf10a1","source":{"kind":"arxiv","id":"1408.5681","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5681","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5681v4","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5681","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"HZIM2IZCI6SP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HZIM2IZCI6SPEAQ7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HZIM2IZC","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HZIM2IZCI6SPEAQ7LDVMHJNQ4N","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5681","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T08:38:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c9368ae614394ba4d8e044f15dfefe18942eaa19c21791379183b9bfee12d3ac","abstract_canon_sha256":"033fcf1dce0ca68f2811764f768d8ff53a6ad96f44a446d521bba30d48579308"},"schema_version":"1.0"},"canonical_sha256":"3e50cd232247a4f2021f58eac3a5b0e37bee22f5911f970a577b05162ccf10a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:35.168752Z","signature_b64":"3Ny4rW1BKVlt0iYen/FwAPleJfNuFATMyXr3IfRGfWVHAMFMDr6cNlu8+CDh+7qD1YH5QieOBC2KW1cM3uC2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e50cd232247a4f2021f58eac3a5b0e37bee22f5911f970a577b05162ccf10a1","last_reissued_at":"2026-05-18T00:40:35.168047Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:35.168047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5681","source_version":4,"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-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2aqUuo0S5H4GDuUMBvAECdZMC24zwjdEi8ds05Y3cV5RSVGgB+oRn6KWZDNCxnp86I7oEMkaTfD+qQCiGmGrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:57:07.934527Z"},"content_sha256":"0ba72c9543f8338184e77fc621ad7c302bab6f5597d5c6a83d39a1088eaaf265","schema_version":"1.0","event_id":"sha256:0ba72c9543f8338184e77fc621ad7c302bab6f5597d5c6a83d39a1088eaaf265"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HZIM2IZCI6SPEAQ7LDVMHJNQ4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weight distribution of cosets of small codes with good dual properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Louay Bazzi","submitted_at":"2014-08-25T08:38:44Z","abstract_excerpt":"The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\\subset \\{0,1\\}^n$ be a binary linear code whose dual has bilateral minimum distance at least $d$, where $d$ is odd. Roughly speaking, we show that the average $L_\\infty$-distance -- and consequently the $L_1$-distance -- between the weight distribution of a random cosets of $Q$ and the binomial distribution decays quickly as the bilateral minimum distance $d$ of the dual of $Q$ increases. For $d = \\Theta(1)$, it decays like $n^{-\\Theta(d)}$. On th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5681","kind":"arxiv","version":4},"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-18T00:40:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bgFUFwO+dZtIHvYgwcxNVIs9ALIObWVdy3wO8o0Hrwkk2Vc5nTCwCh74nntrR7PU2dtDnKDdq5/5iBytZX8oAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T11:57:07.934884Z"},"content_sha256":"cb178b69c7e2c265277d75b0abe78a39cfde6eef866ebf3f44e96fda682ea056","schema_version":"1.0","event_id":"sha256:cb178b69c7e2c265277d75b0abe78a39cfde6eef866ebf3f44e96fda682ea056"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/bundle.json","state_url":"https://pith.science/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/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-06-11T11:57:07Z","links":{"resolver":"https://pith.science/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N","bundle":"https://pith.science/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/bundle.json","state":"https://pith.science/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZIM2IZCI6SPEAQ7LDVMHJNQ4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HZIM2IZCI6SPEAQ7LDVMHJNQ4N","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":"033fcf1dce0ca68f2811764f768d8ff53a6ad96f44a446d521bba30d48579308","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T08:38:44Z","title_canon_sha256":"c9368ae614394ba4d8e044f15dfefe18942eaa19c21791379183b9bfee12d3ac"},"schema_version":"1.0","source":{"id":"1408.5681","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5681","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5681v4","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5681","created_at":"2026-05-18T00:40:35Z"},{"alias_kind":"pith_short_12","alias_value":"HZIM2IZCI6SP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"HZIM2IZCI6SPEAQ7","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"HZIM2IZC","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:cb178b69c7e2c265277d75b0abe78a39cfde6eef866ebf3f44e96fda682ea056","target":"graph","created_at":"2026-05-18T00:40: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":"The bilateral minimum distance of a binary linear code is the maximum $d$ such that all nonzero codewords have weights between $d$ and $n-d$. Let $Q\\subset \\{0,1\\}^n$ be a binary linear code whose dual has bilateral minimum distance at least $d$, where $d$ is odd. Roughly speaking, we show that the average $L_\\infty$-distance -- and consequently the $L_1$-distance -- between the weight distribution of a random cosets of $Q$ and the binomial distribution decays quickly as the bilateral minimum distance $d$ of the dual of $Q$ increases. For $d = \\Theta(1)$, it decays like $n^{-\\Theta(d)}$. On th","authors_text":"Louay Bazzi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T08:38:44Z","title":"Weight distribution of cosets of small codes with good dual properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5681","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:0ba72c9543f8338184e77fc621ad7c302bab6f5597d5c6a83d39a1088eaaf265","target":"record","created_at":"2026-05-18T00:40: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":"033fcf1dce0ca68f2811764f768d8ff53a6ad96f44a446d521bba30d48579308","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-08-25T08:38:44Z","title_canon_sha256":"c9368ae614394ba4d8e044f15dfefe18942eaa19c21791379183b9bfee12d3ac"},"schema_version":"1.0","source":{"id":"1408.5681","kind":"arxiv","version":4}},"canonical_sha256":"3e50cd232247a4f2021f58eac3a5b0e37bee22f5911f970a577b05162ccf10a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e50cd232247a4f2021f58eac3a5b0e37bee22f5911f970a577b05162ccf10a1","first_computed_at":"2026-05-18T00:40:35.168047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:35.168047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Ny4rW1BKVlt0iYen/FwAPleJfNuFATMyXr3IfRGfWVHAMFMDr6cNlu8+CDh+7qD1YH5QieOBC2KW1cM3uC2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:35.168752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5681","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ba72c9543f8338184e77fc621ad7c302bab6f5597d5c6a83d39a1088eaaf265","sha256:cb178b69c7e2c265277d75b0abe78a39cfde6eef866ebf3f44e96fda682ea056"],"state_sha256":"dd55897f61d47599c3c1788538497ef43d65df521fcb8e94c9027f92223ae63a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c3VAZZWfIBYN6f/0BHE2S2nFwmrcGoXUgta37kP+OF0+q6dt8vsZYr1f0S6kNUkBZJBtA7MalB3gmfs7bw1/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T11:57:07.936820Z","bundle_sha256":"c5b4f0bbdeb59df8def39e4dec72e9689e3ce49b0e1708e185fe989cd85d1239"}}