{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JUHYU6P3X4K6K3ANSYJHL3MVYX","short_pith_number":"pith:JUHYU6P3","canonical_record":{"source":{"id":"1805.02147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T04:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"11bd20efc807bccde2f9a2b3549a0220a177b0108b08e3cb165943a6bc5deced","abstract_canon_sha256":"9e1e7e530a826050fd667aefe5bc18f2e19021dd180bcf2c35e83333fc56d6f2"},"schema_version":"1.0"},"canonical_sha256":"4d0f8a79fbbf15e56c0d961275ed95c5efa5efd154bb7f1ee2a83909df62bff9","source":{"kind":"arxiv","id":"1805.02147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02147","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02147v2","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02147","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"JUHYU6P3X4K6","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUHYU6P3X4K6K3AN","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUHYU6P3","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JUHYU6P3X4K6K3ANSYJHL3MVYX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T04:45:45Z","cross_cats_sorted":[],"title_canon_sha256":"11bd20efc807bccde2f9a2b3549a0220a177b0108b08e3cb165943a6bc5deced","abstract_canon_sha256":"9e1e7e530a826050fd667aefe5bc18f2e19021dd180bcf2c35e83333fc56d6f2"},"schema_version":"1.0"},"canonical_sha256":"4d0f8a79fbbf15e56c0d961275ed95c5efa5efd154bb7f1ee2a83909df62bff9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:48.114159Z","signature_b64":"NoYni4DM2iGkBkUYbIXBfIxkq1AyVKetKIFV28QtIX4nD/Jc/fCSrb82/4t24c70yXW9tbtDMf9T5uth+Rd+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d0f8a79fbbf15e56c0d961275ed95c5efa5efd154bb7f1ee2a83909df62bff9","last_reissued_at":"2026-05-18T00:08:48.113499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:48.113499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02147","source_version":2,"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-05-18T00:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0CrdZ7ljoP7n8Vf8AG4sdXaq0jimUYgrD1fhWivqxRMDRbb/KX09YEOZL+Zz6FjekCmChypgNzkDAxGa5HZGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:34:17.131875Z"},"content_sha256":"292d74384adfc809add5981a6281ce8f9bb464f2d43ce75dfa54cf82ce48b088","schema_version":"1.0","event_id":"sha256:292d74384adfc809add5981a6281ce8f9bb464f2d43ce75dfa54cf82ce48b088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JUHYU6P3X4K6K3ANSYJHL3MVYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Criticality, The List Color Function, and List Coloring the Cartesian Product of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hemanshu Kaul, Jeffrey A. Mudrock","submitted_at":"2018-05-06T04:45:45Z","abstract_excerpt":"We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph $G$ to be strong $k$-chromatic-choosable if $\\chi(G) = k$ and every $(k-1)$-assignment for which $G$ is not list-colorable has the property that the lists are the same for all vertices. That is the usual coloring is, in some sense, the obstacle to list-coloring. We prove basic properties of strongly chromatic-choosable graphs such as chromatic-choosability and vertex-criticality, and we construct infinite families of strongly chromatic-choosable graphs. We derive a sufficient condition for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02147","kind":"arxiv","version":2},"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"},"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-05-18T00:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfBGFZxkWLpdOs6xgC+wM6qBTONRXpqXFnYa2LWdVANtR52aNxRQQ3l+JyTssI1avODGYcJJLuIyS87RiUmCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:34:17.132525Z"},"content_sha256":"f7e082cec74bf9f0d9856a79244be4797d6ac4f1c6026b30feb966763a00c3a3","schema_version":"1.0","event_id":"sha256:f7e082cec74bf9f0d9856a79244be4797d6ac4f1c6026b30feb966763a00c3a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/bundle.json","state_url":"https://pith.science/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/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-06-04T03:34:17Z","links":{"resolver":"https://pith.science/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX","bundle":"https://pith.science/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/bundle.json","state":"https://pith.science/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUHYU6P3X4K6K3ANSYJHL3MVYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JUHYU6P3X4K6K3ANSYJHL3MVYX","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":"9e1e7e530a826050fd667aefe5bc18f2e19021dd180bcf2c35e83333fc56d6f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T04:45:45Z","title_canon_sha256":"11bd20efc807bccde2f9a2b3549a0220a177b0108b08e3cb165943a6bc5deced"},"schema_version":"1.0","source":{"id":"1805.02147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02147","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02147v2","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02147","created_at":"2026-05-18T00:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"JUHYU6P3X4K6","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JUHYU6P3X4K6K3AN","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JUHYU6P3","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:f7e082cec74bf9f0d9856a79244be4797d6ac4f1c6026b30feb966763a00c3a3","target":"graph","created_at":"2026-05-18T00:08:48Z","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"},"paper":{"abstract_excerpt":"We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph $G$ to be strong $k$-chromatic-choosable if $\\chi(G) = k$ and every $(k-1)$-assignment for which $G$ is not list-colorable has the property that the lists are the same for all vertices. That is the usual coloring is, in some sense, the obstacle to list-coloring. We prove basic properties of strongly chromatic-choosable graphs such as chromatic-choosability and vertex-criticality, and we construct infinite families of strongly chromatic-choosable graphs. We derive a sufficient condition for th","authors_text":"Hemanshu Kaul, Jeffrey A. Mudrock","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T04:45:45Z","title":"Criticality, The List Color Function, and List Coloring the Cartesian Product of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02147","kind":"arxiv","version":2},"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:292d74384adfc809add5981a6281ce8f9bb464f2d43ce75dfa54cf82ce48b088","target":"record","created_at":"2026-05-18T00:08:48Z","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":"9e1e7e530a826050fd667aefe5bc18f2e19021dd180bcf2c35e83333fc56d6f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-06T04:45:45Z","title_canon_sha256":"11bd20efc807bccde2f9a2b3549a0220a177b0108b08e3cb165943a6bc5deced"},"schema_version":"1.0","source":{"id":"1805.02147","kind":"arxiv","version":2}},"canonical_sha256":"4d0f8a79fbbf15e56c0d961275ed95c5efa5efd154bb7f1ee2a83909df62bff9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d0f8a79fbbf15e56c0d961275ed95c5efa5efd154bb7f1ee2a83909df62bff9","first_computed_at":"2026-05-18T00:08:48.113499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:48.113499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NoYni4DM2iGkBkUYbIXBfIxkq1AyVKetKIFV28QtIX4nD/Jc/fCSrb82/4t24c70yXW9tbtDMf9T5uth+Rd+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:48.114159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:292d74384adfc809add5981a6281ce8f9bb464f2d43ce75dfa54cf82ce48b088","sha256:f7e082cec74bf9f0d9856a79244be4797d6ac4f1c6026b30feb966763a00c3a3"],"state_sha256":"f5cb99c4414aeea73b15ae9e76d857909ade820cb53bdc357b0c4cf7bd795886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ga60kQSPFoI53NMwQDYunRZ5yi9fQ7aLm31zXLLm4NURmW0EJSZpE37Sq0XDWHqU9JcN1fOheTeakyrd3zdIAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:34:17.135847Z","bundle_sha256":"4c592cbc1e181ad51eea052c8ff287f9d22d35a1ef45ea53a35217c55ed555c8"}}