{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZL3OMBTKZIJJ7ZZ2P63K45WIK7","short_pith_number":"pith:ZL3OMBTK","schema_version":"1.0","canonical_sha256":"caf6e6066aca129fe73a7fb6ae76c857dbc04a2e2686569043166e38296f4aeb","source":{"kind":"arxiv","id":"1601.08067","version":1},"attestation_state":"computed","paper":{"title":"Relaxed Byzantine Vector Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Nitin H.Vaidya, Zhuolun Xiang","submitted_at":"2016-01-29T11:53:24Z","abstract_excerpt":"Exact Byzantine consensus problem requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. It is well-known that exact consensus is impossible in an asynchronous system in presence of faults, and in a synchronous system, n>=3f+1 is tight on the number of processes to achieve exact Byzantine consensus with scalar inputs, in presence of up to f Byzantine faulty processes. Recent work has shown that when the inputs are d-dimensional vectors of reals, n>=max(3f+1,(d+1)f+1) is tight to achieve exact Byzantine "},"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":"1601.08067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-29T11:53:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d4b7627b100df334a042005cd48ad44c733492bad00b62c34d660221feefe8d2","abstract_canon_sha256":"1379a0104387baa2d61f7f1dca703e8545573a8107afc17740f6906d56d21fac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:40.422055Z","signature_b64":"Y2483P/ngKi0HEiKwOB0hTYhQFS9/6w/cZn1RwjAVxespgH4yVb7xbQkyU+7/8EqYjNyfPdKmXh4/HH8vR8LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"caf6e6066aca129fe73a7fb6ae76c857dbc04a2e2686569043166e38296f4aeb","last_reissued_at":"2026-05-18T01:21:40.421610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:40.421610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxed Byzantine Vector Consensus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Nitin H.Vaidya, Zhuolun Xiang","submitted_at":"2016-01-29T11:53:24Z","abstract_excerpt":"Exact Byzantine consensus problem requires that non-faulty processes reach agreement on a decision (or output) that is in the convex hull of the inputs at the non-faulty processes. It is well-known that exact consensus is impossible in an asynchronous system in presence of faults, and in a synchronous system, n>=3f+1 is tight on the number of processes to achieve exact Byzantine consensus with scalar inputs, in presence of up to f Byzantine faulty processes. Recent work has shown that when the inputs are d-dimensional vectors of reals, n>=max(3f+1,(d+1)f+1) is tight to achieve exact Byzantine "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.08067","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":"1601.08067","created_at":"2026-05-18T01:21:40.421681+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.08067v1","created_at":"2026-05-18T01:21:40.421681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.08067","created_at":"2026-05-18T01:21:40.421681+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZL3OMBTKZIJJ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZL3OMBTKZIJJ7ZZ2","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZL3OMBTK","created_at":"2026-05-18T12:30:53.716459+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/ZL3OMBTKZIJJ7ZZ2P63K45WIK7","json":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7.json","graph_json":"https://pith.science/api/pith-number/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/graph.json","events_json":"https://pith.science/api/pith-number/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/events.json","paper":"https://pith.science/paper/ZL3OMBTK"},"agent_actions":{"view_html":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7","download_json":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7.json","view_paper":"https://pith.science/paper/ZL3OMBTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.08067&json=true","fetch_graph":"https://pith.science/api/pith-number/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/graph.json","fetch_events":"https://pith.science/api/pith-number/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/action/storage_attestation","attest_author":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/action/author_attestation","sign_citation":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/action/citation_signature","submit_replication":"https://pith.science/pith/ZL3OMBTKZIJJ7ZZ2P63K45WIK7/action/replication_record"}},"created_at":"2026-05-18T01:21:40.421681+00:00","updated_at":"2026-05-18T01:21:40.421681+00:00"}