{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EO3YZEMRVPXUV3Z6YOKBJUIYG3","short_pith_number":"pith:EO3YZEMR","schema_version":"1.0","canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","source":{"kind":"arxiv","id":"1401.4568","version":3},"attestation_state":"computed","paper":{"title":"Strong edge-colouring of sparse planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ararat Harutyunyan (MI), Herv\\'e Hocquard (LaBRI), Julien Bensmail (LaBRI), Petru Valicov (LIP)","submitted_at":"2014-01-18T17:11:56Z","abstract_excerpt":"A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree $\\Delta$ has a strong edge-colouring with at most $4\\Delta+4$ colours. We show that $3\\Delta+1$ colours suffice if the graph has girth 6, and $4\\Delta$ colours suffice if $\\Delta\\geq 7$ or the girth is at least 5. In the last part of the paper, we raise some questions related to a long-standing conjecture of Vizing on proper edge-colouring of planar graphs."},"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":"1401.4568","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-18T17:11:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"099e3538dce21c43a33c2aced8101a59d27c57d24f1220b38621ebdb01c1dbc3","abstract_canon_sha256":"6b122824c3a38d4440fa21418ad0c99effe5d777c224fa2a15ce921f6189c28a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:15.703407Z","signature_b64":"zV3X7FuEfgGQQQ+wIqXk59bipXrqo17Jyp3Yx0/SKyLowYx6CARDYZ5zzIJ+nt2B8/hs+p4wL3Uv/70pWD/8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","last_reissued_at":"2026-05-18T02:47:15.702807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:15.702807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong edge-colouring of sparse planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ararat Harutyunyan (MI), Herv\\'e Hocquard (LaBRI), Julien Bensmail (LaBRI), Petru Valicov (LIP)","submitted_at":"2014-01-18T17:11:56Z","abstract_excerpt":"A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree $\\Delta$ has a strong edge-colouring with at most $4\\Delta+4$ colours. We show that $3\\Delta+1$ colours suffice if the graph has girth 6, and $4\\Delta$ colours suffice if $\\Delta\\geq 7$ or the girth is at least 5. In the last part of the paper, we raise some questions related to a long-standing conjecture of Vizing on proper edge-colouring of planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4568","kind":"arxiv","version":3},"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":"1401.4568","created_at":"2026-05-18T02:47:15.702909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4568v3","created_at":"2026-05-18T02:47:15.702909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4568","created_at":"2026-05-18T02:47:15.702909+00:00"},{"alias_kind":"pith_short_12","alias_value":"EO3YZEMRVPXU","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EO3YZEMRVPXUV3Z6","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EO3YZEMR","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3","json":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3.json","graph_json":"https://pith.science/api/pith-number/EO3YZEMRVPXUV3Z6YOKBJUIYG3/graph.json","events_json":"https://pith.science/api/pith-number/EO3YZEMRVPXUV3Z6YOKBJUIYG3/events.json","paper":"https://pith.science/paper/EO3YZEMR"},"agent_actions":{"view_html":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3","download_json":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3.json","view_paper":"https://pith.science/paper/EO3YZEMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4568&json=true","fetch_graph":"https://pith.science/api/pith-number/EO3YZEMRVPXUV3Z6YOKBJUIYG3/graph.json","fetch_events":"https://pith.science/api/pith-number/EO3YZEMRVPXUV3Z6YOKBJUIYG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/action/storage_attestation","attest_author":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/action/author_attestation","sign_citation":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/action/citation_signature","submit_replication":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/action/replication_record"}},"created_at":"2026-05-18T02:47:15.702909+00:00","updated_at":"2026-05-18T02:47:15.702909+00:00"}