{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QI76ZP7VAHGZH75GG2VUQ2ZQWE","short_pith_number":"pith:QI76ZP7V","canonical_record":{"source":{"id":"1208.6125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-30T10:08:29Z","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"title_canon_sha256":"cd6fe51cd2d276a29815f3f0d0b1becbcf3e707300fb05114f01b725d749a609","abstract_canon_sha256":"3b5c1c4498bcc2984b5bd9c384f1532f15d58ca6d6aa93d71b64e3dfbe746959"},"schema_version":"1.0"},"canonical_sha256":"823fecbff501cd93ffa636ab486b30b10717f546034cb9fe921a10bf15dd5096","source":{"kind":"arxiv","id":"1208.6125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6125","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6125v1","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6125","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"QI76ZP7VAHGZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI76ZP7VAHGZH75G","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI76ZP7V","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QI76ZP7VAHGZH75GG2VUQ2ZQWE","target":"record","payload":{"canonical_record":{"source":{"id":"1208.6125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-30T10:08:29Z","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"title_canon_sha256":"cd6fe51cd2d276a29815f3f0d0b1becbcf3e707300fb05114f01b725d749a609","abstract_canon_sha256":"3b5c1c4498bcc2984b5bd9c384f1532f15d58ca6d6aa93d71b64e3dfbe746959"},"schema_version":"1.0"},"canonical_sha256":"823fecbff501cd93ffa636ab486b30b10717f546034cb9fe921a10bf15dd5096","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:46.432879Z","signature_b64":"zwmjXMa2tF78Jgz3IXhBqasvqfvfDk+Sfmkb/Fr3sdVSQEVnxsSWohnFn/Kocb2557AONXcxSAqu+u7sQR44Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"823fecbff501cd93ffa636ab486b30b10717f546034cb9fe921a10bf15dd5096","last_reissued_at":"2026-05-18T03:46:46.432195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:46.432195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.6125","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-18T03:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3H3z9Hmlpt/ySN2csiyGDYRTZB/6W7dYZpHMpUFit/L7zrmCu89DEvgbs1HtC91kDC5XLSwnSw/c01QnGRGcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:49:49.733677Z"},"content_sha256":"c9d358f39ee7d6b5a3c24fa5421e390a4f4c3719da8c068eaf4c5b11a59a39a5","schema_version":"1.0","event_id":"sha256:c9d358f39ee7d6b5a3c24fa5421e390a4f4c3719da8c068eaf4c5b11a59a39a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QI76ZP7VAHGZH75GG2VUQ2ZQWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded-Contention Coding for Wireless Networks in the High SNR Regime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Muriel M\\'edard, Nancy Lynch","submitted_at":"2012-08-30T10:08:29Z","abstract_excerpt":"Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks.\n  This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6125","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-18T03:46:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"56fiUCdMtR5xY9Sf+xb3rdxCitUOwRCba7EVb2pCir2N4mDZOaqEnVi+lYU+/4P+zDQGUfMnINuPshOQTW5WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:49:49.734414Z"},"content_sha256":"45c35bc58b4e60ca6dab001eda31dd9e6c7430ee6fcd462a00a8cddbbf0e73bb","schema_version":"1.0","event_id":"sha256:45c35bc58b4e60ca6dab001eda31dd9e6c7430ee6fcd462a00a8cddbbf0e73bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/bundle.json","state_url":"https://pith.science/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/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-31T19:49:49Z","links":{"resolver":"https://pith.science/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE","bundle":"https://pith.science/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/bundle.json","state":"https://pith.science/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QI76ZP7VAHGZH75GG2VUQ2ZQWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QI76ZP7VAHGZH75GG2VUQ2ZQWE","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":"3b5c1c4498bcc2984b5bd9c384f1532f15d58ca6d6aa93d71b64e3dfbe746959","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-30T10:08:29Z","title_canon_sha256":"cd6fe51cd2d276a29815f3f0d0b1becbcf3e707300fb05114f01b725d749a609"},"schema_version":"1.0","source":{"id":"1208.6125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.6125","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"arxiv_version","alias_value":"1208.6125v1","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.6125","created_at":"2026-05-18T03:46:46Z"},{"alias_kind":"pith_short_12","alias_value":"QI76ZP7VAHGZ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QI76ZP7VAHGZH75G","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QI76ZP7V","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:45c35bc58b4e60ca6dab001eda31dd9e6c7430ee6fcd462a00a8cddbbf0e73bb","target":"graph","created_at":"2026-05-18T03:46:46Z","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":"Efficient communication in wireless networks is typically challenged by the possibility of interference among several transmitting nodes. Much important research has been invested in decreasing the number of collisions in order to obtain faster algorithms for communication in such networks.\n  This paper proposes a novel approach for wireless communication, which embraces collisions rather than avoiding them, over an additive channel. It introduces a coding technique called Bounded-Contention Coding (BCC) that allows collisions to be successfully decoded by the receiving nodes into the original","authors_text":"Bernhard Haeupler, Keren Censor-Hillel, Muriel M\\'edard, Nancy Lynch","cross_cats":["cs.DC","cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-30T10:08:29Z","title":"Bounded-Contention Coding for Wireless Networks in the High SNR Regime"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.6125","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:c9d358f39ee7d6b5a3c24fa5421e390a4f4c3719da8c068eaf4c5b11a59a39a5","target":"record","created_at":"2026-05-18T03:46:46Z","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":"3b5c1c4498bcc2984b5bd9c384f1532f15d58ca6d6aa93d71b64e3dfbe746959","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-08-30T10:08:29Z","title_canon_sha256":"cd6fe51cd2d276a29815f3f0d0b1becbcf3e707300fb05114f01b725d749a609"},"schema_version":"1.0","source":{"id":"1208.6125","kind":"arxiv","version":1}},"canonical_sha256":"823fecbff501cd93ffa636ab486b30b10717f546034cb9fe921a10bf15dd5096","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"823fecbff501cd93ffa636ab486b30b10717f546034cb9fe921a10bf15dd5096","first_computed_at":"2026-05-18T03:46:46.432195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:46.432195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwmjXMa2tF78Jgz3IXhBqasvqfvfDk+Sfmkb/Fr3sdVSQEVnxsSWohnFn/Kocb2557AONXcxSAqu+u7sQR44Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:46.432879Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.6125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d358f39ee7d6b5a3c24fa5421e390a4f4c3719da8c068eaf4c5b11a59a39a5","sha256:45c35bc58b4e60ca6dab001eda31dd9e6c7430ee6fcd462a00a8cddbbf0e73bb"],"state_sha256":"d277232a986278c3ccb71b135b3c504c79c9770b019d1bb979aede8dd8c7fc47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CNgdpRDubj1hiOcLgh723M/NdDCOWOtrKckLlF2Gnz90zyzyQKs/Zp+5CovhetpP2zqtgqats84dB2lxGheDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:49:49.738218Z","bundle_sha256":"5e4ebf87faf4fda216a020a52d2a6285c75116c502a9d84502fbee849c44bffb"}}