{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HHCC3UI7VLGSDE53BIJ5G5SRMC","short_pith_number":"pith:HHCC3UI7","canonical_record":{"source":{"id":"1410.7044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"876e59e4251fd405539ba46c1f53737122b2ab8239eab03dcce001ae2ff9c52a","abstract_canon_sha256":"fec5a4ee588d63d245dca4a16b487ca8e1f193176882cee196e7da52041600bc"},"schema_version":"1.0"},"canonical_sha256":"39c42dd11faacd2193bb0a13d3765160a02467ab29fa77c89177af98c1b049e5","source":{"kind":"arxiv","id":"1410.7044","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7044","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7044v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7044","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"HHCC3UI7VLGS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHCC3UI7VLGSDE53","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHCC3UI7","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HHCC3UI7VLGSDE53BIJ5G5SRMC","target":"record","payload":{"canonical_record":{"source":{"id":"1410.7044","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:20:50Z","cross_cats_sorted":[],"title_canon_sha256":"876e59e4251fd405539ba46c1f53737122b2ab8239eab03dcce001ae2ff9c52a","abstract_canon_sha256":"fec5a4ee588d63d245dca4a16b487ca8e1f193176882cee196e7da52041600bc"},"schema_version":"1.0"},"canonical_sha256":"39c42dd11faacd2193bb0a13d3765160a02467ab29fa77c89177af98c1b049e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.127147Z","signature_b64":"RJp5741EvazL6P+CdiM5f/Qp46Tw4N7dz4KAJInpm0XYekEfajJEL7Sp3A84/NTzVj18At9oKBVfS4fYMozBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39c42dd11faacd2193bb0a13d3765160a02467ab29fa77c89177af98c1b049e5","last_reissued_at":"2026-05-18T02:39:18.126688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.126688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.7044","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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+f051W8N4feqOz6rt25epwkzF7ps1KGWowLjqlG9MzDNhR9KxG2ckTRSiw0a9/Y08xwPafRSZKPM4XHsC/4bDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:45:33.244075Z"},"content_sha256":"ae6112c270b4a0507a34ee3cda2751d267a467f4580a049cd5e65d11716e7b23","schema_version":"1.0","event_id":"sha256:ae6112c270b4a0507a34ee3cda2751d267a467f4580a049cd5e65d11716e7b23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HHCC3UI7VLGSDE53BIJ5G5SRMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluding pairs of tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Krzysztof Choromanski","submitted_at":"2014-10-26T15:20:50Z","abstract_excerpt":"The Erd\\H{o}s-Hajnal conjecture states that for every given undirected graph $H$ there exists a constant $c(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least $|V(G)|^{c(H)}$. The conjecture is still open. Its equivalent directed version states that for every given tournament $H$ there exists a constant $c(H)>0$ such that every $H$-free tournament $T$ contains a transitive subtournament of order at least $|V(T)|^{c(H)}$. We prove in this paper that $\\{H_{1},H_{2}\\}$-free tournaments $T$ contain transitive subtourn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7044","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:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qsXGhI7b71IVlZD9Ix8xMiYS6yBtaSsvklKhBR8sziHgEhmfI5MMe4tmaM+tI7NPmKm39qD9tpAmR7VL3IU7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:45:33.244744Z"},"content_sha256":"ee1004ff53f7bb52002687cc393f6876f3ee9e83976c5e36ab5683d820efc147","schema_version":"1.0","event_id":"sha256:ee1004ff53f7bb52002687cc393f6876f3ee9e83976c5e36ab5683d820efc147"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/bundle.json","state_url":"https://pith.science/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/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-06-12T09:45:33Z","links":{"resolver":"https://pith.science/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC","bundle":"https://pith.science/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/bundle.json","state":"https://pith.science/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHCC3UI7VLGSDE53BIJ5G5SRMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HHCC3UI7VLGSDE53BIJ5G5SRMC","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":"fec5a4ee588d63d245dca4a16b487ca8e1f193176882cee196e7da52041600bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:20:50Z","title_canon_sha256":"876e59e4251fd405539ba46c1f53737122b2ab8239eab03dcce001ae2ff9c52a"},"schema_version":"1.0","source":{"id":"1410.7044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.7044","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1410.7044v1","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7044","created_at":"2026-05-18T02:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"HHCC3UI7VLGS","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HHCC3UI7VLGSDE53","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HHCC3UI7","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:ee1004ff53f7bb52002687cc393f6876f3ee9e83976c5e36ab5683d820efc147","target":"graph","created_at":"2026-05-18T02:39:18Z","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":"The Erd\\H{o}s-Hajnal conjecture states that for every given undirected graph $H$ there exists a constant $c(H)>0$ such that every graph $G$ that does not contain $H$ as an induced subgraph contains a clique or a stable set of size at least $|V(G)|^{c(H)}$. The conjecture is still open. Its equivalent directed version states that for every given tournament $H$ there exists a constant $c(H)>0$ such that every $H$-free tournament $T$ contains a transitive subtournament of order at least $|V(T)|^{c(H)}$. We prove in this paper that $\\{H_{1},H_{2}\\}$-free tournaments $T$ contain transitive subtourn","authors_text":"Krzysztof Choromanski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:20:50Z","title":"Excluding pairs of tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7044","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:ae6112c270b4a0507a34ee3cda2751d267a467f4580a049cd5e65d11716e7b23","target":"record","created_at":"2026-05-18T02:39:18Z","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":"fec5a4ee588d63d245dca4a16b487ca8e1f193176882cee196e7da52041600bc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:20:50Z","title_canon_sha256":"876e59e4251fd405539ba46c1f53737122b2ab8239eab03dcce001ae2ff9c52a"},"schema_version":"1.0","source":{"id":"1410.7044","kind":"arxiv","version":1}},"canonical_sha256":"39c42dd11faacd2193bb0a13d3765160a02467ab29fa77c89177af98c1b049e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39c42dd11faacd2193bb0a13d3765160a02467ab29fa77c89177af98c1b049e5","first_computed_at":"2026-05-18T02:39:18.126688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:18.126688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJp5741EvazL6P+CdiM5f/Qp46Tw4N7dz4KAJInpm0XYekEfajJEL7Sp3A84/NTzVj18At9oKBVfS4fYMozBAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:18.127147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.7044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae6112c270b4a0507a34ee3cda2751d267a467f4580a049cd5e65d11716e7b23","sha256:ee1004ff53f7bb52002687cc393f6876f3ee9e83976c5e36ab5683d820efc147"],"state_sha256":"14d7663c27f9670fac1c328ced8c0016883fe8db2403677a3b676253346e616e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PjpXp8dxNy3a5s7oXpVINpZUZal0K/MK5G70uEt3uAxts74nCVGJfEQFzP3DI8HnBue4tSQAXoCbnbIl+Q59DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:45:33.248926Z","bundle_sha256":"cddb92f9c7b374dcead92d1db687bd8aeea68fe6b350dd2476cb323efce27282"}}