{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ST4SANER3JRFT5HHUDRLPU6YS7","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":"6ad4652cea100d841dfbb822b96844e1df1ac99c53a28ae5f65174a380b1c36b","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T10:31:08Z","title_canon_sha256":"917990d80b0f2f4027b66b1868394ffa01dd934106188a07ecca6681ff8f743c"},"schema_version":"1.0","source":{"id":"2412.04042","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.04042","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"2412.04042v3","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04042","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"ST4SANER3JRF","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_16","alias_value":"ST4SANER3JRFT5HH","created_at":"2026-07-05T10:47:34Z"},{"alias_kind":"pith_short_8","alias_value":"ST4SANER","created_at":"2026-07-05T10:47:34Z"}],"graph_snapshots":[{"event_id":"sha256:8ea280aad3f009ef7fbc10332b838ab7143009b62237fb126a0eb2f119c3ec54","target":"graph","created_at":"2026-07-05T10:47:34Z","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/2412.04042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-parameter tractable (FPT) with respect to the natural parameter. Two well-known variants of the problem are 2-layer crossing minimization and circular crossing minimization, where every vertex must lie on one of two layers, namely two parallel lines, or a circle, respectively. Both variants are NP-hard, but FPT with respect to the natural parameter.\n  Recently, a local version of the crossing number has also received c","authors_text":"Alexander Wolff, Yasuaki Kobayashi, Yuto Okada","cross_cats":["cs.CC","cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T10:31:08Z","title":"Recognizing 2-Layer and Outer $k$-Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04042","kind":"arxiv","version":3},"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:3122cb3e2208841377ef8c3280cb76651fefca24f44e000b102408c4b69ff075","target":"record","created_at":"2026-07-05T10:47:34Z","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":"6ad4652cea100d841dfbb822b96844e1df1ac99c53a28ae5f65174a380b1c36b","cross_cats_sorted":["cs.CC","cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T10:31:08Z","title_canon_sha256":"917990d80b0f2f4027b66b1868394ffa01dd934106188a07ecca6681ff8f743c"},"schema_version":"1.0","source":{"id":"2412.04042","kind":"arxiv","version":3}},"canonical_sha256":"94f9203491da6259f4e7a0e2b7d3d897f31ca8b84e990dcf99ec134313a55b6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94f9203491da6259f4e7a0e2b7d3d897f31ca8b84e990dcf99ec134313a55b6c","first_computed_at":"2026-07-05T10:47:34.285663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:47:34.285663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9XU8qeY1COEUeuVQTXmg4ak6tv+JjDt4l+Z9brVFmFnjMWD1WB5AZPUQ7pmIUvolNjSJpRkpwI4qszZ+EK2PDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:47:34.286168Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.04042","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3122cb3e2208841377ef8c3280cb76651fefca24f44e000b102408c4b69ff075","sha256:8ea280aad3f009ef7fbc10332b838ab7143009b62237fb126a0eb2f119c3ec54"],"state_sha256":"2f335fb1f54719ce673b859f07dfdfc2ba5516b0797005aa8fc654bccd045e16"}