{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NL2BPBTPEWM5L2WDMFJD6HX5X7","short_pith_number":"pith:NL2BPBTP","canonical_record":{"source":{"id":"0910.5073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-27T09:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4376988fe994826d43090ad26488cf72cce5f715f0d7873e35b79768bdc54f1","abstract_canon_sha256":"f8db5ab8ba94cff06848c40d9b7b7ca353b38f3bb8e3b014d696ef0e22a0c5a0"},"schema_version":"1.0"},"canonical_sha256":"6af417866f2599d5eac361523f1efdbfc8f7fb0a836ef27cbded19a5133eaef8","source":{"kind":"arxiv","id":"0910.5073","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5073","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5073v3","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5073","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"NL2BPBTPEWM5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NL2BPBTPEWM5L2WD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NL2BPBTP","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NL2BPBTPEWM5L2WDMFJD6HX5X7","target":"record","payload":{"canonical_record":{"source":{"id":"0910.5073","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-27T09:29:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e4376988fe994826d43090ad26488cf72cce5f715f0d7873e35b79768bdc54f1","abstract_canon_sha256":"f8db5ab8ba94cff06848c40d9b7b7ca353b38f3bb8e3b014d696ef0e22a0c5a0"},"schema_version":"1.0"},"canonical_sha256":"6af417866f2599d5eac361523f1efdbfc8f7fb0a836ef27cbded19a5133eaef8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:51.311452Z","signature_b64":"7teZwrReC6oelKHuzj+A/qBA+BPQhztOlN2k8v3p+oZk7vSBj/Hc43ZVJZfiFrbHofo9DDwu9bzFTniy/KPbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6af417866f2599d5eac361523f1efdbfc8f7fb0a836ef27cbded19a5133eaef8","last_reissued_at":"2026-05-18T04:36:51.311050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:51.311050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0910.5073","source_version":3,"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BrUN5E93dPtqBIyl0lOS9TPmk2QrwmWIpvDBbb6UN+8rfLyd084pIPW5tSe4wcgSQXYqxZRpC8xu2kyBBIpaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:32:35.388283Z"},"content_sha256":"0c4e0a8010e322213218fb34de6a5723e068d9e81d19088a1665ed990b5527ec","schema_version":"1.0","event_id":"sha256:0c4e0a8010e322213218fb34de6a5723e068d9e81d19088a1665ed990b5527ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NL2BPBTPEWM5L2WDMFJD6HX5X7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chung Shue Chen, Kenneth W. Shum, Wing Shing Wong","submitted_at":"2009-10-27T09:29:18Z","abstract_excerpt":"Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5073","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"},"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:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6h7oOY2Dpc7xAd5LuoKIPyznjwbkegLVUdCMOtKoke6NV6XR2mh75A/H2TnfloPUswvAvkx/tIyRMbkwrILeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:32:35.388654Z"},"content_sha256":"05cf2933f970cdc607c86d6a0ee19d85d0ba288d73f0b63350a7407c06149b8c","schema_version":"1.0","event_id":"sha256:05cf2933f970cdc607c86d6a0ee19d85d0ba288d73f0b63350a7407c06149b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/bundle.json","state_url":"https://pith.science/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/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-02T17:32:35Z","links":{"resolver":"https://pith.science/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7","bundle":"https://pith.science/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/bundle.json","state":"https://pith.science/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NL2BPBTPEWM5L2WDMFJD6HX5X7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NL2BPBTPEWM5L2WDMFJD6HX5X7","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":"f8db5ab8ba94cff06848c40d9b7b7ca353b38f3bb8e3b014d696ef0e22a0c5a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-27T09:29:18Z","title_canon_sha256":"e4376988fe994826d43090ad26488cf72cce5f715f0d7873e35b79768bdc54f1"},"schema_version":"1.0","source":{"id":"0910.5073","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0910.5073","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"0910.5073v3","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.5073","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"NL2BPBTPEWM5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NL2BPBTPEWM5L2WD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NL2BPBTP","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:05cf2933f970cdc607c86d6a0ee19d85d0ba288d73f0b63350a7407c06149b8c","target":"graph","created_at":"2026-05-18T04:36:51Z","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":"Conflict-avoiding codes are used in the multiple-access collision channel without feedback. The number of codewords in a conflict-avoiding code is the number of potential users that can be supported in the system. In this paper, a new upper bound on the size of conflict-avoiding codes is proved. This upper bound is general in the sense that it is applicable to all code lengths and all Hamming weights. Several existing constructions for conflict-avoiding codes, which are known to be optimal for Hamming weights equal to four and five, are shown to be optimal for all Hamming weights in general.","authors_text":"Chung Shue Chen, Kenneth W. Shum, Wing Shing Wong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-27T09:29:18Z","title":"A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.5073","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:0c4e0a8010e322213218fb34de6a5723e068d9e81d19088a1665ed990b5527ec","target":"record","created_at":"2026-05-18T04:36:51Z","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":"f8db5ab8ba94cff06848c40d9b7b7ca353b38f3bb8e3b014d696ef0e22a0c5a0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-27T09:29:18Z","title_canon_sha256":"e4376988fe994826d43090ad26488cf72cce5f715f0d7873e35b79768bdc54f1"},"schema_version":"1.0","source":{"id":"0910.5073","kind":"arxiv","version":3}},"canonical_sha256":"6af417866f2599d5eac361523f1efdbfc8f7fb0a836ef27cbded19a5133eaef8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6af417866f2599d5eac361523f1efdbfc8f7fb0a836ef27cbded19a5133eaef8","first_computed_at":"2026-05-18T04:36:51.311050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:51.311050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7teZwrReC6oelKHuzj+A/qBA+BPQhztOlN2k8v3p+oZk7vSBj/Hc43ZVJZfiFrbHofo9DDwu9bzFTniy/KPbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:51.311452Z","signed_message":"canonical_sha256_bytes"},"source_id":"0910.5073","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c4e0a8010e322213218fb34de6a5723e068d9e81d19088a1665ed990b5527ec","sha256:05cf2933f970cdc607c86d6a0ee19d85d0ba288d73f0b63350a7407c06149b8c"],"state_sha256":"1ead61451021e65bf4f8a7d67b86a49f880f486f58040ccb9f6028d6b5b5922c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtwV9zyPUps6I0Mxm7rVYgfmKlyL302z0SLegXFXbTWvxPwWRGichf2yJSSOBrpNLav3B+lWolPFMhn/dYHRCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:32:35.390787Z","bundle_sha256":"edfb2d42c6861a7f8e1fd64301462ab6676bf6a69b51d4c6c5853e74d70cb253"}}