{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MXFKX24GBTHIG4HFHYCHQTAXMC","short_pith_number":"pith:MXFKX24G","canonical_record":{"source":{"id":"1504.00185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-01T11:36:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2abd156fba7a56173eb6857aa3947cb5d7f2a545770148ae2ec427cf30ffaa8","abstract_canon_sha256":"6faf5dba706a3b3ab1c5403c011ce0f2303d6009909892c4d0e95cf1b59428ec"},"schema_version":"1.0"},"canonical_sha256":"65caabeb860cce8370e53e04784c17608d2363ae263a56cd9bb4187a900e119f","source":{"kind":"arxiv","id":"1504.00185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00185","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00185v1","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00185","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"MXFKX24GBTHI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXFKX24GBTHIG4HF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXFKX24G","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MXFKX24GBTHIG4HFHYCHQTAXMC","target":"record","payload":{"canonical_record":{"source":{"id":"1504.00185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-01T11:36:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2abd156fba7a56173eb6857aa3947cb5d7f2a545770148ae2ec427cf30ffaa8","abstract_canon_sha256":"6faf5dba706a3b3ab1c5403c011ce0f2303d6009909892c4d0e95cf1b59428ec"},"schema_version":"1.0"},"canonical_sha256":"65caabeb860cce8370e53e04784c17608d2363ae263a56cd9bb4187a900e119f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:44.327942Z","signature_b64":"N1vFmTei4oU+4581Tn2TuFb3Zgfn+EA38xHVaQRwtF6LHN5LUs7ZCW/Nr57C6jZ8UsmdI1Ws2eeg9fEQ5MWeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65caabeb860cce8370e53e04784c17608d2363ae263a56cd9bb4187a900e119f","last_reissued_at":"2026-05-18T02:19:44.327426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:44.327426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.00185","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-18T02:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iDmYOdF93rjfKWKUHufx+nqYx5lJPIJ/+lXag+NLbrZAAHieyj2MV/g04eM9Z3LwtnnumpRLCWcOL8hSQ8PYCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:08:17.209745Z"},"content_sha256":"92171487dd9c0646795b89defb2995f9295d00964c0d1db04f4916bc8a4fefe9","schema_version":"1.0","event_id":"sha256:92171487dd9c0646795b89defb2995f9295d00964c0d1db04f4916bc8a4fefe9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MXFKX24GBTHIG4HFHYCHQTAXMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding k partially disjoint paths in a directed planar graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Alexander Schrijver","submitted_at":"2015-04-01T11:36:09Z","abstract_excerpt":"The {\\it partially disjoint paths problem} is: {\\it given:} a directed graph, vertices $r_1,s_1,\\ldots,r_k,s_k$, and a set $F$ of pairs $\\{i,j\\}$ from $\\{1,\\ldots,k\\}$, {\\it find:} for each $i=1,\\ldots,k$ a directed $r_i-s_i$ path $P_i$ such that if $\\{i,j\\}\\in F$ then $P_i$ and $P_j$ are disjoint.\n  We show that for fixed $k$, this problem is solvable in polynomial time if the directed graph is planar. More generally, the problem is solvable in polynomial time for directed graphs embedded on a fixed compact surface. Moreover, one may specify for each edge a subset of $\\{1,\\ldots,k\\}$ prescrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00185","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-18T02:19:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UkUkYLkHEJrYy58ieB+mwGADAwJWVtCOdv46wlz7vGk83y2ST+j9wZx4TIWfVbCOtsa1yVK7l5qs2CZuT3zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:08:17.210085Z"},"content_sha256":"188fd0d5b6b3e6d98e2da57a91007920fe3385045ff56c6944ae9d6f52aad770","schema_version":"1.0","event_id":"sha256:188fd0d5b6b3e6d98e2da57a91007920fe3385045ff56c6944ae9d6f52aad770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/bundle.json","state_url":"https://pith.science/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/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-27T14:08:17Z","links":{"resolver":"https://pith.science/pith/MXFKX24GBTHIG4HFHYCHQTAXMC","bundle":"https://pith.science/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/bundle.json","state":"https://pith.science/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXFKX24GBTHIG4HFHYCHQTAXMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MXFKX24GBTHIG4HFHYCHQTAXMC","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":"6faf5dba706a3b3ab1c5403c011ce0f2303d6009909892c4d0e95cf1b59428ec","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-01T11:36:09Z","title_canon_sha256":"f2abd156fba7a56173eb6857aa3947cb5d7f2a545770148ae2ec427cf30ffaa8"},"schema_version":"1.0","source":{"id":"1504.00185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.00185","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"arxiv_version","alias_value":"1504.00185v1","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00185","created_at":"2026-05-18T02:19:44Z"},{"alias_kind":"pith_short_12","alias_value":"MXFKX24GBTHI","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXFKX24GBTHIG4HF","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXFKX24G","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:188fd0d5b6b3e6d98e2da57a91007920fe3385045ff56c6944ae9d6f52aad770","target":"graph","created_at":"2026-05-18T02:19:44Z","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 {\\it partially disjoint paths problem} is: {\\it given:} a directed graph, vertices $r_1,s_1,\\ldots,r_k,s_k$, and a set $F$ of pairs $\\{i,j\\}$ from $\\{1,\\ldots,k\\}$, {\\it find:} for each $i=1,\\ldots,k$ a directed $r_i-s_i$ path $P_i$ such that if $\\{i,j\\}\\in F$ then $P_i$ and $P_j$ are disjoint.\n  We show that for fixed $k$, this problem is solvable in polynomial time if the directed graph is planar. More generally, the problem is solvable in polynomial time for directed graphs embedded on a fixed compact surface. Moreover, one may specify for each edge a subset of $\\{1,\\ldots,k\\}$ prescrib","authors_text":"Alexander Schrijver","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-01T11:36:09Z","title":"Finding k partially disjoint paths in a directed planar graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00185","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:92171487dd9c0646795b89defb2995f9295d00964c0d1db04f4916bc8a4fefe9","target":"record","created_at":"2026-05-18T02:19:44Z","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":"6faf5dba706a3b3ab1c5403c011ce0f2303d6009909892c4d0e95cf1b59428ec","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-01T11:36:09Z","title_canon_sha256":"f2abd156fba7a56173eb6857aa3947cb5d7f2a545770148ae2ec427cf30ffaa8"},"schema_version":"1.0","source":{"id":"1504.00185","kind":"arxiv","version":1}},"canonical_sha256":"65caabeb860cce8370e53e04784c17608d2363ae263a56cd9bb4187a900e119f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65caabeb860cce8370e53e04784c17608d2363ae263a56cd9bb4187a900e119f","first_computed_at":"2026-05-18T02:19:44.327426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:44.327426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N1vFmTei4oU+4581Tn2TuFb3Zgfn+EA38xHVaQRwtF6LHN5LUs7ZCW/Nr57C6jZ8UsmdI1Ws2eeg9fEQ5MWeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:44.327942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.00185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92171487dd9c0646795b89defb2995f9295d00964c0d1db04f4916bc8a4fefe9","sha256:188fd0d5b6b3e6d98e2da57a91007920fe3385045ff56c6944ae9d6f52aad770"],"state_sha256":"bd6a3966d880a288e6147c3f1f40792e967f94b0759de5cfcf4973796746d4f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XDqR4mIAGC9fzBk4LprKfNqFnffImQBWD7fyV/57uj0dQyBTP3OqhIgBaNJiweoTZ9GZYJx19SdErDAAMq7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:08:17.212336Z","bundle_sha256":"5db7db1eed57cdaa4b993ec834df8ad1d3606c9bec099f4496cb985cbac5a340"}}