{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7IVNDKGUSHF6UVCATDZQW7GCVM","short_pith_number":"pith:7IVNDKGU","schema_version":"1.0","canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","source":{"kind":"arxiv","id":"1303.4580","version":2},"attestation_state":"computed","paper":{"title":"Strong edge coloring of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, D\\'avid Hud\\'ak, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-03-19T13:11:27Z","abstract_excerpt":"A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We show that 3D + 6 colors suffice if the graph has girth 6, and 3D colors suffice if the girth is at least 7. Moreover, we show that cubic planar graphs with girth at least 6 can be strongly edge colored with at most 9 colors."},"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.4580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T13:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"3946446a487e4026c405081374cef88688903944cf58f7df51664a132f1ce12e","abstract_canon_sha256":"ae04b0c38267b9b81737a8eac1cb2efb27caa4f30f76c4ad4d9d80415de243f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:23.628076Z","signature_b64":"zmVddEpmcqLixF7RKzLwkX7Nwiawsd5v/I6N3V3dzDPID9NOgIlTpjATnZOvRmwlYwHJOMWTQsnb47lBvkdnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","last_reissued_at":"2026-05-18T02:58:23.627518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:23.627518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong edge coloring of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, D\\'avid Hud\\'ak, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-03-19T13:11:27Z","abstract_excerpt":"A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We show that 3D + 6 colors suffice if the graph has girth 6, and 3D colors suffice if the girth is at least 7. Moreover, we show that cubic planar graphs with girth at least 6 can be strongly edge colored with at most 9 colors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4580","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.4580","created_at":"2026-05-18T02:58:23.627594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4580v2","created_at":"2026-05-18T02:58:23.627594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4580","created_at":"2026-05-18T02:58:23.627594+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IVNDKGUSHF6","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IVNDKGUSHF6UVCA","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IVNDKGU","created_at":"2026-05-18T12:27:36.564083+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":107,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM","json":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM.json","graph_json":"https://pith.science/api/pith-number/7IVNDKGUSHF6UVCATDZQW7GCVM/graph.json","events_json":"https://pith.science/api/pith-number/7IVNDKGUSHF6UVCATDZQW7GCVM/events.json","paper":"https://pith.science/paper/7IVNDKGU"},"agent_actions":{"view_html":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM","download_json":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM.json","view_paper":"https://pith.science/paper/7IVNDKGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4580&json=true","fetch_graph":"https://pith.science/api/pith-number/7IVNDKGUSHF6UVCATDZQW7GCVM/graph.json","fetch_events":"https://pith.science/api/pith-number/7IVNDKGUSHF6UVCATDZQW7GCVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/action/storage_attestation","attest_author":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/action/author_attestation","sign_citation":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/action/citation_signature","submit_replication":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/action/replication_record"}},"created_at":"2026-05-18T02:58:23.627594+00:00","updated_at":"2026-05-18T02:58:23.627594+00:00"}