{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XCLWDCEOYV6TJAH7IG5BFRRGQJ","short_pith_number":"pith:XCLWDCEO","schema_version":"1.0","canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","source":{"kind":"arxiv","id":"1604.02317","version":2},"attestation_state":"computed","paper":{"title":"Disjoint paths in unions of 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":"2016-04-08T11:55:23Z","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 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 in an earlier paper we proved that for all fixed $k$, there is a polynomial-time algorithm to solve the problem if $G$ is a tournament (or more generally, a semicomplete digraph). Here we prove that for all fixed $k$ there is a polynomial-time algorithm to solve the problem when $V(G)$ is partitioned into a bounded number of sets each inducing a semicomple"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.02317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T11:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"b44de93d2196020d2205c87d97740289adc1adf267d7ca185ad9177900b88aeb","abstract_canon_sha256":"53e227e2239c6014dcf47a43dface543e261f0177320fd48a80c8d36ecf67c0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:33.202257Z","signature_b64":"dBumvVAEWVtfh0B/T2O30SQUIXFO9qisGZp63DFUl9Hk0ZocYuN7OTas/inrEsnNS6EA7glhWDzxGbLI+k5/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","last_reissued_at":"2026-05-17T23:57:33.201823Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:33.201823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint paths in unions of 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":"2016-04-08T11:55:23Z","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 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 in an earlier paper we proved that for all fixed $k$, there is a polynomial-time algorithm to solve the problem if $G$ is a tournament (or more generally, a semicomplete digraph). Here we prove that for all fixed $k$ there is a polynomial-time algorithm to solve the problem when $V(G)$ is partitioned into a bounded number of sets each inducing a semicomple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02317","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.02317","created_at":"2026-05-17T23:57:33.201891+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02317v2","created_at":"2026-05-17T23:57:33.201891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02317","created_at":"2026-05-17T23:57:33.201891+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCLWDCEOYV6T","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCLWDCEOYV6TJAH7","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCLWDCEO","created_at":"2026-05-18T12:30:51.357362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ","json":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ.json","graph_json":"https://pith.science/api/pith-number/XCLWDCEOYV6TJAH7IG5BFRRGQJ/graph.json","events_json":"https://pith.science/api/pith-number/XCLWDCEOYV6TJAH7IG5BFRRGQJ/events.json","paper":"https://pith.science/paper/XCLWDCEO"},"agent_actions":{"view_html":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ","download_json":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ.json","view_paper":"https://pith.science/paper/XCLWDCEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02317&json=true","fetch_graph":"https://pith.science/api/pith-number/XCLWDCEOYV6TJAH7IG5BFRRGQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XCLWDCEOYV6TJAH7IG5BFRRGQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/action/storage_attestation","attest_author":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/action/author_attestation","sign_citation":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/action/citation_signature","submit_replication":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/action/replication_record"}},"created_at":"2026-05-17T23:57:33.201891+00:00","updated_at":"2026-05-17T23:57:33.201891+00:00"}