{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AYYNQVEZCWU43JQUJKCYYYRH6Q","short_pith_number":"pith:AYYNQVEZ","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"},"canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","source":{"kind":"arxiv","id":"2606.24666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24666","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24666v1","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24666","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYYNQVEZCWU4","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_16","alias_value":"AYYNQVEZCWU43JQU","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_8","alias_value":"AYYNQVEZ","created_at":"2026-06-24T01:15:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AYYNQVEZCWU43JQUJKCYYYRH6Q","target":"record","payload":{"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"},"canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","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"},"source_kind":"arxiv","source_id":"2606.24666","source_version":1,"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-06-24T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cCDfr1kWdnq5/nl7calX2hnE4VSYw04EoMgyct9452RzgD+4pyuJ4yReYoFPi+UWDNZNZV6JbJsbYiNIsvRAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:01:52.583199Z"},"content_sha256":"d574a77bddac69cb9e1835c0ab59c1d5bed8ad2d6de1489ae885e9f587eadecf","schema_version":"1.0","event_id":"sha256:d574a77bddac69cb9e1835c0ab59c1d5bed8ad2d6de1489ae885e9f587eadecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AYYNQVEZCWU43JQUJKCYYYRH6Q","target":"graph","payload":{"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"},"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-06-24T01:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2WSK6L6p3e+QpvTgltGplEuTLdq6UNGXeBQuTmCuJkH90MJr1qiqkUnFUDajhB8QuoSIb78uQPsuIP1Wk70DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:01:52.583586Z"},"content_sha256":"c61c2cf6e8109e7909e9bdc846f4041086bda0528637268774852c961ab1e90d","schema_version":"1.0","event_id":"sha256:c61c2cf6e8109e7909e9bdc846f4041086bda0528637268774852c961ab1e90d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/bundle.json","state_url":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/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-30T13:01:52Z","links":{"resolver":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q","bundle":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/bundle.json","state":"https://pith.science/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYYNQVEZCWU43JQUJKCYYYRH6Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AYYNQVEZCWU43JQUJKCYYYRH6Q","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":"1d196c18d173929355e3d0aa20107027379526804f9fbad0b3f835475054a11d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T14:56:31Z","title_canon_sha256":"d41df35a2d3c70304e3010541f5b6121ac7f6619c9d7870c81751ae19ea55226"},"schema_version":"1.0","source":{"id":"2606.24666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24666","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24666v1","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24666","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"AYYNQVEZCWU4","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_16","alias_value":"AYYNQVEZCWU43JQU","created_at":"2026-06-24T01:15:38Z"},{"alias_kind":"pith_short_8","alias_value":"AYYNQVEZ","created_at":"2026-06-24T01:15:38Z"}],"graph_snapshots":[{"event_id":"sha256:c61c2cf6e8109e7909e9bdc846f4041086bda0528637268774852c961ab1e90d","target":"graph","created_at":"2026-06-24T01:15:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Joel Rybicki, Yaroslav Verbitsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T14:56:31Z","title":"Solvability of Approximate Agreement on Graphs and Simplicial Complexes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24666","kind":"arxiv","version":1},"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:d574a77bddac69cb9e1835c0ab59c1d5bed8ad2d6de1489ae885e9f587eadecf","target":"record","created_at":"2026-06-24T01:15:38Z","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":"1d196c18d173929355e3d0aa20107027379526804f9fbad0b3f835475054a11d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-06-23T14:56:31Z","title_canon_sha256":"d41df35a2d3c70304e3010541f5b6121ac7f6619c9d7870c81751ae19ea55226"},"schema_version":"1.0","source":{"id":"2606.24666","kind":"arxiv","version":1}},"canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0630d8549915a9cda6144a858c6227f423bf3e8ec2c41064bdca04385beddfb7","first_computed_at":"2026-06-24T01:15:38.680229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:38.680229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"091LRHYxNfY4j4iVlcCyMI6g1/yriSf6FD3vq89Sm4DrOb20LOOPMX19ZaBz1vsakmU9Ah0bBFNxBFlUPy/yAw==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:38.680629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d574a77bddac69cb9e1835c0ab59c1d5bed8ad2d6de1489ae885e9f587eadecf","sha256:c61c2cf6e8109e7909e9bdc846f4041086bda0528637268774852c961ab1e90d"],"state_sha256":"430979e3f9fd70ba6625e28c94b63a6ba780e553a06daeafc01042f80d66528a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEnX5O+irdpeqt/gXdwAj9Qv1ijI5cNpNmTjEDKBsXMuzTiNcswcnytD1aKw2cH/HlAihMyA3nKiQqTUlIUgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:01:52.585672Z","bundle_sha256":"8bb554162cbf9e214eaa993af944be9632fd9391b02c333d1e8265493d8b1bcc"}}