{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:J2FQT2AX7ALO674YJHHXTLWDK4","short_pith_number":"pith:J2FQT2AX","schema_version":"1.0","canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","source":{"kind":"arxiv","id":"1610.02931","version":1},"attestation_state":"computed","paper":{"title":"Multi-Message Broadcast in Dynamic Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Mohamad Ahmadi","submitted_at":"2016-10-10T14:29:04Z","abstract_excerpt":"We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform generalized version of single-message broadcast algorithms into multi-message broadcast algorithms. Based on these generic algorithms, we obtain multi-message broadcast algorithms for dynamic radio networks for a number of different dynamic network settings. For one of the modeling assumptions, our algorithms are complemented by a lower bound which shows that the upper bound is close to optimal."},"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":"1610.02931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-10T14:29:04Z","cross_cats_sorted":[],"title_canon_sha256":"7dfabb22bdb386176daf95608ab534410ca64a75832466e9c0f99219c070a80c","abstract_canon_sha256":"b2654a453ecc4b7053be65bf4f2d259b82dd486883d96ba21ec6f235a0c28eb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.381300Z","signature_b64":"RiZVOntJLQmO0SxQuUvwQBQYckj9TBIBD6J59NVr63yIp/sRS/M0VuD8CeUyMcMr3sKkWHjfZWMU5UliJ4+LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","last_reissued_at":"2026-05-18T01:02:50.380792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.380792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Message Broadcast in Dynamic Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fabian Kuhn, Mohamad Ahmadi","submitted_at":"2016-10-10T14:29:04Z","abstract_excerpt":"We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform generalized version of single-message broadcast algorithms into multi-message broadcast algorithms. Based on these generic algorithms, we obtain multi-message broadcast algorithms for dynamic radio networks for a number of different dynamic network settings. For one of the modeling assumptions, our algorithms are complemented by a lower bound which shows that the upper bound is close to optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02931","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":"1610.02931","created_at":"2026-05-18T01:02:50.380866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02931v1","created_at":"2026-05-18T01:02:50.380866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02931","created_at":"2026-05-18T01:02:50.380866+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2FQT2AX7ALO","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2FQT2AX7ALO674Y","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2FQT2AX","created_at":"2026-05-18T12:30:22.444734+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/J2FQT2AX7ALO674YJHHXTLWDK4","json":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4.json","graph_json":"https://pith.science/api/pith-number/J2FQT2AX7ALO674YJHHXTLWDK4/graph.json","events_json":"https://pith.science/api/pith-number/J2FQT2AX7ALO674YJHHXTLWDK4/events.json","paper":"https://pith.science/paper/J2FQT2AX"},"agent_actions":{"view_html":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4","download_json":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4.json","view_paper":"https://pith.science/paper/J2FQT2AX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02931&json=true","fetch_graph":"https://pith.science/api/pith-number/J2FQT2AX7ALO674YJHHXTLWDK4/graph.json","fetch_events":"https://pith.science/api/pith-number/J2FQT2AX7ALO674YJHHXTLWDK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/action/storage_attestation","attest_author":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/action/author_attestation","sign_citation":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/action/citation_signature","submit_replication":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/action/replication_record"}},"created_at":"2026-05-18T01:02:50.380866+00:00","updated_at":"2026-05-18T01:02:50.380866+00:00"}