{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DKFNVGONAS3K57RD3V3XGIWTP3","short_pith_number":"pith:DKFNVGON","schema_version":"1.0","canonical_sha256":"1a8ada99cd04b6aefe23dd777322d37ee89dbcf1673e83f4bb4324b401db919a","source":{"kind":"arxiv","id":"1303.4346","version":1},"attestation_state":"computed","paper":{"title":"l-facial edge colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Martina Mockov\\v{c}iakov\\'a, Peter \\v{S}ugerek, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-03-18T18:10:41Z","abstract_excerpt":"An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is conjectured that 3l + 1 colors suffice for an l-facial edge coloring of any plane graph. We prove that 7 colors suffice for a 2-facial edge coloring of any plane graph and therefore confirm the conjecture for l = 2."},"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":"1303.4346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-18T18:10:41Z","cross_cats_sorted":[],"title_canon_sha256":"bdb5e02d7961b2870f1608418d11f09d623d3a21a43c0c65d7c410ffdd96ffc8","abstract_canon_sha256":"8b6a260f65bef89fafca22eb845fa8e0c933c67eddd263d644353c4001c38e86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:21.678157Z","signature_b64":"nLXBV/IhtssJtn8JBKjWv5hv8ijiLkveKFvdUHdMYysMGFbQLX31DSiGLtVs6ql62cXeEHwszoNZMRc70DlBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a8ada99cd04b6aefe23dd777322d37ee89dbcf1673e83f4bb4324b401db919a","last_reissued_at":"2026-05-18T01:31:21.677484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:21.677484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"l-facial edge colorings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Martina Mockov\\v{c}iakov\\'a, Peter \\v{S}ugerek, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-03-18T18:10:41Z","abstract_excerpt":"An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is conjectured that 3l + 1 colors suffice for an l-facial edge coloring of any plane graph. We prove that 7 colors suffice for a 2-facial edge coloring of any plane graph and therefore confirm the conjecture for l = 2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4346","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":"1303.4346","created_at":"2026-05-18T01:31:21.677580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4346v1","created_at":"2026-05-18T01:31:21.677580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4346","created_at":"2026-05-18T01:31:21.677580+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKFNVGONAS3K","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKFNVGONAS3K57RD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKFNVGON","created_at":"2026-05-18T12:27:43.054852+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/DKFNVGONAS3K57RD3V3XGIWTP3","json":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3.json","graph_json":"https://pith.science/api/pith-number/DKFNVGONAS3K57RD3V3XGIWTP3/graph.json","events_json":"https://pith.science/api/pith-number/DKFNVGONAS3K57RD3V3XGIWTP3/events.json","paper":"https://pith.science/paper/DKFNVGON"},"agent_actions":{"view_html":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3","download_json":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3.json","view_paper":"https://pith.science/paper/DKFNVGON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4346&json=true","fetch_graph":"https://pith.science/api/pith-number/DKFNVGONAS3K57RD3V3XGIWTP3/graph.json","fetch_events":"https://pith.science/api/pith-number/DKFNVGONAS3K57RD3V3XGIWTP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3/action/storage_attestation","attest_author":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3/action/author_attestation","sign_citation":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3/action/citation_signature","submit_replication":"https://pith.science/pith/DKFNVGONAS3K57RD3V3XGIWTP3/action/replication_record"}},"created_at":"2026-05-18T01:31:21.677580+00:00","updated_at":"2026-05-18T01:31:21.677580+00:00"}