{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VK7XNEU7I2GYTTM2MNIWHLKN5B","short_pith_number":"pith:VK7XNEU7","canonical_record":{"source":{"id":"1512.05876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T09:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"e34432bf3dd5cc9f670727ef01f9eb63bdfa332fbcd7cc8b4d25824fe4bc5371","abstract_canon_sha256":"9b91b4db92733a9282b91ba855b173eb38b2bf5561750f591a1e889942b21e7b"},"schema_version":"1.0"},"canonical_sha256":"aabf76929f468d89cd9a635163ad4de86eddb0615ca989a6fe42300d0204fc98","source":{"kind":"arxiv","id":"1512.05876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05876","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05876v1","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05876","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"VK7XNEU7I2GY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VK7XNEU7I2GYTTM2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VK7XNEU7","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VK7XNEU7I2GYTTM2MNIWHLKN5B","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T09:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"e34432bf3dd5cc9f670727ef01f9eb63bdfa332fbcd7cc8b4d25824fe4bc5371","abstract_canon_sha256":"9b91b4db92733a9282b91ba855b173eb38b2bf5561750f591a1e889942b21e7b"},"schema_version":"1.0"},"canonical_sha256":"aabf76929f468d89cd9a635163ad4de86eddb0615ca989a6fe42300d0204fc98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:06.021308Z","signature_b64":"bd/muqiT/NzhUiEZVBGLGPd2K9vUp3HLA+IzozBL1BSjJJMIAbp8hJbxikzHmjGxta0W07o2pW4ZBGWmAiTVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aabf76929f468d89cd9a635163ad4de86eddb0615ca989a6fe42300d0204fc98","last_reissued_at":"2026-05-18T01:24:06.020800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:06.020800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05876","source_version":1,"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-18T01:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4upLs5EPp6fIXiI9OOI8MtR9cZ7k26foMvmx9W9PijW0FE9KVPGFeutp8RjKvzyOVBP4nQfhNmXHhgNRaJudCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:19:29.856606Z"},"content_sha256":"bea2fbef98f4d1228eb6c3e7cc14519749e8b23dd8eac57a765604d832698469","schema_version":"1.0","event_id":"sha256:bea2fbef98f4d1228eb6c3e7cc14519749e8b23dd8eac57a765604d832698469"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VK7XNEU7I2GYTTM2MNIWHLKN5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster fixed parameter algorithm for two-layer crossing minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hisao Tamaki, Yasuaki Kobayashi","submitted_at":"2015-12-18T09:09:41Z","abstract_excerpt":"We give an algorithm that decides whether the bipartite crossing number of a given graph is at most $k$. The running time of the algorithm is upper bounded by $2^{O(k)} + n^{O(1)}$, where $n$ is the number of vertices of the input graph, which improves the previously known algorithm due to Kobayashi et al. (TCS 2014) that runs in $2^{O(k \\log k)} + n^{O(1)}$ time. This result is based on a combinatorial upper bound on the number of two-layer drawings of a connected bipartite graph with a bounded crossing number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05876","kind":"arxiv","version":1},"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-18T01:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL97fZgbr8kH0OIdPhphGdd2F/+xMzJjdrDbmVOM/iSi0k/j8SUbb+dY1gz2UWjTmGzT1oiLLk0HL/rHTonfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:19:29.856949Z"},"content_sha256":"5f568883ef1ff39988d4672e4e1221cd9453d7a42b5752814767c1a29baafad7","schema_version":"1.0","event_id":"sha256:5f568883ef1ff39988d4672e4e1221cd9453d7a42b5752814767c1a29baafad7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/bundle.json","state_url":"https://pith.science/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/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-06-04T12:19:29Z","links":{"resolver":"https://pith.science/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B","bundle":"https://pith.science/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/bundle.json","state":"https://pith.science/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VK7XNEU7I2GYTTM2MNIWHLKN5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VK7XNEU7I2GYTTM2MNIWHLKN5B","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":"9b91b4db92733a9282b91ba855b173eb38b2bf5561750f591a1e889942b21e7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T09:09:41Z","title_canon_sha256":"e34432bf3dd5cc9f670727ef01f9eb63bdfa332fbcd7cc8b4d25824fe4bc5371"},"schema_version":"1.0","source":{"id":"1512.05876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05876","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05876v1","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05876","created_at":"2026-05-18T01:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"VK7XNEU7I2GY","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VK7XNEU7I2GYTTM2","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VK7XNEU7","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:5f568883ef1ff39988d4672e4e1221cd9453d7a42b5752814767c1a29baafad7","target":"graph","created_at":"2026-05-18T01:24:06Z","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":"We give an algorithm that decides whether the bipartite crossing number of a given graph is at most $k$. The running time of the algorithm is upper bounded by $2^{O(k)} + n^{O(1)}$, where $n$ is the number of vertices of the input graph, which improves the previously known algorithm due to Kobayashi et al. (TCS 2014) that runs in $2^{O(k \\log k)} + n^{O(1)}$ time. This result is based on a combinatorial upper bound on the number of two-layer drawings of a connected bipartite graph with a bounded crossing number.","authors_text":"Hisao Tamaki, Yasuaki Kobayashi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T09:09:41Z","title":"A faster fixed parameter algorithm for two-layer crossing minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05876","kind":"arxiv","version":1},"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:bea2fbef98f4d1228eb6c3e7cc14519749e8b23dd8eac57a765604d832698469","target":"record","created_at":"2026-05-18T01:24:06Z","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":"9b91b4db92733a9282b91ba855b173eb38b2bf5561750f591a1e889942b21e7b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-18T09:09:41Z","title_canon_sha256":"e34432bf3dd5cc9f670727ef01f9eb63bdfa332fbcd7cc8b4d25824fe4bc5371"},"schema_version":"1.0","source":{"id":"1512.05876","kind":"arxiv","version":1}},"canonical_sha256":"aabf76929f468d89cd9a635163ad4de86eddb0615ca989a6fe42300d0204fc98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aabf76929f468d89cd9a635163ad4de86eddb0615ca989a6fe42300d0204fc98","first_computed_at":"2026-05-18T01:24:06.020800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:06.020800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bd/muqiT/NzhUiEZVBGLGPd2K9vUp3HLA+IzozBL1BSjJJMIAbp8hJbxikzHmjGxta0W07o2pW4ZBGWmAiTVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:06.021308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bea2fbef98f4d1228eb6c3e7cc14519749e8b23dd8eac57a765604d832698469","sha256:5f568883ef1ff39988d4672e4e1221cd9453d7a42b5752814767c1a29baafad7"],"state_sha256":"2527ff393538a48165d6edb77c580f23aac06f6761fc9bb3b5b83a2f3166a752"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kt/ZxBQaOJF2qezHBkTwzcY0O0+Mx9EcQsu9ZhFlhmi3x43Fp04JNxCsNxvFfRsT9CyrrJZbEP3bFWrRz+mBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:19:29.858816Z","bundle_sha256":"4c477161db58412a913e869b4837c4c607481707dc67d4e6a2612a3e88b62ea2"}}