{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XS5BMUOOWW6FV7WK5MUG5RKGYL","short_pith_number":"pith:XS5BMUOO","canonical_record":{"source":{"id":"1607.05645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"bd9dc125d7b2e0dc0e12f21ba3206a00a581eb11eb2970c862c56923ef54874a","abstract_canon_sha256":"b8df32fe80559617a1bfe2d1f177427cfdf266fae9c7cf3d679edcc1bb0a26a4"},"schema_version":"1.0"},"canonical_sha256":"bcba1651ceb5bc5afecaeb286ec546c2f651f4ed85ab9b6a142b8417804d965d","source":{"kind":"arxiv","id":"1607.05645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05645","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05645v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05645","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"XS5BMUOOWW6F","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XS5BMUOOWW6FV7WK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XS5BMUOO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XS5BMUOOWW6FV7WK5MUG5RKGYL","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:59:50Z","cross_cats_sorted":[],"title_canon_sha256":"bd9dc125d7b2e0dc0e12f21ba3206a00a581eb11eb2970c862c56923ef54874a","abstract_canon_sha256":"b8df32fe80559617a1bfe2d1f177427cfdf266fae9c7cf3d679edcc1bb0a26a4"},"schema_version":"1.0"},"canonical_sha256":"bcba1651ceb5bc5afecaeb286ec546c2f651f4ed85ab9b6a142b8417804d965d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:46.389919Z","signature_b64":"3G25GLPUr3pDYay0fFFTLtSJOp67ZGfnxpWYPp1QQwYz7yATuPnwW0WbnKLIrt/3FbT17QLELoOoxELn1l51DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcba1651ceb5bc5afecaeb286ec546c2f651f4ed85ab9b6a142b8417804d965d","last_reissued_at":"2026-05-18T01:10:46.389367Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:46.389367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05645","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:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYQ596skEOzB92F7mUpSW59KhgBgH71yRtraNq3TyphCPkwRYU3FcWwKnKLCLmhpnl3Bey4HMj/Icapr1hvoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:03:23.011551Z"},"content_sha256":"da2899eaa3ef132f5d501aef82c238e17d46cae091ab4b33f76c56a74bbdfdca","schema_version":"1.0","event_id":"sha256:da2899eaa3ef132f5d501aef82c238e17d46cae091ab4b33f76c56a74bbdfdca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XS5BMUOOWW6FV7WK5MUG5RKGYL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Spreading in Dynamic Networks under Oblivious Adversaries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Chen Avin, Gopal Pandurangan, John Augustine, Mehraneh Liaee, Rajmohan Rajaraman","submitted_at":"2016-07-19T15:59:50Z","abstract_excerpt":"We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, $n$ tokens are arbitrarily distributed among the $n$ network nodes, and the goal is to disseminate all the $n$ tokens to every node. Our focus is on token-forwarding algorithms, which do not manipulate tokens in any way other than storing, copying, and forwarding them. Gossip can be completed in linear time in any static network, but a basic open question for dynamic networks is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05645","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:10:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RliRYiUdQjgEpD22UboE+L9XZhql6PUkt32FUHuaYD1bKbjI74eb+ifFkvbGHfFi8f1LOGlo6PPVM5w8VlglCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:03:23.012013Z"},"content_sha256":"86bebbe68a49389c20ca5ec05e459bca1996254636a1278a571aef27e48f66be","schema_version":"1.0","event_id":"sha256:86bebbe68a49389c20ca5ec05e459bca1996254636a1278a571aef27e48f66be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/bundle.json","state_url":"https://pith.science/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/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-06-01T01:03:23Z","links":{"resolver":"https://pith.science/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL","bundle":"https://pith.science/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/bundle.json","state":"https://pith.science/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS5BMUOOWW6FV7WK5MUG5RKGYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XS5BMUOOWW6FV7WK5MUG5RKGYL","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":"b8df32fe80559617a1bfe2d1f177427cfdf266fae9c7cf3d679edcc1bb0a26a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:59:50Z","title_canon_sha256":"bd9dc125d7b2e0dc0e12f21ba3206a00a581eb11eb2970c862c56923ef54874a"},"schema_version":"1.0","source":{"id":"1607.05645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05645","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05645v1","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05645","created_at":"2026-05-18T01:10:46Z"},{"alias_kind":"pith_short_12","alias_value":"XS5BMUOOWW6F","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XS5BMUOOWW6FV7WK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XS5BMUOO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:86bebbe68a49389c20ca5ec05e459bca1996254636a1278a571aef27e48f66be","target":"graph","created_at":"2026-05-18T01:10:46Z","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 study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, $n$ tokens are arbitrarily distributed among the $n$ network nodes, and the goal is to disseminate all the $n$ tokens to every node. Our focus is on token-forwarding algorithms, which do not manipulate tokens in any way other than storing, copying, and forwarding them. Gossip can be completed in linear time in any static network, but a basic open question for dynamic networks is the","authors_text":"Chen Avin, Gopal Pandurangan, John Augustine, Mehraneh Liaee, Rajmohan Rajaraman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:59:50Z","title":"Information Spreading in Dynamic Networks under Oblivious Adversaries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05645","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:da2899eaa3ef132f5d501aef82c238e17d46cae091ab4b33f76c56a74bbdfdca","target":"record","created_at":"2026-05-18T01:10:46Z","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":"b8df32fe80559617a1bfe2d1f177427cfdf266fae9c7cf3d679edcc1bb0a26a4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-19T15:59:50Z","title_canon_sha256":"bd9dc125d7b2e0dc0e12f21ba3206a00a581eb11eb2970c862c56923ef54874a"},"schema_version":"1.0","source":{"id":"1607.05645","kind":"arxiv","version":1}},"canonical_sha256":"bcba1651ceb5bc5afecaeb286ec546c2f651f4ed85ab9b6a142b8417804d965d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcba1651ceb5bc5afecaeb286ec546c2f651f4ed85ab9b6a142b8417804d965d","first_computed_at":"2026-05-18T01:10:46.389367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:46.389367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3G25GLPUr3pDYay0fFFTLtSJOp67ZGfnxpWYPp1QQwYz7yATuPnwW0WbnKLIrt/3FbT17QLELoOoxELn1l51DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:46.389919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da2899eaa3ef132f5d501aef82c238e17d46cae091ab4b33f76c56a74bbdfdca","sha256:86bebbe68a49389c20ca5ec05e459bca1996254636a1278a571aef27e48f66be"],"state_sha256":"823c37424fdeb2e4cc51e8bc84e172425c4851fd80ac47bd208da0639193a1f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mybr5dms86DdXAIF8p/NO4esMbocJC4kt8GeFPnRrEn4D2IggKseGP1XaNV6JQ4L0/Q/NiZbAHgPMaE4D9oSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:03:23.014773Z","bundle_sha256":"49d81eef412b2de6460d1febf5a885ea095df8b7d82e3b804554368c8207a687"}}