{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LMFV67EFSHUIAW3FK4SIO3JJTK","short_pith_number":"pith:LMFV67EF","schema_version":"1.0","canonical_sha256":"5b0b5f7c8591e8805b655724876d299a814563fda1cdb983456406e0e4abc9d6","source":{"kind":"arxiv","id":"1411.1533","version":3},"attestation_state":"computed","paper":{"title":"Bipartitions of highly connected tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim","submitted_at":"2014-11-06T08:58:23Z","abstract_excerpt":"We show that if $T$ is a strongly $10^9k^6\\log(2k)$-connected tournament, there exists a partition $A, B$ of $V(T)$ such that each of $T[A]$, $T[B]$ and $T[A,B]$ is strongly $k$-connected. This provides tournament analogues of two partition conjectures of Thomassen regarding highly connected graphs."},"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":"1411.1533","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-11-06T08:58:23Z","cross_cats_sorted":[],"title_canon_sha256":"ae0d3efea1b9f98a508173250a316b4d2054157b525e864b9e1e5e48eac6c5ac","abstract_canon_sha256":"20527c470af49b0160c61d74c05c1e79ad00e21323f3383b91e4f50c537e3777"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:11.470701Z","signature_b64":"yFmqIcdHJuqwkD3AgaLNhh0ttmb78RELqEfz3qrSTI091GMMzx7ie6evS4nqCVTa7teiGmJI++3YuDtH4PuOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b0b5f7c8591e8805b655724876d299a814563fda1cdb983456406e0e4abc9d6","last_reissued_at":"2026-05-18T02:28:11.470033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:11.470033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartitions of highly connected tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Jaehoon Kim","submitted_at":"2014-11-06T08:58:23Z","abstract_excerpt":"We show that if $T$ is a strongly $10^9k^6\\log(2k)$-connected tournament, there exists a partition $A, B$ of $V(T)$ such that each of $T[A]$, $T[B]$ and $T[A,B]$ is strongly $k$-connected. This provides tournament analogues of two partition conjectures of Thomassen regarding highly connected graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1533","kind":"arxiv","version":3},"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":"1411.1533","created_at":"2026-05-18T02:28:11.470136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1533v3","created_at":"2026-05-18T02:28:11.470136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1533","created_at":"2026-05-18T02:28:11.470136+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMFV67EFSHUI","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMFV67EFSHUIAW3F","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMFV67EF","created_at":"2026-05-18T12:28:38.356838+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/LMFV67EFSHUIAW3FK4SIO3JJTK","json":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK.json","graph_json":"https://pith.science/api/pith-number/LMFV67EFSHUIAW3FK4SIO3JJTK/graph.json","events_json":"https://pith.science/api/pith-number/LMFV67EFSHUIAW3FK4SIO3JJTK/events.json","paper":"https://pith.science/paper/LMFV67EF"},"agent_actions":{"view_html":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK","download_json":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK.json","view_paper":"https://pith.science/paper/LMFV67EF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1533&json=true","fetch_graph":"https://pith.science/api/pith-number/LMFV67EFSHUIAW3FK4SIO3JJTK/graph.json","fetch_events":"https://pith.science/api/pith-number/LMFV67EFSHUIAW3FK4SIO3JJTK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK/action/storage_attestation","attest_author":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK/action/author_attestation","sign_citation":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK/action/citation_signature","submit_replication":"https://pith.science/pith/LMFV67EFSHUIAW3FK4SIO3JJTK/action/replication_record"}},"created_at":"2026-05-18T02:28:11.470136+00:00","updated_at":"2026-05-18T02:28:11.470136+00:00"}