{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FNUNJKI73B56MWH7K3Z3CZUZBR","short_pith_number":"pith:FNUNJKI7","canonical_record":{"source":{"id":"1411.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T12:07:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"02ff9a4e531c1eddc533b3a40acf90f0bcf3ef9afab7a0cedab593b2325d59fd","abstract_canon_sha256":"fd30a3bfba8e32d521e8b1dd249848d5cfd80a35f0e8030a01cc211ef1e1fddb"},"schema_version":"1.0"},"canonical_sha256":"2b68d4a91fd87be658ff56f3b166990c43390c27b524094de88d3b39027e71cc","source":{"kind":"arxiv","id":"1411.0871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0871","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0871v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0871","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"FNUNJKI73B56","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNUNJKI73B56MWH7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNUNJKI7","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FNUNJKI73B56MWH7K3Z3CZUZBR","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T12:07:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"02ff9a4e531c1eddc533b3a40acf90f0bcf3ef9afab7a0cedab593b2325d59fd","abstract_canon_sha256":"fd30a3bfba8e32d521e8b1dd249848d5cfd80a35f0e8030a01cc211ef1e1fddb"},"schema_version":"1.0"},"canonical_sha256":"2b68d4a91fd87be658ff56f3b166990c43390c27b524094de88d3b39027e71cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.034272Z","signature_b64":"V/HTzHeXG/t/XmJUMJWDEh7X0MQIQh+h0YaR3HXAhORx/H4orS6Fg5/niXau0Gu/HS/2zUxfO/RLyvTLd0xHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b68d4a91fd87be658ff56f3b166990c43390c27b524094de88d3b39027e71cc","last_reissued_at":"2026-05-18T02:38:38.033802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.033802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0871","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZDSHUSrD8GCo53JI0Eidbxulb7YvQqliZtyx3utkOYlFTXw2I8h6+i6um8p/Gj4P9+mR9OGCh2BtewFR1a9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:28:22.504438Z"},"content_sha256":"c701fcaf48fb22d32e0b5e7eb930190cae47660b74dae4e0aaf95fd4bc6bb16b","schema_version":"1.0","event_id":"sha256:c701fcaf48fb22d32e0b5e7eb930190cae47660b74dae4e0aaf95fd4bc6bb16b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FNUNJKI73B56MWH7K3Z3CZUZBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An exact characterization of tractable demand patterns for maximum disjoint path problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Paul Wollan","submitted_at":"2014-11-04T12:07:03Z","abstract_excerpt":"We study the following general disjoint paths problem: given a supply graph $G$, a set $T\\subseteq V(G)$ of terminals, a demand graph $H$ on the vertices $T$, and an integer $k$, the task is to find a set of $k$ pairwise vertex-disjoint valid paths, where we say that a path of the supply graph $G$ is valid if its endpoints are in $T$ and adjacent in the demand graph $H$. For a class $\\mathcal{H}$ of graphs, we denote by $\\mathcal{H}$-Maximum Disjoint Paths the restriction of this problem when the demand graph $H$ is assumed to be a member of $\\mathcal{H}$. We study the fixed-parameter tractabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0871","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYTg2o6BOe0lDipwh1Q5nWWmbUF1jcsZ/yYjDLy0Cy4j72+v53e4JWX82oKEXdt0LFqQD8CPkdrPFX0/3fdZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:28:22.505090Z"},"content_sha256":"dfb8f5e1844bf3a20994b377ddce29d742c9acdcdb9dae4b6cabeeb91c1ee097","schema_version":"1.0","event_id":"sha256:dfb8f5e1844bf3a20994b377ddce29d742c9acdcdb9dae4b6cabeeb91c1ee097"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/bundle.json","state_url":"https://pith.science/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/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-30T05:28:22Z","links":{"resolver":"https://pith.science/pith/FNUNJKI73B56MWH7K3Z3CZUZBR","bundle":"https://pith.science/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/bundle.json","state":"https://pith.science/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNUNJKI73B56MWH7K3Z3CZUZBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FNUNJKI73B56MWH7K3Z3CZUZBR","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":"fd30a3bfba8e32d521e8b1dd249848d5cfd80a35f0e8030a01cc211ef1e1fddb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T12:07:03Z","title_canon_sha256":"02ff9a4e531c1eddc533b3a40acf90f0bcf3ef9afab7a0cedab593b2325d59fd"},"schema_version":"1.0","source":{"id":"1411.0871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0871","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0871v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0871","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"FNUNJKI73B56","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FNUNJKI73B56MWH7","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FNUNJKI7","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:dfb8f5e1844bf3a20994b377ddce29d742c9acdcdb9dae4b6cabeeb91c1ee097","target":"graph","created_at":"2026-05-18T02:38:38Z","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 study the following general disjoint paths problem: given a supply graph $G$, a set $T\\subseteq V(G)$ of terminals, a demand graph $H$ on the vertices $T$, and an integer $k$, the task is to find a set of $k$ pairwise vertex-disjoint valid paths, where we say that a path of the supply graph $G$ is valid if its endpoints are in $T$ and adjacent in the demand graph $H$. For a class $\\mathcal{H}$ of graphs, we denote by $\\mathcal{H}$-Maximum Disjoint Paths the restriction of this problem when the demand graph $H$ is assumed to be a member of $\\mathcal{H}$. We study the fixed-parameter tractabi","authors_text":"D\\'aniel Marx, Paul Wollan","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T12:07:03Z","title":"An exact characterization of tractable demand patterns for maximum disjoint path problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0871","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:c701fcaf48fb22d32e0b5e7eb930190cae47660b74dae4e0aaf95fd4bc6bb16b","target":"record","created_at":"2026-05-18T02:38:38Z","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":"fd30a3bfba8e32d521e8b1dd249848d5cfd80a35f0e8030a01cc211ef1e1fddb","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-04T12:07:03Z","title_canon_sha256":"02ff9a4e531c1eddc533b3a40acf90f0bcf3ef9afab7a0cedab593b2325d59fd"},"schema_version":"1.0","source":{"id":"1411.0871","kind":"arxiv","version":1}},"canonical_sha256":"2b68d4a91fd87be658ff56f3b166990c43390c27b524094de88d3b39027e71cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b68d4a91fd87be658ff56f3b166990c43390c27b524094de88d3b39027e71cc","first_computed_at":"2026-05-18T02:38:38.033802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.033802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V/HTzHeXG/t/XmJUMJWDEh7X0MQIQh+h0YaR3HXAhORx/H4orS6Fg5/niXau0Gu/HS/2zUxfO/RLyvTLd0xHAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.034272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c701fcaf48fb22d32e0b5e7eb930190cae47660b74dae4e0aaf95fd4bc6bb16b","sha256:dfb8f5e1844bf3a20994b377ddce29d742c9acdcdb9dae4b6cabeeb91c1ee097"],"state_sha256":"6f658517f48fb327c80487ad7529567430e072e2bc1a062576f29c66db4e98bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAOrdJSz4gBUmsgPrYH+nsCEqbTLM0u73+dq5SHsNUoqgk5wSpU5oaOmC3+Pw+Tu8dkrJGF0rLqBnLFmkn51BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:28:22.508119Z","bundle_sha256":"7872e60fc9d12b64ea66983289179f05d9fc9fc9e06f5f442d3196110204128b"}}