{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2FQT2AX7ALO674YJHHXTLWDK4","short_pith_number":"pith:J2FQT2AX","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"},"canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","source":{"kind":"arxiv","id":"1610.02931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02931","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02931v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02931","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"J2FQT2AX7ALO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2FQT2AX7ALO674Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2FQT2AX","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2FQT2AX7ALO674YJHHXTLWDK4","target":"record","payload":{"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"},"canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","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"},"source_kind":"arxiv","source_id":"1610.02931","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQJfBjnBjbSiWLSiMef8kvbxL72FelCURYUZfM6lIqzAG9+OCzMrg7GelSFl63Cn5Jf9nIRAk2Ioy/qbcnRjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:21:37.607506Z"},"content_sha256":"78df36d0b18082c00474b3e24d1f10204987ca835416bc065ccfe402c33e2119","schema_version":"1.0","event_id":"sha256:78df36d0b18082c00474b3e24d1f10204987ca835416bc065ccfe402c33e2119"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2FQT2AX7ALO674YJHHXTLWDK4","target":"graph","payload":{"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"},"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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0U3BMRbYWeaVI1EgZ9rG0Dr5OD3cKfKW+vWfSIerwpAO6IgVC/T51JIdehtrP9Xwg/rSuWZRWPuVTzlboljCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:21:37.608228Z"},"content_sha256":"0b210957166dde9b72525a42ebbbf69991fe3e30a5dfb5f2a44c2131db22619a","schema_version":"1.0","event_id":"sha256:0b210957166dde9b72525a42ebbbf69991fe3e30a5dfb5f2a44c2131db22619a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/bundle.json","state_url":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2FQT2AX7ALO674YJHHXTLWDK4/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-26T07:21:37Z","links":{"resolver":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4","bundle":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/bundle.json","state":"https://pith.science/pith/J2FQT2AX7ALO674YJHHXTLWDK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2FQT2AX7ALO674YJHHXTLWDK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2FQT2AX7ALO674YJHHXTLWDK4","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":"b2654a453ecc4b7053be65bf4f2d259b82dd486883d96ba21ec6f235a0c28eb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-10T14:29:04Z","title_canon_sha256":"7dfabb22bdb386176daf95608ab534410ca64a75832466e9c0f99219c070a80c"},"schema_version":"1.0","source":{"id":"1610.02931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02931","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02931v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02931","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"J2FQT2AX7ALO","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2FQT2AX7ALO674Y","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2FQT2AX","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:0b210957166dde9b72525a42ebbbf69991fe3e30a5dfb5f2a44c2131db22619a","target":"graph","created_at":"2026-05-18T01:02:50Z","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":"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.","authors_text":"Fabian Kuhn, Mohamad Ahmadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-10T14:29:04Z","title":"Multi-Message Broadcast in Dynamic Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02931","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:78df36d0b18082c00474b3e24d1f10204987ca835416bc065ccfe402c33e2119","target":"record","created_at":"2026-05-18T01:02:50Z","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":"b2654a453ecc4b7053be65bf4f2d259b82dd486883d96ba21ec6f235a0c28eb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-10-10T14:29:04Z","title_canon_sha256":"7dfabb22bdb386176daf95608ab534410ca64a75832466e9c0f99219c070a80c"},"schema_version":"1.0","source":{"id":"1610.02931","kind":"arxiv","version":1}},"canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e8b09e817f816ef7f9849cf79aec3571bfc28efd36513476571b73426442eff","first_computed_at":"2026-05-18T01:02:50.380792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.380792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RiZVOntJLQmO0SxQuUvwQBQYckj9TBIBD6J59NVr63yIp/sRS/M0VuD8CeUyMcMr3sKkWHjfZWMU5UliJ4+LBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.381300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78df36d0b18082c00474b3e24d1f10204987ca835416bc065ccfe402c33e2119","sha256:0b210957166dde9b72525a42ebbbf69991fe3e30a5dfb5f2a44c2131db22619a"],"state_sha256":"0bd95878595a28e076296bcf642af443e5d500d760ebe0593cf40774b3d563ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVOU2F8I1kVyQd7stVK9jCnOHqXW+P5qiUo4mcWJ6WnqY64sFhWxw8BMKVnSk2Wb5jQ6OA4YPN12rFmkKdN8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:21:37.611961Z","bundle_sha256":"82965cc058dd2909bdf6e57f5d102d83c9ae0c805aaa1b4f1fb92fee0cfb5994"}}