{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JF345ZIFH4K7TCRZNWHD6BDDPY","short_pith_number":"pith:JF345ZIF","schema_version":"1.0","canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","source":{"kind":"arxiv","id":"1307.1332","version":2},"attestation_state":"computed","paper":{"title":"Byzantine Convex Consensus: An Optimal Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2013-07-04T14:01:57Z","abstract_excerpt":"Much of the past work on asynchronous approximate Byzantine consensus has assumed scalar inputs at the nodes [4, 8]. Recent work has yielded approximate Byzantine consensus algorithms for the case when the input at each node is a d-dimensional vector, and the nodes must reach consensus on a vector in the convex hull of the input vectors at the fault-free nodes [9, 13]. The d-dimensional vectors can be equivalently viewed as points in the d-dimensional Euclidean space. Thus, the algorithms in [9, 13] require the fault-free nodes to decide on a point in the d-dimensional space.\n  In our recent w"},"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":"1307.1332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-04T14:01:57Z","cross_cats_sorted":[],"title_canon_sha256":"e90814486c055bf2909310314bd5668bc450d2ad750aef5cb6907c481a341423","abstract_canon_sha256":"43a712d629c7566af0abfe0423f746e74e057a8d627b02b841274234e710564d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:53.060629Z","signature_b64":"7rDSN+UUyLerBQLxa6JkvlJqoaxHSTU56/q/szDqlcmqMSD6RKHbpzJdr5jnzhd8k/7imjqyCSYJuoxsvT1wCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","last_reissued_at":"2026-05-18T03:18:53.060181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:53.060181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Convex Consensus: An Optimal Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Lewis Tseng, Nitin Vaidya","submitted_at":"2013-07-04T14:01:57Z","abstract_excerpt":"Much of the past work on asynchronous approximate Byzantine consensus has assumed scalar inputs at the nodes [4, 8]. Recent work has yielded approximate Byzantine consensus algorithms for the case when the input at each node is a d-dimensional vector, and the nodes must reach consensus on a vector in the convex hull of the input vectors at the fault-free nodes [9, 13]. The d-dimensional vectors can be equivalently viewed as points in the d-dimensional Euclidean space. Thus, the algorithms in [9, 13] require the fault-free nodes to decide on a point in the d-dimensional space.\n  In our recent w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1332","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.1332","created_at":"2026-05-18T03:18:53.060240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1332v2","created_at":"2026-05-18T03:18:53.060240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1332","created_at":"2026-05-18T03:18:53.060240+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF345ZIFH4K7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF345ZIFH4K7TCRZ","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF345ZIF","created_at":"2026-05-18T12:27:49.015174+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/JF345ZIFH4K7TCRZNWHD6BDDPY","json":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY.json","graph_json":"https://pith.science/api/pith-number/JF345ZIFH4K7TCRZNWHD6BDDPY/graph.json","events_json":"https://pith.science/api/pith-number/JF345ZIFH4K7TCRZNWHD6BDDPY/events.json","paper":"https://pith.science/paper/JF345ZIF"},"agent_actions":{"view_html":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY","download_json":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY.json","view_paper":"https://pith.science/paper/JF345ZIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1332&json=true","fetch_graph":"https://pith.science/api/pith-number/JF345ZIFH4K7TCRZNWHD6BDDPY/graph.json","fetch_events":"https://pith.science/api/pith-number/JF345ZIFH4K7TCRZNWHD6BDDPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/action/storage_attestation","attest_author":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/action/author_attestation","sign_citation":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/action/citation_signature","submit_replication":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/action/replication_record"}},"created_at":"2026-05-18T03:18:53.060240+00:00","updated_at":"2026-05-18T03:18:53.060240+00:00"}