{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NV3GQCSQPCCN3TR5AJBFCAGM3Q","short_pith_number":"pith:NV3GQCSQ","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"},"canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","source":{"kind":"arxiv","id":"1303.2753","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2753","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2753v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2753","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"NV3GQCSQPCCN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NV3GQCSQPCCN3TR5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NV3GQCSQ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NV3GQCSQPCCN3TR5AJBFCAGM3Q","target":"record","payload":{"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"},"canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","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"},"source_kind":"arxiv","source_id":"1303.2753","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-05-18T00:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RJuMkghE7IT4hqSTDkNXRxYpjmU5flRnKSN5IYP0QESLsApMWHUX46hJggeo4G561pl9RuKGYJvk934rUY9YCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:54.219823Z"},"content_sha256":"51cd36aa64c5869c309cb56a5587850bfca50899ff2385bc669d4524eaafaac0","schema_version":"1.0","event_id":"sha256:51cd36aa64c5869c309cb56a5587850bfca50899ff2385bc669d4524eaafaac0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NV3GQCSQPCCN3TR5AJBFCAGM3Q","target":"graph","payload":{"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"},"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:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9IdCB+suExIEzcNhQepXjQSUz1M9vP3Jxuix3HSOVisKjomgE51q8D5P6ErVNZsW7HfIUH/jsxX5jARNmkiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:43:54.220173Z"},"content_sha256":"6c6b66a5c1a5eed7674b92d25d36c427c281d894f6645390b40b4b5ad17f15cc","schema_version":"1.0","event_id":"sha256:6c6b66a5c1a5eed7674b92d25d36c427c281d894f6645390b40b4b5ad17f15cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/bundle.json","state_url":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/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-05-30T08:43:54Z","links":{"resolver":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q","bundle":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/bundle.json","state":"https://pith.science/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NV3GQCSQPCCN3TR5AJBFCAGM3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NV3GQCSQPCCN3TR5AJBFCAGM3Q","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":"a7d553d91f0cd147a04dc649c893b2c29a1ac2acd421a1b294eb3d34fc530a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-12T02:42:26Z","title_canon_sha256":"126e0b40f884dc826800f6b064f87149edbbb8855e6449788c34f735ed434771"},"schema_version":"1.0","source":{"id":"1303.2753","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2753","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2753v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2753","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"NV3GQCSQPCCN","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NV3GQCSQPCCN3TR5","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NV3GQCSQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:6c6b66a5c1a5eed7674b92d25d36c427c281d894f6645390b40b4b5ad17f15cc","target":"graph","created_at":"2026-05-18T00:54:58Z","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 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","authors_text":"Bernard Lidick\\'y, Derrick Stolee, Ilkyoo Choi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-12T02:42:26Z","title":"On Choosability with Separation of Planar Graphs with Forbidden Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2753","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:51cd36aa64c5869c309cb56a5587850bfca50899ff2385bc669d4524eaafaac0","target":"record","created_at":"2026-05-18T00:54:58Z","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":"a7d553d91f0cd147a04dc649c893b2c29a1ac2acd421a1b294eb3d34fc530a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-12T02:42:26Z","title_canon_sha256":"126e0b40f884dc826800f6b064f87149edbbb8855e6449788c34f735ed434771"},"schema_version":"1.0","source":{"id":"1303.2753","kind":"arxiv","version":1}},"canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d76680a507884ddce3d02425100ccdc06e6673b5c17cc68643c0b3e5e649ea4","first_computed_at":"2026-05-18T00:54:58.439749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.439749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7EitEBqQNFim5NxLBcgXvvAOKayG3OUmeZK5bmpBFp9SV4noMwaXFuAufLuO3gXWsuqd7hdxIZpo28W502u8BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.440206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2753","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51cd36aa64c5869c309cb56a5587850bfca50899ff2385bc669d4524eaafaac0","sha256:6c6b66a5c1a5eed7674b92d25d36c427c281d894f6645390b40b4b5ad17f15cc"],"state_sha256":"2d704cee357200bcbebd44bc767e134d910874f7680a779b71d05ab8af9ed81b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"voM8Dyg0Q6OE6FvsoWbh3MdsMS82dWtHqkXKMgyJYixjT0HH4X1OB/7vL1cvjre+27HgQ7jabwIBrME8No+GBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:43:54.222213Z","bundle_sha256":"d4adb8ef3bdfe17b278ec2922fa0dbbd41bfdbebcc1805cd91cbef356bcc8864"}}