{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDYTQ4XXWSBVHBCQT7U2T5D5PX","short_pith_number":"pith:KDYTQ4XX","canonical_record":{"source":{"id":"1502.04561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T14:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"0960660d40d38c89539598e95978992f7597f372ad5511644d1f1e550f134690","abstract_canon_sha256":"cc3a4582f3f08d1b37581a87aec2cfd471b54e8a53583da71d3dc227606d0126"},"schema_version":"1.0"},"canonical_sha256":"50f13872f7b4835384509fe9a9f47d7ddf9e42db578ff252993e1a4ca8aa476e","source":{"kind":"arxiv","id":"1502.04561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04561","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04561v2","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04561","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"KDYTQ4XXWSBV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDYTQ4XXWSBVHBCQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDYTQ4XX","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDYTQ4XXWSBVHBCQT7U2T5D5PX","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T14:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"0960660d40d38c89539598e95978992f7597f372ad5511644d1f1e550f134690","abstract_canon_sha256":"cc3a4582f3f08d1b37581a87aec2cfd471b54e8a53583da71d3dc227606d0126"},"schema_version":"1.0"},"canonical_sha256":"50f13872f7b4835384509fe9a9f47d7ddf9e42db578ff252993e1a4ca8aa476e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:07.160410Z","signature_b64":"64mtO731G3l4wQsKPwCoh9PnYMeB2ZiVsfaOVYZXjJhXm/pSCvSHzQma8zId3ZMb3Cj6CC4YH/RkzAtYRcIQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50f13872f7b4835384509fe9a9f47d7ddf9e42db578ff252993e1a4ca8aa476e","last_reissued_at":"2026-05-18T00:50:07.159719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:07.159719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04561","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-05-18T00:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yq4ipZkcxhpX3sCOpv6o+VNx+S7+NBgY7RJane88g2hMC50dhLTcNm1Nkeh5KQBcYsSLYaQC5Rmmqlo657CoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:37:58.951960Z"},"content_sha256":"ed08361903e0a8170f3d74543cb2b5b1d0fe12ca510e9b9cb72004c909031d27","schema_version":"1.0","event_id":"sha256:ed08361903e0a8170f3d74543cb2b5b1d0fe12ca510e9b9cb72004c909031d27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDYTQ4XXWSBVHBCQT7U2T5D5PX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Choosability in signed planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eckhard Steffen, Ligang Jin, Yingli Kang","submitted_at":"2015-02-16T14:54:19Z","abstract_excerpt":"This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \\in \\{3,4,5,6\\}$, every signed planar graph without circuits of length $k$ is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of length 4 is 3-choosable. We construct a signed planar graph with girth 4 which is not 3-choosable but the unsigned graph is 3-choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04561","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":""},"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:50:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVWz5G8g31IZE8FhDc4dZOORQ3grChH3B5OgaSIjrrafdJrEVfKVZZ0h7oOooVxU0KzLr+kVei3tSxFua4BmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:37:58.952326Z"},"content_sha256":"76e941e090a6334307d0f56de6f70013a5525f683fca5e0b428edf5c24f778a1","schema_version":"1.0","event_id":"sha256:76e941e090a6334307d0f56de6f70013a5525f683fca5e0b428edf5c24f778a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/bundle.json","state_url":"https://pith.science/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/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-03T19:37:58Z","links":{"resolver":"https://pith.science/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX","bundle":"https://pith.science/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/bundle.json","state":"https://pith.science/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDYTQ4XXWSBVHBCQT7U2T5D5PX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDYTQ4XXWSBVHBCQT7U2T5D5PX","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":"cc3a4582f3f08d1b37581a87aec2cfd471b54e8a53583da71d3dc227606d0126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T14:54:19Z","title_canon_sha256":"0960660d40d38c89539598e95978992f7597f372ad5511644d1f1e550f134690"},"schema_version":"1.0","source":{"id":"1502.04561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04561","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04561v2","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04561","created_at":"2026-05-18T00:50:07Z"},{"alias_kind":"pith_short_12","alias_value":"KDYTQ4XXWSBV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDYTQ4XXWSBVHBCQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDYTQ4XX","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:76e941e090a6334307d0f56de6f70013a5525f683fca5e0b428edf5c24f778a1","target":"graph","created_at":"2026-05-18T00:50:07Z","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":"This paper studies the choosability of signed planar graphs. We prove that every signed planar graph is 5-choosable and that there is a signed planar graph which is not 4-choosable while the unsigned graph is 4-choosable. For each $k \\in \\{3,4,5,6\\}$, every signed planar graph without circuits of length $k$ is 4-choosable. Furthermore, every signed planar graph without circuits of length 3 and of length 4 is 3-choosable. We construct a signed planar graph with girth 4 which is not 3-choosable but the unsigned graph is 3-choosable.","authors_text":"Eckhard Steffen, Ligang Jin, Yingli Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T14:54:19Z","title":"Choosability in signed planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04561","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:ed08361903e0a8170f3d74543cb2b5b1d0fe12ca510e9b9cb72004c909031d27","target":"record","created_at":"2026-05-18T00:50:07Z","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":"cc3a4582f3f08d1b37581a87aec2cfd471b54e8a53583da71d3dc227606d0126","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-16T14:54:19Z","title_canon_sha256":"0960660d40d38c89539598e95978992f7597f372ad5511644d1f1e550f134690"},"schema_version":"1.0","source":{"id":"1502.04561","kind":"arxiv","version":2}},"canonical_sha256":"50f13872f7b4835384509fe9a9f47d7ddf9e42db578ff252993e1a4ca8aa476e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50f13872f7b4835384509fe9a9f47d7ddf9e42db578ff252993e1a4ca8aa476e","first_computed_at":"2026-05-18T00:50:07.159719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:07.159719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"64mtO731G3l4wQsKPwCoh9PnYMeB2ZiVsfaOVYZXjJhXm/pSCvSHzQma8zId3ZMb3Cj6CC4YH/RkzAtYRcIQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:07.160410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed08361903e0a8170f3d74543cb2b5b1d0fe12ca510e9b9cb72004c909031d27","sha256:76e941e090a6334307d0f56de6f70013a5525f683fca5e0b428edf5c24f778a1"],"state_sha256":"7f1117cbeb2f48f7b29e820ccb5bf494adb84bba49769e3499904fbd078768ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hM+5ydjLdpb2o70luWHjaSctOy2NjPbcQs1GaflHu3YBO7z7SG9GKSdLwRw0vwBBMsg9cf6xbQmS7dlrOf0QDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:37:58.954245Z","bundle_sha256":"09eb188f4d2e8261ce2ff871c8474bcbce866a9933190d3ec53a9774b518f079"}}