{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AXI7EC67MMEFK7USWMB2M6O34B","short_pith_number":"pith:AXI7EC67","schema_version":"1.0","canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","source":{"kind":"arxiv","id":"2505.09834","version":2},"attestation_state":"computed","paper":{"title":"An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc Distel","submitted_at":"2025-05-14T22:26:08Z","abstract_excerpt":"Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth $k$ admit a partition with `local, but dense' parts whose quotient has treewidth $k-1$. Specifically, each part is contained within the closed neighbourhood of some vertex. We use this to construct a $3$-quasi-isometry between graphs of cliquewidth $k$ and graphs of treewidth $k-1$. Th"},"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.09834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-14T22:26:08Z","cross_cats_sorted":[],"title_canon_sha256":"15495048c892c1a9c7b927e56cd62b1abff58a474a728f562fa69b1151370888","abstract_canon_sha256":"2d7e2c5533ef1c11b8bea6dbdca03118ad5a72c88dcc7437b99b2a615d980933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:20.442897Z","signature_b64":"fW4wdXzhKtu6Z1KybrSow2Q+Z+hpIiW2SRrGASjU9bph7Vh2Emuf1twdkOcaB2M+4S82g8Gd25zaMUNoInhEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","last_reissued_at":"2026-07-05T11:08:20.442431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:20.442431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Marc Distel","submitted_at":"2025-05-14T22:26:08Z","abstract_excerpt":"Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi-isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth $k$ admit a partition with `local, but dense' parts whose quotient has treewidth $k-1$. Specifically, each part is contained within the closed neighbourhood of some vertex. We use this to construct a $3$-quasi-isometry between graphs of cliquewidth $k$ and graphs of treewidth $k-1$. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09834","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.09834/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.09834","created_at":"2026-07-05T11:08:20.442488+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09834v2","created_at":"2026-07-05T11:08:20.442488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09834","created_at":"2026-07-05T11:08:20.442488+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXI7EC67MMEF","created_at":"2026-07-05T11:08:20.442488+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXI7EC67MMEFK7US","created_at":"2026-07-05T11:08:20.442488+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXI7EC67","created_at":"2026-07-05T11:08:20.442488+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/AXI7EC67MMEFK7USWMB2M6O34B","json":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B.json","graph_json":"https://pith.science/api/pith-number/AXI7EC67MMEFK7USWMB2M6O34B/graph.json","events_json":"https://pith.science/api/pith-number/AXI7EC67MMEFK7USWMB2M6O34B/events.json","paper":"https://pith.science/paper/AXI7EC67"},"agent_actions":{"view_html":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B","download_json":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B.json","view_paper":"https://pith.science/paper/AXI7EC67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09834&json=true","fetch_graph":"https://pith.science/api/pith-number/AXI7EC67MMEFK7USWMB2M6O34B/graph.json","fetch_events":"https://pith.science/api/pith-number/AXI7EC67MMEFK7USWMB2M6O34B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/action/storage_attestation","attest_author":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/action/author_attestation","sign_citation":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/action/citation_signature","submit_replication":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/action/replication_record"}},"created_at":"2026-07-05T11:08:20.442488+00:00","updated_at":"2026-07-05T11:08:20.442488+00:00"}