{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B5YDUHC57XCMCCY4TVVEWXZZWR","short_pith_number":"pith:B5YDUHC5","canonical_record":{"source":{"id":"1503.08570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-30T07:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"1b258b1883efdc5b779392095228f5ff3220bfc9b3ef07158a836275cd1c72e0","abstract_canon_sha256":"af8f3dec5b829dd601c78602794f676a1b19144a2a1771a35b37ea1ce14ee231"},"schema_version":"1.0"},"canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","source":{"kind":"arxiv","id":"1503.08570","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08570","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08570v1","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08570","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"B5YDUHC57XCM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5YDUHC57XCMCCY4","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5YDUHC5","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B5YDUHC57XCMCCY4TVVEWXZZWR","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-30T07:31:15Z","cross_cats_sorted":[],"title_canon_sha256":"1b258b1883efdc5b779392095228f5ff3220bfc9b3ef07158a836275cd1c72e0","abstract_canon_sha256":"af8f3dec5b829dd601c78602794f676a1b19144a2a1771a35b37ea1ce14ee231"},"schema_version":"1.0"},"canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:04.480930Z","signature_b64":"OgS2NKMfMb4P1avrcDMRRz7Fs50zJRQHs+O4m9pRe1vfFpYIMOqtkAR+zrnKO6Zbuf22r6ChRX0yh5OZWDZWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","last_reissued_at":"2026-05-18T00:58:04.480507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:04.480507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08570","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-18T00:58:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o3PcfIlohRwi0w/yj5F4zXh4TRfc+dr67V/sGLpiQDRZ/K2XQ5MOjriYCDrBPHtkNJ6D1ba3trpQwc5fhuxcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:15.038158Z"},"content_sha256":"9d14c29dcb62fb11d2ecff5e909f1cad75dcb4c3a0f0b95ee198652f8977e8b4","schema_version":"1.0","event_id":"sha256:9d14c29dcb62fb11d2ecff5e909f1cad75dcb4c3a0f0b95ee198652f8977e8b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B5YDUHC57XCMCCY4TVVEWXZZWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongxiao Yu, Francis C.M. Lau, Li Ning, Shenzhong Feng, Yong Zhang, Yuexuan Wang","submitted_at":"2015-03-30T07:31:15Z","abstract_excerpt":"In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and propose a uniform protocol that with high probability accomplishes the dissemination in O(k/F + F \\cdot log n) rounds, assuming F available channels and collision detection. This result is asymptotically optimal when k is large (k \\geq F^2 \\cdot log n). To our knowledge, this is the first uniform protocol for information exchange in multi-channel networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08570","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-18T00:58:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDQVS5S72LjzHxYwMEDH3BJUlZg2I6JU0QzBPF2wvcjypMaLMmtOeXFOXwu/IoSGb0SaHd84ajAzHjWIaq2FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:42:15.038745Z"},"content_sha256":"20125fdd867db1b9f8c73a67d0293468f43ba1b840884a4147983f18c33bbe51","schema_version":"1.0","event_id":"sha256:20125fdd867db1b9f8c73a67d0293468f43ba1b840884a4147983f18c33bbe51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/bundle.json","state_url":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/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-26T16:42:15Z","links":{"resolver":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR","bundle":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/bundle.json","state":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B5YDUHC57XCMCCY4TVVEWXZZWR","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":"af8f3dec5b829dd601c78602794f676a1b19144a2a1771a35b37ea1ce14ee231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-30T07:31:15Z","title_canon_sha256":"1b258b1883efdc5b779392095228f5ff3220bfc9b3ef07158a836275cd1c72e0"},"schema_version":"1.0","source":{"id":"1503.08570","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08570","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08570v1","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08570","created_at":"2026-05-18T00:58:04Z"},{"alias_kind":"pith_short_12","alias_value":"B5YDUHC57XCM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B5YDUHC57XCMCCY4","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B5YDUHC5","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:20125fdd867db1b9f8c73a67d0293468f43ba1b840884a4147983f18c33bbe51","target":"graph","created_at":"2026-05-18T00:58:04Z","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":"In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and propose a uniform protocol that with high probability accomplishes the dissemination in O(k/F + F \\cdot log n) rounds, assuming F available channels and collision detection. This result is asymptotically optimal when k is large (k \\geq F^2 \\cdot log n). To our knowledge, this is the first uniform protocol for information exchange in multi-channel networks.","authors_text":"Dongxiao Yu, Francis C.M. Lau, Li Ning, Shenzhong Feng, Yong Zhang, Yuexuan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-30T07:31:15Z","title":"Uniform Information Exchange in Multi-channel Wireless Ad Hoc Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08570","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:9d14c29dcb62fb11d2ecff5e909f1cad75dcb4c3a0f0b95ee198652f8977e8b4","target":"record","created_at":"2026-05-18T00:58:04Z","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":"af8f3dec5b829dd601c78602794f676a1b19144a2a1771a35b37ea1ce14ee231","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-03-30T07:31:15Z","title_canon_sha256":"1b258b1883efdc5b779392095228f5ff3220bfc9b3ef07158a836275cd1c72e0"},"schema_version":"1.0","source":{"id":"1503.08570","kind":"arxiv","version":1}},"canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","first_computed_at":"2026-05-18T00:58:04.480507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:04.480507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OgS2NKMfMb4P1avrcDMRRz7Fs50zJRQHs+O4m9pRe1vfFpYIMOqtkAR+zrnKO6Zbuf22r6ChRX0yh5OZWDZWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:04.480930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08570","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d14c29dcb62fb11d2ecff5e909f1cad75dcb4c3a0f0b95ee198652f8977e8b4","sha256:20125fdd867db1b9f8c73a67d0293468f43ba1b840884a4147983f18c33bbe51"],"state_sha256":"f757c7aac6e154a502bb02c4e9be737c4f16d558eed61387e55b01da61aa3f77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1b6vuagc624RvpvIy3ZZeI/oI+wEq7CMgRRiYYyMnXbcSln45uGKl2fqIODmvUUd+7S4YNsphBNOSRFhOmsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:42:15.041455Z","bundle_sha256":"7b71ebc659275cc1e0a5ee36530514df51cbc31cd23824ab31317ab787ab1235"}}