{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VZIS4TS2ZDYVKKVIROQQLXZAQA","short_pith_number":"pith:VZIS4TS2","canonical_record":{"source":{"id":"1904.05011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T06:06:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6b9564785d95c0225269d7599a917177e39280114e273c8a16aaf7c953150738","abstract_canon_sha256":"9aae8b77659a77587fcb4e3bcaf8d6cf163e5ad24dc8c14582f46c97e292e725"},"schema_version":"1.0"},"canonical_sha256":"ae512e4e5ac8f1552aa88ba105df20801ba73237e2e25c403d4c59e367e602f9","source":{"kind":"arxiv","id":"1904.05011","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05011","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05011v2","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05011","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"VZIS4TS2ZDYV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VZIS4TS2ZDYVKKVI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VZIS4TS2","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VZIS4TS2ZDYVKKVIROQQLXZAQA","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05011","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T06:06:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6b9564785d95c0225269d7599a917177e39280114e273c8a16aaf7c953150738","abstract_canon_sha256":"9aae8b77659a77587fcb4e3bcaf8d6cf163e5ad24dc8c14582f46c97e292e725"},"schema_version":"1.0"},"canonical_sha256":"ae512e4e5ac8f1552aa88ba105df20801ba73237e2e25c403d4c59e367e602f9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:14.665819Z","signature_b64":"5tzswe14J6CW6P4CLAYP1s9JF45DnYlJlLALsKs4KIXqmnLE9nYDdi5RUE5t2QVNnhUnAWOiE6XXcjB0fFq9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae512e4e5ac8f1552aa88ba105df20801ba73237e2e25c403d4c59e367e602f9","last_reissued_at":"2026-05-17T23:45:14.665190Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:14.665190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05011","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-05-17T23:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SAG7pKKK0feWPeFd/6DjddbDL9h8p7+R0tRbe2lgNspf/XJydEfkOz1Qj+emATUV/Yl/TloZrUDIsJKIto7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:13:53.502250Z"},"content_sha256":"086a9a8dc9050497c9f3a4f30b0a8f10d3021d5f9f2cfef553003b6d38425d07","schema_version":"1.0","event_id":"sha256:086a9a8dc9050497c9f3a4f30b0a8f10d3021d5f9f2cfef553003b6d38425d07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VZIS4TS2ZDYVKKVIROQQLXZAQA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An FPT Algorithm for Max-Cut Parameterized by Crossing Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Shuichi Miyazaki, Suguru Tamaki, Yasuaki Kobayashi, Yusuke Kobayashi","submitted_at":"2019-04-10T06:06:15Z","abstract_excerpt":"The Max-Cut problem is known to be NP-hard on general graphs, while it can be solved in polynomial time on planar graphs. In this paper, we present a fixed-parameter tractable algorithm for the problem on `almost' planar graphs: Given an $n$-vertex graph and its drawing with $k$ crossings, our algorithm runs in time $O(2^k(n+k)^{3/2} \\log (n + k))$. Previously, Dahn, Kriege and Mutzel (IWOCA 2018) obtained an algorithm that, given an $n$-vertex graph and its $1$-planar drawing with $k$ crossings, runs in time $O(3^k n^{3/2} \\log n)$. Our result simultaneously improves the running time and remo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05011","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":""},"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-05-17T23:45:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"swY3ijgvdfNogpx8GTjvuIFWrWH/nT0kXvV5cwZe+HVC9urIRyaOn+k3hhO9qpkjA8SIIJxXfQ/BHDReMtbvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:13:53.502617Z"},"content_sha256":"9b81e8eda43c6c9f157f436a67e5c379ae9265e7a162b6f4a0c20e344591a8fc","schema_version":"1.0","event_id":"sha256:9b81e8eda43c6c9f157f436a67e5c379ae9265e7a162b6f4a0c20e344591a8fc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/bundle.json","state_url":"https://pith.science/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/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-05-28T01:13:53Z","links":{"resolver":"https://pith.science/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA","bundle":"https://pith.science/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/bundle.json","state":"https://pith.science/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZIS4TS2ZDYVKKVIROQQLXZAQA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VZIS4TS2ZDYVKKVIROQQLXZAQA","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":"9aae8b77659a77587fcb4e3bcaf8d6cf163e5ad24dc8c14582f46c97e292e725","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T06:06:15Z","title_canon_sha256":"6b9564785d95c0225269d7599a917177e39280114e273c8a16aaf7c953150738"},"schema_version":"1.0","source":{"id":"1904.05011","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05011","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05011v2","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05011","created_at":"2026-05-17T23:45:14Z"},{"alias_kind":"pith_short_12","alias_value":"VZIS4TS2ZDYV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VZIS4TS2ZDYVKKVI","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VZIS4TS2","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:9b81e8eda43c6c9f157f436a67e5c379ae9265e7a162b6f4a0c20e344591a8fc","target":"graph","created_at":"2026-05-17T23:45:14Z","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":"The Max-Cut problem is known to be NP-hard on general graphs, while it can be solved in polynomial time on planar graphs. In this paper, we present a fixed-parameter tractable algorithm for the problem on `almost' planar graphs: Given an $n$-vertex graph and its drawing with $k$ crossings, our algorithm runs in time $O(2^k(n+k)^{3/2} \\log (n + k))$. Previously, Dahn, Kriege and Mutzel (IWOCA 2018) obtained an algorithm that, given an $n$-vertex graph and its $1$-planar drawing with $k$ crossings, runs in time $O(3^k n^{3/2} \\log n)$. Our result simultaneously improves the running time and remo","authors_text":"Shuichi Miyazaki, Suguru Tamaki, Yasuaki Kobayashi, Yusuke Kobayashi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T06:06:15Z","title":"An FPT Algorithm for Max-Cut Parameterized by Crossing Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05011","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:086a9a8dc9050497c9f3a4f30b0a8f10d3021d5f9f2cfef553003b6d38425d07","target":"record","created_at":"2026-05-17T23:45:14Z","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":"9aae8b77659a77587fcb4e3bcaf8d6cf163e5ad24dc8c14582f46c97e292e725","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-10T06:06:15Z","title_canon_sha256":"6b9564785d95c0225269d7599a917177e39280114e273c8a16aaf7c953150738"},"schema_version":"1.0","source":{"id":"1904.05011","kind":"arxiv","version":2}},"canonical_sha256":"ae512e4e5ac8f1552aa88ba105df20801ba73237e2e25c403d4c59e367e602f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae512e4e5ac8f1552aa88ba105df20801ba73237e2e25c403d4c59e367e602f9","first_computed_at":"2026-05-17T23:45:14.665190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:14.665190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5tzswe14J6CW6P4CLAYP1s9JF45DnYlJlLALsKs4KIXqmnLE9nYDdi5RUE5t2QVNnhUnAWOiE6XXcjB0fFq9Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:14.665819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05011","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:086a9a8dc9050497c9f3a4f30b0a8f10d3021d5f9f2cfef553003b6d38425d07","sha256:9b81e8eda43c6c9f157f436a67e5c379ae9265e7a162b6f4a0c20e344591a8fc"],"state_sha256":"7511b8c750b6e2f541ee4675d279e0ffe953abcb7eda78693fc513c82dbe2c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRJEaSPSv/RTk/3HSvu8IaVxJAQ1b1yMNK3MXy2XSDcRV/ypVQLVJyJ4iB7QjyBieA+GstJx+Nv2W06N0d0eCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:13:53.504567Z","bundle_sha256":"a9bfa92b35e57f1210c9cdc4f279c9241054680c9399bec7c5e752620ce3f462"}}