{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BDK5BUMGCLV2F4SXT7ZHLL6KEB","short_pith_number":"pith:BDK5BUMG","canonical_record":{"source":{"id":"1507.01181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-05T08:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"30a3a0c40dd088b9d02c6ffed2e2a62fb2a82e418faa12285cedb55aa70f4db0","abstract_canon_sha256":"63569954bead51fcc023e2a9835c1959e98c497feb3122d732e5931c29dd26fc"},"schema_version":"1.0"},"canonical_sha256":"08d5d0d18612eba2f2579ff275afca2045e37ad1d7c8e13a27cdb5a351057f86","source":{"kind":"arxiv","id":"1507.01181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01181","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01181v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01181","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"BDK5BUMGCLV2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BDK5BUMGCLV2F4SX","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BDK5BUMG","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BDK5BUMGCLV2F4SXT7ZHLL6KEB","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-05T08:54:59Z","cross_cats_sorted":[],"title_canon_sha256":"30a3a0c40dd088b9d02c6ffed2e2a62fb2a82e418faa12285cedb55aa70f4db0","abstract_canon_sha256":"63569954bead51fcc023e2a9835c1959e98c497feb3122d732e5931c29dd26fc"},"schema_version":"1.0"},"canonical_sha256":"08d5d0d18612eba2f2579ff275afca2045e37ad1d7c8e13a27cdb5a351057f86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:17.845238Z","signature_b64":"bjEhZzOZFSK1XZstHrZ1I6zzn9WOApvhDbvO+5urv/U6fkxDPp28XyQt0fx4J+4zsuBJEPxWL8bxYhLtCK0kBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d5d0d18612eba2f2579ff275afca2045e37ad1d7c8e13a27cdb5a351057f86","last_reissued_at":"2026-05-18T01:37:17.844474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:17.844474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01181","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:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59/e68dzYvULd+BM3DNr5g3VGka6KCRtZVFWI6FTT6wFKuVoDrXh62VBPWqrv3/Q3u4QUEZyMPhvFbwR9NNjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:28:52.558214Z"},"content_sha256":"3cce4b413f5a31d63ec825c8f4c18df2e9171a7ff29f80ace00e967a6a63fc0c","schema_version":"1.0","event_id":"sha256:3cce4b413f5a31d63ec825c8f4c18df2e9171a7ff29f80ace00e967a6a63fc0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BDK5BUMGCLV2F4SXT7ZHLL6KEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Fast and Robust Information Spreading in the Vertex-Congest Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Keren Censor-Hillel, Tariq Toukan","submitted_at":"2015-07-05T08:54:59Z","abstract_excerpt":"This paper initiates the study of the impact of failures on the fundamental problem of \\emph{information spreading} in the Vertex-Congest model, in which in every round, each of the $n$ nodes sends the same $O(\\log{n})$-bit message to all of its neighbors.\n  Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring $\\Omega(n/\\sqrt{k})$ rounds on some graphs, which we denote by $G_{n,k}$, where $k$ is the vertex-connectivity.\n  Second, we design a randomized algorithm that m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01181","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:37:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFuHvW8t8x6HeWRJ611MEbwkEMvfUAag0+5Of35qaHHWfZDND5bpSZ6YY8Or+52gYIis43uJT/AXfZjjYtFyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:28:52.558763Z"},"content_sha256":"091b70d449d2ffac6bb17a59857a4ed1184b2c4981d37f0480daa7c5f0133599","schema_version":"1.0","event_id":"sha256:091b70d449d2ffac6bb17a59857a4ed1184b2c4981d37f0480daa7c5f0133599"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/bundle.json","state_url":"https://pith.science/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/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-01T04:28:52Z","links":{"resolver":"https://pith.science/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB","bundle":"https://pith.science/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/bundle.json","state":"https://pith.science/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDK5BUMGCLV2F4SXT7ZHLL6KEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BDK5BUMGCLV2F4SXT7ZHLL6KEB","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":"63569954bead51fcc023e2a9835c1959e98c497feb3122d732e5931c29dd26fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-05T08:54:59Z","title_canon_sha256":"30a3a0c40dd088b9d02c6ffed2e2a62fb2a82e418faa12285cedb55aa70f4db0"},"schema_version":"1.0","source":{"id":"1507.01181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01181","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01181v1","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01181","created_at":"2026-05-18T01:37:17Z"},{"alias_kind":"pith_short_12","alias_value":"BDK5BUMGCLV2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BDK5BUMGCLV2F4SX","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BDK5BUMG","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:091b70d449d2ffac6bb17a59857a4ed1184b2c4981d37f0480daa7c5f0133599","target":"graph","created_at":"2026-05-18T01:37:17Z","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":"This paper initiates the study of the impact of failures on the fundamental problem of \\emph{information spreading} in the Vertex-Congest model, in which in every round, each of the $n$ nodes sends the same $O(\\log{n})$-bit message to all of its neighbors.\n  Our contribution to coping with failures is twofold. First, we prove that the randomized algorithm which chooses uniformly at random the next message to forward is slow, requiring $\\Omega(n/\\sqrt{k})$ rounds on some graphs, which we denote by $G_{n,k}$, where $k$ is the vertex-connectivity.\n  Second, we design a randomized algorithm that m","authors_text":"Keren Censor-Hillel, Tariq Toukan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-05T08:54:59Z","title":"On Fast and Robust Information Spreading in the Vertex-Congest Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01181","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:3cce4b413f5a31d63ec825c8f4c18df2e9171a7ff29f80ace00e967a6a63fc0c","target":"record","created_at":"2026-05-18T01:37:17Z","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":"63569954bead51fcc023e2a9835c1959e98c497feb3122d732e5931c29dd26fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-05T08:54:59Z","title_canon_sha256":"30a3a0c40dd088b9d02c6ffed2e2a62fb2a82e418faa12285cedb55aa70f4db0"},"schema_version":"1.0","source":{"id":"1507.01181","kind":"arxiv","version":1}},"canonical_sha256":"08d5d0d18612eba2f2579ff275afca2045e37ad1d7c8e13a27cdb5a351057f86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08d5d0d18612eba2f2579ff275afca2045e37ad1d7c8e13a27cdb5a351057f86","first_computed_at":"2026-05-18T01:37:17.844474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:17.844474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bjEhZzOZFSK1XZstHrZ1I6zzn9WOApvhDbvO+5urv/U6fkxDPp28XyQt0fx4J+4zsuBJEPxWL8bxYhLtCK0kBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:17.845238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cce4b413f5a31d63ec825c8f4c18df2e9171a7ff29f80ace00e967a6a63fc0c","sha256:091b70d449d2ffac6bb17a59857a4ed1184b2c4981d37f0480daa7c5f0133599"],"state_sha256":"68b099b277d4cd283b713ca631f0ca898932632dbecf0acb7248100c82baa982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KjXNbFzrLsu8XqLPoFCzLVVbKnfdZA70AEAPBLXNbRnG10wwHAHJrhpQ0y+st2sa1Ro2ispVgk36f2TMqwt6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:28:52.561461Z","bundle_sha256":"4ac6416f5d4196fa4a4d2493c070871d73fc3ce834169b239077217e43528ab1"}}