{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5NODSS244HUVF7WFPBAY2YRQUL","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6580ff7eed5e60883a18a9772b13e0499501bba6f3776120865eb2f239ad1aeb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T13:40:04Z","title_canon_sha256":"449ec20e09f0985707c5d635de6070095b7fc83860812a88eb4b9dbb3d56eef3"},"schema_version":"1.0","source":{"id":"2605.14834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14834","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14834v1","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14834","created_at":"2026-05-17T23:38:58Z"},{"alias_kind":"pith_short_12","alias_value":"5NODSS244HUV","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5NODSS244HUVF7WF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5NODSS24","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:c220878afc4adce52bdbb482b7be4774e1278e91eccaa5e9f674c3de4e4f82e7","target":"graph","created_at":"2026-05-17T23:38:58Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The polynomial-time reduction from a known NP-complete problem to min-1-planarity testing is correct and preserves the yes/no answer."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Deciding if a graph admits a min-1-planar drawing is NP-hard."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Deciding whether a graph admits a min-1-planar drawing is NP-hard."}],"snapshot_sha256":"fa8f8ea068e9b18f69adaf7dbdc9e13b9723032d13feb89b09b36abf50ab9f05"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing. A drawing of a graph is min-$k$-planar if, for every crossing in the drawing, at least one of the two crossing edges involves at most $k$ crossings. This notion of min-$k$-planarity was introduced by Binucci, B\\\"{u}ngener, Di Battista, Didimo, Dujmovi\\'c, Hong, Kaufmann, Liotta, Morin, and Tappini [GD 2023; JGAA, 2024] as a generalization of $k$-planarity.","authors_text":"Yuto Okada","cross_cats":["cs.DS"],"headline":"Deciding whether a graph admits a min-1-planar drawing is NP-hard.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T13:40:04Z","title":"Min-1-Planarity is NP-Hard"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"2-level quasi-planarity or how caterpillars climb (spqr-)trees","work_id":"5b5b8512-bfbe-4553-acb9-1f3d726c7393","year":2021},{"cited_arxiv_id":"","doi":"10.1137/1","is_internal_anchor":false,"ref_index":2,"title":"More asymmetry yields faster matrix multiplication","work_id":"5ec132ea-8bab-4415-b2af-677e9db16f00","year":2014},{"cited_arxiv_id":"","doi":"10.1007/s00453-016-0200-5","is_internal_anchor":false,"ref_index":3,"title":"5 Carla Binucci, Aaron Büngener, Giuseppe Di Battista, Walter Didimo, Vida Dujmović, Seok- Hee Hong, Michael Kaufmann, Giuseppe Liotta, Pat Morin, and Alessandra Tappini","work_id":"c510fbd5-ed5e-4546-8854-57d15a1b4140","year":2023},{"cited_arxiv_id":"","doi":"10.7155/jgaa.v28i2.2925","is_internal_anchor":false,"ref_index":4,"title":"7 Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Antonios Symvonis, and Ioannis G","work_id":"6b790ed2-f7f0-4e6a-8c89-1e4c756b0bcc","year":null},{"cited_arxiv_id":"","doi":"10.1016/j.tcs.2015.04.020","is_internal_anchor":false,"ref_index":5,"title":"URL:https://doi.org/10.1016/j.tcs.2015.04.020, doi: 10.1016/J.TCS.2015.04.020. 8 Franz J. Brandenburg. Recognizing optimal 1-planar graphs in linear time.Algorith- mica, 80(1):1–28,","work_id":"c8bdc92e-4000-4e34-a1bc-19043d923923","year":2015}],"snapshot_sha256":"a409903c2bc0432299fa7a77b6d29b51e6f9f9626036c38c00072b46ed9fd8ad"},"source":{"id":"2605.14834","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T03:13:31.806385Z","id":"b63bf3d7-b4eb-428f-81b8-eb11ec6253d8","model_set":{"reader":"grok-4.3"},"one_line_summary":"Deciding if a graph admits a min-1-planar drawing is NP-hard.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Deciding whether a graph admits a min-1-planar drawing is NP-hard.","strongest_claim":"we show that it is NP-hard to determine whether a given graph admits a min-1-planar drawing.","weakest_assumption":"The polynomial-time reduction from a known NP-complete problem to min-1-planarity testing is correct and preserves the yes/no answer."}},"verdict_id":"b63bf3d7-b4eb-428f-81b8-eb11ec6253d8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:767d2ce21d787971ab29c6742e6f869c14708ba3b2045da469151b9a835915a2","target":"record","created_at":"2026-05-17T23:38:58Z","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":"6580ff7eed5e60883a18a9772b13e0499501bba6f3776120865eb2f239ad1aeb","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-05-14T13:40:04Z","title_canon_sha256":"449ec20e09f0985707c5d635de6070095b7fc83860812a88eb4b9dbb3d56eef3"},"schema_version":"1.0","source":{"id":"2605.14834","kind":"arxiv","version":1}},"canonical_sha256":"eb5c394b5ce1e952fec578418d6230a2e931cd75277a74c58309d562d0de387b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb5c394b5ce1e952fec578418d6230a2e931cd75277a74c58309d562d0de387b","first_computed_at":"2026-05-17T23:38:58.012733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:58.012733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGTLfxSSuzi1pMhkW1gYGYnrAazujQEPcq5Ql9nNRExa/DjaJvdxWYQdqryRhpFxTRooq3eH4vjV6H3eNW5aCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:58.013432Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:767d2ce21d787971ab29c6742e6f869c14708ba3b2045da469151b9a835915a2","sha256:c220878afc4adce52bdbb482b7be4774e1278e91eccaa5e9f674c3de4e4f82e7","sha256:528a8d6a07e2c267aca28c5f5deb3acd35a5fb539cbb74e82638dec2b09ea176"],"state_sha256":"5d1139ea36838fdca8544ab5f0a06c4b488e983c61166f4a175b1426d12a9f17"}