{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7UN2PT5SEV32TPJXVGJCKCVSOP","short_pith_number":"pith:7UN2PT5S","canonical_record":{"source":{"id":"2306.11995","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T03:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a358febf9131fc42f91d3fe9c5f96732dbd5e0b74e86be6d5bb81d4da964c12","abstract_canon_sha256":"32135947a56e862ff6957ddb3b9dd44e390009b7b912fca52646845f870f5b16"},"schema_version":"1.0"},"canonical_sha256":"fd1ba7cfb22577a9bd37a992250ab273e56b3f5dd71c0ad6b79d2629285a7ad7","source":{"kind":"arxiv","id":"2306.11995","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11995","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11995v2","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11995","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"7UN2PT5SEV32","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_16","alias_value":"7UN2PT5SEV32TPJX","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_8","alias_value":"7UN2PT5S","created_at":"2026-07-05T06:24:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7UN2PT5SEV32TPJXVGJCKCVSOP","target":"record","payload":{"canonical_record":{"source":{"id":"2306.11995","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T03:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"4a358febf9131fc42f91d3fe9c5f96732dbd5e0b74e86be6d5bb81d4da964c12","abstract_canon_sha256":"32135947a56e862ff6957ddb3b9dd44e390009b7b912fca52646845f870f5b16"},"schema_version":"1.0"},"canonical_sha256":"fd1ba7cfb22577a9bd37a992250ab273e56b3f5dd71c0ad6b79d2629285a7ad7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:01.161092Z","signature_b64":"irNaJZQeo81qFR1VzhFwSytBBWbkEX45mdLBSCOJH1wOCbotD8Nv/x5TYKCxF3jGqMZvKOGgfo0bnnlNfnfNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd1ba7cfb22577a9bd37a992250ab273e56b3f5dd71c0ad6b79d2629285a7ad7","last_reissued_at":"2026-07-05T06:24:01.160740Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:01.160740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.11995","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-07-05T06:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qndorCeuDmXawso6fnHjEc7gLN7IYmKF0zu2EIh8FbRSTitY8MyWd40Oi+cuHBCqt5lzY39PgZ5Kgej50c2VCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:03:28.063609Z"},"content_sha256":"f4b1e597b43bd13840bbe97b75d020f480db5d1e6f1e5513042cd85406ef3586","schema_version":"1.0","event_id":"sha256:f4b1e597b43bd13840bbe97b75d020f480db5d1e6f1e5513042cd85406ef3586"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7UN2PT5SEV32TPJXVGJCKCVSOP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Two problems of defective choosability","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Rongxing Xu, Xuding Zhu","submitted_at":"2023-06-21T03:12:45Z","abstract_excerpt":"Given positive integers $p \\ge k$, and a non-negative integer $d$, we say a graph $G$ is $(k,d,p)$-choosable if for every list assignment $L$ with $|L(v)|\\geq k$ for each $v \\in V(G)$ and $|\\bigcup_{v\\in V(G)}L(v)| \\leq p$, there exists an $L$-coloring of $G$ such that each monochromatic subgraph has maximum degree at most $d$. In particular, $(k,0,k)$-choosable means $k$-colorable, $(k,0,+\\infty)$-choosable means $k$-choosable and $(k,d,+\\infty)$-choosable means $d$-defective $k$-choosable. This paper proves that there are 1-defective 3-choosable graphs that are not 4-choosable, and for any p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11995","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.11995/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-05T06:24:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1k5fSddTh3xE2Iu7Rbw1Km3DsOq/lMTYpqr8VjdzHHSn1ul2vrZ1qHKdhlIM76fD0aFIpcM9xAVH1ADcmu4ACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T01:03:28.063977Z"},"content_sha256":"63625ae131c9ce6f492bf932c3839ba91e9e8d1647ae5ea1f38b3047ddc3554b","schema_version":"1.0","event_id":"sha256:63625ae131c9ce6f492bf932c3839ba91e9e8d1647ae5ea1f38b3047ddc3554b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/bundle.json","state_url":"https://pith.science/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/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-07-09T01:03:28Z","links":{"resolver":"https://pith.science/pith/7UN2PT5SEV32TPJXVGJCKCVSOP","bundle":"https://pith.science/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/bundle.json","state":"https://pith.science/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UN2PT5SEV32TPJXVGJCKCVSOP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7UN2PT5SEV32TPJXVGJCKCVSOP","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":"32135947a56e862ff6957ddb3b9dd44e390009b7b912fca52646845f870f5b16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T03:12:45Z","title_canon_sha256":"4a358febf9131fc42f91d3fe9c5f96732dbd5e0b74e86be6d5bb81d4da964c12"},"schema_version":"1.0","source":{"id":"2306.11995","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.11995","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"arxiv_version","alias_value":"2306.11995v2","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.11995","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_12","alias_value":"7UN2PT5SEV32","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_16","alias_value":"7UN2PT5SEV32TPJX","created_at":"2026-07-05T06:24:01Z"},{"alias_kind":"pith_short_8","alias_value":"7UN2PT5S","created_at":"2026-07-05T06:24:01Z"}],"graph_snapshots":[{"event_id":"sha256:63625ae131c9ce6f492bf932c3839ba91e9e8d1647ae5ea1f38b3047ddc3554b","target":"graph","created_at":"2026-07-05T06:24:01Z","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/2306.11995/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given positive integers $p \\ge k$, and a non-negative integer $d$, we say a graph $G$ is $(k,d,p)$-choosable if for every list assignment $L$ with $|L(v)|\\geq k$ for each $v \\in V(G)$ and $|\\bigcup_{v\\in V(G)}L(v)| \\leq p$, there exists an $L$-coloring of $G$ such that each monochromatic subgraph has maximum degree at most $d$. In particular, $(k,0,k)$-choosable means $k$-colorable, $(k,0,+\\infty)$-choosable means $k$-choosable and $(k,d,+\\infty)$-choosable means $d$-defective $k$-choosable. This paper proves that there are 1-defective 3-choosable graphs that are not 4-choosable, and for any p","authors_text":"Jie Ma, Rongxing Xu, Xuding Zhu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T03:12:45Z","title":"On Two problems of defective choosability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.11995","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:f4b1e597b43bd13840bbe97b75d020f480db5d1e6f1e5513042cd85406ef3586","target":"record","created_at":"2026-07-05T06:24:01Z","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":"32135947a56e862ff6957ddb3b9dd44e390009b7b912fca52646845f870f5b16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-21T03:12:45Z","title_canon_sha256":"4a358febf9131fc42f91d3fe9c5f96732dbd5e0b74e86be6d5bb81d4da964c12"},"schema_version":"1.0","source":{"id":"2306.11995","kind":"arxiv","version":2}},"canonical_sha256":"fd1ba7cfb22577a9bd37a992250ab273e56b3f5dd71c0ad6b79d2629285a7ad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd1ba7cfb22577a9bd37a992250ab273e56b3f5dd71c0ad6b79d2629285a7ad7","first_computed_at":"2026-07-05T06:24:01.160740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:24:01.160740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irNaJZQeo81qFR1VzhFwSytBBWbkEX45mdLBSCOJH1wOCbotD8Nv/x5TYKCxF3jGqMZvKOGgfo0bnnlNfnfNDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:24:01.161092Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.11995","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4b1e597b43bd13840bbe97b75d020f480db5d1e6f1e5513042cd85406ef3586","sha256:63625ae131c9ce6f492bf932c3839ba91e9e8d1647ae5ea1f38b3047ddc3554b"],"state_sha256":"8a3eb791ae36fa12b9eed1a0511560a59192bfd2cbd5c5714ecb5e8467e39b00"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpS47ho6LgjfD2227MShA7doa/MwobziC2DsYrsDrZwRxxSx1tRSUOMjjYN3b0CywOOwkTATmbv+pt+ya/maDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T01:03:28.065967Z","bundle_sha256":"ca6f77f354cf6f374978690561b69e694e5ef21f8390283f0a7741b1b79c3df3"}}