{"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"}