{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MVCGY265ZOTSA4ODHVQ2FAPN25","short_pith_number":"pith:MVCGY265","schema_version":"1.0","canonical_sha256":"65446c6bddcba72071c33d61a281edd747b790d1df53d5a99b539dd95c45075d","source":{"kind":"arxiv","id":"2602.21411","version":2},"attestation_state":"computed","paper":{"title":"General Convex Agreement with Near-Optimal Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anton Paramonov, Diana Ghinea, Marc Dufay","submitted_at":"2026-02-24T22:31:20Z","abstract_excerpt":"Byzantine Agreement (BA) considers a setting of $n$ parties out of which up to $t$ can be byzantine (malicious), and requires the honest parties to agree on an input subject to a condition called \\emph{validity}: if all honest parties have input $v$, the output agreed upon must be $v$. Convex Agreement (CA) strengthens BA by requiring the output agreed upon to lie in the convex hull of the honest parties' inputs. This validity condition captures aggregation tasks, such as robust learning and sensor fusion, where honest inputs may differ but should still constrain the final decision. Existing p"},"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":"2602.21411","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-02-24T22:31:20Z","cross_cats_sorted":[],"title_canon_sha256":"51606aad1fecbf3191875bc187b99b69ca4804e1c5e2f4f876dfa342ad630c58","abstract_canon_sha256":"e1de51cbe183789081ff75e90a08bf1da5a2ec3f4b6a44ccae85da0f54b5aaf6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:05:09.251533Z","signature_b64":"ZeXTPcKHdhYbWuHtMBmghFwh6zz3VEAK4bRKANhcxfcMwkCK69Zf4g58R7UaKl2INKplk8HmKXFJdE9u0iZ4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65446c6bddcba72071c33d61a281edd747b790d1df53d5a99b539dd95c45075d","last_reissued_at":"2026-06-08T01:05:09.250852Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:05:09.250852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General Convex Agreement with Near-Optimal Communication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anton Paramonov, Diana Ghinea, Marc Dufay","submitted_at":"2026-02-24T22:31:20Z","abstract_excerpt":"Byzantine Agreement (BA) considers a setting of $n$ parties out of which up to $t$ can be byzantine (malicious), and requires the honest parties to agree on an input subject to a condition called \\emph{validity}: if all honest parties have input $v$, the output agreed upon must be $v$. Convex Agreement (CA) strengthens BA by requiring the output agreed upon to lie in the convex hull of the honest parties' inputs. This validity condition captures aggregation tasks, such as robust learning and sensor fusion, where honest inputs may differ but should still constrain the final decision. Existing p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.21411","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.21411/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":"2602.21411","created_at":"2026-06-08T01:05:09.250958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.21411v2","created_at":"2026-06-08T01:05:09.250958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.21411","created_at":"2026-06-08T01:05:09.250958+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVCGY265ZOTS","created_at":"2026-06-08T01:05:09.250958+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVCGY265ZOTSA4OD","created_at":"2026-06-08T01:05:09.250958+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVCGY265","created_at":"2026-06-08T01:05:09.250958+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/MVCGY265ZOTSA4ODHVQ2FAPN25","json":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25.json","graph_json":"https://pith.science/api/pith-number/MVCGY265ZOTSA4ODHVQ2FAPN25/graph.json","events_json":"https://pith.science/api/pith-number/MVCGY265ZOTSA4ODHVQ2FAPN25/events.json","paper":"https://pith.science/paper/MVCGY265"},"agent_actions":{"view_html":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25","download_json":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25.json","view_paper":"https://pith.science/paper/MVCGY265","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.21411&json=true","fetch_graph":"https://pith.science/api/pith-number/MVCGY265ZOTSA4ODHVQ2FAPN25/graph.json","fetch_events":"https://pith.science/api/pith-number/MVCGY265ZOTSA4ODHVQ2FAPN25/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25/action/storage_attestation","attest_author":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25/action/author_attestation","sign_citation":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25/action/citation_signature","submit_replication":"https://pith.science/pith/MVCGY265ZOTSA4ODHVQ2FAPN25/action/replication_record"}},"created_at":"2026-06-08T01:05:09.250958+00:00","updated_at":"2026-06-08T01:05:09.250958+00:00"}