{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:F5ICQQEPIRHTG44C6DKHAMUYLY","short_pith_number":"pith:F5ICQQEP","canonical_record":{"source":{"id":"2504.01548","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T09:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"72022be91883526abec6218c57e08d827a0d69133ca7744f16ab4c9f018c465e","abstract_canon_sha256":"21eeb227fffcb888467f48ac029777a7b98e4982606b0c314c27cf731ba353dd"},"schema_version":"1.0"},"canonical_sha256":"2f5028408f444f337382f0d47032985e3ae82af79e4f611a218f7777ed4f0a19","source":{"kind":"arxiv","id":"2504.01548","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.01548","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"2504.01548v1","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01548","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"F5ICQQEPIRHT","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_16","alias_value":"F5ICQQEPIRHTG44C","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_8","alias_value":"F5ICQQEP","created_at":"2026-07-05T10:43:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:F5ICQQEPIRHTG44C6DKHAMUYLY","target":"record","payload":{"canonical_record":{"source":{"id":"2504.01548","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T09:44:52Z","cross_cats_sorted":[],"title_canon_sha256":"72022be91883526abec6218c57e08d827a0d69133ca7744f16ab4c9f018c465e","abstract_canon_sha256":"21eeb227fffcb888467f48ac029777a7b98e4982606b0c314c27cf731ba353dd"},"schema_version":"1.0"},"canonical_sha256":"2f5028408f444f337382f0d47032985e3ae82af79e4f611a218f7777ed4f0a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:17.059531Z","signature_b64":"ujWQ6TGhzhiWk0FeoSIbx9LzeQItqEiW2B+Hys7fac9otN4j5r8aOPVf3PmhY1zitrndkOmcZKEKdvJpDOB6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5028408f444f337382f0d47032985e3ae82af79e4f611a218f7777ed4f0a19","last_reissued_at":"2026-07-05T10:43:17.059066Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:17.059066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.01548","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-07-05T10:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+2Q3KcCkd1YwCF4cSZLmXy1GZBsMve5Xd3q/aQ1E3ihMkpLmh87PlcpoSX+0SDWbcMWxL6WyLq5HJvRyozVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:40:13.859248Z"},"content_sha256":"cabc6e1aaa6f5cd2f7a19ca27e3bd19bcf6a24bf558ea13334881e5365688510","schema_version":"1.0","event_id":"sha256:cabc6e1aaa6f5cd2f7a19ca27e3bd19bcf6a24bf558ea13334881e5365688510"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:F5ICQQEPIRHTG44C6DKHAMUYLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Defective coloring of blowups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Raphael Steiner, Sergey Norin","submitted_at":"2025-04-02T09:44:52Z","abstract_excerpt":"Given a graph $G$ and an integer $d\\ge 0$, its $d$-defective chromatic number $\\chi^d(G)$ is the smallest size of a partition of the vertices into parts inducing subgraphs with maximum degree at most $d$. Guo, Kang and Zwaneveld recently studied the relationship between the $d$-defective chromatic number of the $(d+1)$-fold (clique) blowup $G\\boxtimes K_{d+1}$ of a graph $G$ and its ordinary chromatic number, and conjectured that $\\chi(G)=\\chi^d(G\\boxtimes K_{d+1})$ for every graph $G$ and $d\\ge 0$. In this note we disprove this conjecture by constructing graphs $G$ of arbitrarily large chroma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01548","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.01548/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-05T10:43:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpOtDBqUc05qZm75PN/eUY3HBm40oJYvGpcJalK8/agwPMkT4nvifMPyAirPaS6Dr38fLqopJWIXqbuEBJ9nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T02:40:13.859714Z"},"content_sha256":"7b33b076596095bbeee68a1bf258e0167ec716a9458b24c84cd56e894e57cda7","schema_version":"1.0","event_id":"sha256:7b33b076596095bbeee68a1bf258e0167ec716a9458b24c84cd56e894e57cda7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/bundle.json","state_url":"https://pith.science/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/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-14T02:40:13Z","links":{"resolver":"https://pith.science/pith/F5ICQQEPIRHTG44C6DKHAMUYLY","bundle":"https://pith.science/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/bundle.json","state":"https://pith.science/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5ICQQEPIRHTG44C6DKHAMUYLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:F5ICQQEPIRHTG44C6DKHAMUYLY","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":"21eeb227fffcb888467f48ac029777a7b98e4982606b0c314c27cf731ba353dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T09:44:52Z","title_canon_sha256":"72022be91883526abec6218c57e08d827a0d69133ca7744f16ab4c9f018c465e"},"schema_version":"1.0","source":{"id":"2504.01548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.01548","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"arxiv_version","alias_value":"2504.01548v1","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.01548","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_12","alias_value":"F5ICQQEPIRHT","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_16","alias_value":"F5ICQQEPIRHTG44C","created_at":"2026-07-05T10:43:17Z"},{"alias_kind":"pith_short_8","alias_value":"F5ICQQEP","created_at":"2026-07-05T10:43:17Z"}],"graph_snapshots":[{"event_id":"sha256:7b33b076596095bbeee68a1bf258e0167ec716a9458b24c84cd56e894e57cda7","target":"graph","created_at":"2026-07-05T10:43:17Z","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/2504.01548/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph $G$ and an integer $d\\ge 0$, its $d$-defective chromatic number $\\chi^d(G)$ is the smallest size of a partition of the vertices into parts inducing subgraphs with maximum degree at most $d$. Guo, Kang and Zwaneveld recently studied the relationship between the $d$-defective chromatic number of the $(d+1)$-fold (clique) blowup $G\\boxtimes K_{d+1}$ of a graph $G$ and its ordinary chromatic number, and conjectured that $\\chi(G)=\\chi^d(G\\boxtimes K_{d+1})$ for every graph $G$ and $d\\ge 0$. In this note we disprove this conjecture by constructing graphs $G$ of arbitrarily large chroma","authors_text":"Raphael Steiner, Sergey Norin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T09:44:52Z","title":"Defective coloring of blowups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.01548","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:cabc6e1aaa6f5cd2f7a19ca27e3bd19bcf6a24bf558ea13334881e5365688510","target":"record","created_at":"2026-07-05T10:43:17Z","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":"21eeb227fffcb888467f48ac029777a7b98e4982606b0c314c27cf731ba353dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-02T09:44:52Z","title_canon_sha256":"72022be91883526abec6218c57e08d827a0d69133ca7744f16ab4c9f018c465e"},"schema_version":"1.0","source":{"id":"2504.01548","kind":"arxiv","version":1}},"canonical_sha256":"2f5028408f444f337382f0d47032985e3ae82af79e4f611a218f7777ed4f0a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f5028408f444f337382f0d47032985e3ae82af79e4f611a218f7777ed4f0a19","first_computed_at":"2026-07-05T10:43:17.059066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:17.059066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ujWQ6TGhzhiWk0FeoSIbx9LzeQItqEiW2B+Hys7fac9otN4j5r8aOPVf3PmhY1zitrndkOmcZKEKdvJpDOB6CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:17.059531Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.01548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cabc6e1aaa6f5cd2f7a19ca27e3bd19bcf6a24bf558ea13334881e5365688510","sha256:7b33b076596095bbeee68a1bf258e0167ec716a9458b24c84cd56e894e57cda7"],"state_sha256":"4425e376a327717d3510d37882a6051450234c19b316f18897d1f60c268b0029"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIBCHjxmDduOdZCpnHkK31e1VbxDaSLCAmo93xVsmG9R/E/pnL324JHvcgLERnCBG5mZkST/9T0TFRCbjGqHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T02:40:13.862944Z","bundle_sha256":"5fa5f827e3963a820eeecf3625907f0d1d564016f643c7b4195c8b1a10378efe"}}