{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TLCSE5PH4M3YYLYMIRQ3EFLMTW","short_pith_number":"pith:TLCSE5PH","schema_version":"1.0","canonical_sha256":"9ac52275e7e3378c2f0c4461b2156c9d8af62832f84bf516b6e835693b470a99","source":{"kind":"arxiv","id":"1606.08827","version":1},"attestation_state":"computed","paper":{"title":"The Erd\\\"os-Hajnal Conjecture---A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky","submitted_at":"2016-06-28T19:07:32Z","abstract_excerpt":"The Erd\\\"os-Hajnal conjecture states that for every graph $H$, there exists a constant $\\delta(H) > 0$ such that every graph $G$ with no induced subgraph isomorphic to $H$ has either a clique or a stable set of size at least $|V(G)|^{\\delta(H)}$. This paper is a survey of some of the known results on this conjecture."},"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":"1606.08827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-28T19:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"1cec1a572321c615044b0b0b38a44bd3f6ce8c916f69bb71ea9ed588db593ce9","abstract_canon_sha256":"8860fc3f6218ecbfa6d9b75158d537a198cb368b146b8994c57b500f1d4b8749"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:47.072030Z","signature_b64":"wLfRks8ErmPP++XWavuNI8q9Xg3TXhbBG+/E0yRdgOHoaXy6GB2QrWS1wj2oH7WnrGp12bvc0JW9cTDLdCwCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ac52275e7e3378c2f0c4461b2156c9d8af62832f84bf516b6e835693b470a99","last_reissued_at":"2026-05-18T01:11:47.071680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:47.071680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Erd\\\"os-Hajnal Conjecture---A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maria Chudnovsky","submitted_at":"2016-06-28T19:07:32Z","abstract_excerpt":"The Erd\\\"os-Hajnal conjecture states that for every graph $H$, there exists a constant $\\delta(H) > 0$ such that every graph $G$ with no induced subgraph isomorphic to $H$ has either a clique or a stable set of size at least $|V(G)|^{\\delta(H)}$. This paper is a survey of some of the known results on this conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08827","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":"1606.08827","created_at":"2026-05-18T01:11:47.071734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08827v1","created_at":"2026-05-18T01:11:47.071734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08827","created_at":"2026-05-18T01:11:47.071734+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLCSE5PH4M3Y","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLCSE5PH4M3YYLYM","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLCSE5PH","created_at":"2026-05-18T12:30:44.179134+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/TLCSE5PH4M3YYLYMIRQ3EFLMTW","json":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW.json","graph_json":"https://pith.science/api/pith-number/TLCSE5PH4M3YYLYMIRQ3EFLMTW/graph.json","events_json":"https://pith.science/api/pith-number/TLCSE5PH4M3YYLYMIRQ3EFLMTW/events.json","paper":"https://pith.science/paper/TLCSE5PH"},"agent_actions":{"view_html":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW","download_json":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW.json","view_paper":"https://pith.science/paper/TLCSE5PH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08827&json=true","fetch_graph":"https://pith.science/api/pith-number/TLCSE5PH4M3YYLYMIRQ3EFLMTW/graph.json","fetch_events":"https://pith.science/api/pith-number/TLCSE5PH4M3YYLYMIRQ3EFLMTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW/action/storage_attestation","attest_author":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW/action/author_attestation","sign_citation":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW/action/citation_signature","submit_replication":"https://pith.science/pith/TLCSE5PH4M3YYLYMIRQ3EFLMTW/action/replication_record"}},"created_at":"2026-05-18T01:11:47.071734+00:00","updated_at":"2026-05-18T01:11:47.071734+00:00"}