{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PIYI7MQUXQRSROKSYOKWGHUBMT","short_pith_number":"pith:PIYI7MQU","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"},"canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","source":{"kind":"arxiv","id":"1908.05597","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05597","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05597v4","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05597","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"PIYI7MQUXQRS","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_16","alias_value":"PIYI7MQUXQRSROKS","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_8","alias_value":"PIYI7MQU","created_at":"2026-07-05T03:17:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PIYI7MQUXQRSROKSYOKWGHUBMT","target":"record","payload":{"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"},"canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","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"},"source_kind":"arxiv","source_id":"1908.05597","source_version":4,"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-07-05T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qJJXgwasnfyUKUwMiFhBH4SwYdCphKkZZkosXAtwRAIP+1Y3EW6O86I8hK0YzW6R9iOlRaPVTU+MTSoXXz/yCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:54:46.479720Z"},"content_sha256":"34a33a47756d5495f3d6e9570b853a6f755cfdb9d741e8e8f183fb2463826191","schema_version":"1.0","event_id":"sha256:34a33a47756d5495f3d6e9570b853a6f755cfdb9d741e8e8f183fb2463826191"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PIYI7MQUXQRSROKSYOKWGHUBMT","target":"graph","payload":{"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"},"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-07-05T03:17:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACcwD8aNt57yUWP25eFIJpeRsOA1wH0uUpu518bOYKnK/Zzns/jpnF6n6fWt4/onNwFLBUKTHEE1ZA23ZMb6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:54:46.480630Z"},"content_sha256":"3d53249d6d224c2ea7774f8b180fc3e7b51ee85402b912d412bc3f844843f64f","schema_version":"1.0","event_id":"sha256:3d53249d6d224c2ea7774f8b180fc3e7b51ee85402b912d412bc3f844843f64f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/bundle.json","state_url":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/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-08-16T15:54:46Z","links":{"resolver":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT","bundle":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/bundle.json","state":"https://pith.science/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PIYI7MQUXQRSROKSYOKWGHUBMT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PIYI7MQUXQRSROKSYOKWGHUBMT","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":"a832e1164df0266cdff686bd98ec50a83e29026f3e287887189cabaa0c14c59a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T06:36:49Z","title_canon_sha256":"e959e985789d067aec74dc2e56339e4bdebd76ae174a9ef3cae13ce2837dd1c8"},"schema_version":"1.0","source":{"id":"1908.05597","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05597","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05597v4","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05597","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_12","alias_value":"PIYI7MQUXQRS","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_16","alias_value":"PIYI7MQUXQRSROKS","created_at":"2026-07-05T03:17:11Z"},{"alias_kind":"pith_short_8","alias_value":"PIYI7MQU","created_at":"2026-07-05T03:17:11Z"}],"graph_snapshots":[{"event_id":"sha256:3d53249d6d224c2ea7774f8b180fc3e7b51ee85402b912d412bc3f844843f64f","target":"graph","created_at":"2026-07-05T03:17:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05597/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chun-Hung Liu, David R. Wood","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T06:36:49Z","title":"Clustered Variants of Haj\\'os' Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05597","kind":"arxiv","version":4},"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:34a33a47756d5495f3d6e9570b853a6f755cfdb9d741e8e8f183fb2463826191","target":"record","created_at":"2026-07-05T03:17:11Z","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":"a832e1164df0266cdff686bd98ec50a83e29026f3e287887189cabaa0c14c59a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-14T06:36:49Z","title_canon_sha256":"e959e985789d067aec74dc2e56339e4bdebd76ae174a9ef3cae13ce2837dd1c8"},"schema_version":"1.0","source":{"id":"1908.05597","kind":"arxiv","version":4}},"canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a308fb214bc2328b952c395631e8164e5fccb0bc1456df0c453ca9dbe8a88bf","first_computed_at":"2026-07-05T03:17:11.747614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:17:11.747614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5v+n/hloRQtnsB+YG8TghyZGXSGQiEZeMk84+G9325sgODplAf9/E/3knvrsPQG0ZXJavVBU1gdbaEjvj2eoCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:17:11.748159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05597","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34a33a47756d5495f3d6e9570b853a6f755cfdb9d741e8e8f183fb2463826191","sha256:3d53249d6d224c2ea7774f8b180fc3e7b51ee85402b912d412bc3f844843f64f"],"state_sha256":"5a6f0fabc1827849edd1f5594abb8c663d31bb04c2fbc56681130dceda51427f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xh3vBq01hkN2r87SwYCLO5BZEszT0UrNBWrLC+k6On8b97XISaoJC6RrVPVJTVkaBEjN+wudZkmNLbUd0acUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:54:46.486157Z","bundle_sha256":"96e9cb9e5a40d55963caf649c822922cc46ddabaa8d5628b15ce1274786458d4"}}