{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LQ74VWW772KXVEISWNBZ34WLYQ","short_pith_number":"pith:LQ74VWW7","schema_version":"1.0","canonical_sha256":"5c3fcadadffe957a9112b3439df2cbc41cd6edc2fa4295af46b2000645e362d0","source":{"kind":"arxiv","id":"2606.23260","version":1},"attestation_state":"computed","paper":{"title":"Solving Approximate Agreement on continuous and discrete spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Augustin Albert, Sergio Rajsbaum","submitted_at":"2026-06-22T12:44:11Z","abstract_excerpt":"We consider $n$ asynchronous processes prone to crashes, communicating via shared read-write registers, and study the wait-free solvability of approximate agreement: given inputs, processes must output values that are close to each other, and satisfy a validity property. At the very least, if inputs are identical, all outputs must equal that input.\n  The problem has been studied for various input spaces: continuous, discrete, one-dimensional or multidimensional. For metric spaces, validity requires outputs to lie in the convex hull of the inputs. For graphs, and more generally simplicial compl"},"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":"2606.23260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-22T12:44:11Z","cross_cats_sorted":[],"title_canon_sha256":"8763fdec44c7d59a6e2b9bf91d9ba8fbde8246582ce069caa4c6614c1ab4908e","abstract_canon_sha256":"3743980566255f041aca1a3003681904229427ffe4e98cb3ffd48727822ee64e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:15.129366Z","signature_b64":"mkz4hjKH/aAOZMbqbsyowE1z5xsDjWG0wk9pnhzSshH0POy0z5PAS+cJ6YrUbxGB+DYU4xQzPgkozMgrJaQ9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c3fcadadffe957a9112b3439df2cbc41cd6edc2fa4295af46b2000645e362d0","last_reissued_at":"2026-06-23T03:14:15.129031Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:15.129031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Approximate Agreement on continuous and discrete spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Augustin Albert, Sergio Rajsbaum","submitted_at":"2026-06-22T12:44:11Z","abstract_excerpt":"We consider $n$ asynchronous processes prone to crashes, communicating via shared read-write registers, and study the wait-free solvability of approximate agreement: given inputs, processes must output values that are close to each other, and satisfy a validity property. At the very least, if inputs are identical, all outputs must equal that input.\n  The problem has been studied for various input spaces: continuous, discrete, one-dimensional or multidimensional. For metric spaces, validity requires outputs to lie in the convex hull of the inputs. For graphs, and more generally simplicial compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23260","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23260/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":"2606.23260","created_at":"2026-06-23T03:14:15.129081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23260v1","created_at":"2026-06-23T03:14:15.129081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23260","created_at":"2026-06-23T03:14:15.129081+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQ74VWW772KX","created_at":"2026-06-23T03:14:15.129081+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQ74VWW772KXVEIS","created_at":"2026-06-23T03:14:15.129081+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQ74VWW7","created_at":"2026-06-23T03:14:15.129081+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/LQ74VWW772KXVEISWNBZ34WLYQ","json":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ.json","graph_json":"https://pith.science/api/pith-number/LQ74VWW772KXVEISWNBZ34WLYQ/graph.json","events_json":"https://pith.science/api/pith-number/LQ74VWW772KXVEISWNBZ34WLYQ/events.json","paper":"https://pith.science/paper/LQ74VWW7"},"agent_actions":{"view_html":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ","download_json":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ.json","view_paper":"https://pith.science/paper/LQ74VWW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23260&json=true","fetch_graph":"https://pith.science/api/pith-number/LQ74VWW772KXVEISWNBZ34WLYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LQ74VWW772KXVEISWNBZ34WLYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ/action/storage_attestation","attest_author":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ/action/author_attestation","sign_citation":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ/action/citation_signature","submit_replication":"https://pith.science/pith/LQ74VWW772KXVEISWNBZ34WLYQ/action/replication_record"}},"created_at":"2026-06-23T03:14:15.129081+00:00","updated_at":"2026-06-23T03:14:15.129081+00:00"}