{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:WU4CSB7WP3WQUB3DU4L2IC3XWP","short_pith_number":"pith:WU4CSB7W","canonical_record":{"source":{"id":"2208.05998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-11T18:13:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9ccd58eb9902f0a9d9ecafbed2ac686b22b13454e6cd5208659dc225f07bc60f","abstract_canon_sha256":"8ed032c759389672c2d561a98424ab79557e3e61db53352004cf222b3ac5d227"},"schema_version":"1.0"},"canonical_sha256":"b5382907f67eed0a0763a717a40b77b3fee2581bd55e7c076d701c8ec6536152","source":{"kind":"arxiv","id":"2208.05998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05998","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05998v1","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05998","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"WU4CSB7WP3WQ","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_16","alias_value":"WU4CSB7WP3WQUB3D","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_8","alias_value":"WU4CSB7W","created_at":"2026-07-05T04:48:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:WU4CSB7WP3WQUB3DU4L2IC3XWP","target":"record","payload":{"canonical_record":{"source":{"id":"2208.05998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-11T18:13:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"9ccd58eb9902f0a9d9ecafbed2ac686b22b13454e6cd5208659dc225f07bc60f","abstract_canon_sha256":"8ed032c759389672c2d561a98424ab79557e3e61db53352004cf222b3ac5d227"},"schema_version":"1.0"},"canonical_sha256":"b5382907f67eed0a0763a717a40b77b3fee2581bd55e7c076d701c8ec6536152","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:00.029691Z","signature_b64":"6S5Xb+/gpsCv371KAV83r331pq9q8PYIZqlMU/Oc6uMQTppooj/WSaA06vLnhoh2q8VfVTMj0zy1k4O5bg0GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5382907f67eed0a0763a717a40b77b3fee2581bd55e7c076d701c8ec6536152","last_reissued_at":"2026-07-05T04:48:00.029230Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:00.029230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.05998","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-07-05T04:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgJ3WXtyETzJO1D/Rdk7J7MjjMnRgkPzY/9yinW7ckXYG17SDfEyAP2ZoFPse5SqvSlsQB0+9XQpARp3hMUoDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:08.330983Z"},"content_sha256":"72b97339ad95b28bd7da359cc04e962260c4450bd0177851d8ee88701c015cba","schema_version":"1.0","event_id":"sha256:72b97339ad95b28bd7da359cc04e962260c4450bd0177851d8ee88701c015cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:WU4CSB7WP3WQUB3DU4L2IC3XWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of Information Spreading in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Calvin Newport, Jeremy Fineman, Michael Dinitz, Seth Gilbert","submitted_at":"2022-08-11T18:13:27Z","abstract_excerpt":"The best known solutions for $k$-message broadcast in dynamic networks of size $n$ require $\\Omega(nk)$ rounds. In this paper, we see if these bounds can be improved by smoothed analysis. We study perhaps the most natural randomized algorithm for disseminating tokens in this setting: at every time step, choose a token to broadcast randomly from the set of tokens you know. We show that with even a small amount of smoothing (one random edge added per round), this natural strategy solves $k$-message broadcast in $\\tilde{O}(n+k^3)$ rounds, with high probability, beating the best known bounds for $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05998","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/2208.05998/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-07-05T04:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDfpC75OjCmLLPX4PVkOaMgvognwKeFV+DOXqESxUGIKqFcERtQ3N582JObDEG6Z2fhhlA3gjENcIkNX4DSMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:53:08.331627Z"},"content_sha256":"f6d159ca5142c6dda3ba7a8e0a0640c0f1590c17c023edfd2c7f5611bb1744bc","schema_version":"1.0","event_id":"sha256:f6d159ca5142c6dda3ba7a8e0a0640c0f1590c17c023edfd2c7f5611bb1744bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/bundle.json","state_url":"https://pith.science/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/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-07-07T04:53:08Z","links":{"resolver":"https://pith.science/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP","bundle":"https://pith.science/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/bundle.json","state":"https://pith.science/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WU4CSB7WP3WQUB3DU4L2IC3XWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:WU4CSB7WP3WQUB3DU4L2IC3XWP","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":"8ed032c759389672c2d561a98424ab79557e3e61db53352004cf222b3ac5d227","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-11T18:13:27Z","title_canon_sha256":"9ccd58eb9902f0a9d9ecafbed2ac686b22b13454e6cd5208659dc225f07bc60f"},"schema_version":"1.0","source":{"id":"2208.05998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.05998","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"2208.05998v1","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.05998","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"WU4CSB7WP3WQ","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_16","alias_value":"WU4CSB7WP3WQUB3D","created_at":"2026-07-05T04:48:00Z"},{"alias_kind":"pith_short_8","alias_value":"WU4CSB7W","created_at":"2026-07-05T04:48:00Z"}],"graph_snapshots":[{"event_id":"sha256:f6d159ca5142c6dda3ba7a8e0a0640c0f1590c17c023edfd2c7f5611bb1744bc","target":"graph","created_at":"2026-07-05T04:48:00Z","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/2208.05998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The best known solutions for $k$-message broadcast in dynamic networks of size $n$ require $\\Omega(nk)$ rounds. In this paper, we see if these bounds can be improved by smoothed analysis. We study perhaps the most natural randomized algorithm for disseminating tokens in this setting: at every time step, choose a token to broadcast randomly from the set of tokens you know. We show that with even a small amount of smoothing (one random edge added per round), this natural strategy solves $k$-message broadcast in $\\tilde{O}(n+k^3)$ rounds, with high probability, beating the best known bounds for $","authors_text":"Calvin Newport, Jeremy Fineman, Michael Dinitz, Seth Gilbert","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-11T18:13:27Z","title":"Smoothed Analysis of Information Spreading in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.05998","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:72b97339ad95b28bd7da359cc04e962260c4450bd0177851d8ee88701c015cba","target":"record","created_at":"2026-07-05T04:48:00Z","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":"8ed032c759389672c2d561a98424ab79557e3e61db53352004cf222b3ac5d227","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-08-11T18:13:27Z","title_canon_sha256":"9ccd58eb9902f0a9d9ecafbed2ac686b22b13454e6cd5208659dc225f07bc60f"},"schema_version":"1.0","source":{"id":"2208.05998","kind":"arxiv","version":1}},"canonical_sha256":"b5382907f67eed0a0763a717a40b77b3fee2581bd55e7c076d701c8ec6536152","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5382907f67eed0a0763a717a40b77b3fee2581bd55e7c076d701c8ec6536152","first_computed_at":"2026-07-05T04:48:00.029230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:48:00.029230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6S5Xb+/gpsCv371KAV83r331pq9q8PYIZqlMU/Oc6uMQTppooj/WSaA06vLnhoh2q8VfVTMj0zy1k4O5bg0GBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:48:00.029691Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.05998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b97339ad95b28bd7da359cc04e962260c4450bd0177851d8ee88701c015cba","sha256:f6d159ca5142c6dda3ba7a8e0a0640c0f1590c17c023edfd2c7f5611bb1744bc"],"state_sha256":"e68b7f21f5d74c13f98886f4c780d15f93a996f7cff542e0a43dff08810ee026"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNQ+U/busqO8k2Nt8saHHwqB6gQJldrilZJEvIEze5n55fHU8JsuY2nxXcpwAR1Htf4hZD43HMeVYfhMEaZyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:53:08.334893Z","bundle_sha256":"b5d568a803cd90848685b9216758648ffc6f3d99344601f11c99fbd86b222903"}}