{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2S3PT4XJIPOBYGFCZOANIACVSD","short_pith_number":"pith:2S3PT4XJ","schema_version":"1.0","canonical_sha256":"d4b6f9f2e943dc1c18a2cb80d4005590e83e0ad374e038b2c0ff868844226975","source":{"kind":"arxiv","id":"1008.4551","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Consensus Algorithm with Linear Per-Bit Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2010-08-26T17:29:31Z","abstract_excerpt":"In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discussion in this note is not self-contained, and relies heavily on the material in [2] - please refer to [2] for the necessary background."},"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":"1008.4551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-26T17:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"42360072a8d90396f02b1d31cdd98e0c93efbe0dbbe9ea1309f78514c8de21bc","abstract_canon_sha256":"e30a51bb41b659008a2715e5f522a560358e51aa8caa92b74198f957d394b9c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:45.124289Z","signature_b64":"JyPAQFr4Gs2hIDnJiiIUdsTbUBzTVjfMnBqU+qx7SvyCXrmlGW38w3b4Iby7XPABXGwNJATIgI82dVzJ5TYsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b6f9f2e943dc1c18a2cb80d4005590e83e0ad374e038b2c0ff868844226975","last_reissued_at":"2026-05-18T04:41:45.123556Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:45.123556Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Consensus Algorithm with Linear Per-Bit Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guanfeng Liang, Nitin Vaidya","submitted_at":"2010-08-26T17:29:31Z","abstract_excerpt":"In this report, building on the deterministic multi-valued one-to-many Byzantine agreement (broadcast) algorithm in our recent technical report [2], we introduce a deterministic multi-valued all-to-all Byzantine agreement algorithm (consensus), with linear complexity per bit agreed upon. The discussion in this note is not self-contained, and relies heavily on the material in [2] - please refer to [2] for the necessary background."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4551","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1008.4551","created_at":"2026-05-18T04:41:45.123632+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4551v1","created_at":"2026-05-18T04:41:45.123632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4551","created_at":"2026-05-18T04:41:45.123632+00:00"},{"alias_kind":"pith_short_12","alias_value":"2S3PT4XJIPOB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2S3PT4XJIPOBYGFC","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2S3PT4XJ","created_at":"2026-05-18T12:26:03.138858+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/2S3PT4XJIPOBYGFCZOANIACVSD","json":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD.json","graph_json":"https://pith.science/api/pith-number/2S3PT4XJIPOBYGFCZOANIACVSD/graph.json","events_json":"https://pith.science/api/pith-number/2S3PT4XJIPOBYGFCZOANIACVSD/events.json","paper":"https://pith.science/paper/2S3PT4XJ"},"agent_actions":{"view_html":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD","download_json":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD.json","view_paper":"https://pith.science/paper/2S3PT4XJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4551&json=true","fetch_graph":"https://pith.science/api/pith-number/2S3PT4XJIPOBYGFCZOANIACVSD/graph.json","fetch_events":"https://pith.science/api/pith-number/2S3PT4XJIPOBYGFCZOANIACVSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD/action/storage_attestation","attest_author":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD/action/author_attestation","sign_citation":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD/action/citation_signature","submit_replication":"https://pith.science/pith/2S3PT4XJIPOBYGFCZOANIACVSD/action/replication_record"}},"created_at":"2026-05-18T04:41:45.123632+00:00","updated_at":"2026-05-18T04:41:45.123632+00:00"}