{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BBPPG43FPVRSP4K6KVMWPZIBF7","short_pith_number":"pith:BBPPG43F","canonical_record":{"source":{"id":"1411.6226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-23T11:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"47c30f264cb7b45e4d1248552faa7b7d3a4933b958ac30dd866d50793da4227c","abstract_canon_sha256":"cb0e823b5b108290b86284aa2348e94a3aaed09230a4025edba35a4c85595e40"},"schema_version":"1.0"},"canonical_sha256":"085ef373657d6327f15e555967e5012fcc300d36881bb0868e8d593bf3e465b0","source":{"kind":"arxiv","id":"1411.6226","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6226","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6226v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6226","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"BBPPG43FPVRS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BBPPG43FPVRSP4K6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BBPPG43F","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BBPPG43FPVRSP4K6KVMWPZIBF7","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-23T11:17:38Z","cross_cats_sorted":[],"title_canon_sha256":"47c30f264cb7b45e4d1248552faa7b7d3a4933b958ac30dd866d50793da4227c","abstract_canon_sha256":"cb0e823b5b108290b86284aa2348e94a3aaed09230a4025edba35a4c85595e40"},"schema_version":"1.0"},"canonical_sha256":"085ef373657d6327f15e555967e5012fcc300d36881bb0868e8d593bf3e465b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:00.458083Z","signature_b64":"PTj3BsBdGuKodi2BDGGADViybIJwQEZr7AsHvOKfEufuPcK+ddrI443QOlSyQBOrbqMwesj9PmdqASIs0AZ5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"085ef373657d6327f15e555967e5012fcc300d36881bb0868e8d593bf3e465b0","last_reissued_at":"2026-05-18T02:33:00.457754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:00.457754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6226","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CntnmrQCoVAc6te1I6WY7uRvk0M5a80al5jPRzdEPzoRNyu1fT5Y0BNam9LrE5pimUL6O6N6Z8JsFbtmO6QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:27:49.141197Z"},"content_sha256":"07ab0177d47b6856716fd675051170a22b4b6018f0df5a341327bef976afda17","schema_version":"1.0","event_id":"sha256:07ab0177d47b6856716fd675051170a22b4b6018f0df5a341327bef976afda17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BBPPG43FPVRSP4K6KVMWPZIBF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disjoint paths in tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","submitted_at":"2014-11-23T11:17:38Z","abstract_excerpt":"Given $k$ pairs of vertices $(s_i,t_i)$, $1\\le i\\le k$, of a digraph $G$, how can we test whether there exist $k$ vertex-disjoint directed paths from $s_i$ to $t_i$ for $1\\le i\\le k$? This is NP-complete in general digraphs, even for $k = 2$, but for $k=2$ there is a polynomial-time algorithm when $G$ is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen. Here we prove that for all fixed $k$ there is a polynomial-time algorithm to solve the problem when $G$ is semicomplete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6226","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:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NpArP7v/Kag6v9uvTAw/jh05pOEt2chkfMKi8C7bxYNHLakPaWKRkg5KEryf2YOhFGF+koWGYMfEPPwwou6DCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:27:49.141556Z"},"content_sha256":"93ba62734ac877a1585d8e15513acccee1e2404e753fe4fad8a9a5ed93c80f32","schema_version":"1.0","event_id":"sha256:93ba62734ac877a1585d8e15513acccee1e2404e753fe4fad8a9a5ed93c80f32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/bundle.json","state_url":"https://pith.science/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/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-28T02:27:49Z","links":{"resolver":"https://pith.science/pith/BBPPG43FPVRSP4K6KVMWPZIBF7","bundle":"https://pith.science/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/bundle.json","state":"https://pith.science/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BBPPG43FPVRSP4K6KVMWPZIBF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BBPPG43FPVRSP4K6KVMWPZIBF7","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":"cb0e823b5b108290b86284aa2348e94a3aaed09230a4025edba35a4c85595e40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-23T11:17:38Z","title_canon_sha256":"47c30f264cb7b45e4d1248552faa7b7d3a4933b958ac30dd866d50793da4227c"},"schema_version":"1.0","source":{"id":"1411.6226","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6226","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6226v1","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6226","created_at":"2026-05-18T02:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"BBPPG43FPVRS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BBPPG43FPVRSP4K6","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BBPPG43F","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:93ba62734ac877a1585d8e15513acccee1e2404e753fe4fad8a9a5ed93c80f32","target":"graph","created_at":"2026-05-18T02:33:00Z","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 $k$ pairs of vertices $(s_i,t_i)$, $1\\le i\\le k$, of a digraph $G$, how can we test whether there exist $k$ vertex-disjoint directed paths from $s_i$ to $t_i$ for $1\\le i\\le k$? This is NP-complete in general digraphs, even for $k = 2$, but for $k=2$ there is a polynomial-time algorithm when $G$ is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen. Here we prove that for all fixed $k$ there is a polynomial-time algorithm to solve the problem when $G$ is semicomplete.","authors_text":"Alex Scott, Maria Chudnovsky, Paul Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-23T11:17:38Z","title":"Disjoint paths in tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6226","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:07ab0177d47b6856716fd675051170a22b4b6018f0df5a341327bef976afda17","target":"record","created_at":"2026-05-18T02:33:00Z","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":"cb0e823b5b108290b86284aa2348e94a3aaed09230a4025edba35a4c85595e40","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-23T11:17:38Z","title_canon_sha256":"47c30f264cb7b45e4d1248552faa7b7d3a4933b958ac30dd866d50793da4227c"},"schema_version":"1.0","source":{"id":"1411.6226","kind":"arxiv","version":1}},"canonical_sha256":"085ef373657d6327f15e555967e5012fcc300d36881bb0868e8d593bf3e465b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"085ef373657d6327f15e555967e5012fcc300d36881bb0868e8d593bf3e465b0","first_computed_at":"2026-05-18T02:33:00.457754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:33:00.457754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTj3BsBdGuKodi2BDGGADViybIJwQEZr7AsHvOKfEufuPcK+ddrI443QOlSyQBOrbqMwesj9PmdqASIs0AZ5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:33:00.458083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6226","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07ab0177d47b6856716fd675051170a22b4b6018f0df5a341327bef976afda17","sha256:93ba62734ac877a1585d8e15513acccee1e2404e753fe4fad8a9a5ed93c80f32"],"state_sha256":"7be7e94843896946931228bf0c855825ff2df22794fdc581a05ef697541dc2bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q73ayyxzjoX4FsbDRMz+7+dr0CG8k/Flq1mdLHHwULa2Usb+5z2j/kHIcfZqPnn8hYcjt1iC1w4UHAgCtUwfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:27:49.143443Z","bundle_sha256":"9ee57ecdf8d500d549a399487f9cdb42a217199303bc95dc8b8d9008e277a2f5"}}