{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VSWSB5SQT3NDZDBLXUWZY7JU7A","short_pith_number":"pith:VSWSB5SQ","schema_version":"1.0","canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","source":{"kind":"arxiv","id":"1805.07781","version":1},"attestation_state":"computed","paper":{"title":"Two Erd\\H{o}s--Hajnal-type Theorems in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Michal Amir, Mykhaylo Tyomkyn","submitted_at":"2018-05-20T15:54:45Z","abstract_excerpt":"The Erd\\H{o}s--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$, have homogeneous sets of size significantly larger than one can generally expect to find in a graph. We obtain two results of this flavor in the setting of $r$-uniform hypergraphs.\n  A theorem of R\\\"odl asserts that if an $n$-vertex graph is non-universal then it contains an almost homogeneous set (i.e one with edge density either very close to $0$ or $1$) of size $\\Omega(n)$. We prove that if a $3$-uniform hypergraph is non-universal then it contains an"},"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":"1805.07781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T15:54:45Z","cross_cats_sorted":[],"title_canon_sha256":"b139fee98ee105862fab664de2a2273e36236c7d7ee720637b4b6ab553f9d767","abstract_canon_sha256":"d34dced039620a9c2a32adfeb60f1f900f43e0f4d2edb552e21d59d6e47092d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:32.572836Z","signature_b64":"tddQF8Q8qC/D+KTmwXpnkoUlfXKsFSm/H7wsNPmXEjGSR4V6Nm6LBxHn+fmPPZKHf+afmzgoOlpQ5a8ntSSFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","last_reissued_at":"2026-05-18T00:15:32.572187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:32.572187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Erd\\H{o}s--Hajnal-type Theorems in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Shapira, Michal Amir, Mykhaylo Tyomkyn","submitted_at":"2018-05-20T15:54:45Z","abstract_excerpt":"The Erd\\H{o}s--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$, have homogeneous sets of size significantly larger than one can generally expect to find in a graph. We obtain two results of this flavor in the setting of $r$-uniform hypergraphs.\n  A theorem of R\\\"odl asserts that if an $n$-vertex graph is non-universal then it contains an almost homogeneous set (i.e one with edge density either very close to $0$ or $1$) of size $\\Omega(n)$. We prove that if a $3$-uniform hypergraph is non-universal then it contains an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07781","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":"1805.07781","created_at":"2026-05-18T00:15:32.572311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07781v1","created_at":"2026-05-18T00:15:32.572311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07781","created_at":"2026-05-18T00:15:32.572311+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSWSB5SQT3ND","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSWSB5SQT3NDZDBL","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSWSB5SQ","created_at":"2026-05-18T12:32:59.047623+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/VSWSB5SQT3NDZDBLXUWZY7JU7A","json":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A.json","graph_json":"https://pith.science/api/pith-number/VSWSB5SQT3NDZDBLXUWZY7JU7A/graph.json","events_json":"https://pith.science/api/pith-number/VSWSB5SQT3NDZDBLXUWZY7JU7A/events.json","paper":"https://pith.science/paper/VSWSB5SQ"},"agent_actions":{"view_html":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A","download_json":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A.json","view_paper":"https://pith.science/paper/VSWSB5SQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07781&json=true","fetch_graph":"https://pith.science/api/pith-number/VSWSB5SQT3NDZDBLXUWZY7JU7A/graph.json","fetch_events":"https://pith.science/api/pith-number/VSWSB5SQT3NDZDBLXUWZY7JU7A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/action/storage_attestation","attest_author":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/action/author_attestation","sign_citation":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/action/citation_signature","submit_replication":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/action/replication_record"}},"created_at":"2026-05-18T00:15:32.572311+00:00","updated_at":"2026-05-18T00:15:32.572311+00:00"}