{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2RHPYTIPT3QXSVUGVUS5G4KYMK","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":"c973efc624acd7e4b1f4c1dd7d3952dd886b09ef6f4a878edb902442051bd8d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-20T14:12:26Z","title_canon_sha256":"48a2c7f6f356f278bda671621c1bac0d9694a46c2c75fd3c1d57fd828cec7ed5"},"schema_version":"1.0","source":{"id":"1508.04992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04992","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04992v1","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04992","created_at":"2026-05-18T01:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"2RHPYTIPT3QX","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2RHPYTIPT3QXSVUG","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2RHPYTIP","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:0c51c82558ca2cd7efab34065caefd6ca15b5e41bff307c19a2b5b0737863cea","target":"graph","created_at":"2026-05-18T01:35:00Z","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":"A celebrated unresolved conjecture of Erd\\H{o}s and Hajnal states that for every undirected graph $H$ there exists $\\epsilon(H)>0$ such that every undirected graph on $n$ vertices that does not contain $H$ as an induced subgraph contains a clique or stable set of size at least $n^{\\epsilon(H)}$. The conjecture has a directed equivalent version stating that for every tournament $H$ there exists $\\epsilon(H)>0$ such that every $H$-free $n$-vertex tournament $T$ contains a transitive subtournament of order at least $n^{\\epsilon(H)}$. We say that a tournament is \\textit{prime} if it does not have ","authors_text":"Eli Berger, Krzysztof Choromanski, Maria Chudnovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-20T14:12:26Z","title":"On the Erd\\H{o}s-Hajnal conjecture for six-vertex tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04992","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:42769447c378e07d171f9629e89f4a52b20936df7c298145ce8634e1ed114793","target":"record","created_at":"2026-05-18T01:35:00Z","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":"c973efc624acd7e4b1f4c1dd7d3952dd886b09ef6f4a878edb902442051bd8d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-20T14:12:26Z","title_canon_sha256":"48a2c7f6f356f278bda671621c1bac0d9694a46c2c75fd3c1d57fd828cec7ed5"},"schema_version":"1.0","source":{"id":"1508.04992","kind":"arxiv","version":1}},"canonical_sha256":"d44efc4d0f9ee1795686ad25d371586287287447d85c6986bf2871b4b335a4fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d44efc4d0f9ee1795686ad25d371586287287447d85c6986bf2871b4b335a4fb","first_computed_at":"2026-05-18T01:35:00.052158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:00.052158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MIzWJ6ip/V2NTPIUaW97/S4webtT0oArf5g2hcC3SpWw0hn7ihh8reSTGvsx83nk29u6SdJgORRzakkVOCs5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:00.052759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42769447c378e07d171f9629e89f4a52b20936df7c298145ce8634e1ed114793","sha256:0c51c82558ca2cd7efab34065caefd6ca15b5e41bff307c19a2b5b0737863cea"],"state_sha256":"8a8e174536344aa09c5eb1875a3ae69acda754d85b471ee7a4416991fe09bad1"}