{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O7OITO5R5A2VEO2OS3DKIXZT7T","short_pith_number":"pith:O7OITO5R","schema_version":"1.0","canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","source":{"kind":"arxiv","id":"1211.7353","version":3},"attestation_state":"computed","paper":{"title":"Connected tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Malte M\\\"uller, Reinhard Diestel","submitted_at":"2012-11-30T19:50:07Z","abstract_excerpt":"The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle.\n  We further prove a connected analogue of the duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large. Both these results are qualitative: the bounds are good but n"},"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":"1211.7353","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-30T19:50:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be7b01399944dffa86a10f767a2fa23b86aa64f4ffc37c07ef45fe9feedbaa0e","abstract_canon_sha256":"a41a2181cffa919579d6776951bd55c90adb6022fd423595a56bf8b08df0d479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:15.823055Z","signature_b64":"U+F5xJDQnK4vfl9UH3g5hpRmxOJKb7Gh0+CGH2EkopiuG5+M/Z9sv4qmFIxzDKiQNNNyilsNyUucOcSCgzhvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77dc89bbb1e835523b4e96c6a45f33fcc9982cfc4b961495126a8801a67b2f04","last_reissued_at":"2026-05-18T01:30:15.822408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:15.822408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected tree-width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Malte M\\\"uller, Reinhard Diestel","submitted_at":"2012-11-30T19:50:07Z","abstract_excerpt":"The connected tree-width of a graph is the minimum width of a tree-decomposition whose parts induce connected subgraphs. Long cycles are examples of graphs that have small tree-width but large connected tree-width. We show that a graph has small connected tree-width if and only if it has small tree-width and contains no long geodesic cycle.\n  We further prove a connected analogue of the duality theorem for tree-width: a finite graph has small connected tree-width if and only if it has no bramble whose connected covers are all large. Both these results are qualitative: the bounds are good but n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7353","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1211.7353","created_at":"2026-05-18T01:30:15.822502+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.7353v3","created_at":"2026-05-18T01:30:15.822502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7353","created_at":"2026-05-18T01:30:15.822502+00:00"},{"alias_kind":"pith_short_12","alias_value":"O7OITO5R5A2V","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O7OITO5R5A2VEO2O","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O7OITO5R","created_at":"2026-05-18T12:27:16.716162+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/O7OITO5R5A2VEO2OS3DKIXZT7T","json":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T.json","graph_json":"https://pith.science/api/pith-number/O7OITO5R5A2VEO2OS3DKIXZT7T/graph.json","events_json":"https://pith.science/api/pith-number/O7OITO5R5A2VEO2OS3DKIXZT7T/events.json","paper":"https://pith.science/paper/O7OITO5R"},"agent_actions":{"view_html":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T","download_json":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T.json","view_paper":"https://pith.science/paper/O7OITO5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.7353&json=true","fetch_graph":"https://pith.science/api/pith-number/O7OITO5R5A2VEO2OS3DKIXZT7T/graph.json","fetch_events":"https://pith.science/api/pith-number/O7OITO5R5A2VEO2OS3DKIXZT7T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/action/storage_attestation","attest_author":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/action/author_attestation","sign_citation":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/action/citation_signature","submit_replication":"https://pith.science/pith/O7OITO5R5A2VEO2OS3DKIXZT7T/action/replication_record"}},"created_at":"2026-05-18T01:30:15.822502+00:00","updated_at":"2026-05-18T01:30:15.822502+00:00"}