{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GNX4RXENAVNJLOYWAPMBLI4COH","short_pith_number":"pith:GNX4RXEN","schema_version":"1.0","canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","source":{"kind":"arxiv","id":"1304.5591","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of 1-Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Michael J. Bannister, Sergio Cabello","submitted_at":"2013-04-20T06:14:31Z","abstract_excerpt":"We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter tractable algorithms. However, the problem remains NP-complete for graphs of bounded bandwidth, pathwidth, or 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":"1304.5591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-20T06:14:31Z","cross_cats_sorted":[],"title_canon_sha256":"eeee972069ffddad25fc9098fb8998ae4c0109475aa5d2971e8d27b4c897ef8a","abstract_canon_sha256":"718f3abb43b7b37c402f985951646e9e48d34c988006fc0688e547add5e7831b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:15.420791Z","signature_b64":"VcYP5i3BHGu/2AGpG5B+RYpvYmE00caBvsukddoMdqjIvsimfHJDmbNJr742YsCv0FGFI0OBvqkTkdXnX5KJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"336fc8dc8d055a95bb1603d815a38271ecfb5201991a2ef9ae9377e831c90423","last_reissued_at":"2026-05-17T23:58:15.420223Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:15.420223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of 1-Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Eppstein, Michael J. Bannister, Sergio Cabello","submitted_at":"2013-04-20T06:14:31Z","abstract_excerpt":"We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the parameterized complexity of the problem with respect to the vertex cover number, tree-depth, and cyclomatic number. For these parameters we construct fixed-parameter tractable algorithms. However, the problem remains NP-complete for graphs of bounded bandwidth, pathwidth, or treewidth."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5591","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":""},"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":"1304.5591","created_at":"2026-05-17T23:58:15.420310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5591v1","created_at":"2026-05-17T23:58:15.420310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5591","created_at":"2026-05-17T23:58:15.420310+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNX4RXENAVNJ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNX4RXENAVNJLOYW","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNX4RXEN","created_at":"2026-05-18T12:27:45.050594+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/GNX4RXENAVNJLOYWAPMBLI4COH","json":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH.json","graph_json":"https://pith.science/api/pith-number/GNX4RXENAVNJLOYWAPMBLI4COH/graph.json","events_json":"https://pith.science/api/pith-number/GNX4RXENAVNJLOYWAPMBLI4COH/events.json","paper":"https://pith.science/paper/GNX4RXEN"},"agent_actions":{"view_html":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH","download_json":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH.json","view_paper":"https://pith.science/paper/GNX4RXEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5591&json=true","fetch_graph":"https://pith.science/api/pith-number/GNX4RXENAVNJLOYWAPMBLI4COH/graph.json","fetch_events":"https://pith.science/api/pith-number/GNX4RXENAVNJLOYWAPMBLI4COH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/action/storage_attestation","attest_author":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/action/author_attestation","sign_citation":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/action/citation_signature","submit_replication":"https://pith.science/pith/GNX4RXENAVNJLOYWAPMBLI4COH/action/replication_record"}},"created_at":"2026-05-17T23:58:15.420310+00:00","updated_at":"2026-05-17T23:58:15.420310+00:00"}