{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RTLPC7J5H5XJ2HWXEXDMVSVRJS","short_pith_number":"pith:RTLPC7J5","schema_version":"1.0","canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","source":{"kind":"arxiv","id":"2506.10717","version":2},"attestation_state":"computed","paper":{"title":"Structural Parameterizations of $k$-Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada","submitted_at":"2025-06-12T14:05:44Z","abstract_excerpt":"The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the minimum integer $k$ such that it is $k$-planar. The problem of determining whether an input graph is $1$-planar is known to be NP-complete even for near-planar graphs [Cabello and Mohar, SIAM J. Comput. 2013], that is, the graphs obtained from planar graphs by adding a single edge. Moreover, the local crossing number is hard to approximate within a factor $2 "},"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":"2506.10717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-12T14:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"d08c23850531573a69312e278999bd0b24538c7bfc028807dc2a74127e52e6cf","abstract_canon_sha256":"acd3772d4c663016805f1a3dc63bc586c00d6098a823a869460a73bbee6a538b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:00:02.239776Z","signature_b64":"shs9WQSnROdVwwWOv67m+6FZG4eSfQ+a1eUn8WUJOHrOhR/0WFn/pQa4Z4ejLpxDIG+LoqUU/i7bI8PDE62hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","last_reissued_at":"2026-07-05T12:00:02.239252Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:00:02.239252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Parameterizations of $k$-Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada","submitted_at":"2025-06-12T14:05:44Z","abstract_excerpt":"The concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times. The local crossing number of a graph is the minimum integer $k$ such that it is $k$-planar. The problem of determining whether an input graph is $1$-planar is known to be NP-complete even for near-planar graphs [Cabello and Mohar, SIAM J. Comput. 2013], that is, the graphs obtained from planar graphs by adding a single edge. Moreover, the local crossing number is hard to approximate within a factor $2 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10717","kind":"arxiv","version":2},"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/2506.10717/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":"2506.10717","created_at":"2026-07-05T12:00:02.239322+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10717v2","created_at":"2026-07-05T12:00:02.239322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10717","created_at":"2026-07-05T12:00:02.239322+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTLPC7J5H5XJ","created_at":"2026-07-05T12:00:02.239322+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTLPC7J5H5XJ2HWX","created_at":"2026-07-05T12:00:02.239322+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTLPC7J5","created_at":"2026-07-05T12:00:02.239322+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/RTLPC7J5H5XJ2HWXEXDMVSVRJS","json":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS.json","graph_json":"https://pith.science/api/pith-number/RTLPC7J5H5XJ2HWXEXDMVSVRJS/graph.json","events_json":"https://pith.science/api/pith-number/RTLPC7J5H5XJ2HWXEXDMVSVRJS/events.json","paper":"https://pith.science/paper/RTLPC7J5"},"agent_actions":{"view_html":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS","download_json":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS.json","view_paper":"https://pith.science/paper/RTLPC7J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10717&json=true","fetch_graph":"https://pith.science/api/pith-number/RTLPC7J5H5XJ2HWXEXDMVSVRJS/graph.json","fetch_events":"https://pith.science/api/pith-number/RTLPC7J5H5XJ2HWXEXDMVSVRJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/action/storage_attestation","attest_author":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/action/author_attestation","sign_citation":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/action/citation_signature","submit_replication":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/action/replication_record"}},"created_at":"2026-07-05T12:00:02.239322+00:00","updated_at":"2026-07-05T12:00:02.239322+00:00"}