{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VSWSB5SQT3NDZDBLXUWZY7JU7A","short_pith_number":"pith:VSWSB5SQ","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"},"canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","source":{"kind":"arxiv","id":"1805.07781","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07781","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07781v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07781","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"VSWSB5SQT3ND","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VSWSB5SQT3NDZDBL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VSWSB5SQ","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VSWSB5SQT3NDZDBLXUWZY7JU7A","target":"record","payload":{"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"},"canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","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"},"source_kind":"arxiv","source_id":"1805.07781","source_version":1,"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luyV+83QhgwHcIfvhGwfGsLL4TGnqgThgx3hkDc30Awhg8Iip4oIIiqywYrKj/c0fcsIgfnuFDQVv45fBA9uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:01:25.637608Z"},"content_sha256":"78abe9c5e339accde5f9aa6813411331bc5dda297c2eca225afec375cfea36ce","schema_version":"1.0","event_id":"sha256:78abe9c5e339accde5f9aa6813411331bc5dda297c2eca225afec375cfea36ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VSWSB5SQT3NDZDBLXUWZY7JU7A","target":"graph","payload":{"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"},"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OVMaL5rPVidd9L1T0V7FZkCmkTsuYbKuIqsrwvJ/pqmMgz03fXn55AXELllPdYh4kyKtUHfqqoNtCrFz7lQkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:01:25.637950Z"},"content_sha256":"b552f890d53b3081866e3bbffedfff2574297e1bee2535ab4ac81d0eb5068c4d","schema_version":"1.0","event_id":"sha256:b552f890d53b3081866e3bbffedfff2574297e1bee2535ab4ac81d0eb5068c4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/bundle.json","state_url":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/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-03T01:01:25Z","links":{"resolver":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A","bundle":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/bundle.json","state":"https://pith.science/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSWSB5SQT3NDZDBLXUWZY7JU7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VSWSB5SQT3NDZDBLXUWZY7JU7A","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":"d34dced039620a9c2a32adfeb60f1f900f43e0f4d2edb552e21d59d6e47092d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T15:54:45Z","title_canon_sha256":"b139fee98ee105862fab664de2a2273e36236c7d7ee720637b4b6ab553f9d767"},"schema_version":"1.0","source":{"id":"1805.07781","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07781","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07781v1","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07781","created_at":"2026-05-18T00:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"VSWSB5SQT3ND","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VSWSB5SQT3NDZDBL","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VSWSB5SQ","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:b552f890d53b3081866e3bbffedfff2574297e1bee2535ab4ac81d0eb5068c4d","target":"graph","created_at":"2026-05-18T00:15:32Z","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":"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","authors_text":"Asaf Shapira, Michal Amir, Mykhaylo Tyomkyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T15:54:45Z","title":"Two Erd\\H{o}s--Hajnal-type Theorems in Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07781","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:78abe9c5e339accde5f9aa6813411331bc5dda297c2eca225afec375cfea36ce","target":"record","created_at":"2026-05-18T00:15:32Z","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":"d34dced039620a9c2a32adfeb60f1f900f43e0f4d2edb552e21d59d6e47092d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-20T15:54:45Z","title_canon_sha256":"b139fee98ee105862fab664de2a2273e36236c7d7ee720637b4b6ab553f9d767"},"schema_version":"1.0","source":{"id":"1805.07781","kind":"arxiv","version":1}},"canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acad20f6509eda3c8c2bbd2d9c7d34f8304d230ab0d7177263c03901471ada44","first_computed_at":"2026-05-18T00:15:32.572187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:32.572187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tddQF8Q8qC/D+KTmwXpnkoUlfXKsFSm/H7wsNPmXEjGSR4V6Nm6LBxHn+fmPPZKHf+afmzgoOlpQ5a8ntSSFAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:32.572836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07781","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78abe9c5e339accde5f9aa6813411331bc5dda297c2eca225afec375cfea36ce","sha256:b552f890d53b3081866e3bbffedfff2574297e1bee2535ab4ac81d0eb5068c4d"],"state_sha256":"77676185007cd275717a3bfbb26118fb627fdfb344d95fbdec6a1240e39ca74f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oBR5DLAvYs7BOJSgkVrk49fryNZwrwZDQoyUEbODMjS1ZDImWZtSjVEtpw+dyl/6KaTefJ6w0byGDBjkStrBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:01:25.640109Z","bundle_sha256":"dc32821d1a4c96f2f815d072af3adedaa247de358ec33b2ed9d36ef4373d0d97"}}