{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XCLWDCEOYV6TJAH7IG5BFRRGQJ","short_pith_number":"pith:XCLWDCEO","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"},"canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","source":{"kind":"arxiv","id":"1604.02317","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02317","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02317v2","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02317","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"XCLWDCEOYV6T","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XCLWDCEOYV6TJAH7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XCLWDCEO","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XCLWDCEOYV6TJAH7IG5BFRRGQJ","target":"record","payload":{"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"},"canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","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"},"source_kind":"arxiv","source_id":"1604.02317","source_version":2,"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-17T23:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6V427s6IjlVp/+/ZYEyVYiXZKwMKXz+aCXOXx04RJD3UL6Rszcod2mLn8S2yQwPUzN6ijAP4j5SDkN/a9gqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:46:48.880920Z"},"content_sha256":"c990ec897e11b012d8412ca04d0dda96812df4031fc302c991611ac0a66a25f3","schema_version":"1.0","event_id":"sha256:c990ec897e11b012d8412ca04d0dda96812df4031fc302c991611ac0a66a25f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XCLWDCEOYV6TJAH7IG5BFRRGQJ","target":"graph","payload":{"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"},"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-17T23:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1qgEwgyXHYsSVmAakcAhG9KwzH+zNcSga4sr9cksheFiAbNOpuUIeGKrtU/HwlufOGZVMpdw2kfq9DYABQ6DBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:46:48.881268Z"},"content_sha256":"e846cd14f0efd510dfa98fce3bb7f441e48c664bcc135369fc3e1cb325fd6a27","schema_version":"1.0","event_id":"sha256:e846cd14f0efd510dfa98fce3bb7f441e48c664bcc135369fc3e1cb325fd6a27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/bundle.json","state_url":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/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-28T10:46:48Z","links":{"resolver":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ","bundle":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/bundle.json","state":"https://pith.science/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCLWDCEOYV6TJAH7IG5BFRRGQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XCLWDCEOYV6TJAH7IG5BFRRGQJ","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":"53e227e2239c6014dcf47a43dface543e261f0177320fd48a80c8d36ecf67c0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T11:55:23Z","title_canon_sha256":"b44de93d2196020d2205c87d97740289adc1adf267d7ca185ad9177900b88aeb"},"schema_version":"1.0","source":{"id":"1604.02317","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02317","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02317v2","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02317","created_at":"2026-05-17T23:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"XCLWDCEOYV6T","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XCLWDCEOYV6TJAH7","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XCLWDCEO","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:e846cd14f0efd510dfa98fce3bb7f441e48c664bcc135369fc3e1cb325fd6a27","target":"graph","created_at":"2026-05-17T23:57:33Z","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 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","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":"2016-04-08T11:55:23Z","title":"Disjoint paths in unions of tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02317","kind":"arxiv","version":2},"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:c990ec897e11b012d8412ca04d0dda96812df4031fc302c991611ac0a66a25f3","target":"record","created_at":"2026-05-17T23:57:33Z","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":"53e227e2239c6014dcf47a43dface543e261f0177320fd48a80c8d36ecf67c0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-08T11:55:23Z","title_canon_sha256":"b44de93d2196020d2205c87d97740289adc1adf267d7ca185ad9177900b88aeb"},"schema_version":"1.0","source":{"id":"1604.02317","kind":"arxiv","version":2}},"canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b89761888ec57d3480ff41ba12c626824c32c3c9dba5032a2b49beb84d6a897c","first_computed_at":"2026-05-17T23:57:33.201823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:33.201823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dBumvVAEWVtfh0B/T2O30SQUIXFO9qisGZp63DFUl9Hk0ZocYuN7OTas/inrEsnNS6EA7glhWDzxGbLI+k5/Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:33.202257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02317","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c990ec897e11b012d8412ca04d0dda96812df4031fc302c991611ac0a66a25f3","sha256:e846cd14f0efd510dfa98fce3bb7f441e48c664bcc135369fc3e1cb325fd6a27"],"state_sha256":"ab2f6c4d71a44388269dd1b45c4ba46201db7e26382b5c4fda308ce4d84146e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyhJac4T1KB9xDeqntTXGXDpN8OIogmuTp7kh3gVaQxvbaoYCS5YXdF4H/8U7VuzjdCEH8Rdp8STNVYUS2kHBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:46:48.885436Z","bundle_sha256":"6c289ff780dceabbabd2786f3b6c176e4b3c63a23d467bde58cab2a741def9d9"}}