{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:5PKHR37JNVMRAOZTTEAMLEMH7H","short_pith_number":"pith:5PKHR37J","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"},"canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","source":{"kind":"arxiv","id":"2407.09714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.09714","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"2407.09714v1","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09714","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"5PKHR37JNVMR","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_16","alias_value":"5PKHR37JNVMRAOZT","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_8","alias_value":"5PKHR37J","created_at":"2026-06-03T02:05:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:5PKHR37JNVMRAOZTTEAMLEMH7H","target":"record","payload":{"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"},"canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","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"},"source_kind":"arxiv","source_id":"2407.09714","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-06-03T02:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dSuPfRlDA6a/LY9eIyD63edPfNUXVXZN/ky5aBqkeFfCV/NfpPl/i25YbxPTOPYZ14CHx6exu/10WhFxQY5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:11:46.696291Z"},"content_sha256":"40b1c31d4040ee6c06ca30775bef73385daeca8f7dd0ccdfd1e93cda9dfb1e7e","schema_version":"1.0","event_id":"sha256:40b1c31d4040ee6c06ca30775bef73385daeca8f7dd0ccdfd1e93cda9dfb1e7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:5PKHR37JNVMRAOZTTEAMLEMH7H","target":"graph","payload":{"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"},"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-06-03T02:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J6PqCwDiV9S96xYw6EswHMuIbbpQgQElxomhew2iuqpdEcK6DXXXfkhjl8BcE7Ux97rE/kaFfrZJd0KhtdWjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T19:11:46.697273Z"},"content_sha256":"142fd2f05648e7fb8340887143565a9500bc351ce75d0d3b46766bb8eb94eefd","schema_version":"1.0","event_id":"sha256:142fd2f05648e7fb8340887143565a9500bc351ce75d0d3b46766bb8eb94eefd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/bundle.json","state_url":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/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-08-14T19:11:46Z","links":{"resolver":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H","bundle":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/bundle.json","state":"https://pith.science/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5PKHR37JNVMRAOZTTEAMLEMH7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:5PKHR37JNVMRAOZTTEAMLEMH7H","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":"2c448b0664e92bbdb818fad3c4090f786e79379eceb3c671e3db3a26d90a2efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-12T22:55:01Z","title_canon_sha256":"a184abb37f710c6ce4f6224f1c5625d64a0a610ae9aa7a61422e59bc601cd75b"},"schema_version":"1.0","source":{"id":"2407.09714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.09714","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"2407.09714v1","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.09714","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"5PKHR37JNVMR","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_16","alias_value":"5PKHR37JNVMRAOZT","created_at":"2026-06-03T02:05:39Z"},{"alias_kind":"pith_short_8","alias_value":"5PKHR37J","created_at":"2026-06-03T02:05:39Z"}],"graph_snapshots":[{"event_id":"sha256:142fd2f05648e7fb8340887143565a9500bc351ce75d0d3b46766bb8eb94eefd","target":"graph","created_at":"2026-06-03T02:05:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2407.09714/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Garrett Parzych, Joshua J. Daymude","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-12T22:55:01Z","title":"Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.09714","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:40b1c31d4040ee6c06ca30775bef73385daeca8f7dd0ccdfd1e93cda9dfb1e7e","target":"record","created_at":"2026-06-03T02:05:39Z","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":"2c448b0664e92bbdb818fad3c4090f786e79379eceb3c671e3db3a26d90a2efe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2024-07-12T22:55:01Z","title_canon_sha256":"a184abb37f710c6ce4f6224f1c5625d64a0a610ae9aa7a61422e59bc601cd75b"},"schema_version":"1.0","source":{"id":"2407.09714","kind":"arxiv","version":1}},"canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebd478efe96d59103b339900c59187f9db99667c175dbb9259d91165dae727bc","first_computed_at":"2026-06-03T02:05:39.757302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T02:05:39.757302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kM8vzKibcymU9ZJffa0bHJfbSHI4H50HPbd/jw+xFTAhg4W1d94FbdQMouYNeq/w2kTFkKrdTJNQqNW2qgg5AQ==","signature_status":"signed_v1","signed_at":"2026-06-03T02:05:39.757763Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.09714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40b1c31d4040ee6c06ca30775bef73385daeca8f7dd0ccdfd1e93cda9dfb1e7e","sha256:142fd2f05648e7fb8340887143565a9500bc351ce75d0d3b46766bb8eb94eefd"],"state_sha256":"dfbee721f663594873d41b853784a0179a0379ebc53b35677630b335edfa912d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXNIrdI6s428c+GPZMVNKiRqGZojEyf3p5jwWFY2i8FNBUI6uNrJ84rOKPWc2HFaXdCsX/kXecC61XTLMMJ7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T19:11:46.714296Z","bundle_sha256":"cd7ea143059d5e7fb76ec030b42425bd363a4ae0cd398e1a5693701386187064"}}