{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6","short_pith_number":"pith:G4ZWTEX6","schema_version":"1.0","canonical_sha256":"37336992fe9b21e2581fba429e67c3cf9c9374fd08dba48f8c75968678ed7790","source":{"kind":"arxiv","id":"1307.1051","version":1},"attestation_state":"computed","paper":{"title":"Byzantine Convex Consensus: Preliminary Version","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-03T15:49:13Z","abstract_excerpt":"Much of the past work on asynchronous approximate Byzantine consensus has assumed scalar inputs at the nodes [3, 7]. 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 [8, 12]. The d-dimensional vectors can be equivalently viewed as points in the d-dimensional Euclidean space. Thus, the algorithms in [8, 12] require the fault-free nodes to decide on a point in the d-dimensional space.\n  In this paper, "},"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.1051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-03T15:49:13Z","cross_cats_sorted":[],"title_canon_sha256":"20ae2af4645311d63e1beea95ec4b7b466ab2f3fc95b6e18096104bc17c2172d","abstract_canon_sha256":"0ecba3123c4f50f94646e9b192c7b52e41723fdbf02997f960cdf4063a00f9f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:23.064841Z","signature_b64":"nhA21Y3+nCrh39zfGCJZ/MY9uX65m+MTxZgiOX85nZiN+gTQy/KJUZR+PmuVax3SrugZ6JKO4Ehf+7TopfBHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37336992fe9b21e2581fba429e67c3cf9c9374fd08dba48f8c75968678ed7790","last_reissued_at":"2026-05-18T03:19:23.064336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:23.064336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine Convex Consensus: Preliminary Version","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-03T15:49:13Z","abstract_excerpt":"Much of the past work on asynchronous approximate Byzantine consensus has assumed scalar inputs at the nodes [3, 7]. 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 [8, 12]. The d-dimensional vectors can be equivalently viewed as points in the d-dimensional Euclidean space. Thus, the algorithms in [8, 12] require the fault-free nodes to decide on a point in the d-dimensional space.\n  In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1051","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":"1307.1051","created_at":"2026-05-18T03:19:23.064414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.1051v1","created_at":"2026-05-18T03:19:23.064414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1051","created_at":"2026-05-18T03:19:23.064414+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4ZWTEX6TMQ6","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4ZWTEX6TMQ6EWA7","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4ZWTEX6","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/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6","json":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6.json","graph_json":"https://pith.science/api/pith-number/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/graph.json","events_json":"https://pith.science/api/pith-number/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/events.json","paper":"https://pith.science/paper/G4ZWTEX6"},"agent_actions":{"view_html":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6","download_json":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6.json","view_paper":"https://pith.science/paper/G4ZWTEX6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.1051&json=true","fetch_graph":"https://pith.science/api/pith-number/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/action/storage_attestation","attest_author":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/action/author_attestation","sign_citation":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/action/citation_signature","submit_replication":"https://pith.science/pith/G4ZWTEX6TMQ6EWA7XJBJ4Z6DZ6/action/replication_record"}},"created_at":"2026-05-18T03:19:23.064414+00:00","updated_at":"2026-05-18T03:19:23.064414+00:00"}