{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B5YDUHC57XCMCCY4TVVEWXZZWR","short_pith_number":"pith:B5YDUHC5","schema_version":"1.0","canonical_sha256":"0f703a1c5dfdc4c10b1c9d6a4b5f39b45e05538b71e19c9f2f6f47adf650d107","source":{"kind":"arxiv","id":"1503.08570","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1503.08570","created_at":"2026-05-18T00:58:04.480566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.08570v1","created_at":"2026-05-18T00:58:04.480566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08570","created_at":"2026-05-18T00:58:04.480566+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5YDUHC57XCM","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5YDUHC57XCMCCY4","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5YDUHC5","created_at":"2026-05-18T12:29:14.074870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR","json":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR.json","graph_json":"https://pith.science/api/pith-number/B5YDUHC57XCMCCY4TVVEWXZZWR/graph.json","events_json":"https://pith.science/api/pith-number/B5YDUHC57XCMCCY4TVVEWXZZWR/events.json","paper":"https://pith.science/paper/B5YDUHC5"},"agent_actions":{"view_html":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR","download_json":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR.json","view_paper":"https://pith.science/paper/B5YDUHC5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.08570&json=true","fetch_graph":"https://pith.science/api/pith-number/B5YDUHC57XCMCCY4TVVEWXZZWR/graph.json","fetch_events":"https://pith.science/api/pith-number/B5YDUHC57XCMCCY4TVVEWXZZWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/action/storage_attestation","attest_author":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/action/author_attestation","sign_citation":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/action/citation_signature","submit_replication":"https://pith.science/pith/B5YDUHC57XCMCCY4TVVEWXZZWR/action/replication_record"}},"created_at":"2026-05-18T00:58:04.480566+00:00","updated_at":"2026-05-18T00:58:04.480566+00:00"}