{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BX6CTH4VCNVVVHXYW7MEE2RWVL","short_pith_number":"pith:BX6CTH4V","canonical_record":{"source":{"id":"1304.4207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-15T19:15:18Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fc087fb0c529a823829b00ec459951c8038e50544d3db7c5175dad843d802a1c","abstract_canon_sha256":"0dea38e6577eb5a392f5e6b9d980b4727225b8f8c28ab139374e58d7bcfb8b76"},"schema_version":"1.0"},"canonical_sha256":"0dfc299f95136b5a9ef8b7d8426a36aac4d9cd792610731e2604cbe56f8726c9","source":{"kind":"arxiv","id":"1304.4207","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4207","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4207v1","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4207","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"BX6CTH4VCNVV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BX6CTH4VCNVVVHXY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BX6CTH4V","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BX6CTH4VCNVVVHXYW7MEE2RWVL","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4207","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-15T19:15:18Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"fc087fb0c529a823829b00ec459951c8038e50544d3db7c5175dad843d802a1c","abstract_canon_sha256":"0dea38e6577eb5a392f5e6b9d980b4727225b8f8c28ab139374e58d7bcfb8b76"},"schema_version":"1.0"},"canonical_sha256":"0dfc299f95136b5a9ef8b7d8426a36aac4d9cd792610731e2604cbe56f8726c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:55.161627Z","signature_b64":"muzivM+iqB4udNkvlaosEqAeH43MCPEqZFT/igRFsfwoAH6TWnAI9mlNm87388qFnAV/d4cWjLWMRlOVL10cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dfc299f95136b5a9ef8b7d8426a36aac4d9cd792610731e2604cbe56f8726c9","last_reissued_at":"2026-05-18T03:27:55.160869Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:55.160869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4207","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-18T03:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohDRJqOx5/8nYYIMiOlhpTmM2SLGaFQe/ICULT7dL4fdEhW74MNWUoXgQEXi20KFZ/pJEw1zygbwp3vkBvTPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:27:38.529131Z"},"content_sha256":"f071f67ab41bfa27a102e11bfa67af138921f463c9f19c70f7061e79496267f2","schema_version":"1.0","event_id":"sha256:f071f67ab41bfa27a102e11bfa67af138921f463c9f19c70f7061e79496267f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BX6CTH4VCNVVVHXYW7MEE2RWVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"D\\'aniel Marx, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2013-04-15T19:15:18Z","abstract_excerpt":"Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from s_i to t_i. Schrijver [SICOMP'94] proved that the k-Vertex-Disjoint Paths problem on planar directed graphs can be solved in time n^{O(k)}. We give an algorithm with running time 2^{2^{O(k^2)}} n^{O(1)} for the problem, that is, we show the fixed-parameter tractability of the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4207","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-18T03:27:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCxqNRWIaWV+H4XIMJ/jna5qETKR3iJpsWWE5yye+Wf+bQtBqjZR9KsrctVv0WIGgYJ6lQt3nxgxm0ZGzp2lBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T20:27:38.529836Z"},"content_sha256":"88d8cd5c3464554ef1fa642349b7d041e3f5e8b587ff07bc3f1868c44fbc306c","schema_version":"1.0","event_id":"sha256:88d8cd5c3464554ef1fa642349b7d041e3f5e8b587ff07bc3f1868c44fbc306c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/bundle.json","state_url":"https://pith.science/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/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-18T20:27:38Z","links":{"resolver":"https://pith.science/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL","bundle":"https://pith.science/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/bundle.json","state":"https://pith.science/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BX6CTH4VCNVVVHXYW7MEE2RWVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BX6CTH4VCNVVVHXYW7MEE2RWVL","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":"0dea38e6577eb5a392f5e6b9d980b4727225b8f8c28ab139374e58d7bcfb8b76","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-15T19:15:18Z","title_canon_sha256":"fc087fb0c529a823829b00ec459951c8038e50544d3db7c5175dad843d802a1c"},"schema_version":"1.0","source":{"id":"1304.4207","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4207","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4207v1","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4207","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"BX6CTH4VCNVV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BX6CTH4VCNVVVHXY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BX6CTH4V","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:88d8cd5c3464554ef1fa642349b7d041e3f5e8b587ff07bc3f1868c44fbc306c","target":"graph","created_at":"2026-05-18T03:27:55Z","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":"Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from s_i to t_i. Schrijver [SICOMP'94] proved that the k-Vertex-Disjoint Paths problem on planar directed graphs can be solved in time n^{O(k)}. We give an algorithm with running time 2^{2^{O(k^2)}} n^{O(1)} for the problem, that is, we show the fixed-parameter tractability of the problem.","authors_text":"D\\'aniel Marx, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-15T19:15:18Z","title":"The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4207","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:f071f67ab41bfa27a102e11bfa67af138921f463c9f19c70f7061e79496267f2","target":"record","created_at":"2026-05-18T03:27:55Z","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":"0dea38e6577eb5a392f5e6b9d980b4727225b8f8c28ab139374e58d7bcfb8b76","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-04-15T19:15:18Z","title_canon_sha256":"fc087fb0c529a823829b00ec459951c8038e50544d3db7c5175dad843d802a1c"},"schema_version":"1.0","source":{"id":"1304.4207","kind":"arxiv","version":1}},"canonical_sha256":"0dfc299f95136b5a9ef8b7d8426a36aac4d9cd792610731e2604cbe56f8726c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dfc299f95136b5a9ef8b7d8426a36aac4d9cd792610731e2604cbe56f8726c9","first_computed_at":"2026-05-18T03:27:55.160869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:55.160869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"muzivM+iqB4udNkvlaosEqAeH43MCPEqZFT/igRFsfwoAH6TWnAI9mlNm87388qFnAV/d4cWjLWMRlOVL10cAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:55.161627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4207","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f071f67ab41bfa27a102e11bfa67af138921f463c9f19c70f7061e79496267f2","sha256:88d8cd5c3464554ef1fa642349b7d041e3f5e8b587ff07bc3f1868c44fbc306c"],"state_sha256":"db77e12a34cfc62cf47a5d1331f35d0dbd88d9997296a3289b69338d620e45b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCpZ0UK/2MzQUJJzIyz4BU+3rJXrVhUt5jlBBq4Z9MS0TQ9hY9apKOOdpAsHawz5PQzcnuhot17sEsnxs4GtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T20:27:38.532062Z","bundle_sha256":"ddbdafde45c654933850e56c149f1ebec0655dae49f07f751c209a6db6ff1616"}}