{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HQSIZOCCSVSCCXWWHNNRZ4WUPI","short_pith_number":"pith:HQSIZOCC","canonical_record":{"source":{"id":"1211.3876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-11-16T12:19:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"799cc213dc8793024a9ccacc3548a613b8a2a368eeb7aa11f11c2b7a38aa43bf","abstract_canon_sha256":"c91312898a8ceaa33971d6f19c331c182c20be80629f9deac5aed275d1b46c97"},"schema_version":"1.0"},"canonical_sha256":"3c248cb8429564215ed63b5b1cf2d47a3c082fd8fbe90cd6e5e7ca0179010015","source":{"kind":"arxiv","id":"1211.3876","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3876","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3876v3","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3876","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"HQSIZOCCSVSC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HQSIZOCCSVSCCXWW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HQSIZOCC","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HQSIZOCCSVSCCXWWHNNRZ4WUPI","target":"record","payload":{"canonical_record":{"source":{"id":"1211.3876","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-11-16T12:19:41Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"799cc213dc8793024a9ccacc3548a613b8a2a368eeb7aa11f11c2b7a38aa43bf","abstract_canon_sha256":"c91312898a8ceaa33971d6f19c331c182c20be80629f9deac5aed275d1b46c97"},"schema_version":"1.0"},"canonical_sha256":"3c248cb8429564215ed63b5b1cf2d47a3c082fd8fbe90cd6e5e7ca0179010015","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:53.070983Z","signature_b64":"/NtomipPxCaSCDA6Jin/cSl4CYTNE708nGWVm2El0aFHfn7OmUwPPaVMQfIyIhpB4+rTmAUzT3BO73s/RiVaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c248cb8429564215ed63b5b1cf2d47a3c082fd8fbe90cd6e5e7ca0179010015","last_reissued_at":"2026-05-18T00:37:53.070523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:53.070523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.3876","source_version":3,"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-18T00:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DFeB2aMupMwGloMD8fY5Orj2l10lzgqAGwANMzFPH9f7ZVGoD6vYivyd7VdAhgdWSinAV2k1MUKf00g6JoZbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:06:27.008296Z"},"content_sha256":"4118d8f08a874cb85b7d12b32aea43f63ec574a3580c0f74f26b0f88f15241e3","schema_version":"1.0","event_id":"sha256:4118d8f08a874cb85b7d12b32aea43f63ec574a3580c0f74f26b0f88f15241e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HQSIZOCCSVSCCXWWHNNRZ4WUPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Induced Subgraphs of Finite Graphs not Containing Large Empty and Complete Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"G\\'abor S\\'agi","submitted_at":"2012-11-16T12:19:41Z","abstract_excerpt":"In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G does not contain complete or empty induced subgraphs of size at least |V(G)|^c(H), then H can be isomorphically embedded into G ? The positive answer has become known as the Erd\\H{o}s-Hajnal conjecture.\n  In Theorem 3.20 of the present paper we settle this conjecture in the affirmative. To do so, we are studying here the fine structure of ultraproducts of fini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3876","kind":"arxiv","version":3},"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-18T00:37:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DV9YX1j8JRcn1ocpiu/4LNKl5/xVSfny9ISd6IOpSDVcNz+RIHSpsQnimTLebrLCuXQJfWBX/dWNKaiaZbQCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:06:27.008663Z"},"content_sha256":"ff65f7bc2e13c21f7e363249f77b9125a504bb4deb972417942d46d0bf356c6a","schema_version":"1.0","event_id":"sha256:ff65f7bc2e13c21f7e363249f77b9125a504bb4deb972417942d46d0bf356c6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/bundle.json","state_url":"https://pith.science/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/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-03T13:06:27Z","links":{"resolver":"https://pith.science/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI","bundle":"https://pith.science/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/bundle.json","state":"https://pith.science/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQSIZOCCSVSCCXWWHNNRZ4WUPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HQSIZOCCSVSCCXWWHNNRZ4WUPI","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":"c91312898a8ceaa33971d6f19c331c182c20be80629f9deac5aed275d1b46c97","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-11-16T12:19:41Z","title_canon_sha256":"799cc213dc8793024a9ccacc3548a613b8a2a368eeb7aa11f11c2b7a38aa43bf"},"schema_version":"1.0","source":{"id":"1211.3876","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3876","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3876v3","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3876","created_at":"2026-05-18T00:37:53Z"},{"alias_kind":"pith_short_12","alias_value":"HQSIZOCCSVSC","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HQSIZOCCSVSCCXWW","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HQSIZOCC","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:ff65f7bc2e13c21f7e363249f77b9125a504bb4deb972417942d46d0bf356c6a","target":"graph","created_at":"2026-05-18T00:37:53Z","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":"In their celebrated paper [Ramsey-Type Theorems, Discrete Appl. Math. 25 (1989) 37-52], Erd\\H{o}s and Hajnal asked the following: is it true, that for any finite graph H there exists a constant c(H) such that for any finite graph G, if G does not contain complete or empty induced subgraphs of size at least |V(G)|^c(H), then H can be isomorphically embedded into G ? The positive answer has become known as the Erd\\H{o}s-Hajnal conjecture.\n  In Theorem 3.20 of the present paper we settle this conjecture in the affirmative. To do so, we are studying here the fine structure of ultraproducts of fini","authors_text":"G\\'abor S\\'agi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-11-16T12:19:41Z","title":"On Induced Subgraphs of Finite Graphs not Containing Large Empty and Complete Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3876","kind":"arxiv","version":3},"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:4118d8f08a874cb85b7d12b32aea43f63ec574a3580c0f74f26b0f88f15241e3","target":"record","created_at":"2026-05-18T00:37:53Z","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":"c91312898a8ceaa33971d6f19c331c182c20be80629f9deac5aed275d1b46c97","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-11-16T12:19:41Z","title_canon_sha256":"799cc213dc8793024a9ccacc3548a613b8a2a368eeb7aa11f11c2b7a38aa43bf"},"schema_version":"1.0","source":{"id":"1211.3876","kind":"arxiv","version":3}},"canonical_sha256":"3c248cb8429564215ed63b5b1cf2d47a3c082fd8fbe90cd6e5e7ca0179010015","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c248cb8429564215ed63b5b1cf2d47a3c082fd8fbe90cd6e5e7ca0179010015","first_computed_at":"2026-05-18T00:37:53.070523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:53.070523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/NtomipPxCaSCDA6Jin/cSl4CYTNE708nGWVm2El0aFHfn7OmUwPPaVMQfIyIhpB4+rTmAUzT3BO73s/RiVaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:53.070983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3876","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4118d8f08a874cb85b7d12b32aea43f63ec574a3580c0f74f26b0f88f15241e3","sha256:ff65f7bc2e13c21f7e363249f77b9125a504bb4deb972417942d46d0bf356c6a"],"state_sha256":"140e23bf82a676f01a357cc456fa0136ccc672fac3a4437db9a7456b2b2e18c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhFyaw+EzRn88/c+AlgeIEiuZZWIIed6ZPWhlmqHe1U74QR9CslzZsdsvHlLiyQj+AFX3U5T/Dhbxhnv3GFIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:06:27.010624Z","bundle_sha256":"97c9a9dba6c00f17846f6a8c7502609069ef376c2958e8dec1c0012b5910c270"}}