{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VJKUNPNUWZYX7577VICV7JGSYH","short_pith_number":"pith:VJKUNPNU","schema_version":"1.0","canonical_sha256":"aa5546bdb4b6717ff7ffaa055fa4d2c1d48c64819d664b951920be53c7d654cb","source":{"kind":"arxiv","id":"1701.06800","version":2},"attestation_state":"computed","paper":{"title":"Linear-Time Data Dissemination in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Manfred Schwarz, Martin Zeiner, Ulrich Schmid","submitted_at":"2017-01-24T10:38:08Z","abstract_excerpt":"Broadcasting and convergecasting are pivotal services in distributed systems, in particular, in wireless ad-hoc and sensor networks, which are characterized by time- varying communication graphs. We study the question of whether it is possible to disseminate data available locally at some process to all n processes in sparsely connected synchronous dynamic networks with directed links in linear time. Recently, Charron-Bost, F\\\"ugger and Nowak proved an upper bound of O(n log n) rounds for the case where every communication graph is an arbitrary directed rooted tree. We present a new formalism,"},"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":"1701.06800","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-24T10:38:08Z","cross_cats_sorted":[],"title_canon_sha256":"95eaf5c98efdd81c3f07ecf93a7c5038d5abed469cccc9eda9a182de39177779","abstract_canon_sha256":"476b0cc261a0062f5c291be2337c22805376d88dc2eb21b9fda76ff9e3ff26a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:42.127063Z","signature_b64":"Zbcepo8AUPDmCbsbzv48A1FBMjVEUYU3ZKP8Tj+fX5NSgjHD7qAt2pcYXB1GqhiXDWHYhVbuICNK/E8i9xPVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa5546bdb4b6717ff7ffaa055fa4d2c1d48c64819d664b951920be53c7d654cb","last_reissued_at":"2026-05-18T00:47:42.126126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:42.126126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Data Dissemination in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Manfred Schwarz, Martin Zeiner, Ulrich Schmid","submitted_at":"2017-01-24T10:38:08Z","abstract_excerpt":"Broadcasting and convergecasting are pivotal services in distributed systems, in particular, in wireless ad-hoc and sensor networks, which are characterized by time- varying communication graphs. We study the question of whether it is possible to disseminate data available locally at some process to all n processes in sparsely connected synchronous dynamic networks with directed links in linear time. Recently, Charron-Bost, F\\\"ugger and Nowak proved an upper bound of O(n log n) rounds for the case where every communication graph is an arbitrary directed rooted tree. We present a new formalism,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06800","kind":"arxiv","version":2},"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":"1701.06800","created_at":"2026-05-18T00:47:42.126284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06800v2","created_at":"2026-05-18T00:47:42.126284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06800","created_at":"2026-05-18T00:47:42.126284+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJKUNPNUWZYX","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJKUNPNUWZYX7577","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJKUNPNU","created_at":"2026-05-18T12:31:49.984773+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/VJKUNPNUWZYX7577VICV7JGSYH","json":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH.json","graph_json":"https://pith.science/api/pith-number/VJKUNPNUWZYX7577VICV7JGSYH/graph.json","events_json":"https://pith.science/api/pith-number/VJKUNPNUWZYX7577VICV7JGSYH/events.json","paper":"https://pith.science/paper/VJKUNPNU"},"agent_actions":{"view_html":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH","download_json":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH.json","view_paper":"https://pith.science/paper/VJKUNPNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06800&json=true","fetch_graph":"https://pith.science/api/pith-number/VJKUNPNUWZYX7577VICV7JGSYH/graph.json","fetch_events":"https://pith.science/api/pith-number/VJKUNPNUWZYX7577VICV7JGSYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH/action/storage_attestation","attest_author":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH/action/author_attestation","sign_citation":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH/action/citation_signature","submit_replication":"https://pith.science/pith/VJKUNPNUWZYX7577VICV7JGSYH/action/replication_record"}},"created_at":"2026-05-18T00:47:42.126284+00:00","updated_at":"2026-05-18T00:47:42.126284+00:00"}