{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:64ECCUGDXI65VSX7HUQ3G6RU22","short_pith_number":"pith:64ECCUGD","schema_version":"1.0","canonical_sha256":"f7082150c3ba3ddacaff3d21b37a34d68b5da3610bb2419a8b6405e496e1d62b","source":{"kind":"arxiv","id":"2309.01264","version":1},"attestation_state":"computed","paper":{"title":"Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Bart M. P. Jansen, Fabrizio Montecchiani, Giuseppe Liotta, Kirill Simonov, Liana Khazaliya, Philipp Kindermann","submitted_at":"2023-09-03T20:09:52Z","abstract_excerpt":"Upward planarity testing and Rectilinear planarity testing are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth. In this paper we show that these two problems are W[1]-hard parameterized by treewidth, which answers open problems posed in two earlier papers. The key step in our proof is an analysis of the All-or-Nothing Flow problem, a generalization of which was used as an intermediate step in the NP-completeness proof for both planarity testing problems. We prove that the flow problem is W[1]-hard parameterized by treewidth "},"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":"2309.01264","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-09-03T20:09:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"aa832a2e8c650e4658dfb9d8256ff614eb900b5ca553c70b40df897d3ac876b0","abstract_canon_sha256":"c184f22066ce9d58d37d0084548868577048c9f62f13ce2b405ce5fd7df68799"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:35.308455Z","signature_b64":"6w4FRUGEBn7Oy52YqNE+McRnntqyrADIR66icuyOSoC6EvnQ7eGqbkccNFLZGESyd5Rx8WAvF6Enj1S97zOzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7082150c3ba3ddacaff3d21b37a34d68b5da3610bb2419a8b6405e496e1d62b","last_reissued_at":"2026-07-05T06:47:35.308041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:35.308041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Bart M. P. Jansen, Fabrizio Montecchiani, Giuseppe Liotta, Kirill Simonov, Liana Khazaliya, Philipp Kindermann","submitted_at":"2023-09-03T20:09:52Z","abstract_excerpt":"Upward planarity testing and Rectilinear planarity testing are central problems in graph drawing. It is known that they are both NP-complete, but XP when parameterized by treewidth. In this paper we show that these two problems are W[1]-hard parameterized by treewidth, which answers open problems posed in two earlier papers. The key step in our proof is an analysis of the All-or-Nothing Flow problem, a generalization of which was used as an intermediate step in the NP-completeness proof for both planarity testing problems. We prove that the flow problem is W[1]-hard parameterized by treewidth "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.01264","kind":"arxiv","version":1},"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/2309.01264/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":"2309.01264","created_at":"2026-07-05T06:47:35.308097+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.01264v1","created_at":"2026-07-05T06:47:35.308097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.01264","created_at":"2026-07-05T06:47:35.308097+00:00"},{"alias_kind":"pith_short_12","alias_value":"64ECCUGDXI65","created_at":"2026-07-05T06:47:35.308097+00:00"},{"alias_kind":"pith_short_16","alias_value":"64ECCUGDXI65VSX7","created_at":"2026-07-05T06:47:35.308097+00:00"},{"alias_kind":"pith_short_8","alias_value":"64ECCUGD","created_at":"2026-07-05T06:47:35.308097+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/64ECCUGDXI65VSX7HUQ3G6RU22","json":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22.json","graph_json":"https://pith.science/api/pith-number/64ECCUGDXI65VSX7HUQ3G6RU22/graph.json","events_json":"https://pith.science/api/pith-number/64ECCUGDXI65VSX7HUQ3G6RU22/events.json","paper":"https://pith.science/paper/64ECCUGD"},"agent_actions":{"view_html":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22","download_json":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22.json","view_paper":"https://pith.science/paper/64ECCUGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.01264&json=true","fetch_graph":"https://pith.science/api/pith-number/64ECCUGDXI65VSX7HUQ3G6RU22/graph.json","fetch_events":"https://pith.science/api/pith-number/64ECCUGDXI65VSX7HUQ3G6RU22/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22/action/storage_attestation","attest_author":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22/action/author_attestation","sign_citation":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22/action/citation_signature","submit_replication":"https://pith.science/pith/64ECCUGDXI65VSX7HUQ3G6RU22/action/replication_record"}},"created_at":"2026-07-05T06:47:35.308097+00:00","updated_at":"2026-07-05T06:47:35.308097+00:00"}