{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7FZLRI3G36GCZTQFUHBVOBBFII","short_pith_number":"pith:7FZLRI3G","schema_version":"1.0","canonical_sha256":"f972b8a366df8c2cce05a1c35704254206685bc57a0aef096580700e22ea25e9","source":{"kind":"arxiv","id":"1112.1336","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.1336","created_at":"2026-05-18T00:57:57.157223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.1336v5","created_at":"2026-05-18T00:57:57.157223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1336","created_at":"2026-05-18T00:57:57.157223+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FZLRI3G36GC","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FZLRI3G36GCZTQF","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FZLRI3G","created_at":"2026-05-18T12:26:22.705136+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII","json":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII.json","graph_json":"https://pith.science/api/pith-number/7FZLRI3G36GCZTQFUHBVOBBFII/graph.json","events_json":"https://pith.science/api/pith-number/7FZLRI3G36GCZTQFUHBVOBBFII/events.json","paper":"https://pith.science/paper/7FZLRI3G"},"agent_actions":{"view_html":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII","download_json":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII.json","view_paper":"https://pith.science/paper/7FZLRI3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.1336&json=true","fetch_graph":"https://pith.science/api/pith-number/7FZLRI3G36GCZTQFUHBVOBBFII/graph.json","fetch_events":"https://pith.science/api/pith-number/7FZLRI3G36GCZTQFUHBVOBBFII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/action/storage_attestation","attest_author":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/action/author_attestation","sign_citation":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/action/citation_signature","submit_replication":"https://pith.science/pith/7FZLRI3G36GCZTQFUHBVOBBFII/action/replication_record"}},"created_at":"2026-05-18T00:57:57.157223+00:00","updated_at":"2026-05-18T00:57:57.157223+00:00"}