{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GGER3NZSSM5HUTC5HUQQBS4NC4","short_pith_number":"pith:GGER3NZS","schema_version":"1.0","canonical_sha256":"31891db732933a7a4c5d3d2100cb8d173e54a92a409b6159fd69f5211361c2ba","source":{"kind":"arxiv","id":"1410.7049","version":1},"attestation_state":"computed","paper":{"title":"The Strong EH-Property and the Erd\\H{o}s-Hajnal Conjecture","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:41:01Z","abstract_excerpt":"The Erd\\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\\epsilon(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)|^{\\epsilon(H)}$. The Conjecture is still open. Some time ago its directed version was formulated (see:\\cite{alon}). In the directed version graphs are replaced by tournaments, and cliques and stable sets by transitive subtournaments. If the Conjecture is not true then the smallest counterexample is a prime tournament. For a long time the Conjecture was known only for"},"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":"1410.7049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-26T15:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"c63249844daff28da8637d8e23b408d22fabc47767e26edee57102f27d5d9cf6","abstract_canon_sha256":"ef93205b22eea61f9040d1a6ab445a3c50cf9964ff4a6c907d870b00aec0e22a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.101936Z","signature_b64":"7nHObKLX/WfUNnMdM2+XdgRQRex2KT4pyMgKv/lhSKfz4yHaoxHU4+9XX3W4wcfdzxfW7EgGXSkAhIbn7eIsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31891db732933a7a4c5d3d2100cb8d173e54a92a409b6159fd69f5211361c2ba","last_reissued_at":"2026-05-18T02:39:18.100935Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.100935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Strong EH-Property and the Erd\\H{o}s-Hajnal Conjecture","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:41:01Z","abstract_excerpt":"The Erd\\H{o}s-Hajnal Conjecture states that for every $H$ there exists a constant $\\epsilon(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)|^{\\epsilon(H)}$. The Conjecture is still open. Some time ago its directed version was formulated (see:\\cite{alon}). In the directed version graphs are replaced by tournaments, and cliques and stable sets by transitive subtournaments. If the Conjecture is not true then the smallest counterexample is a prime tournament. For a long time the Conjecture was known only for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7049","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.7049","created_at":"2026-05-18T02:39:18.101479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7049v1","created_at":"2026-05-18T02:39:18.101479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7049","created_at":"2026-05-18T02:39:18.101479+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGER3NZSSM5H","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGER3NZSSM5HUTC5","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGER3NZS","created_at":"2026-05-18T12:28:30.664211+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/GGER3NZSSM5HUTC5HUQQBS4NC4","json":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4.json","graph_json":"https://pith.science/api/pith-number/GGER3NZSSM5HUTC5HUQQBS4NC4/graph.json","events_json":"https://pith.science/api/pith-number/GGER3NZSSM5HUTC5HUQQBS4NC4/events.json","paper":"https://pith.science/paper/GGER3NZS"},"agent_actions":{"view_html":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4","download_json":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4.json","view_paper":"https://pith.science/paper/GGER3NZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7049&json=true","fetch_graph":"https://pith.science/api/pith-number/GGER3NZSSM5HUTC5HUQQBS4NC4/graph.json","fetch_events":"https://pith.science/api/pith-number/GGER3NZSSM5HUTC5HUQQBS4NC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4/action/storage_attestation","attest_author":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4/action/author_attestation","sign_citation":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4/action/citation_signature","submit_replication":"https://pith.science/pith/GGER3NZSSM5HUTC5HUQQBS4NC4/action/replication_record"}},"created_at":"2026-05-18T02:39:18.101479+00:00","updated_at":"2026-05-18T02:39:18.101479+00:00"}