{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GJC27NVHBSSEPC6EVGF6MJFMWS","short_pith_number":"pith:GJC27NVH","schema_version":"1.0","canonical_sha256":"3245afb6a70ca4478bc4a98be624acb490e94a5345b3894c6831dcd2aedd5435","source":{"kind":"arxiv","id":"1203.5944","version":1},"attestation_state":"computed","paper":{"title":"Adding one edge to planar graphs makes crossing number and 1-planarity hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.CG","authors_text":"Bojan Mohar, Sergio Cabello","submitted_at":"2012-03-27T12:03:12Z","abstract_excerpt":"A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every edge is crossed by at most one other edge. We show that it is NP-hard to decide whether a given near-planar graph is 1-planar. The main idea in both reductions is to consider the problem of simultaneously drawing two planar graphs inside a disk, with some of its vertices fixed at the boundary of the disk. This leads to the concept of anchored embedding, which i"},"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":"1203.5944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-27T12:03:12Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"9cc03ad4c7626749e3b07c9a7e2cdaf9fbe2cb0b0f563e6b70cabd24beef9c4d","abstract_canon_sha256":"3ad51410260979579298312d406d318858e7c4063193b4aab8903729bf3c8676"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:12.966184Z","signature_b64":"Vg6YUAxEL2EaMGcAsCsPk8fD3DJ5f0HTtEBQC8iSmYazIGsj/4DhjZGl6Fr1t8DDunmujxueCAFyfe5+zxWHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3245afb6a70ca4478bc4a98be624acb490e94a5345b3894c6831dcd2aedd5435","last_reissued_at":"2026-05-18T03:59:12.965548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:12.965548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adding one edge to planar graphs makes crossing number and 1-planarity hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.CG","authors_text":"Bojan Mohar, Sergio Cabello","submitted_at":"2012-03-27T12:03:12Z","abstract_excerpt":"A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every edge is crossed by at most one other edge. We show that it is NP-hard to decide whether a given near-planar graph is 1-planar. The main idea in both reductions is to consider the problem of simultaneously drawing two planar graphs inside a disk, with some of its vertices fixed at the boundary of the disk. This leads to the concept of anchored embedding, which i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5944","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":"1203.5944","created_at":"2026-05-18T03:59:12.965644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5944v1","created_at":"2026-05-18T03:59:12.965644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5944","created_at":"2026-05-18T03:59:12.965644+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJC27NVHBSSE","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJC27NVHBSSEPC6E","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJC27NVH","created_at":"2026-05-18T12:27:06.952714+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/GJC27NVHBSSEPC6EVGF6MJFMWS","json":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS.json","graph_json":"https://pith.science/api/pith-number/GJC27NVHBSSEPC6EVGF6MJFMWS/graph.json","events_json":"https://pith.science/api/pith-number/GJC27NVHBSSEPC6EVGF6MJFMWS/events.json","paper":"https://pith.science/paper/GJC27NVH"},"agent_actions":{"view_html":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS","download_json":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS.json","view_paper":"https://pith.science/paper/GJC27NVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5944&json=true","fetch_graph":"https://pith.science/api/pith-number/GJC27NVHBSSEPC6EVGF6MJFMWS/graph.json","fetch_events":"https://pith.science/api/pith-number/GJC27NVHBSSEPC6EVGF6MJFMWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS/action/storage_attestation","attest_author":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS/action/author_attestation","sign_citation":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS/action/citation_signature","submit_replication":"https://pith.science/pith/GJC27NVHBSSEPC6EVGF6MJFMWS/action/replication_record"}},"created_at":"2026-05-18T03:59:12.965644+00:00","updated_at":"2026-05-18T03:59:12.965644+00:00"}