{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XKX3DZKBITQ23X2JRIZDAPMDWX","short_pith_number":"pith:XKX3DZKB","schema_version":"1.0","canonical_sha256":"baafb1e54144e1addf498a32303d83b5c83463bcb70005786b50a4b5aaa94420","source":{"kind":"arxiv","id":"2505.06550","version":2},"attestation_state":"computed","paper":{"title":"Coarse Balanced Separators and Tree-Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Robert Hickingbotham","submitted_at":"2025-05-10T07:36:12Z","abstract_excerpt":"A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced separator of size at most $k$. Motivated by recent progress on coarse treewidth, Abrishami, Czy\\.{z}ewska, Kluk, Pilipczuk, Pilipczuk, and Rz\\k{a}\\.{z}ewski (2025) conjectured a coarse analogue to this result: every graph that has a balanced separator consisting of a bounded number of balls of bounded radius is quasi-isometric to a graph with bounded treewidth. In t"},"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":"2505.06550","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-10T07:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"ed99948fb0a54a9056ddc9f3171a87931eae3edab76347cc3bf64ab86c0cbfcd","abstract_canon_sha256":"a82872a43236743ec7294c53c6314efd508e150bb5dcf8586c1d0b6e4113f1d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:54.767023Z","signature_b64":"zyT/wJPDw9yHMpX9nKK2tFs4HhiWG55vstYjlhsA6oKJcUPivONAxjXKvl0m6rXQDQx/7CjsAeDYxRNJkQJzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"baafb1e54144e1addf498a32303d83b5c83463bcb70005786b50a4b5aaa94420","last_reissued_at":"2026-07-05T11:40:54.766486Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:54.766486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse Balanced Separators and Tree-Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky, Robert Hickingbotham","submitted_at":"2025-05-10T07:36:12Z","abstract_excerpt":"A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced separator of size at most $k$. Motivated by recent progress on coarse treewidth, Abrishami, Czy\\.{z}ewska, Kluk, Pilipczuk, Pilipczuk, and Rz\\k{a}\\.{z}ewski (2025) conjectured a coarse analogue to this result: every graph that has a balanced separator consisting of a bounded number of balls of bounded radius is quasi-isometric to a graph with bounded treewidth. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06550","kind":"arxiv","version":2},"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/2505.06550/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":"2505.06550","created_at":"2026-07-05T11:40:54.766550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.06550v2","created_at":"2026-07-05T11:40:54.766550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06550","created_at":"2026-07-05T11:40:54.766550+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKX3DZKBITQ2","created_at":"2026-07-05T11:40:54.766550+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKX3DZKBITQ23X2J","created_at":"2026-07-05T11:40:54.766550+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKX3DZKB","created_at":"2026-07-05T11:40:54.766550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.14974","citing_title":"Coarse Balanced Separators in Biclique-Induced-Minor-Free Graphs","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX","json":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX.json","graph_json":"https://pith.science/api/pith-number/XKX3DZKBITQ23X2JRIZDAPMDWX/graph.json","events_json":"https://pith.science/api/pith-number/XKX3DZKBITQ23X2JRIZDAPMDWX/events.json","paper":"https://pith.science/paper/XKX3DZKB"},"agent_actions":{"view_html":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX","download_json":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX.json","view_paper":"https://pith.science/paper/XKX3DZKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.06550&json=true","fetch_graph":"https://pith.science/api/pith-number/XKX3DZKBITQ23X2JRIZDAPMDWX/graph.json","fetch_events":"https://pith.science/api/pith-number/XKX3DZKBITQ23X2JRIZDAPMDWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX/action/storage_attestation","attest_author":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX/action/author_attestation","sign_citation":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX/action/citation_signature","submit_replication":"https://pith.science/pith/XKX3DZKBITQ23X2JRIZDAPMDWX/action/replication_record"}},"created_at":"2026-07-05T11:40:54.766550+00:00","updated_at":"2026-07-05T11:40:54.766550+00:00"}