{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GSMPMLDF4MH47Y7IVARF33S7UC","short_pith_number":"pith:GSMPMLDF","schema_version":"1.0","canonical_sha256":"3498f62c65e30fcfe3e8a8225dee5fa09e49cdb4dd8b6303ce5c79b2cd22204a","source":{"kind":"arxiv","id":"1302.2543","version":1},"attestation_state":"computed","paper":{"title":"Byzantine Vector Consensus in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nitin H. Vaidya, Vijay K. Garg","submitted_at":"2013-02-11T17:25:24Z","abstract_excerpt":"Consider a network of n processes each of which has a d-dimensional vector of reals as its input. Each process can communicate directly with all the processes in the system; thus the communication network is a complete graph. All the communication channels are reliable and FIFO (first-in-first-out). The problem of Byzantine vector consensus (BVC) requires agreement on a d-dimensional vector that is in the convex hull of the d-dimensional input vectors at the non-faulty processes. We obtain the following results for Byzantine vector consensus in complete graphs while tolerating up to f Byzantin"},"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":"1302.2543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-11T17:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"6ca4ab2f6e5ea5dfc1860665bbd3b82b2e9f186a17f391a95b0bd758e1d8028c","abstract_canon_sha256":"55a10087a90d5a51564f93225436a8c1e6ea5b4604aab2323e8e89481de3ae23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:00.888297Z","signature_b64":"un/IreJCn3JR05tq/TNt82mS8lbdeezcv884IltznLB+OzoCZ42PB6G7hpoer7fSTwDZv8BtQ5tKEEURf5AHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3498f62c65e30fcfe3e8a8225dee5fa09e49cdb4dd8b6303ce5c79b2cd22204a","last_reissued_at":"2026-05-18T03:34:00.887654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:00.887654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Vector Consensus in Complete Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Nitin H. Vaidya, Vijay K. Garg","submitted_at":"2013-02-11T17:25:24Z","abstract_excerpt":"Consider a network of n processes each of which has a d-dimensional vector of reals as its input. Each process can communicate directly with all the processes in the system; thus the communication network is a complete graph. All the communication channels are reliable and FIFO (first-in-first-out). The problem of Byzantine vector consensus (BVC) requires agreement on a d-dimensional vector that is in the convex hull of the d-dimensional input vectors at the non-faulty processes. We obtain the following results for Byzantine vector consensus in complete graphs while tolerating up to f Byzantin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2543","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":"1302.2543","created_at":"2026-05-18T03:34:00.887756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2543v1","created_at":"2026-05-18T03:34:00.887756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2543","created_at":"2026-05-18T03:34:00.887756+00:00"},{"alias_kind":"pith_short_12","alias_value":"GSMPMLDF4MH4","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GSMPMLDF4MH47Y7I","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GSMPMLDF","created_at":"2026-05-18T12:27:45.050594+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/GSMPMLDF4MH47Y7IVARF33S7UC","json":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC.json","graph_json":"https://pith.science/api/pith-number/GSMPMLDF4MH47Y7IVARF33S7UC/graph.json","events_json":"https://pith.science/api/pith-number/GSMPMLDF4MH47Y7IVARF33S7UC/events.json","paper":"https://pith.science/paper/GSMPMLDF"},"agent_actions":{"view_html":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC","download_json":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC.json","view_paper":"https://pith.science/paper/GSMPMLDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2543&json=true","fetch_graph":"https://pith.science/api/pith-number/GSMPMLDF4MH47Y7IVARF33S7UC/graph.json","fetch_events":"https://pith.science/api/pith-number/GSMPMLDF4MH47Y7IVARF33S7UC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC/action/storage_attestation","attest_author":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC/action/author_attestation","sign_citation":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC/action/citation_signature","submit_replication":"https://pith.science/pith/GSMPMLDF4MH47Y7IVARF33S7UC/action/replication_record"}},"created_at":"2026-05-18T03:34:00.887756+00:00","updated_at":"2026-05-18T03:34:00.887756+00:00"}