{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AYYNQVEZCWU43JQUJKCYYYRH6Q","short_pith_number":"pith:AYYNQVEZ","schema_version":"1.0","canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","source":{"kind":"arxiv","id":"2606.24666","version":1},"attestation_state":"computed","paper":{"title":"Solvability of Approximate Agreement on Graphs and Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joel Rybicki, Yaroslav Verbitsky","submitted_at":"2026-06-23T14:56:31Z","abstract_excerpt":"Approximate agreement tasks on graphs are discrete relaxations of consensus, where each process in a distributed system is given as input a vertex on a graph $G$, and processes have to output vertices that lie on a clique of $G$ contained in the convex hull of the input vertices. Although such tasks have been widely studied in a variety of models, graph classes and notions of convexity, it remains largely open for which classes of graphs these problems are solvable in asynchronous systems.\n  In this work, we give a complete topological characterisation of the $t$-resilient solvability of appro"},"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.24666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T14:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"d41df35a2d3c70304e3010541f5b6121ac7f6619c9d7870c81751ae19ea55226","abstract_canon_sha256":"1d196c18d173929355e3d0aa20107027379526804f9fbad0b3f835475054a11d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:38.680629Z","signature_b64":"091LRHYxNfY4j4iVlcCyMI6g1/yriSf6FD3vq89Sm4DrOb20LOOPMX19ZaBz1vsakmU9Ah0bBFNxBFlUPy/yAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","last_reissued_at":"2026-06-24T01:15:38.680229Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:38.680229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solvability of Approximate Agreement on Graphs and Simplicial Complexes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Joel Rybicki, Yaroslav Verbitsky","submitted_at":"2026-06-23T14:56:31Z","abstract_excerpt":"Approximate agreement tasks on graphs are discrete relaxations of consensus, where each process in a distributed system is given as input a vertex on a graph $G$, and processes have to output vertices that lie on a clique of $G$ contained in the convex hull of the input vertices. Although such tasks have been widely studied in a variety of models, graph classes and notions of convexity, it remains largely open for which classes of graphs these problems are solvable in asynchronous systems.\n  In this work, we give a complete topological characterisation of the $t$-resilient solvability of appro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24666","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.24666/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.24666","created_at":"2026-06-24T01:15:38.680291+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24666v1","created_at":"2026-06-24T01:15:38.680291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24666","created_at":"2026-06-24T01:15:38.680291+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYYNQVEZCWU4","created_at":"2026-06-24T01:15:38.680291+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYYNQVEZCWU43JQU","created_at":"2026-06-24T01:15:38.680291+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYYNQVEZ","created_at":"2026-06-24T01:15:38.680291+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/AYYNQVEZCWU43JQUJKCYYYRH6Q","json":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q.json","graph_json":"https://pith.science/api/pith-number/AYYNQVEZCWU43JQUJKCYYYRH6Q/graph.json","events_json":"https://pith.science/api/pith-number/AYYNQVEZCWU43JQUJKCYYYRH6Q/events.json","paper":"https://pith.science/paper/AYYNQVEZ"},"agent_actions":{"view_html":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q","download_json":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q.json","view_paper":"https://pith.science/paper/AYYNQVEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24666&json=true","fetch_graph":"https://pith.science/api/pith-number/AYYNQVEZCWU43JQUJKCYYYRH6Q/graph.json","fetch_events":"https://pith.science/api/pith-number/AYYNQVEZCWU43JQUJKCYYYRH6Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/action/storage_attestation","attest_author":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/action/author_attestation","sign_citation":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/action/citation_signature","submit_replication":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/action/replication_record"}},"created_at":"2026-06-24T01:15:38.680291+00:00","updated_at":"2026-06-24T01:15:38.680291+00:00"}