{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GJC27NVHBSSEPC6EVGF6MJFMWS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3ad51410260979579298312d406d318858e7c4063193b4aab8903729bf3c8676","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-27T12:03:12Z","title_canon_sha256":"9cc03ad4c7626749e3b07c9a7e2cdaf9fbe2cb0b0f563e6b70cabd24beef9c4d"},"schema_version":"1.0","source":{"id":"1203.5944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.5944","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"arxiv_version","alias_value":"1203.5944v1","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5944","created_at":"2026-05-18T03:59:12Z"},{"alias_kind":"pith_short_12","alias_value":"GJC27NVHBSSE","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJC27NVHBSSEPC6E","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJC27NVH","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:2dab6479c49be576da791d3f5f366ddaba7b34f28953e3e75194ef5c876f56c7","target":"graph","created_at":"2026-05-18T03:59:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Bojan Mohar, Sergio Cabello","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-27T12:03:12Z","title":"Adding one edge to planar graphs makes crossing number and 1-planarity hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5944","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e6c1cfbf5e2545d7c22d99382152d2ee63899d2d2e43fcec4b45fa42313625f7","target":"record","created_at":"2026-05-18T03:59:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3ad51410260979579298312d406d318858e7c4063193b4aab8903729bf3c8676","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-03-27T12:03:12Z","title_canon_sha256":"9cc03ad4c7626749e3b07c9a7e2cdaf9fbe2cb0b0f563e6b70cabd24beef9c4d"},"schema_version":"1.0","source":{"id":"1203.5944","kind":"arxiv","version":1}},"canonical_sha256":"3245afb6a70ca4478bc4a98be624acb490e94a5345b3894c6831dcd2aedd5435","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3245afb6a70ca4478bc4a98be624acb490e94a5345b3894c6831dcd2aedd5435","first_computed_at":"2026-05-18T03:59:12.965548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:12.965548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vg6YUAxEL2EaMGcAsCsPk8fD3DJ5f0HTtEBQC8iSmYazIGsj/4DhjZGl6Fr1t8DDunmujxueCAFyfe5+zxWHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:12.966184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.5944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6c1cfbf5e2545d7c22d99382152d2ee63899d2d2e43fcec4b45fa42313625f7","sha256:2dab6479c49be576da791d3f5f366ddaba7b34f28953e3e75194ef5c876f56c7"],"state_sha256":"81a2947af144ab729759ba85047c981ca7da5c289461fb9cfcb105318b018194"}