{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2VAKVXCYVV4RWT65NAEFDM3KQB","short_pith_number":"pith:2VAKVXCY","schema_version":"1.0","canonical_sha256":"d540aadc58ad791b4fdd680851b36a806c83850020fe8649b436fd96415452ce","source":{"kind":"arxiv","id":"2605.12629","version":1},"attestation_state":"computed","paper":{"title":"Relative accessibility for graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Relative accessibility for graphs is characterized by a subring of the Boolean ring and matches the algebraic definition for groups.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Joseph Paul MacManus","submitted_at":"2026-05-12T18:12:33Z","abstract_excerpt":"We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups. This implies, in particular, that relative accessibility is a quasi-isometry invariant amongst finitely generated groups, when the quasi-isometr"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.12629","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-12T18:12:33Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"c0b231659902ff4865a6671e26fcd46045c7af5c1dbcb0785dde04519c4bbb03","abstract_canon_sha256":"3967b3c1f420aa8e2859db1ed4a8193c1536f5f2ab0739d6b58b60f032045fb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:00.220350Z","signature_b64":"lxdVlqLaP+WUDlmm1S3SnVFHVG0II5Nd47vpn8alrUW/5dwKV9KNmayI0RVVGUeKms0qtrMSlgD8H9iqtBaDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d540aadc58ad791b4fdd680851b36a806c83850020fe8649b436fd96415452ce","last_reissued_at":"2026-05-18T03:10:00.219910Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:00.219910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relative accessibility for graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Relative accessibility for graphs is characterized by a subring of the Boolean ring and matches the algebraic definition for groups.","cross_cats":["math.GR"],"primary_cat":"math.CO","authors_text":"Joseph Paul MacManus","submitted_at":"2026-05-12T18:12:33Z","abstract_excerpt":"We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups. This implies, in particular, that relative accessibility is a quasi-isometry invariant amongst finitely generated groups, when the quasi-isometr"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graphs are locally finite and quasi-transitive, and any quasi-isometry under consideration coarsely preserves the left cosets of the peripheral subgroups.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Relative accessibility for graphs is characterized by a subring of the Boolean ring and matches the algebraic definition for groups.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"344fa622ecc46ceff6df1e3b8404d9c53ee44f563b1c6c6144981ce929c74bd7"},"source":{"id":"2605.12629","kind":"arxiv","version":1},"verdict":{"id":"622090f9-82c2-4ec6-a7e9-4a1f3db96502","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T20:32:18.992004Z","strongest_claim":"In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups.","one_line_summary":"Relative accessibility in graphs is defined relative to peripheral systems, characterized via Boolean ring subrings for quasi-transitive graphs, and shown to match the group-theoretic version while being quasi-isometry invariant when cosets are preserved.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graphs are locally finite and quasi-transitive, and any quasi-isometry under consideration coarsely preserves the left cosets of the peripheral subgroups.","pith_extraction_headline":"Relative accessibility for graphs is characterized by a subring of the Boolean ring and matches the algebraic definition for groups."},"references":{"count":31,"sample":[{"doi":"","year":null,"title":"arXiv preprint arXiv:0708.0920 , year=","work_id":"825ccb65-cbc5-4525-b45d-9fa047e66514","ref_index":1,"cited_arxiv_id":"0708.0920","is_internal_anchor":true},{"doi":"","year":2006,"title":"Quasi-actions on trees and property (","work_id":"ed24c1e3-135a-4879-96e1-97a52e2bafa9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The electronic journal of combinatorics , volume=","work_id":"589a7b8b-3a74-4a32-84d1-12f0041b09f1","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"International Journal of Algebra and Computation , volume=","work_id":"6b136852-985f-485c-9d7d-70ab1d8bbf9d","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Metric spaces of non-positive curvature , author=. 2013 , publisher=","work_id":"7ac28cb5-7554-4d46-80ff-79fbf92fcaec","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"6ed566ba05f499d85e7903215a824d219ab4da074f88e9a751d54de9862179f3","internal_anchors":2},"formal_canon":{"evidence_count":2,"snapshot_sha256":"8d3e2f231e345299a3f42b6f4cab380cffa0929ca35f17fcc29a0f63fb4adfa4"},"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":"2605.12629","created_at":"2026-05-18T03:10:00.219975+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.12629v1","created_at":"2026-05-18T03:10:00.219975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12629","created_at":"2026-05-18T03:10:00.219975+00:00"},{"alias_kind":"pith_short_12","alias_value":"2VAKVXCYVV4R","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"2VAKVXCYVV4RWT65","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"2VAKVXCY","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB","json":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB.json","graph_json":"https://pith.science/api/pith-number/2VAKVXCYVV4RWT65NAEFDM3KQB/graph.json","events_json":"https://pith.science/api/pith-number/2VAKVXCYVV4RWT65NAEFDM3KQB/events.json","paper":"https://pith.science/paper/2VAKVXCY"},"agent_actions":{"view_html":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB","download_json":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB.json","view_paper":"https://pith.science/paper/2VAKVXCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.12629&json=true","fetch_graph":"https://pith.science/api/pith-number/2VAKVXCYVV4RWT65NAEFDM3KQB/graph.json","fetch_events":"https://pith.science/api/pith-number/2VAKVXCYVV4RWT65NAEFDM3KQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB/action/storage_attestation","attest_author":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB/action/author_attestation","sign_citation":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB/action/citation_signature","submit_replication":"https://pith.science/pith/2VAKVXCYVV4RWT65NAEFDM3KQB/action/replication_record"}},"created_at":"2026-05-18T03:10:00.219975+00:00","updated_at":"2026-05-18T03:10:00.219975+00:00"}