{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5VRXOPTA6VHJXX6F3KKZNXNFTC","short_pith_number":"pith:5VRXOPTA","schema_version":"1.0","canonical_sha256":"ed63773e60f54e9bdfc5da9596dda598ba8563231ce8232de1206bf0e4d903fa","source":{"kind":"arxiv","id":"1605.02474","version":1},"attestation_state":"computed","paper":{"title":"Data Dissemination in Unified Dynamic Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongxiao Yu, Magnus M. Halldorsson, Tigran Tonoyan, Yuexuan Wang","submitted_at":"2016-05-09T08:44:15Z","abstract_excerpt":"We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based models (such as quasi unit disc graphs, bounded-independence graphs, and protocol model). The only requirement is that the nodes can be embedded in a bounded growth quasi-metric, which is the weakest condition known to ensure distributed operability. Both the nodes and the links of the network are dynamic: nodes can come and go, while the signal strength on "},"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":"1605.02474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-09T08:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"0e6d7c7a2eb129b7741b9a77ab232772fce64c7a25285707c858c3ca1ea47c0e","abstract_canon_sha256":"4186339806db2d3a756a60ca1c6e7a06a45bfee4193e5da86475fd86aee09deb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:16.439919Z","signature_b64":"Un5d5gy9cPltfQPIWbGSpjKeGNiSliJRzsaQl2NuDItD9JB8RLy4JHCaGi6XYRCmj3H8u9Xo1kn185SkQ7cPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed63773e60f54e9bdfc5da9596dda598ba8563231ce8232de1206bf0e4d903fa","last_reissued_at":"2026-05-18T01:15:16.439338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:16.439338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Dissemination in Unified Dynamic Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dongxiao Yu, Magnus M. Halldorsson, Tigran Tonoyan, Yuexuan Wang","submitted_at":"2016-05-09T08:44:15Z","abstract_excerpt":"We give efficient algorithms for the fundamental problems of Broadcast and Local Broadcast in dynamic wireless networks. We propose a general model of communication which captures and includes both fading models (like SINR) and graph-based models (such as quasi unit disc graphs, bounded-independence graphs, and protocol model). The only requirement is that the nodes can be embedded in a bounded growth quasi-metric, which is the weakest condition known to ensure distributed operability. Both the nodes and the links of the network are dynamic: nodes can come and go, while the signal strength on "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02474","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":"1605.02474","created_at":"2026-05-18T01:15:16.439431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02474v1","created_at":"2026-05-18T01:15:16.439431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02474","created_at":"2026-05-18T01:15:16.439431+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VRXOPTA6VHJ","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VRXOPTA6VHJXX6F","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VRXOPTA","created_at":"2026-05-18T12:30:01.593930+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/5VRXOPTA6VHJXX6F3KKZNXNFTC","json":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC.json","graph_json":"https://pith.science/api/pith-number/5VRXOPTA6VHJXX6F3KKZNXNFTC/graph.json","events_json":"https://pith.science/api/pith-number/5VRXOPTA6VHJXX6F3KKZNXNFTC/events.json","paper":"https://pith.science/paper/5VRXOPTA"},"agent_actions":{"view_html":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC","download_json":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC.json","view_paper":"https://pith.science/paper/5VRXOPTA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02474&json=true","fetch_graph":"https://pith.science/api/pith-number/5VRXOPTA6VHJXX6F3KKZNXNFTC/graph.json","fetch_events":"https://pith.science/api/pith-number/5VRXOPTA6VHJXX6F3KKZNXNFTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC/action/storage_attestation","attest_author":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC/action/author_attestation","sign_citation":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC/action/citation_signature","submit_replication":"https://pith.science/pith/5VRXOPTA6VHJXX6F3KKZNXNFTC/action/replication_record"}},"created_at":"2026-05-18T01:15:16.439431+00:00","updated_at":"2026-05-18T01:15:16.439431+00:00"}