{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PSL5XR76MA7B3LHKKKMCVSMAFR","short_pith_number":"pith:PSL5XR76","canonical_record":{"source":{"id":"1104.5544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-29T02:55:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ef1551c4a99023e32aa049ae063bb4d06bc1736a47a4721e0a54ebf6cdaf130c","abstract_canon_sha256":"519331729a1bed177047090bbf998f8fefdd157b78d84c2f4734150aa91f2651"},"schema_version":"1.0"},"canonical_sha256":"7c97dbc7fe603e1dacea52982ac9802c657fae9742fdcbab995380cb7d96856b","source":{"kind":"arxiv","id":"1104.5544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5544","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5544v1","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5544","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"PSL5XR76MA7B","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PSL5XR76MA7B3LHK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PSL5XR76","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PSL5XR76MA7B3LHKKKMCVSMAFR","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-29T02:55:11Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ef1551c4a99023e32aa049ae063bb4d06bc1736a47a4721e0a54ebf6cdaf130c","abstract_canon_sha256":"519331729a1bed177047090bbf998f8fefdd157b78d84c2f4734150aa91f2651"},"schema_version":"1.0"},"canonical_sha256":"7c97dbc7fe603e1dacea52982ac9802c657fae9742fdcbab995380cb7d96856b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:20.808591Z","signature_b64":"Q+oCEiK6eQMDUBXU0rlyHaqHUxINXc3/ke2V2BAAfoRJnLRsDww8cV8rmoF3nMl0++W/D1mm7cgf893guW0RDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c97dbc7fe603e1dacea52982ac9802c657fae9742fdcbab995380cb7d96856b","last_reissued_at":"2026-05-18T04:23:20.808038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:20.808038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5544","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-18T04:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2kQiKloXhAMCSbMLgS2PjtsHzsbEOKVbgV9qYMFaueqAMnoXlCKErsjr9m35hOKH+k4EXRyd8wM+FnMt+M6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:29.634495Z"},"content_sha256":"534be5acbc3b6585e6dfb8c23eabd5301c67e8240a43b078679ce5fb4b09f99c","schema_version":"1.0","event_id":"sha256:534be5acbc3b6585e6dfb8c23eabd5301c67e8240a43b078679ce5fb4b09f99c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PSL5XR76MA7B3LHKKKMCVSMAFR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Erdos-Hajnal-type theorems in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2011-04-29T02:55:11Z","abstract_excerpt":"The Erdos-Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n^{d(H)}, where d(H) > 0 depends only on the graph H. Except for a few special cases, this conjecture remains wide open. However, it is known that a H-free graph must contain a complete or empty bipartite graph with parts of polynomial size. We prove an analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform hypergraph on n vertices is H-free, for any given H, then i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5544","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-18T04:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMhYlNU+C3UWEvVI3WGQSwxz5U6GsNFf5+N8+kYJySAGWGtC/39noAmEkIOtrjW09rlbTDhIyQTW/yuKAYGuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:36:29.635135Z"},"content_sha256":"37cbd1e944289499c9446077bfcebbbf451294102f84b275ecbdc355b47d77f3","schema_version":"1.0","event_id":"sha256:37cbd1e944289499c9446077bfcebbbf451294102f84b275ecbdc355b47d77f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/bundle.json","state_url":"https://pith.science/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/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-05-30T14:36:29Z","links":{"resolver":"https://pith.science/pith/PSL5XR76MA7B3LHKKKMCVSMAFR","bundle":"https://pith.science/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/bundle.json","state":"https://pith.science/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSL5XR76MA7B3LHKKKMCVSMAFR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PSL5XR76MA7B3LHKKKMCVSMAFR","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":"519331729a1bed177047090bbf998f8fefdd157b78d84c2f4734150aa91f2651","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-29T02:55:11Z","title_canon_sha256":"ef1551c4a99023e32aa049ae063bb4d06bc1736a47a4721e0a54ebf6cdaf130c"},"schema_version":"1.0","source":{"id":"1104.5544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5544","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5544v1","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5544","created_at":"2026-05-18T04:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"PSL5XR76MA7B","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PSL5XR76MA7B3LHK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PSL5XR76","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:37cbd1e944289499c9446077bfcebbbf451294102f84b275ecbdc355b47d77f3","target":"graph","created_at":"2026-05-18T04:23:20Z","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 Erdos-Hajnal conjecture states that if a graph on n vertices is H-free, that is, it does not contain an induced copy of a given graph H, then it must contain either a clique or an independent set of size n^{d(H)}, where d(H) > 0 depends only on the graph H. Except for a few special cases, this conjecture remains wide open. However, it is known that a H-free graph must contain a complete or empty bipartite graph with parts of polynomial size. We prove an analogue of this result for 3-uniform hypergraphs, showing that if a 3-uniform hypergraph on n vertices is H-free, for any given H, then i","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-29T02:55:11Z","title":"Erdos-Hajnal-type theorems in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5544","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:534be5acbc3b6585e6dfb8c23eabd5301c67e8240a43b078679ce5fb4b09f99c","target":"record","created_at":"2026-05-18T04:23:20Z","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":"519331729a1bed177047090bbf998f8fefdd157b78d84c2f4734150aa91f2651","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-04-29T02:55:11Z","title_canon_sha256":"ef1551c4a99023e32aa049ae063bb4d06bc1736a47a4721e0a54ebf6cdaf130c"},"schema_version":"1.0","source":{"id":"1104.5544","kind":"arxiv","version":1}},"canonical_sha256":"7c97dbc7fe603e1dacea52982ac9802c657fae9742fdcbab995380cb7d96856b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c97dbc7fe603e1dacea52982ac9802c657fae9742fdcbab995380cb7d96856b","first_computed_at":"2026-05-18T04:23:20.808038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:20.808038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q+oCEiK6eQMDUBXU0rlyHaqHUxINXc3/ke2V2BAAfoRJnLRsDww8cV8rmoF3nMl0++W/D1mm7cgf893guW0RDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:20.808591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:534be5acbc3b6585e6dfb8c23eabd5301c67e8240a43b078679ce5fb4b09f99c","sha256:37cbd1e944289499c9446077bfcebbbf451294102f84b275ecbdc355b47d77f3"],"state_sha256":"0ec5b70510a9e8b196e33e7ee5e007c96a6202451a925c0327a39258c84d3324"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TdmCNwcA2pJQj7AmOGZxj9fzXVth56E//CSEZJ+9zs5dQJc/T4iGvJ2y+NUBF5+rSwaU/p8qXUaXKFT23sjDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:36:29.638274Z","bundle_sha256":"a30087f33d809fcf192ead43e8ee17b7f1c551e69d6ca2b6f950be9c5bc4e641"}}