{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:AW2IV6NNSGJNLP3BJZLDBVRGV5","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":"14bc56611548da3e9a50ba53894539c61c0a80dcf7e8ef66e6660244e268bc0c","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-24T15:27:29Z","title_canon_sha256":"f3411f0ee57b071531d4b0a9aff0d6de585fc716048b34a07f49d0322b9ef1ff"},"schema_version":"1.0","source":{"id":"2009.11754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11754","created_at":"2026-07-05T02:33:54Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11754v2","created_at":"2026-07-05T02:33:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11754","created_at":"2026-07-05T02:33:54Z"},{"alias_kind":"pith_short_12","alias_value":"AW2IV6NNSGJN","created_at":"2026-07-05T02:33:54Z"},{"alias_kind":"pith_short_16","alias_value":"AW2IV6NNSGJNLP3B","created_at":"2026-07-05T02:33:54Z"},{"alias_kind":"pith_short_8","alias_value":"AW2IV6NN","created_at":"2026-07-05T02:33:54Z"}],"graph_snapshots":[{"event_id":"sha256:da481b071483ca5f9c19a82756724d7039076ed18c240a9c4b592308362a9013","target":"graph","created_at":"2026-07-05T02:33:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.11754/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Conflict-avoiding codes (CACs) were introduced by Levenshtein as a single-channel transmission scheme for a multiple-access collision channel without feedback. When the number of simultaneously active source nodes is less than or equal to the weight of a CAC, it is able to provide a hard guarantee that each active source node transmits at least one packet successfully within a fixed time duration, no matter what the relative time offsets between the source nodes are. In this paper, we extend CACs to multichannel CACs for providing such a hard guarantee over multiple orthogonal channels. Upper ","authors_text":"Kenneth W. Shum, Wing Shing Wong, Yijin Zhang, Yuan-Hsun Lo","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-24T15:27:29Z","title":"Multichannel Conflict-Avoiding Codes of Weights Three and Four"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11754","kind":"arxiv","version":2},"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:2b7831788d8bf6cdb579c23b1fc6393f35339834f29c28d38ff5084c38206f44","target":"record","created_at":"2026-07-05T02:33:54Z","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":"14bc56611548da3e9a50ba53894539c61c0a80dcf7e8ef66e6660244e268bc0c","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-24T15:27:29Z","title_canon_sha256":"f3411f0ee57b071531d4b0a9aff0d6de585fc716048b34a07f49d0322b9ef1ff"},"schema_version":"1.0","source":{"id":"2009.11754","kind":"arxiv","version":2}},"canonical_sha256":"05b48af9ad9192d5bf614e5630d626af78d5d18bdb1b1ed070fc2e430aabc320","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05b48af9ad9192d5bf614e5630d626af78d5d18bdb1b1ed070fc2e430aabc320","first_computed_at":"2026-07-05T02:33:54.971108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:33:54.971108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZrvF3qRyzXaF+Pyu2Oejd3Yoz2CJ2MjVd2cZEp+MhZ7UxYuag2tH/F+JC1HaZEmn0WzgQgT6E06gTV2bzRLpBg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:33:54.971539Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b7831788d8bf6cdb579c23b1fc6393f35339834f29c28d38ff5084c38206f44","sha256:da481b071483ca5f9c19a82756724d7039076ed18c240a9c4b592308362a9013"],"state_sha256":"325fd0c38087a6ef0ccffd2aafd5e0ed013c7deed458b3fab362d69300cbdf1b"}