{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JNGSZNBPCH6H56BFTTCXXVABGD","short_pith_number":"pith:JNGSZNBP","canonical_record":{"source":{"id":"1302.2599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T20:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"ecbd588eaeea40fcb0343ace21110ed01f96a7079ca5312a0122e845173e7ee1","abstract_canon_sha256":"e6b4eeecc6225c79b4d375a4c1c43a753d43da953532ba5429a40876e955b761"},"schema_version":"1.0"},"canonical_sha256":"4b4d2cb42f11fc7ef8259cc57bd40130c003b9099e3f4b515930dd402541210d","source":{"kind":"arxiv","id":"1302.2599","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2599","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2599v1","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2599","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"JNGSZNBPCH6H","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNGSZNBPCH6H56BF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNGSZNBP","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JNGSZNBPCH6H56BFTTCXXVABGD","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T20:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"ecbd588eaeea40fcb0343ace21110ed01f96a7079ca5312a0122e845173e7ee1","abstract_canon_sha256":"e6b4eeecc6225c79b4d375a4c1c43a753d43da953532ba5429a40876e955b761"},"schema_version":"1.0"},"canonical_sha256":"4b4d2cb42f11fc7ef8259cc57bd40130c003b9099e3f4b515930dd402541210d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:00.667520Z","signature_b64":"ecNWAqezDInKVvWNKksrCI64AvuKan+lz+ln/EQmJe0fLQfX6T01+Or2Ld+bGeWHFe8n/NDSs1/p1wIDjq19BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4d2cb42f11fc7ef8259cc57bd40130c003b9099e3f4b515930dd402541210d","last_reissued_at":"2026-05-18T03:34:00.666774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:00.666774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2599","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-18T03:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DEmgz7WQWlKM/p/hB79PfsCdEajHz9ioWTJ1pqHInhE/AhCW9zZj2SFiQPNj7jp1RKOLrfRLjJJ5mYR5W9GTBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:41.591119Z"},"content_sha256":"4e45da370b63d439742eae1ca20f1b72804fefea19d64f18d0dfa01a24255bf2","schema_version":"1.0","event_id":"sha256:4e45da370b63d439742eae1ca20f1b72804fefea19d64f18d0dfa01a24255bf2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JNGSZNBPCH6H56BFTTCXXVABGD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$(3,1)^*$-choosability of planar graphs without adjacent short cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andre Raspaud, Min Chen","submitted_at":"2013-02-11T20:15:58Z","abstract_excerpt":"A list assignment of a graph $G$ is a function $L$ that assigns a list $L(v)$ of colors to each vertex $v\\in V(G)$. An $(L,d)^*$-coloring is a mapping $\\pi$ that assigns a color $\\pi(v)\\in L(v)$ to each vertex $v\\in V(G)$ so that at most $d$ neighbors of $v$ receive color $\\pi(v)$. A graph $G$ is said to be $(k,d)^*$-choosable if it admits an $(L,d)^*$-coloring for every list assignment $L$ with $|L(v)|\\ge k$ for all $v\\in V(G)$. In 2001, Lih et al. \\cite{LSWZ-01} proved that planar graphs without 4- and $l$-cycles are $(3,1)^*$-choosable, where $l\\in \\{5,6,7\\}$. Later, Dong and Xu \\cite{DX-09"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2599","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-18T03:34:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"giwIZ/qqql0yDw/jvVDc5kVNVeGEuO80rOkFXwUEQDSrOhLez73H6RD1L4+IVKS9+Mmb6sL1AOi21+k81YKMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:07:41.591483Z"},"content_sha256":"8b372f61622a23ad7017a082f7ba433e7877b406650ac6e7c5e77e9129ae6436","schema_version":"1.0","event_id":"sha256:8b372f61622a23ad7017a082f7ba433e7877b406650ac6e7c5e77e9129ae6436"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNGSZNBPCH6H56BFTTCXXVABGD/bundle.json","state_url":"https://pith.science/pith/JNGSZNBPCH6H56BFTTCXXVABGD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNGSZNBPCH6H56BFTTCXXVABGD/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-03T22:07:41Z","links":{"resolver":"https://pith.science/pith/JNGSZNBPCH6H56BFTTCXXVABGD","bundle":"https://pith.science/pith/JNGSZNBPCH6H56BFTTCXXVABGD/bundle.json","state":"https://pith.science/pith/JNGSZNBPCH6H56BFTTCXXVABGD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNGSZNBPCH6H56BFTTCXXVABGD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JNGSZNBPCH6H56BFTTCXXVABGD","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":"e6b4eeecc6225c79b4d375a4c1c43a753d43da953532ba5429a40876e955b761","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T20:15:58Z","title_canon_sha256":"ecbd588eaeea40fcb0343ace21110ed01f96a7079ca5312a0122e845173e7ee1"},"schema_version":"1.0","source":{"id":"1302.2599","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2599","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2599v1","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2599","created_at":"2026-05-18T03:34:00Z"},{"alias_kind":"pith_short_12","alias_value":"JNGSZNBPCH6H","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JNGSZNBPCH6H56BF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JNGSZNBP","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:8b372f61622a23ad7017a082f7ba433e7877b406650ac6e7c5e77e9129ae6436","target":"graph","created_at":"2026-05-18T03:34:00Z","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":"A list assignment of a graph $G$ is a function $L$ that assigns a list $L(v)$ of colors to each vertex $v\\in V(G)$. An $(L,d)^*$-coloring is a mapping $\\pi$ that assigns a color $\\pi(v)\\in L(v)$ to each vertex $v\\in V(G)$ so that at most $d$ neighbors of $v$ receive color $\\pi(v)$. A graph $G$ is said to be $(k,d)^*$-choosable if it admits an $(L,d)^*$-coloring for every list assignment $L$ with $|L(v)|\\ge k$ for all $v\\in V(G)$. In 2001, Lih et al. \\cite{LSWZ-01} proved that planar graphs without 4- and $l$-cycles are $(3,1)^*$-choosable, where $l\\in \\{5,6,7\\}$. Later, Dong and Xu \\cite{DX-09","authors_text":"Andre Raspaud, Min Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T20:15:58Z","title":"$(3,1)^*$-choosability of planar graphs without adjacent short cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2599","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:4e45da370b63d439742eae1ca20f1b72804fefea19d64f18d0dfa01a24255bf2","target":"record","created_at":"2026-05-18T03:34:00Z","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":"e6b4eeecc6225c79b4d375a4c1c43a753d43da953532ba5429a40876e955b761","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-11T20:15:58Z","title_canon_sha256":"ecbd588eaeea40fcb0343ace21110ed01f96a7079ca5312a0122e845173e7ee1"},"schema_version":"1.0","source":{"id":"1302.2599","kind":"arxiv","version":1}},"canonical_sha256":"4b4d2cb42f11fc7ef8259cc57bd40130c003b9099e3f4b515930dd402541210d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b4d2cb42f11fc7ef8259cc57bd40130c003b9099e3f4b515930dd402541210d","first_computed_at":"2026-05-18T03:34:00.666774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:00.666774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ecNWAqezDInKVvWNKksrCI64AvuKan+lz+ln/EQmJe0fLQfX6T01+Or2Ld+bGeWHFe8n/NDSs1/p1wIDjq19BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:00.667520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2599","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e45da370b63d439742eae1ca20f1b72804fefea19d64f18d0dfa01a24255bf2","sha256:8b372f61622a23ad7017a082f7ba433e7877b406650ac6e7c5e77e9129ae6436"],"state_sha256":"122cc4ed1db84698e3ab7995700264973e1e508f86fcb4bb376a2dbfdbda81da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+my+ouhTKkKUZ3Xi4tpFq2n1+YLKpEKqVo+dcAb0EH87UgJZbfBjTBU6pxjEfJRWBGefeCQRH7DDP6J7XmSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:07:41.593430Z","bundle_sha256":"e3cda4ab04286ba12722eac227c44430456cd363d7eb591fef5c51f69ee10941"}}