{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PIYI7MQUXQRSROKSYOKWGHUBMT","short_pith_number":"pith:PIYI7MQU","schema_version":"1.0","canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","source":{"kind":"arxiv","id":"1908.05597","version":4},"attestation_state":"computed","paper":{"title":"Clustered Variants of Haj\\'os' Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, David R. Wood","submitted_at":"2019-08-14T06:36:49Z","abstract_excerpt":"Haj\\'os conjectured that every graph containing no subdivision of the complete graph $K_{s+1}$ is properly $s$-colorable. This conjecture was disproved by Catlin. Indeed, the maximum chromatic number of such graphs is $\\Omega(s^2/\\log s)$. We prove that $O(s)$ colors are enough for a weakening of this conjecture that only requires every monochromatic component to have bounded size (so-called clustered coloring). Our approach leads to more results. Say that a graph is an almost $(\\leq 1)$-subdivision of a graph $H$ if it can be obtained from $H$ by subdividing edges, where at most one edge is s"},"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":"1908.05597","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T06:36:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e959e985789d067aec74dc2e56339e4bdebd76ae174a9ef3cae13ce2837dd1c8","abstract_canon_sha256":"a832e1164df0266cdff686bd98ec50a83e29026f3e287887189cabaa0c14c59a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:17:11.748159Z","signature_b64":"5v+n/hloRQtnsB+YG8TghyZGXSGQiEZeMk84+G9325sgODplAf9/E/3knvrsPQG0ZXJavVBU1gdbaEjvj2eoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","last_reissued_at":"2026-07-05T03:17:11.747614Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:17:11.747614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustered Variants of Haj\\'os' Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, David R. Wood","submitted_at":"2019-08-14T06:36:49Z","abstract_excerpt":"Haj\\'os conjectured that every graph containing no subdivision of the complete graph $K_{s+1}$ is properly $s$-colorable. This conjecture was disproved by Catlin. Indeed, the maximum chromatic number of such graphs is $\\Omega(s^2/\\log s)$. We prove that $O(s)$ colors are enough for a weakening of this conjecture that only requires every monochromatic component to have bounded size (so-called clustered coloring). Our approach leads to more results. Say that a graph is an almost $(\\leq 1)$-subdivision of a graph $H$ if it can be obtained from $H$ by subdividing edges, where at most one edge is s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05597","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05597/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05597","created_at":"2026-07-05T03:17:11.747673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05597v4","created_at":"2026-07-05T03:17:11.747673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05597","created_at":"2026-07-05T03:17:11.747673+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIYI7MQUXQRS","created_at":"2026-07-05T03:17:11.747673+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIYI7MQUXQRSROKS","created_at":"2026-07-05T03:17:11.747673+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIYI7MQU","created_at":"2026-07-05T03:17:11.747673+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/PIYI7MQUXQRSROKSYOKWGHUBMT","json":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT.json","graph_json":"https://pith.science/api/pith-number/PIYI7MQUXQRSROKSYOKWGHUBMT/graph.json","events_json":"https://pith.science/api/pith-number/PIYI7MQUXQRSROKSYOKWGHUBMT/events.json","paper":"https://pith.science/paper/PIYI7MQU"},"agent_actions":{"view_html":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT","download_json":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT.json","view_paper":"https://pith.science/paper/PIYI7MQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05597&json=true","fetch_graph":"https://pith.science/api/pith-number/PIYI7MQUXQRSROKSYOKWGHUBMT/graph.json","fetch_events":"https://pith.science/api/pith-number/PIYI7MQUXQRSROKSYOKWGHUBMT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/action/storage_attestation","attest_author":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/action/author_attestation","sign_citation":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/action/citation_signature","submit_replication":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/action/replication_record"}},"created_at":"2026-07-05T03:17:11.747673+00:00","updated_at":"2026-07-05T03:17:11.747673+00:00"}