{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6SXI43RJ4NETES5B2SQLHMKAUE","short_pith_number":"pith:6SXI43RJ","schema_version":"1.0","canonical_sha256":"f4ae8e6e29e349324ba1d4a0b3b140a114e222a362d7840eecd44224a7d59c4b","source":{"kind":"arxiv","id":"2606.31702","version":1},"attestation_state":"computed","paper":{"title":"List-Coloring and Chromatic-Choosability -- A Dynamic Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K Somasundaram, Nandana K Vasudevan, N Narayanan","submitted_at":"2026-06-30T14:10:19Z","abstract_excerpt":"List-coloring, introduced independently by Vizing and by Erd\\H{o}s, Rubin, and Taylor in the 1970s, generalizes ordinary vertex coloring by assigning to each vertex its own set of admissible colors. A graph is chromatic-choosable if its list chromatic number equals its chromatic number. The previous survey on list-coloring by D R Woodall (2001), emphasized defective choosability, the list-coloring conjectures, and different methods used for list-coloring. This survey reviews major developments on list-coloring and chromatic-choosability, with emphasis on graph classes for which equality is kno"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.31702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-30T14:10:19Z","cross_cats_sorted":[],"title_canon_sha256":"f8e439f53672e41f0631c63ef2847917450b3b416ee4d49e3f873914c7074ad4","abstract_canon_sha256":"314e88bf0d5776a8763990dc6ba89cddead82b1dcba52afccc6ae57baf2bfa8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:12.214372Z","signature_b64":"S0fq4u45vGlJjT6ChS6nvy+kqyArtnw9xRKuPwq7F+DxG4zRNyQR1BPpMaOE75kfDq/0+Yt6EF3WNcEXbJ4rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ae8e6e29e349324ba1d4a0b3b140a114e222a362d7840eecd44224a7d59c4b","last_reissued_at":"2026-07-01T01:18:12.213908Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:12.213908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List-Coloring and Chromatic-Choosability -- A Dynamic Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"K Somasundaram, Nandana K Vasudevan, N Narayanan","submitted_at":"2026-06-30T14:10:19Z","abstract_excerpt":"List-coloring, introduced independently by Vizing and by Erd\\H{o}s, Rubin, and Taylor in the 1970s, generalizes ordinary vertex coloring by assigning to each vertex its own set of admissible colors. A graph is chromatic-choosable if its list chromatic number equals its chromatic number. The previous survey on list-coloring by D R Woodall (2001), emphasized defective choosability, the list-coloring conjectures, and different methods used for list-coloring. This survey reviews major developments on list-coloring and chromatic-choosability, with emphasis on graph classes for which equality is kno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31702","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/2606.31702/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.31702","created_at":"2026-07-01T01:18:12.213968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31702v1","created_at":"2026-07-01T01:18:12.213968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31702","created_at":"2026-07-01T01:18:12.213968+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SXI43RJ4NET","created_at":"2026-07-01T01:18:12.213968+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SXI43RJ4NETES5B","created_at":"2026-07-01T01:18:12.213968+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SXI43RJ","created_at":"2026-07-01T01:18:12.213968+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE","json":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE.json","graph_json":"https://pith.science/api/pith-number/6SXI43RJ4NETES5B2SQLHMKAUE/graph.json","events_json":"https://pith.science/api/pith-number/6SXI43RJ4NETES5B2SQLHMKAUE/events.json","paper":"https://pith.science/paper/6SXI43RJ"},"agent_actions":{"view_html":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE","download_json":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE.json","view_paper":"https://pith.science/paper/6SXI43RJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31702&json=true","fetch_graph":"https://pith.science/api/pith-number/6SXI43RJ4NETES5B2SQLHMKAUE/graph.json","fetch_events":"https://pith.science/api/pith-number/6SXI43RJ4NETES5B2SQLHMKAUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE/action/storage_attestation","attest_author":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE/action/author_attestation","sign_citation":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE/action/citation_signature","submit_replication":"https://pith.science/pith/6SXI43RJ4NETES5B2SQLHMKAUE/action/replication_record"}},"created_at":"2026-07-01T01:18:12.213968+00:00","updated_at":"2026-07-01T01:18:12.213968+00:00"}