{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JF345ZIFH4K7TCRZNWHD6BDDPY","short_pith_number":"pith:JF345ZIF","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"},"canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","source":{"kind":"arxiv","id":"1307.1332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1332","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1332v2","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1332","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"JF345ZIFH4K7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JF345ZIFH4K7TCRZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JF345ZIF","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JF345ZIFH4K7TCRZNWHD6BDDPY","target":"record","payload":{"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"},"canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","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"},"source_kind":"arxiv","source_id":"1307.1332","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3REaYO83R58ckGYQlaQ+WaFG65FBCV2MKyd75Njd9tLbCDT2GbtMlHcEDHdRxex5+tKqha3vinanOW+NNrdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:36:17.469624Z"},"content_sha256":"d5466b7090cb7edd34b99a3eb3d8414ee30fc0f0c448935aeccfeec867fa5d87","schema_version":"1.0","event_id":"sha256:d5466b7090cb7edd34b99a3eb3d8414ee30fc0f0c448935aeccfeec867fa5d87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JF345ZIFH4K7TCRZNWHD6BDDPY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of9O368ZYugkAIk9dHBI7Y/Ei9Naezg1GA6cXfzKy1BuorUwvdXClP+l3aZY/ds/Okp8UQuJQgt29tg6lT1HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T10:36:17.469987Z"},"content_sha256":"ee74fcdf29e6fddf8b05aacb8b25b828f5def40d3962ed677d640822372991fb","schema_version":"1.0","event_id":"sha256:ee74fcdf29e6fddf8b05aacb8b25b828f5def40d3962ed677d640822372991fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/bundle.json","state_url":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T10:36:17Z","links":{"resolver":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY","bundle":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/bundle.json","state":"https://pith.science/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF345ZIFH4K7TCRZNWHD6BDDPY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JF345ZIFH4K7TCRZNWHD6BDDPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"43a712d629c7566af0abfe0423f746e74e057a8d627b02b841274234e710564d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-04T14:01:57Z","title_canon_sha256":"e90814486c055bf2909310314bd5668bc450d2ad750aef5cb6907c481a341423"},"schema_version":"1.0","source":{"id":"1307.1332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1332","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1332v2","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1332","created_at":"2026-05-18T03:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"JF345ZIFH4K7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JF345ZIFH4K7TCRZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JF345ZIF","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:ee74fcdf29e6fddf8b05aacb8b25b828f5def40d3962ed677d640822372991fb","target":"graph","created_at":"2026-05-18T03:18:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Lewis Tseng, Nitin Vaidya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-04T14:01:57Z","title":"Byzantine Convex Consensus: An Optimal Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1332","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d5466b7090cb7edd34b99a3eb3d8414ee30fc0f0c448935aeccfeec867fa5d87","target":"record","created_at":"2026-05-18T03:18:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"43a712d629c7566af0abfe0423f746e74e057a8d627b02b841274234e710564d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-07-04T14:01:57Z","title_canon_sha256":"e90814486c055bf2909310314bd5668bc450d2ad750aef5cb6907c481a341423"},"schema_version":"1.0","source":{"id":"1307.1332","kind":"arxiv","version":2}},"canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4977cee5053f15f98a396d8e3f04637e0bcdabbc0f0a25523c03db668d921ccf","first_computed_at":"2026-05-18T03:18:53.060181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:53.060181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7rDSN+UUyLerBQLxa6JkvlJqoaxHSTU56/q/szDqlcmqMSD6RKHbpzJdr5jnzhd8k/7imjqyCSYJuoxsvT1wCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:53.060629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5466b7090cb7edd34b99a3eb3d8414ee30fc0f0c448935aeccfeec867fa5d87","sha256:ee74fcdf29e6fddf8b05aacb8b25b828f5def40d3962ed677d640822372991fb"],"state_sha256":"34c4ac371b887fc3d23903dde37311c4b553515325b8a62b381574b9489a5651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v/GKVbfd3pl3avuPv91sAp7ZPAcO99TZbuf5YY5CQxUorc9ckaQfD85V51vwaM5vcqweBrzHXWcfVvJHFKQWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T10:36:17.471898Z","bundle_sha256":"cdd985bc7e78cde80097181d92814c12d24021d7834bd3d52433fea9d6bdcc22"}}