{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NYGGVV3FP2VCUM4QONNTBOGHXR","short_pith_number":"pith:NYGGVV3F","schema_version":"1.0","canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","source":{"kind":"arxiv","id":"2411.15864","version":1},"attestation_state":"computed","paper":{"title":"Pathways to Tractability for Geometric Thickness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Alexander Firbas, Martin N\\\"ollenburg, Robert Ganian, Simon Dominik Fink, Thomas Depian","submitted_at":"2024-11-24T14:57:26Z","abstract_excerpt":"We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is NP-hard, we investigate its tractability through the lens of parameterized complexity. As our first set of contributions, we provide two fixed-parameter algorithms which utilize well-studied parameters of the input graph, notably the vertex cover and feedback edge numbers. Since parameterizing by the thickness itself does not yield tractability and the use of o"},"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":"2411.15864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-24T14:57:26Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e8fde035a8187ef819c6d8b95d604af575c0f8a3b6224b76e05b153013b1fcd8","abstract_canon_sha256":"1e0444fb4da71bd78f38df7a1dc0ad04dccd305cf280b72bd59f523afe28621f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:41.981829Z","signature_b64":"Lj7As+DvsdDrDIyF1npRUAlkRSlMZAMtNMjRs85rui1XkrPHmD56J/jsY+iVLpRnwULaX/XM9EQO9TXxaz5nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e0c6ad7657eaa2a3390735b30b8c7bc6a28cab4429e181bb3eb26d9340fefc6","last_reissued_at":"2026-07-05T09:39:41.981403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:41.981403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pathways to Tractability for Geometric Thickness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Alexander Firbas, Martin N\\\"ollenburg, Robert Ganian, Simon Dominik Fink, Thomas Depian","submitted_at":"2024-11-24T14:57:26Z","abstract_excerpt":"We study the classical problem of computing geometric thickness, i.e., finding a straight-line drawing of an input graph and a partition of its edges into as few parts as possible so that each part is crossing-free. Since the problem is NP-hard, we investigate its tractability through the lens of parameterized complexity. As our first set of contributions, we provide two fixed-parameter algorithms which utilize well-studied parameters of the input graph, notably the vertex cover and feedback edge numbers. Since parameterizing by the thickness itself does not yield tractability and the use of o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15864","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/2411.15864/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":"2411.15864","created_at":"2026-07-05T09:39:41.981468+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15864v1","created_at":"2026-07-05T09:39:41.981468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15864","created_at":"2026-07-05T09:39:41.981468+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYGGVV3FP2VC","created_at":"2026-07-05T09:39:41.981468+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYGGVV3FP2VCUM4Q","created_at":"2026-07-05T09:39:41.981468+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYGGVV3F","created_at":"2026-07-05T09:39:41.981468+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/NYGGVV3FP2VCUM4QONNTBOGHXR","json":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR.json","graph_json":"https://pith.science/api/pith-number/NYGGVV3FP2VCUM4QONNTBOGHXR/graph.json","events_json":"https://pith.science/api/pith-number/NYGGVV3FP2VCUM4QONNTBOGHXR/events.json","paper":"https://pith.science/paper/NYGGVV3F"},"agent_actions":{"view_html":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR","download_json":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR.json","view_paper":"https://pith.science/paper/NYGGVV3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15864&json=true","fetch_graph":"https://pith.science/api/pith-number/NYGGVV3FP2VCUM4QONNTBOGHXR/graph.json","fetch_events":"https://pith.science/api/pith-number/NYGGVV3FP2VCUM4QONNTBOGHXR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/action/storage_attestation","attest_author":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/action/author_attestation","sign_citation":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/action/citation_signature","submit_replication":"https://pith.science/pith/NYGGVV3FP2VCUM4QONNTBOGHXR/action/replication_record"}},"created_at":"2026-07-05T09:39:41.981468+00:00","updated_at":"2026-07-05T09:39:41.981468+00:00"}