{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JZAVAW46OF7MWAE2UM5VIHQTRF","short_pith_number":"pith:JZAVAW46","schema_version":"1.0","canonical_sha256":"4e41505b9e717ecb009aa33b541e1389639c387a1aa03a4f18d0e111097c9d8e","source":{"kind":"arxiv","id":"1312.0361","version":1},"attestation_state":"computed","paper":{"title":"On edge-colorings of bicubic planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis-Hadrien Robert","submitted_at":"2013-12-02T07:32:56Z","abstract_excerpt":"In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two edge-3-colorings of a planar bicubic graph are Kempe equivalent. Additionaly we show that the degree of colorings behaves well with respect to Kempe equivalence."},"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":"1312.0361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-02T07:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"6cbb0042d5ce2dd71a691a2bdb38a8fec9ab39a685138aebaa551d9908ee2733","abstract_canon_sha256":"9d612589e392200c9e0799e4334d9547aeec34b4f56d13c0d181a5aca43c4bac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:45.871760Z","signature_b64":"F3XGcPb2OPm5q9cb1FAOAt64RIbfvOhNRbdOst9yq/KztlYQypu8Bh8ssix6LIhQqVR/1ecjD4+Qu4GMLvFUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e41505b9e717ecb009aa33b541e1389639c387a1aa03a4f18d0e111097c9d8e","last_reissued_at":"2026-05-18T03:05:45.871091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:45.871091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On edge-colorings of bicubic planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis-Hadrien Robert","submitted_at":"2013-12-02T07:32:56Z","abstract_excerpt":"In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two edge-3-colorings of a planar bicubic graph are Kempe equivalent. Additionaly we show that the degree of colorings behaves well with respect to Kempe equivalence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0361","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":"1312.0361","created_at":"2026-05-18T03:05:45.871189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0361v1","created_at":"2026-05-18T03:05:45.871189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0361","created_at":"2026-05-18T03:05:45.871189+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZAVAW46OF7M","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZAVAW46OF7MWAE2","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZAVAW46","created_at":"2026-05-18T12:27:49.015174+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/JZAVAW46OF7MWAE2UM5VIHQTRF","json":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF.json","graph_json":"https://pith.science/api/pith-number/JZAVAW46OF7MWAE2UM5VIHQTRF/graph.json","events_json":"https://pith.science/api/pith-number/JZAVAW46OF7MWAE2UM5VIHQTRF/events.json","paper":"https://pith.science/paper/JZAVAW46"},"agent_actions":{"view_html":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF","download_json":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF.json","view_paper":"https://pith.science/paper/JZAVAW46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0361&json=true","fetch_graph":"https://pith.science/api/pith-number/JZAVAW46OF7MWAE2UM5VIHQTRF/graph.json","fetch_events":"https://pith.science/api/pith-number/JZAVAW46OF7MWAE2UM5VIHQTRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF/action/storage_attestation","attest_author":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF/action/author_attestation","sign_citation":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF/action/citation_signature","submit_replication":"https://pith.science/pith/JZAVAW46OF7MWAE2UM5VIHQTRF/action/replication_record"}},"created_at":"2026-05-18T03:05:45.871189+00:00","updated_at":"2026-05-18T03:05:45.871189+00:00"}