{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5PKHR37JNVMRAOZTTEAMLEMH7H","short_pith_number":"pith:5PKHR37J","schema_version":"1.0","canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","source":{"kind":"arxiv","id":"2407.09714","version":1},"attestation_state":"computed","paper":{"title":"Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Garrett Parzych, Joshua J. Daymude","submitted_at":"2024-07-12T22:55:01Z","abstract_excerpt":"Broadcast is a ubiquitous distributed computing problem that underpins many other system tasks. In static, connected networks, it was recently shown that broadcast is solvable without any node memory and only constant-size messages in worst-case asymptotically optimal time (Hussak and Trehan, PODC'19/STACS'20/DC'23). In the dynamic setting of adversarial topology changes, however, existing algorithms rely on identifiers, port labels, or polynomial memory to solve broadcast and compute functions over node inputs. We investigate space-efficient, terminating broadcast algorithms for anonymous, sy"},"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":"2407.09714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-12T22:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"a184abb37f710c6ce4f6224f1c5625d64a0a610ae9aa7a61422e59bc601cd75b","abstract_canon_sha256":"2c448b0664e92bbdb818fad3c4090f786e79379eceb3c671e3db3a26d90a2efe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T02:05:39.757763Z","signature_b64":"kM8vzKibcymU9ZJffa0bHJfbSHI4H50HPbd/jw+xFTAhg4W1d94FbdQMouYNeq/w2kTFkKrdTJNQqNW2qgg5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","last_reissued_at":"2026-06-03T02:05:39.757302Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T02:05:39.757302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Garrett Parzych, Joshua J. Daymude","submitted_at":"2024-07-12T22:55:01Z","abstract_excerpt":"Broadcast is a ubiquitous distributed computing problem that underpins many other system tasks. In static, connected networks, it was recently shown that broadcast is solvable without any node memory and only constant-size messages in worst-case asymptotically optimal time (Hussak and Trehan, PODC'19/STACS'20/DC'23). In the dynamic setting of adversarial topology changes, however, existing algorithms rely on identifiers, port labels, or polynomial memory to solve broadcast and compute functions over node inputs. We investigate space-efficient, terminating broadcast algorithms for anonymous, sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09714","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.09714/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.09714","created_at":"2026-06-03T02:05:39.757368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.09714v1","created_at":"2026-06-03T02:05:39.757368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09714","created_at":"2026-06-03T02:05:39.757368+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PKHR37JNVMR","created_at":"2026-06-03T02:05:39.757368+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PKHR37JNVMRAOZT","created_at":"2026-06-03T02:05:39.757368+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PKHR37J","created_at":"2026-06-03T02:05:39.757368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.17794","citing_title":"Memory makes computation universal, remember?","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H","json":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H.json","graph_json":"https://pith.science/api/pith-number/5PKHR37JNVMRAOZTTEAMLEMH7H/graph.json","events_json":"https://pith.science/api/pith-number/5PKHR37JNVMRAOZTTEAMLEMH7H/events.json","paper":"https://pith.science/paper/5PKHR37J"},"agent_actions":{"view_html":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H","download_json":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H.json","view_paper":"https://pith.science/paper/5PKHR37J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.09714&json=true","fetch_graph":"https://pith.science/api/pith-number/5PKHR37JNVMRAOZTTEAMLEMH7H/graph.json","fetch_events":"https://pith.science/api/pith-number/5PKHR37JNVMRAOZTTEAMLEMH7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/action/storage_attestation","attest_author":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/action/author_attestation","sign_citation":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/action/citation_signature","submit_replication":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/action/replication_record"}},"created_at":"2026-06-03T02:05:39.757368+00:00","updated_at":"2026-06-03T02:05:39.757368+00:00"}