{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7FZLRI3G36GCZTQFUHBVOBBFII","short_pith_number":"pith:7FZLRI3G","canonical_record":{"source":{"id":"1112.1336","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-12-06T16:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"0a25808ac216c3021dc5415ca469a0057bc9067e54c30c439fe7e2c2d20607a4","abstract_canon_sha256":"1addee836b93fd9cdd8efc5cad604790eb01ef5a8474eb4814340c9de8cdcdb8"},"schema_version":"1.0"},"canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","source":{"kind":"arxiv","id":"1112.1336","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1336","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1336v5","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1336","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"7FZLRI3G36GC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7FZLRI3G36GCZTQF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7FZLRI3G","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7FZLRI3G36GCZTQFUHBVOBBFII","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1336","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-12-06T16:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"0a25808ac216c3021dc5415ca469a0057bc9067e54c30c439fe7e2c2d20607a4","abstract_canon_sha256":"1addee836b93fd9cdd8efc5cad604790eb01ef5a8474eb4814340c9de8cdcdb8"},"schema_version":"1.0"},"canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.157632Z","signature_b64":"blSgL0wbINcoue3SfiljGcYZQ5NRMiCPOMfVTb0UI2peZ/epaxgwAF0VhgCho/941g8Uqq6WCCdrO7em4o35Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","last_reissued_at":"2026-05-18T00:57:57.157150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.157150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1336","source_version":5,"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XmEVDvSXLOpRAxt0JVz7rCWl8dh4NJn8W//ss4p//Q2Picunvz63wAnoWwRNTipOT9IJrJd6Sy3+4YtTgljzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:59:43.771923Z"},"content_sha256":"cee9948dbc65e92c3834a75043a40a40428b50ee8d4c7b07daf8989d1f4d990f","schema_version":"1.0","event_id":"sha256:cee9948dbc65e92c3834a75043a40a40428b50ee8d4c7b07daf8989d1f4d990f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7FZLRI3G36GCZTQFUHBVOBBFII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Brian D. O. Anderson, Guodong Shi, Karl Henrik Johansson","submitted_at":"2011-12-06T16:33:04Z","abstract_excerpt":"Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step, every node updates its state based on a Bernoulli trial, independent in time and among different nodes: either averaging among the neighbor set generated by the random graph, or sticking with its current state. Connectivity-independence and arc-independence are introduced to capture the fundamental influence of the random graphs on the consensus convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1336","kind":"arxiv","version":5},"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-18T00:57:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DZlBzhDki8QITW4nLXSdrR4Ex8xzqfAiQDmZZ83yUhJVD7o/b1bJyAON72zu3Wh5m3PqhmG6wklgAtFCyuYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:59:43.772273Z"},"content_sha256":"aadf8890ca04f4852b086df5b60c642eb39abe98935a8f5c054ba98ef19ad302","schema_version":"1.0","event_id":"sha256:aadf8890ca04f4852b086df5b60c642eb39abe98935a8f5c054ba98ef19ad302"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/bundle.json","state_url":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FZLRI3G36GCZTQFUHBVOBBFII/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-30T19:59:43Z","links":{"resolver":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII","bundle":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/bundle.json","state":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FZLRI3G36GCZTQFUHBVOBBFII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7FZLRI3G36GCZTQFUHBVOBBFII","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":"1addee836b93fd9cdd8efc5cad604790eb01ef5a8474eb4814340c9de8cdcdb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-12-06T16:33:04Z","title_canon_sha256":"0a25808ac216c3021dc5415ca469a0057bc9067e54c30c439fe7e2c2d20607a4"},"schema_version":"1.0","source":{"id":"1112.1336","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1336","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1336v5","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1336","created_at":"2026-05-18T00:57:57Z"},{"alias_kind":"pith_short_12","alias_value":"7FZLRI3G36GC","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7FZLRI3G36GCZTQF","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7FZLRI3G","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:aadf8890ca04f4852b086df5b60c642eb39abe98935a8f5c054ba98ef19ad302","target":"graph","created_at":"2026-05-18T00:57:57Z","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":"Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of all possible digraphs over the node set. At each time step, every node updates its state based on a Bernoulli trial, independent in time and among different nodes: either averaging among the neighbor set generated by the random graph, or sticking with its current state. Connectivity-independence and arc-independence are introduced to capture the fundamental influence of the random graphs on the consensus convergence","authors_text":"Brian D. O. Anderson, Guodong Shi, Karl Henrik Johansson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-12-06T16:33:04Z","title":"Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1336","kind":"arxiv","version":5},"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:cee9948dbc65e92c3834a75043a40a40428b50ee8d4c7b07daf8989d1f4d990f","target":"record","created_at":"2026-05-18T00:57:57Z","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":"1addee836b93fd9cdd8efc5cad604790eb01ef5a8474eb4814340c9de8cdcdb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-12-06T16:33:04Z","title_canon_sha256":"0a25808ac216c3021dc5415ca469a0057bc9067e54c30c439fe7e2c2d20607a4"},"schema_version":"1.0","source":{"id":"1112.1336","kind":"arxiv","version":5}},"canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","first_computed_at":"2026-05-18T00:57:57.157150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:57.157150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"blSgL0wbINcoue3SfiljGcYZQ5NRMiCPOMfVTb0UI2peZ/epaxgwAF0VhgCho/941g8Uqq6WCCdrO7em4o35Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:57.157632Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1336","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cee9948dbc65e92c3834a75043a40a40428b50ee8d4c7b07daf8989d1f4d990f","sha256:aadf8890ca04f4852b086df5b60c642eb39abe98935a8f5c054ba98ef19ad302"],"state_sha256":"0eaf5879dbd35629da484da93080044cd40a2d4e47b2ca2f9964239d3d1a42bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uAGFEtVZHyN69iH44BwpxtrZljTG4uOM/uTRPpWKo3E4M5pXZ14VFSDrUaW2Lc+E7vAsKp0rNPX+FR83jc51Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:59:43.774259Z","bundle_sha256":"eda812aea9b9b1fd9bf4a29fcecea48062f2d9ea045cd8681dbb199bb2fec633"}}