{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZBGCBEXK6M7ZNYXIJ5U5TZKNVG","short_pith_number":"pith:ZBGCBEXK","schema_version":"1.0","canonical_sha256":"c84c2092eaf33f96e2e84f69d9e54da995d4cfd64553d7f22968abd3bfa465e6","source":{"kind":"arxiv","id":"2105.01230","version":3},"attestation_state":"computed","paper":{"title":"Separating layered treewidth and row treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Mehrnoosh Javarsineh, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","submitted_at":"2021-05-04T00:41:46Z","abstract_excerpt":"Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from the definitions that the layered treewidth of a graph is at most its row treewidth plus 1. Moreover, a minor-closed class has bounded layered treewidth if and only if it has bounded row treewidth. However, it has been open whether row treewidth is bounded by a function of layered treewidth. This paper answers this question in the negative. In particular, for every integer $k$ we describe a graph with layered treewidth 1"},"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":"2105.01230","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-04T00:41:46Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5fc4afedfcd20fa75182df9af08d208b12afe09d49e150dfd0ed14ad5c676ab1","abstract_canon_sha256":"897daf6de0f01ae98bcd4c88d13c09763307bfe6988410de9296d3d00b811e6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:33.175699Z","signature_b64":"ncx47/lVhUK6hl+pueb3uGRPPwTeMm418/qbTTlZKQURi9pMzc9R3u1/mpsI6y/T8XTreGE/wnza+GqERYd/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c84c2092eaf33f96e2e84f69d9e54da995d4cfd64553d7f22968abd3bfa465e6","last_reissued_at":"2026-07-05T06:23:33.175272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:33.175272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating layered treewidth and row treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Mehrnoosh Javarsineh, Pat Morin, Prosenjit Bose, Vida Dujmovi\\'c","submitted_at":"2021-05-04T00:41:46Z","abstract_excerpt":"Layered treewidth and row treewidth are recently introduced graph parameters that have been key ingredients in the solution of several well-known open problems. It follows from the definitions that the layered treewidth of a graph is at most its row treewidth plus 1. Moreover, a minor-closed class has bounded layered treewidth if and only if it has bounded row treewidth. However, it has been open whether row treewidth is bounded by a function of layered treewidth. This paper answers this question in the negative. In particular, for every integer $k$ we describe a graph with layered treewidth 1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01230","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.01230/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":"2105.01230","created_at":"2026-07-05T06:23:33.175346+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.01230v3","created_at":"2026-07-05T06:23:33.175346+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01230","created_at":"2026-07-05T06:23:33.175346+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBGCBEXK6M7Z","created_at":"2026-07-05T06:23:33.175346+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBGCBEXK6M7ZNYXI","created_at":"2026-07-05T06:23:33.175346+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBGCBEXK","created_at":"2026-07-05T06:23:33.175346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09495","citing_title":"Row pathwidth of complete binary trees","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG","json":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG.json","graph_json":"https://pith.science/api/pith-number/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/graph.json","events_json":"https://pith.science/api/pith-number/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/events.json","paper":"https://pith.science/paper/ZBGCBEXK"},"agent_actions":{"view_html":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG","download_json":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG.json","view_paper":"https://pith.science/paper/ZBGCBEXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.01230&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/action/storage_attestation","attest_author":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/action/author_attestation","sign_citation":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/action/citation_signature","submit_replication":"https://pith.science/pith/ZBGCBEXK6M7ZNYXIJ5U5TZKNVG/action/replication_record"}},"created_at":"2026-07-05T06:23:33.175346+00:00","updated_at":"2026-07-05T06:23:33.175346+00:00"}