{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S4IO3D6NPFVUB4MULV746VZIOU","short_pith_number":"pith:S4IO3D6N","canonical_record":{"source":{"id":"1905.09495","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-23T06:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"99a4f9c65b176ac3cc9c99b5b7702e31ec17fa7abe511ccd0206e911d105b8f7","abstract_canon_sha256":"f6b2c580db4fe164ccb72b494680c409c2ef166c843388427a09c22a086907dd"},"schema_version":"1.0"},"canonical_sha256":"9710ed8fcd796b40f1945d7fcf57287536cdb344852c696b75b48bee426e2bd9","source":{"kind":"arxiv","id":"1905.09495","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09495","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09495v4","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09495","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"S4IO3D6NPFVU","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"S4IO3D6NPFVUB4MU","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"S4IO3D6N","created_at":"2026-07-05T03:37:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S4IO3D6NPFVUB4MULV746VZIOU","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09495","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-23T06:40:54Z","cross_cats_sorted":[],"title_canon_sha256":"99a4f9c65b176ac3cc9c99b5b7702e31ec17fa7abe511ccd0206e911d105b8f7","abstract_canon_sha256":"f6b2c580db4fe164ccb72b494680c409c2ef166c843388427a09c22a086907dd"},"schema_version":"1.0"},"canonical_sha256":"9710ed8fcd796b40f1945d7fcf57287536cdb344852c696b75b48bee426e2bd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:36.881956Z","signature_b64":"aiqcS78f/ZGHSx6FwRBggu5eTkA1EN5SI0ALHAWO5H2VxpEbZ7WdCFsyo0jBEaI/ToeFGLK7OCCWaEufCJjjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9710ed8fcd796b40f1945d7fcf57287536cdb344852c696b75b48bee426e2bd9","last_reissued_at":"2026-07-05T03:37:36.881502Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:36.881502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09495","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:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzjmMWc0G0xVokeSkW+gGZ+6CHFhvfDpiulQ5pDJTeViNh3NST2+frHjSiyRMUuXgbZs70jK0N6O5gSoNUiRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:05:41.640777Z"},"content_sha256":"9ab779c3a37244dfa3c079a8954b257cbd6fbf6213e5901f386f2638e5a68579","schema_version":"1.0","event_id":"sha256:9ab779c3a37244dfa3c079a8954b257cbd6fbf6213e5901f386f2638e5a68579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S4IO3D6NPFVUB4MULV746VZIOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clustered Coloring of Graphs Excluding a Subgraph and a Minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chun-Hung Liu, David R. Wood","submitted_at":"2019-05-23T06:40:54Z","abstract_excerpt":"A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This paper studies clustered colorings of graphs, where the number of colors depends on an excluded minor and/or an excluded subgraph. We prove the following results (for fixed integers $s,t$ and a fixed graph $H$). First we show that graphs with no $K_{s,t}$ subgraph and with no $H$-minor are $(s+2)$-colorable with bounded clustering. The number of colors here is best possible. This result implies that gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09495","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/1905.09495/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:37:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k3H9/Orn5qq25B1Affv0khykSyu7gV8W4iNAVUNyC58QVxkKwAJ8D4iAlK84FDFGgiFntlFf7FY7AHBdPLZ3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T01:05:41.641277Z"},"content_sha256":"b51f3bd2311d75ee098b24641957d8819c36a077f118812b39499c021e49213f","schema_version":"1.0","event_id":"sha256:b51f3bd2311d75ee098b24641957d8819c36a077f118812b39499c021e49213f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4IO3D6NPFVUB4MULV746VZIOU/bundle.json","state_url":"https://pith.science/pith/S4IO3D6NPFVUB4MULV746VZIOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4IO3D6NPFVUB4MULV746VZIOU/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-09T01:05:41Z","links":{"resolver":"https://pith.science/pith/S4IO3D6NPFVUB4MULV746VZIOU","bundle":"https://pith.science/pith/S4IO3D6NPFVUB4MULV746VZIOU/bundle.json","state":"https://pith.science/pith/S4IO3D6NPFVUB4MULV746VZIOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4IO3D6NPFVUB4MULV746VZIOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S4IO3D6NPFVUB4MULV746VZIOU","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":"f6b2c580db4fe164ccb72b494680c409c2ef166c843388427a09c22a086907dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-23T06:40:54Z","title_canon_sha256":"99a4f9c65b176ac3cc9c99b5b7702e31ec17fa7abe511ccd0206e911d105b8f7"},"schema_version":"1.0","source":{"id":"1905.09495","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09495","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09495v4","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09495","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_12","alias_value":"S4IO3D6NPFVU","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_16","alias_value":"S4IO3D6NPFVUB4MU","created_at":"2026-07-05T03:37:36Z"},{"alias_kind":"pith_short_8","alias_value":"S4IO3D6N","created_at":"2026-07-05T03:37:36Z"}],"graph_snapshots":[{"event_id":"sha256:b51f3bd2311d75ee098b24641957d8819c36a077f118812b39499c021e49213f","target":"graph","created_at":"2026-07-05T03:37:36Z","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/1905.09495/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This paper studies clustered colorings of graphs, where the number of colors depends on an excluded minor and/or an excluded subgraph. We prove the following results (for fixed integers $s,t$ and a fixed graph $H$). First we show that graphs with no $K_{s,t}$ subgraph and with no $H$-minor are $(s+2)$-colorable with bounded clustering. The number of colors here is best possible. This result implies that gr","authors_text":"Chun-Hung Liu, David R. Wood","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-23T06:40:54Z","title":"Clustered Coloring of Graphs Excluding a Subgraph and a Minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09495","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:9ab779c3a37244dfa3c079a8954b257cbd6fbf6213e5901f386f2638e5a68579","target":"record","created_at":"2026-07-05T03:37:36Z","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":"f6b2c580db4fe164ccb72b494680c409c2ef166c843388427a09c22a086907dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-23T06:40:54Z","title_canon_sha256":"99a4f9c65b176ac3cc9c99b5b7702e31ec17fa7abe511ccd0206e911d105b8f7"},"schema_version":"1.0","source":{"id":"1905.09495","kind":"arxiv","version":4}},"canonical_sha256":"9710ed8fcd796b40f1945d7fcf57287536cdb344852c696b75b48bee426e2bd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9710ed8fcd796b40f1945d7fcf57287536cdb344852c696b75b48bee426e2bd9","first_computed_at":"2026-07-05T03:37:36.881502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:36.881502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aiqcS78f/ZGHSx6FwRBggu5eTkA1EN5SI0ALHAWO5H2VxpEbZ7WdCFsyo0jBEaI/ToeFGLK7OCCWaEufCJjjBw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:36.881956Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09495","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ab779c3a37244dfa3c079a8954b257cbd6fbf6213e5901f386f2638e5a68579","sha256:b51f3bd2311d75ee098b24641957d8819c36a077f118812b39499c021e49213f"],"state_sha256":"d1c55474f7c787166eaeedbeada169f6785c648444dffbb97a4281cbf6ddfdf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQ4cMiN1OEmd3WRimHtGmWOITHCXVO+DgqikNkNLdN1TAZSi/BwuEtawBljD5OFVkgdKOmcHIZEGwrM0icmRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T01:05:41.644468Z","bundle_sha256":"b5d82416dafa253ea2441f8671c55979b483b8110fda7df3d885cb1bdfc58e6c"}}