{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FETM7G4JLIZQFRG3M3NR44C3ZO","short_pith_number":"pith:FETM7G4J","canonical_record":{"source":{"id":"1803.03588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T16:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"174ea4786808bbc57e31a90c07939e522522067af236b5ee700a0263c040ebd8","abstract_canon_sha256":"92993d3b5039a3c10dd43acb94f11d239039e658ce88a4cb9e0899ef9f7623c5"},"schema_version":"1.0"},"canonical_sha256":"2926cf9b895a3302c4db66db1e705bcbab166dd8adb9daf463385b4b926a1a35","source":{"kind":"arxiv","id":"1803.03588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03588","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03588v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03588","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"FETM7G4JLIZQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FETM7G4JLIZQFRG3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FETM7G4J","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FETM7G4JLIZQFRG3M3NR44C3ZO","target":"record","payload":{"canonical_record":{"source":{"id":"1803.03588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T16:29:58Z","cross_cats_sorted":[],"title_canon_sha256":"174ea4786808bbc57e31a90c07939e522522067af236b5ee700a0263c040ebd8","abstract_canon_sha256":"92993d3b5039a3c10dd43acb94f11d239039e658ce88a4cb9e0899ef9f7623c5"},"schema_version":"1.0"},"canonical_sha256":"2926cf9b895a3302c4db66db1e705bcbab166dd8adb9daf463385b4b926a1a35","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:39.052271Z","signature_b64":"yjxrwcxYJZ8Prrh78iD0HwrZp0YmRnFaPBnXR73pxBBqRqhICg3NMPydb+tETyR+ERfd/9IORRyv8D5r4JObBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2926cf9b895a3302c4db66db1e705bcbab166dd8adb9daf463385b4b926a1a35","last_reissued_at":"2026-05-18T00:21:39.051638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:39.051638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.03588","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2DCUv1xubinIkfXGVNjBpTsFYTJuvLHpuy7rU2T+4qOfCrSXXTzLVVJRtRLHZ3/M0+oJQpmLPSwQREaDOvGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:29:56.127722Z"},"content_sha256":"a8d5d5a522f5a1081a8be0cc968b4116549d5d57fe445cd4cb81428f71f5b3b4","schema_version":"1.0","event_id":"sha256:a8d5d5a522f5a1081a8be0cc968b4116549d5d57fe445cd4cb81428f71f5b3b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FETM7G4JLIZQFRG3M3NR44C3ZO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Erdos-Hajnal for graphs with no 5-hole","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Jacob Fox, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","submitted_at":"2018-03-09T16:29:58Z","abstract_excerpt":"The Erdos-Hajnal conjecture says that for every graph $H$ there exists $c>0$ such that $\\max(\\alpha(G),\\omega(G))\\ge n^c$ for every $H$-free graph $G$ with $n$ vertices, and this is still open when $H=C_5$. Until now the best bound known on $\\max(\\alpha(G),\\omega(G))$ for $C_5$-free graphs was the general bound of Erdos and Hajnal, that for all $H$, $\\max(\\alpha(G),\\omega(G))\\ge 2^{\\Omega(\\sqrt{\\log n })}$ if $G$ is $H$-free. We improve this when $H=C_5$ to $\\max(\\alpha(G),\\omega(G))\\ge 2^{\\Omega(\\sqrt{\\log n \\log \\log n})}.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03588","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:21:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsBTRZbuuPOk9HJhKpXEWexbpQ+m5ti11Ro/qwaWEcbdXriBWewjzO1d742LDk+dwoWw0RGYQkp0+Ba/YesHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:29:56.128081Z"},"content_sha256":"b32f43e2be8f5c667a8d2cb6aefc699713c9d7c8e513f6bacddf62b509d02b22","schema_version":"1.0","event_id":"sha256:b32f43e2be8f5c667a8d2cb6aefc699713c9d7c8e513f6bacddf62b509d02b22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/bundle.json","state_url":"https://pith.science/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/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-26T15:29:56Z","links":{"resolver":"https://pith.science/pith/FETM7G4JLIZQFRG3M3NR44C3ZO","bundle":"https://pith.science/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/bundle.json","state":"https://pith.science/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FETM7G4JLIZQFRG3M3NR44C3ZO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FETM7G4JLIZQFRG3M3NR44C3ZO","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":"92993d3b5039a3c10dd43acb94f11d239039e658ce88a4cb9e0899ef9f7623c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T16:29:58Z","title_canon_sha256":"174ea4786808bbc57e31a90c07939e522522067af236b5ee700a0263c040ebd8"},"schema_version":"1.0","source":{"id":"1803.03588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03588","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03588v1","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03588","created_at":"2026-05-18T00:21:39Z"},{"alias_kind":"pith_short_12","alias_value":"FETM7G4JLIZQ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FETM7G4JLIZQFRG3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FETM7G4J","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:b32f43e2be8f5c667a8d2cb6aefc699713c9d7c8e513f6bacddf62b509d02b22","target":"graph","created_at":"2026-05-18T00:21:39Z","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 says that for every graph $H$ there exists $c>0$ such that $\\max(\\alpha(G),\\omega(G))\\ge n^c$ for every $H$-free graph $G$ with $n$ vertices, and this is still open when $H=C_5$. Until now the best bound known on $\\max(\\alpha(G),\\omega(G))$ for $C_5$-free graphs was the general bound of Erdos and Hajnal, that for all $H$, $\\max(\\alpha(G),\\omega(G))\\ge 2^{\\Omega(\\sqrt{\\log n })}$ if $G$ is $H$-free. We improve this when $H=C_5$ to $\\max(\\alpha(G),\\omega(G))\\ge 2^{\\Omega(\\sqrt{\\log n \\log \\log n})}.$","authors_text":"Alex Scott, Jacob Fox, Maria Chudnovsky, Paul Seymour, Sophie Spirkl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T16:29:58Z","title":"Towards Erdos-Hajnal for graphs with no 5-hole"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03588","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:a8d5d5a522f5a1081a8be0cc968b4116549d5d57fe445cd4cb81428f71f5b3b4","target":"record","created_at":"2026-05-18T00:21:39Z","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":"92993d3b5039a3c10dd43acb94f11d239039e658ce88a4cb9e0899ef9f7623c5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-09T16:29:58Z","title_canon_sha256":"174ea4786808bbc57e31a90c07939e522522067af236b5ee700a0263c040ebd8"},"schema_version":"1.0","source":{"id":"1803.03588","kind":"arxiv","version":1}},"canonical_sha256":"2926cf9b895a3302c4db66db1e705bcbab166dd8adb9daf463385b4b926a1a35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2926cf9b895a3302c4db66db1e705bcbab166dd8adb9daf463385b4b926a1a35","first_computed_at":"2026-05-18T00:21:39.051638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:39.051638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yjxrwcxYJZ8Prrh78iD0HwrZp0YmRnFaPBnXR73pxBBqRqhICg3NMPydb+tETyR+ERfd/9IORRyv8D5r4JObBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:39.052271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8d5d5a522f5a1081a8be0cc968b4116549d5d57fe445cd4cb81428f71f5b3b4","sha256:b32f43e2be8f5c667a8d2cb6aefc699713c9d7c8e513f6bacddf62b509d02b22"],"state_sha256":"66d633782c9c70d91e21196ca65b7f08636974d54ca9a465096f04024720ad2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AixPItrE8bGrjuVVSCBQDWBGFLZi8gycjxyoSfSJZy2osotKTUatvHIo/Ka/DCqE+SJuxVqBVFPk1jjysIygAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:29:56.130418Z","bundle_sha256":"7725fcb36dd379a37511275b522f7dc39bf85072024fd464c652becbc69522fc"}}