{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DSK3KRZBHFSHTWMORSDJ4J5BLT","short_pith_number":"pith:DSK3KRZB","schema_version":"1.0","canonical_sha256":"1c95b54721396479d98e8c869e27a15cfae478284b24817692d88328bf7e36f8","source":{"kind":"arxiv","id":"2606.17605","version":1},"attestation_state":"computed","paper":{"title":"A coarse Menger theorem for hyperbolic graphs, finitely presented groups, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.MG"],"primary_cat":"math.CO","authors_text":"Sandra Albrechtsen","submitted_at":"2026-06-16T07:10:58Z","abstract_excerpt":"Menger's theorem is one of the most fundamental results in graph theory. It states that if a graph $G$ does not contain $k$ disjoint paths between two given sets $X$ and $Y$ of vertices in $G$, then there is a set of at most $k-1$ vertices that intersects every path between $X$ and $Y$. Nguyen, Scott, and Seymour gave a counterexample to the conjectured natural coarse variant in which the paths are required to be pairwise at distance at least $d$, and, conversely, there is a set of at most $k-1$ bounded-radius balls intersecting every path between $X$ and $Y$. In other words, the coarse Menger"},"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.17605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-16T07:10:58Z","cross_cats_sorted":["math.GR","math.MG"],"title_canon_sha256":"e557cc18c587ec96636d8bb1c618c2683243a157ddfc50dfbfc75feb75d91f21","abstract_canon_sha256":"974431af750aa596f0d0ea15cf87cb70a036593e92fd1f5ff61d52db934cfb21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:17.110365Z","signature_b64":"oh+ovNTjbF8Tj48CnuqgO+GtqqJIAoD37xQ9KZeJXADZSdCBrZdx9j852uYHrH/j+lzl0C5Ch1O0nCJhhKyZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c95b54721396479d98e8c869e27a15cfae478284b24817692d88328bf7e36f8","last_reissued_at":"2026-06-19T16:10:17.110021Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:17.110021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A coarse Menger theorem for hyperbolic graphs, finitely presented groups, and more","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR","math.MG"],"primary_cat":"math.CO","authors_text":"Sandra Albrechtsen","submitted_at":"2026-06-16T07:10:58Z","abstract_excerpt":"Menger's theorem is one of the most fundamental results in graph theory. It states that if a graph $G$ does not contain $k$ disjoint paths between two given sets $X$ and $Y$ of vertices in $G$, then there is a set of at most $k-1$ vertices that intersects every path between $X$ and $Y$. Nguyen, Scott, and Seymour gave a counterexample to the conjectured natural coarse variant in which the paths are required to be pairwise at distance at least $d$, and, conversely, there is a set of at most $k-1$ bounded-radius balls intersecting every path between $X$ and $Y$. In other words, the coarse Menger"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17605","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.17605/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.17605","created_at":"2026-06-19T16:10:17.110075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17605v1","created_at":"2026-06-19T16:10:17.110075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17605","created_at":"2026-06-19T16:10:17.110075+00:00"},{"alias_kind":"pith_short_12","alias_value":"DSK3KRZBHFSH","created_at":"2026-06-19T16:10:17.110075+00:00"},{"alias_kind":"pith_short_16","alias_value":"DSK3KRZBHFSHTWMO","created_at":"2026-06-19T16:10:17.110075+00:00"},{"alias_kind":"pith_short_8","alias_value":"DSK3KRZB","created_at":"2026-06-19T16:10:17.110075+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/DSK3KRZBHFSHTWMORSDJ4J5BLT","json":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT.json","graph_json":"https://pith.science/api/pith-number/DSK3KRZBHFSHTWMORSDJ4J5BLT/graph.json","events_json":"https://pith.science/api/pith-number/DSK3KRZBHFSHTWMORSDJ4J5BLT/events.json","paper":"https://pith.science/paper/DSK3KRZB"},"agent_actions":{"view_html":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT","download_json":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT.json","view_paper":"https://pith.science/paper/DSK3KRZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17605&json=true","fetch_graph":"https://pith.science/api/pith-number/DSK3KRZBHFSHTWMORSDJ4J5BLT/graph.json","fetch_events":"https://pith.science/api/pith-number/DSK3KRZBHFSHTWMORSDJ4J5BLT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT/action/storage_attestation","attest_author":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT/action/author_attestation","sign_citation":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT/action/citation_signature","submit_replication":"https://pith.science/pith/DSK3KRZBHFSHTWMORSDJ4J5BLT/action/replication_record"}},"created_at":"2026-06-19T16:10:17.110075+00:00","updated_at":"2026-06-19T16:10:17.110075+00:00"}