{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IPI373RFX5JZSDJVQXTOCBWQSO","short_pith_number":"pith:IPI373RF","schema_version":"1.0","canonical_sha256":"43d1bfee25bf53990d3585e6e106d093a1c3944b48118b4f39acf857cf90a613","source":{"kind":"arxiv","id":"1107.1920","version":3},"attestation_state":"computed","paper":{"title":"Chromatic number, clique subdivisions, and the conjectures of Haj\\'os and Erd\\H{o}s-Fajtlowicz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Jacob Fox","submitted_at":"2011-07-11T01:48:12Z","abstract_excerpt":"For a graph $G$, let $\\chi(G)$ denote its chromatic number and $\\sigma(G)$ denote the order of the largest clique subdivision in $G$. Let H(n) be the maximum of $\\chi(G)/\\sigma(G)$ over all $n$-vertex graphs $G$. A famous conjecture of Haj\\'os from 1961 states that $\\sigma(G) \\geq \\chi(G)$ for every graph $G$. That is, $H(n) \\leq 1$ for all positive integers $n$. This conjecture was disproved by Catlin in 1979. Erd\\H{o}s and Fajtlowicz further showed by considering a random graph that $H(n) \\geq cn^{1/2}/\\log n$ for some absolute constant $c>0$. In 1981 they conjectured that this bound is tigh"},"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":"1107.1920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-11T01:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"e804bacaff70078d0212a5349dfa4ddcac2f1ea425019cd0b0b485d525a64091","abstract_canon_sha256":"baa67e498250668c4378d1bff7ce633d6d11e21a6718f4a9ba52f64524b27390"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:25.155095Z","signature_b64":"e2GKvXydTNbETxtNLN+gTojrpt7F9WAOjsXx1fy++Ey87f2EPwptzFhAf23dUaVbWfa/AyakGi0BgfKw3lbcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43d1bfee25bf53990d3585e6e106d093a1c3944b48118b4f39acf857cf90a613","last_reissued_at":"2026-05-18T04:02:25.154604Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:25.154604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic number, clique subdivisions, and the conjectures of Haj\\'os and Erd\\H{o}s-Fajtlowicz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Choongbum Lee, Jacob Fox","submitted_at":"2011-07-11T01:48:12Z","abstract_excerpt":"For a graph $G$, let $\\chi(G)$ denote its chromatic number and $\\sigma(G)$ denote the order of the largest clique subdivision in $G$. Let H(n) be the maximum of $\\chi(G)/\\sigma(G)$ over all $n$-vertex graphs $G$. A famous conjecture of Haj\\'os from 1961 states that $\\sigma(G) \\geq \\chi(G)$ for every graph $G$. That is, $H(n) \\leq 1$ for all positive integers $n$. This conjecture was disproved by Catlin in 1979. Erd\\H{o}s and Fajtlowicz further showed by considering a random graph that $H(n) \\geq cn^{1/2}/\\log n$ for some absolute constant $c>0$. In 1981 they conjectured that this bound is tigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1920","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.1920","created_at":"2026-05-18T04:02:25.154679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1920v3","created_at":"2026-05-18T04:02:25.154679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1920","created_at":"2026-05-18T04:02:25.154679+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPI373RFX5JZ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPI373RFX5JZSDJV","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPI373RF","created_at":"2026-05-18T12:26:32.869790+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/IPI373RFX5JZSDJVQXTOCBWQSO","json":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO.json","graph_json":"https://pith.science/api/pith-number/IPI373RFX5JZSDJVQXTOCBWQSO/graph.json","events_json":"https://pith.science/api/pith-number/IPI373RFX5JZSDJVQXTOCBWQSO/events.json","paper":"https://pith.science/paper/IPI373RF"},"agent_actions":{"view_html":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO","download_json":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO.json","view_paper":"https://pith.science/paper/IPI373RF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1920&json=true","fetch_graph":"https://pith.science/api/pith-number/IPI373RFX5JZSDJVQXTOCBWQSO/graph.json","fetch_events":"https://pith.science/api/pith-number/IPI373RFX5JZSDJVQXTOCBWQSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO/action/storage_attestation","attest_author":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO/action/author_attestation","sign_citation":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO/action/citation_signature","submit_replication":"https://pith.science/pith/IPI373RFX5JZSDJVQXTOCBWQSO/action/replication_record"}},"created_at":"2026-05-18T04:02:25.154679+00:00","updated_at":"2026-05-18T04:02:25.154679+00:00"}