{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NV3GQCSQPCCN3TR5AJBFCAGM3Q","short_pith_number":"pith:NV3GQCSQ","schema_version":"1.0","canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","source":{"kind":"arxiv","id":"1303.2753","version":1},"attestation_state":"computed","paper":{"title":"On Choosability with Separation of Planar Graphs with Forbidden Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Derrick Stolee, Ilkyoo Choi","submitted_at":"2013-03-12T02:42:26Z","abstract_excerpt":"We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)-list assignment L on a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k,d)-choosable if there exists an L-coloring of G for every (k,d)-list assignment L. This concept is also known as choosability with separation. We prove that planar graphs without 4-cycles are (3,1)-choosable and that planar graphs without 5-cycles and 6-cycles are (3,1)-choosable. In addition"},"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":"1303.2753","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-12T02:42:26Z","cross_cats_sorted":[],"title_canon_sha256":"126e0b40f884dc826800f6b064f87149edbbb8855e6449788c34f735ed434771","abstract_canon_sha256":"a7d553d91f0cd147a04dc649c893b2c29a1ac2acd421a1b294eb3d34fc530a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.440206Z","signature_b64":"7EitEBqQNFim5NxLBcgXvvAOKayG3OUmeZK5bmpBFp9SV4noMwaXFuAufLuO3gXWsuqd7hdxIZpo28W502u8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","last_reissued_at":"2026-05-18T00:54:58.439749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.439749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Choosability with Separation of Planar Graphs with Forbidden Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bernard Lidick\\'y, Derrick Stolee, Ilkyoo Choi","submitted_at":"2013-03-12T02:42:26Z","abstract_excerpt":"We study choosability with separation which is a constrained version of list coloring of graphs. A (k,d)-list assignment L on a graph G is a function that assigns to each vertex v a list L(v) of at least k colors and for any adjacent pair xy, the lists L(x) and L(y) share at most d colors. A graph G is (k,d)-choosable if there exists an L-coloring of G for every (k,d)-list assignment L. This concept is also known as choosability with separation. We prove that planar graphs without 4-cycles are (3,1)-choosable and that planar graphs without 5-cycles and 6-cycles are (3,1)-choosable. In addition"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2753","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":""},"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":"1303.2753","created_at":"2026-05-18T00:54:58.439813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2753v1","created_at":"2026-05-18T00:54:58.439813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2753","created_at":"2026-05-18T00:54:58.439813+00:00"},{"alias_kind":"pith_short_12","alias_value":"NV3GQCSQPCCN","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NV3GQCSQPCCN3TR5","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NV3GQCSQ","created_at":"2026-05-18T12:27:52.871228+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/NV3GQCSQPCCN3TR5AJBFCAGM3Q","json":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q.json","graph_json":"https://pith.science/api/pith-number/NV3GQCSQPCCN3TR5AJBFCAGM3Q/graph.json","events_json":"https://pith.science/api/pith-number/NV3GQCSQPCCN3TR5AJBFCAGM3Q/events.json","paper":"https://pith.science/paper/NV3GQCSQ"},"agent_actions":{"view_html":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q","download_json":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q.json","view_paper":"https://pith.science/paper/NV3GQCSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2753&json=true","fetch_graph":"https://pith.science/api/pith-number/NV3GQCSQPCCN3TR5AJBFCAGM3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/NV3GQCSQPCCN3TR5AJBFCAGM3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/action/storage_attestation","attest_author":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/action/author_attestation","sign_citation":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/action/citation_signature","submit_replication":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/action/replication_record"}},"created_at":"2026-05-18T00:54:58.439813+00:00","updated_at":"2026-05-18T00:54:58.439813+00:00"}