{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4S65XE6MJM6GMKURZLOUMLQNLB","short_pith_number":"pith:4S65XE6M","schema_version":"1.0","canonical_sha256":"e4bddb93cc4b3c662a91cadd462e0d5860a873beff28ea631332a60d51d079f7","source":{"kind":"arxiv","id":"1404.3155","version":2},"attestation_state":"computed","paper":{"title":"Characterizing width two for variants of treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hans L. Bodlaender, O-joung Kwon, Seongmin Ok, Stefan Kratsch, Vincent J.C. Kreuzen","submitted_at":"2014-04-11T17:01:17Z","abstract_excerpt":"In this paper, we consider the notion of \\emph{special treewidth}, recently introduced by Courcelle\\cite{Courcelle2012}. In a special tree decomposition, for each vertex $v$ in a given graph, the bags containing $v$ form a rooted path. We show that the class of graphs of special treewidth at most two is closed under taking minors, and give the complete list of the six minor obstructions. As an intermediate result, we prove that every connected graph of special treewidth at most two can be constructed by arranging blocks of special treewidth at most two in a specific tree-like fashion.\n  Inspir"},"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":"1404.3155","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-11T17:01:17Z","cross_cats_sorted":[],"title_canon_sha256":"08713fcc4f50756c85c3b7a74d9b860e690596f4226da48d308af09fd5ed98c0","abstract_canon_sha256":"1b47d24e972e8c634fe816f866605ac5afeaac570222b1e73bdf88c5cc6b7146"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:41.622387Z","signature_b64":"9CiKFPkesUy51WlA9kXCvYacJpR0lWkv4EMSl0ZKdgrizYkpmr6nqm6Yh+/wpv0icQtlpUa/oPrCT2ej6W6SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4bddb93cc4b3c662a91cadd462e0d5860a873beff28ea631332a60d51d079f7","last_reissued_at":"2026-05-18T02:41:41.621869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:41.621869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing width two for variants of treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hans L. Bodlaender, O-joung Kwon, Seongmin Ok, Stefan Kratsch, Vincent J.C. Kreuzen","submitted_at":"2014-04-11T17:01:17Z","abstract_excerpt":"In this paper, we consider the notion of \\emph{special treewidth}, recently introduced by Courcelle\\cite{Courcelle2012}. In a special tree decomposition, for each vertex $v$ in a given graph, the bags containing $v$ form a rooted path. We show that the class of graphs of special treewidth at most two is closed under taking minors, and give the complete list of the six minor obstructions. As an intermediate result, we prove that every connected graph of special treewidth at most two can be constructed by arranging blocks of special treewidth at most two in a specific tree-like fashion.\n  Inspir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3155","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":""},"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":"1404.3155","created_at":"2026-05-18T02:41:41.621949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3155v2","created_at":"2026-05-18T02:41:41.621949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3155","created_at":"2026-05-18T02:41:41.621949+00:00"},{"alias_kind":"pith_short_12","alias_value":"4S65XE6MJM6G","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4S65XE6MJM6GMKUR","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4S65XE6M","created_at":"2026-05-18T12:28:14.216126+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/4S65XE6MJM6GMKURZLOUMLQNLB","json":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB.json","graph_json":"https://pith.science/api/pith-number/4S65XE6MJM6GMKURZLOUMLQNLB/graph.json","events_json":"https://pith.science/api/pith-number/4S65XE6MJM6GMKURZLOUMLQNLB/events.json","paper":"https://pith.science/paper/4S65XE6M"},"agent_actions":{"view_html":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB","download_json":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB.json","view_paper":"https://pith.science/paper/4S65XE6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3155&json=true","fetch_graph":"https://pith.science/api/pith-number/4S65XE6MJM6GMKURZLOUMLQNLB/graph.json","fetch_events":"https://pith.science/api/pith-number/4S65XE6MJM6GMKURZLOUMLQNLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB/action/storage_attestation","attest_author":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB/action/author_attestation","sign_citation":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB/action/citation_signature","submit_replication":"https://pith.science/pith/4S65XE6MJM6GMKURZLOUMLQNLB/action/replication_record"}},"created_at":"2026-05-18T02:41:41.621949+00:00","updated_at":"2026-05-18T02:41:41.621949+00:00"}