{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:RTLPC7J5H5XJ2HWXEXDMVSVRJS","short_pith_number":"pith:RTLPC7J5","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"},"canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","source":{"kind":"arxiv","id":"2506.10717","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10717","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10717v2","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10717","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"RTLPC7J5H5XJ","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_16","alias_value":"RTLPC7J5H5XJ2HWX","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_8","alias_value":"RTLPC7J5","created_at":"2026-07-05T12:00:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:RTLPC7J5H5XJ2HWXEXDMVSVRJS","target":"record","payload":{"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"},"canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","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"},"source_kind":"arxiv","source_id":"2506.10717","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m7J5FGAKDhIsY0MttMy/vrOX+bTqHe3HjVIdf6BGY9nmr0rjo4rNup7ZniS/QQ3Ri8eFUPCKs8E4V7a+mdG8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:11:20.786876Z"},"content_sha256":"a059ed922408519974cacfb08909723046d6bcf01e490dec5dde2dc7e2069f26","schema_version":"1.0","event_id":"sha256:a059ed922408519974cacfb08909723046d6bcf01e490dec5dde2dc7e2069f26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:RTLPC7J5H5XJ2HWXEXDMVSVRJS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/6bhPC79gobuRLTpfrsOERxyy5Df0iPcu5RQDMJXAJ8/YuxlGVSXefyP9twVQVgIwEUjL0kbvF3QHMEePe9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:11:20.787369Z"},"content_sha256":"c629f3cba300155eb376a8f226d2a374ba07e98a4c9e7406680f90fae73709d5","schema_version":"1.0","event_id":"sha256:c629f3cba300155eb376a8f226d2a374ba07e98a4c9e7406680f90fae73709d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/bundle.json","state_url":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T07:11:20Z","links":{"resolver":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS","bundle":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/bundle.json","state":"https://pith.science/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTLPC7J5H5XJ2HWXEXDMVSVRJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:RTLPC7J5H5XJ2HWXEXDMVSVRJS","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":"acd3772d4c663016805f1a3dc63bc586c00d6098a823a869460a73bbee6a538b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-12T14:05:44Z","title_canon_sha256":"d08c23850531573a69312e278999bd0b24538c7bfc028807dc2a74127e52e6cf"},"schema_version":"1.0","source":{"id":"2506.10717","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.10717","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"2506.10717v2","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10717","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"RTLPC7J5H5XJ","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_16","alias_value":"RTLPC7J5H5XJ2HWX","created_at":"2026-07-05T12:00:02Z"},{"alias_kind":"pith_short_8","alias_value":"RTLPC7J5","created_at":"2026-07-05T12:00:02Z"}],"graph_snapshots":[{"event_id":"sha256:c629f3cba300155eb376a8f226d2a374ba07e98a4c9e7406680f90fae73709d5","target":"graph","created_at":"2026-07-05T12:00:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.10717/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Tatsuya Gima, Yasuaki Kobayashi, Yuto Okada","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-12T14:05:44Z","title":"Structural Parameterizations of $k$-Planarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10717","kind":"arxiv","version":2},"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:a059ed922408519974cacfb08909723046d6bcf01e490dec5dde2dc7e2069f26","target":"record","created_at":"2026-07-05T12:00:02Z","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":"acd3772d4c663016805f1a3dc63bc586c00d6098a823a869460a73bbee6a538b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-12T14:05:44Z","title_canon_sha256":"d08c23850531573a69312e278999bd0b24538c7bfc028807dc2a74127e52e6cf"},"schema_version":"1.0","source":{"id":"2506.10717","kind":"arxiv","version":2}},"canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cd6f17d3d3f6e9d1ed725c6cacab14cbc224231f691eb5641d5d6d17119501f","first_computed_at":"2026-07-05T12:00:02.239252Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:00:02.239252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"shs9WQSnROdVwwWOv67m+6FZG4eSfQ+a1eUn8WUJOHrOhR/0WFn/pQa4Z4ejLpxDIG+LoqUU/i7bI8PDE62hAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:00:02.239776Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.10717","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a059ed922408519974cacfb08909723046d6bcf01e490dec5dde2dc7e2069f26","sha256:c629f3cba300155eb376a8f226d2a374ba07e98a4c9e7406680f90fae73709d5"],"state_sha256":"2458ff4946df61a5c5910f8d58b99fbdaefe310eb8e207dc2cd1ecb909d6c1b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xr/gnhdbjPgol1l+4NhkD06Iu34VyiJG0CKH3wttfR64YvHlEMfEvDwOKQk28MvYiWtMCZchkLhxHPqwjMzBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T07:11:20.791357Z","bundle_sha256":"37b84fd4d79b2b897770b799d08a89d1958e8b73076e7574ec579fc195ef4e84"}}