{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:AXI7EC67MMEFK7USWMB2M6O34B","short_pith_number":"pith:AXI7EC67","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"},"canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","source":{"kind":"arxiv","id":"2505.09834","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09834","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09834v2","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09834","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"AXI7EC67MMEF","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_16","alias_value":"AXI7EC67MMEFK7US","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_8","alias_value":"AXI7EC67","created_at":"2026-07-05T11:08:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:AXI7EC67MMEFK7USWMB2M6O34B","target":"record","payload":{"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"},"canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","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"},"source_kind":"arxiv","source_id":"2505.09834","source_version":2,"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-07-05T11:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OsR0xfPhTEf5OlHIrF33Vd+OWDjbEmHaLj9aihLLZWNP/gNUl9noarUxFXumhxY5VChJUKgT4esWrRoJzCn2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:10:21.852023Z"},"content_sha256":"679adcfa29d93dbbe51653c369c6b22a389b56b2983a4cf58913f6aadc1dc067","schema_version":"1.0","event_id":"sha256:679adcfa29d93dbbe51653c369c6b22a389b56b2983a4cf58913f6aadc1dc067"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:AXI7EC67MMEFK7USWMB2M6O34B","target":"graph","payload":{"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"},"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-07-05T11:08:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nSHrBeYU5Q2/OVqn53MFOouC8KokQjNfAOJK29APbU5sV/aREcMZGi18RmWaKQATgoVLwvfjUSSnk+vuhdTEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T16:10:21.852547Z"},"content_sha256":"b19a8a6cecdfe3fb36fe907a1478aa7552af84e491e2d87b9af71682ae25bcf0","schema_version":"1.0","event_id":"sha256:b19a8a6cecdfe3fb36fe907a1478aa7552af84e491e2d87b9af71682ae25bcf0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/bundle.json","state_url":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AXI7EC67MMEFK7USWMB2M6O34B/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-08-21T16:10:21Z","links":{"resolver":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B","bundle":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/bundle.json","state":"https://pith.science/pith/AXI7EC67MMEFK7USWMB2M6O34B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AXI7EC67MMEFK7USWMB2M6O34B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:AXI7EC67MMEFK7USWMB2M6O34B","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":"2d7e2c5533ef1c11b8bea6dbdca03118ad5a72c88dcc7437b99b2a615d980933","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-14T22:26:08Z","title_canon_sha256":"15495048c892c1a9c7b927e56cd62b1abff58a474a728f562fa69b1151370888"},"schema_version":"1.0","source":{"id":"2505.09834","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.09834","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"arxiv_version","alias_value":"2505.09834v2","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09834","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_12","alias_value":"AXI7EC67MMEF","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_16","alias_value":"AXI7EC67MMEFK7US","created_at":"2026-07-05T11:08:20Z"},{"alias_kind":"pith_short_8","alias_value":"AXI7EC67","created_at":"2026-07-05T11:08:20Z"}],"graph_snapshots":[{"event_id":"sha256:b19a8a6cecdfe3fb36fe907a1478aa7552af84e491e2d87b9af71682ae25bcf0","target":"graph","created_at":"2026-07-05T11:08:20Z","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/2505.09834/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Marc Distel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-14T22:26:08Z","title":"An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09834","kind":"arxiv","version":2},"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:679adcfa29d93dbbe51653c369c6b22a389b56b2983a4cf58913f6aadc1dc067","target":"record","created_at":"2026-07-05T11:08:20Z","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":"2d7e2c5533ef1c11b8bea6dbdca03118ad5a72c88dcc7437b99b2a615d980933","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-14T22:26:08Z","title_canon_sha256":"15495048c892c1a9c7b927e56cd62b1abff58a474a728f562fa69b1151370888"},"schema_version":"1.0","source":{"id":"2505.09834","kind":"arxiv","version":2}},"canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05d1f20bdf6308557e92b303a679dbe060f31b464170685fa16a691ba02602f6","first_computed_at":"2026-07-05T11:08:20.442431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:20.442431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fW4wdXzhKtu6Z1KybrSow2Q+Z+hpIiW2SRrGASjU9bph7Vh2Emuf1twdkOcaB2M+4S82g8Gd25zaMUNoInhEAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:20.442897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.09834","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:679adcfa29d93dbbe51653c369c6b22a389b56b2983a4cf58913f6aadc1dc067","sha256:b19a8a6cecdfe3fb36fe907a1478aa7552af84e491e2d87b9af71682ae25bcf0"],"state_sha256":"df71f5e28707cb5a839052f8516a7179d096b676ed3e0e0c8a265b21d1c2b7c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbBNdigfoB2ZFVDztoh37uZvWOfRmErUv5KTyD9xrNthrX+Ol0Eb7hFuJdKyJy3hUP4Ao3eUL2KB1OPjzwKiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T16:10:21.856348Z","bundle_sha256":"ca530a3976bb93830c47fab941fbdedbfe3cfe25e8a22facad8ff69a8b5da2d9"}}