{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:T5MMXAOJ36M7NAUL3BZAWISYKE","short_pith_number":"pith:T5MMXAOJ","canonical_record":{"source":{"id":"1208.0525","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PF","submitted_at":"2012-08-02T16:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"4068468889aba24a5b0a87ad45b58a284663e097cc3d95f98a8e8fc717de97b5","abstract_canon_sha256":"fe3e171ab80443c31172ad8b777c1ef18ecfbb73b413258f8d8ecd8d198af616"},"schema_version":"1.0"},"canonical_sha256":"9f58cb81c9df99f6828bd8720b2258512b6d3897f98f32c47f93b2e422b35252","source":{"kind":"arxiv","id":"1208.0525","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0525","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0525v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0525","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"T5MMXAOJ36M7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T5MMXAOJ36M7NAUL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T5MMXAOJ","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:T5MMXAOJ36M7NAUL3BZAWISYKE","target":"record","payload":{"canonical_record":{"source":{"id":"1208.0525","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PF","submitted_at":"2012-08-02T16:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"4068468889aba24a5b0a87ad45b58a284663e097cc3d95f98a8e8fc717de97b5","abstract_canon_sha256":"fe3e171ab80443c31172ad8b777c1ef18ecfbb73b413258f8d8ecd8d198af616"},"schema_version":"1.0"},"canonical_sha256":"9f58cb81c9df99f6828bd8720b2258512b6d3897f98f32c47f93b2e422b35252","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:25.704790Z","signature_b64":"95haAORG9F+D/YtnLVhNMp6wPsKjF++H+3VLu/ZyqIWU7en3Pzdi7QyEmb9dkPdlutJnzLhmyHy8CqvSJsm+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f58cb81c9df99f6828bd8720b2258512b6d3897f98f32c47f93b2e422b35252","last_reissued_at":"2026-05-18T03:25:25.704276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:25.704276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.0525","source_version":2,"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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UOusNkyIkZbEwRWjra2rkrJo5mLB0+6kl1hDwezuhxBL1f8UNalFF/kk1/bUWpYgGwENN6Pj4l+3SxFGxodBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:25:19.246684Z"},"content_sha256":"be0253c2363e00b9e2084cd38acf8e6e5b6cbbb87583b844164bc56893774a05","schema_version":"1.0","event_id":"sha256:be0253c2363e00b9e2084cd38acf8e6e5b6cbbb87583b844164bc56893774a05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:T5MMXAOJ36M7NAUL3BZAWISYKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Upper Bound on the Convergence Time for Distributed Binary Consensus","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Pan Hui, Paul W. Cuff, Sanjeev R. Kulkarni, Shang Shang","submitted_at":"2012-08-02T16:00:45Z","abstract_excerpt":"The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by B\\'en\\'ezit et al.. In the initial setting, each node in the network has one of two possible states (\"yes\" or \"no\"). Nodes can update their states by communicating with their neighbors via a 2-bit message in an asynchronous clock setting. Eventually, all nodes reach consensus on the majority states. We use the theory of electric networks, random walks, and couplings of Markov chains to derive an O(N4 logN) upper bound for the expected convergence time on an arbitrary gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0525","kind":"arxiv","version":2},"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-18T03:25:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFFoIXaL7VUbHzu8sNjgZE2OyAIP03O2Rj+CPoIArSMyI0GuCWw124E9OEmaVTh8atSvDYl4FTBu3IMc6wTzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:25:19.247339Z"},"content_sha256":"7b2dfa494b52df1f7533338a38443129b898625a5e1a2b403dd793a0f1ab229e","schema_version":"1.0","event_id":"sha256:7b2dfa494b52df1f7533338a38443129b898625a5e1a2b403dd793a0f1ab229e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/bundle.json","state_url":"https://pith.science/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/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-05-25T04:25:19Z","links":{"resolver":"https://pith.science/pith/T5MMXAOJ36M7NAUL3BZAWISYKE","bundle":"https://pith.science/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/bundle.json","state":"https://pith.science/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5MMXAOJ36M7NAUL3BZAWISYKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:T5MMXAOJ36M7NAUL3BZAWISYKE","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":"fe3e171ab80443c31172ad8b777c1ef18ecfbb73b413258f8d8ecd8d198af616","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PF","submitted_at":"2012-08-02T16:00:45Z","title_canon_sha256":"4068468889aba24a5b0a87ad45b58a284663e097cc3d95f98a8e8fc717de97b5"},"schema_version":"1.0","source":{"id":"1208.0525","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.0525","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"arxiv_version","alias_value":"1208.0525v2","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0525","created_at":"2026-05-18T03:25:25Z"},{"alias_kind":"pith_short_12","alias_value":"T5MMXAOJ36M7","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T5MMXAOJ36M7NAUL","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T5MMXAOJ","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:7b2dfa494b52df1f7533338a38443129b898625a5e1a2b403dd793a0f1ab229e","target":"graph","created_at":"2026-05-18T03:25:25Z","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":"The problem addressed in this paper is the analysis of a distributed consensus algorithm for arbitrary networks, proposed by B\\'en\\'ezit et al.. In the initial setting, each node in the network has one of two possible states (\"yes\" or \"no\"). Nodes can update their states by communicating with their neighbors via a 2-bit message in an asynchronous clock setting. Eventually, all nodes reach consensus on the majority states. We use the theory of electric networks, random walks, and couplings of Markov chains to derive an O(N4 logN) upper bound for the expected convergence time on an arbitrary gra","authors_text":"Pan Hui, Paul W. Cuff, Sanjeev R. Kulkarni, Shang Shang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PF","submitted_at":"2012-08-02T16:00:45Z","title":"An Upper Bound on the Convergence Time for Distributed Binary Consensus"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0525","kind":"arxiv","version":2},"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:be0253c2363e00b9e2084cd38acf8e6e5b6cbbb87583b844164bc56893774a05","target":"record","created_at":"2026-05-18T03:25:25Z","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":"fe3e171ab80443c31172ad8b777c1ef18ecfbb73b413258f8d8ecd8d198af616","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.PF","submitted_at":"2012-08-02T16:00:45Z","title_canon_sha256":"4068468889aba24a5b0a87ad45b58a284663e097cc3d95f98a8e8fc717de97b5"},"schema_version":"1.0","source":{"id":"1208.0525","kind":"arxiv","version":2}},"canonical_sha256":"9f58cb81c9df99f6828bd8720b2258512b6d3897f98f32c47f93b2e422b35252","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f58cb81c9df99f6828bd8720b2258512b6d3897f98f32c47f93b2e422b35252","first_computed_at":"2026-05-18T03:25:25.704276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:25.704276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"95haAORG9F+D/YtnLVhNMp6wPsKjF++H+3VLu/ZyqIWU7en3Pzdi7QyEmb9dkPdlutJnzLhmyHy8CqvSJsm+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:25.704790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.0525","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be0253c2363e00b9e2084cd38acf8e6e5b6cbbb87583b844164bc56893774a05","sha256:7b2dfa494b52df1f7533338a38443129b898625a5e1a2b403dd793a0f1ab229e"],"state_sha256":"6c34326909171b4df76ed43495a3ec570f6cc0eefe728e23f76a1e20e1730202"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1VN7pq3lgauwNuTl5j0GX/EJM6j/n1SuqxXtbJ2b9lOI8g6epZpdWahMe9R9X+NWOJYoEeMToYZF0FW3g1U+Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:25:19.250537Z","bundle_sha256":"4199c1eb00a1447fc9f919e8d5baf70b840439d4aa1be38f562c7f2d03dce93d"}}