{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:P74WMVAHRUQT4WT6QEHT3IT6GN","short_pith_number":"pith:P74WMVAH","schema_version":"1.0","canonical_sha256":"7ff96654078d213e5a7e810f3da27e3377ece07e9e7eaab62e023e74d6a7f478","source":{"kind":"arxiv","id":"2306.12741","version":4},"attestation_state":"computed","paper":{"title":"Centroid Approximation with Multidimensional Approximate Agreement Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Darya Melnyk, Melanie Cambus","submitted_at":"2023-06-22T08:46:07Z","abstract_excerpt":"In this paper, we present distributed fault-tolerant algorithms that approximate the centroid (i.e., the average) of a set of $n$ data points in $\\mathbb{R}^d$. Our work falls into the broader area of multidimensional Byzantine approximate agreement. We show that state-of-the-art algorithms, such as agreeing inside the convex hull of all non-faulty vectors, or minimum-diameter averaging (MDA), in the worst case either prevent us from agreeing on a vector close to the centroid (in terms of approximation quality), or allow Byzantine parties to influence the output considerably (in terms of valid"},"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":"2306.12741","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-06-22T08:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"7aef526fb8ddc6a574e4257e315291c901647056ce6791b9bb9107f124ff3bef","abstract_canon_sha256":"7df47a8bc80d6912004b4a27abf3882b73f9ea9a933dce0bd730e971a8a27281"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:57.473360Z","signature_b64":"GK+cKF0MeKk4CsPFKvzGlApdmX5PbzAtZGtgltLTjkuCv48/xVAD7h1l9ouP30xB1wukrIGaMzubeGvripykBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ff96654078d213e5a7e810f3da27e3377ece07e9e7eaab62e023e74d6a7f478","last_reissued_at":"2026-07-05T12:06:57.472681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:57.472681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centroid Approximation with Multidimensional Approximate Agreement Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Darya Melnyk, Melanie Cambus","submitted_at":"2023-06-22T08:46:07Z","abstract_excerpt":"In this paper, we present distributed fault-tolerant algorithms that approximate the centroid (i.e., the average) of a set of $n$ data points in $\\mathbb{R}^d$. Our work falls into the broader area of multidimensional Byzantine approximate agreement. We show that state-of-the-art algorithms, such as agreeing inside the convex hull of all non-faulty vectors, or minimum-diameter averaging (MDA), in the worst case either prevent us from agreeing on a vector close to the centroid (in terms of approximation quality), or allow Byzantine parties to influence the output considerably (in terms of valid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.12741","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.12741/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.12741","created_at":"2026-07-05T12:06:57.472769+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.12741v4","created_at":"2026-07-05T12:06:57.472769+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.12741","created_at":"2026-07-05T12:06:57.472769+00:00"},{"alias_kind":"pith_short_12","alias_value":"P74WMVAHRUQT","created_at":"2026-07-05T12:06:57.472769+00:00"},{"alias_kind":"pith_short_16","alias_value":"P74WMVAHRUQT4WT6","created_at":"2026-07-05T12:06:57.472769+00:00"},{"alias_kind":"pith_short_8","alias_value":"P74WMVAH","created_at":"2026-07-05T12:06:57.472769+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.05591","citing_title":"Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN","json":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN.json","graph_json":"https://pith.science/api/pith-number/P74WMVAHRUQT4WT6QEHT3IT6GN/graph.json","events_json":"https://pith.science/api/pith-number/P74WMVAHRUQT4WT6QEHT3IT6GN/events.json","paper":"https://pith.science/paper/P74WMVAH"},"agent_actions":{"view_html":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN","download_json":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN.json","view_paper":"https://pith.science/paper/P74WMVAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.12741&json=true","fetch_graph":"https://pith.science/api/pith-number/P74WMVAHRUQT4WT6QEHT3IT6GN/graph.json","fetch_events":"https://pith.science/api/pith-number/P74WMVAHRUQT4WT6QEHT3IT6GN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN/action/storage_attestation","attest_author":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN/action/author_attestation","sign_citation":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN/action/citation_signature","submit_replication":"https://pith.science/pith/P74WMVAHRUQT4WT6QEHT3IT6GN/action/replication_record"}},"created_at":"2026-07-05T12:06:57.472769+00:00","updated_at":"2026-07-05T12:06:57.472769+00:00"}