{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5ZKNWMJGUUAKFUESUZLC5W7NRG","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":"45f80fe069c3d8f836f23fb7bc9ab4ec1a9b11a9a7c9695c8498e011e4990f48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T09:49:16Z","title_canon_sha256":"27f148293c866b7a06f4a5290931981c551a51574cde3b326e823eb2dbf735c0"},"schema_version":"1.0","source":{"id":"1210.7944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7944","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7944v1","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7944","created_at":"2026-05-18T03:41:57Z"},{"alias_kind":"pith_short_12","alias_value":"5ZKNWMJGUUAK","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5ZKNWMJGUUAKFUES","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5ZKNWMJG","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:bc3c191d2f0ba1828b30eb0cae2cac4a1ee2ae64d91b2fa4c1e4392638d0c207","target":"graph","created_at":"2026-05-18T03:41:57Z","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":"It is known that every loopless cubic graph is 4-edge choosable. We prove the following strengthened result.\n  Let G be a planar cubic graph having b cut-edges. There exists a set F of at most 5b/2 edges of G with the following property. For any function L which assigns to each edge of F a set of 4 colours and which assigns to each edge in E(G)-F a set of 3 colours, the graph G has a proper edge colouring where the colour of each edge e belongs to L(e).","authors_text":"Andrea Spencer, Luis Goddyn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T09:49:16Z","title":"Few Long Lists for Edge Choosability of Planar Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7944","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:0fa3b3406f99aef805c3c6c7dfae0344d282e3d115d9f7a18f6d35f610f9f658","target":"record","created_at":"2026-05-18T03:41:57Z","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":"45f80fe069c3d8f836f23fb7bc9ab4ec1a9b11a9a7c9695c8498e011e4990f48","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T09:49:16Z","title_canon_sha256":"27f148293c866b7a06f4a5290931981c551a51574cde3b326e823eb2dbf735c0"},"schema_version":"1.0","source":{"id":"1210.7944","kind":"arxiv","version":1}},"canonical_sha256":"ee54db3126a500a2d092a6562edbed89aae648439298d30eb77f777717735eda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee54db3126a500a2d092a6562edbed89aae648439298d30eb77f777717735eda","first_computed_at":"2026-05-18T03:41:57.563601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:57.563601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y9NAEO/hQMsJAJgp4vRhX//CFIOKgMv+hp82JlteWhG9JkrBOMA3q5L2DDGIsNgM1/HtuSYp35bCkqgZ46RCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:57.564363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fa3b3406f99aef805c3c6c7dfae0344d282e3d115d9f7a18f6d35f610f9f658","sha256:bc3c191d2f0ba1828b30eb0cae2cac4a1ee2ae64d91b2fa4c1e4392638d0c207"],"state_sha256":"74449fc01fcce20b4e61b236d0750cd16e168651ae6c49299caaebe65b817376"}