{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EO3YZEMRVPXUV3Z6YOKBJUIYG3","short_pith_number":"pith:EO3YZEMR","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"},"canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","source":{"kind":"arxiv","id":"1401.4568","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4568","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4568v3","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4568","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"EO3YZEMRVPXU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EO3YZEMRVPXUV3Z6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EO3YZEMR","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EO3YZEMRVPXUV3Z6YOKBJUIYG3","target":"record","payload":{"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"},"canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","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"},"source_kind":"arxiv","source_id":"1401.4568","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"paX740nt+D/QkaCbLlWAmf2lHRjMeLNr9FYjAu5DNwA6b/qTt/2LfuUZ2bdM65N1KLyUGs8c6fJVqY4s4jlOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:38:50.458608Z"},"content_sha256":"39b83dc05644e4bcecafd048c723ad1d474019b3e5203b0c07ae84918e1cd80d","schema_version":"1.0","event_id":"sha256:39b83dc05644e4bcecafd048c723ad1d474019b3e5203b0c07ae84918e1cd80d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EO3YZEMRVPXUV3Z6YOKBJUIYG3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:47:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lC+8u9pTTtpSbBjjnSzolOatwYTU1EJie/RLZIe+CZ2QIaSSZJyrIQ0AGceeVqaIaDaBNElCZla9nOD4aRjsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:38:50.458954Z"},"content_sha256":"0a6ccb23985f9d11eb0a56cf1f036a853b5223039a289fbd1c829ea97b62c210","schema_version":"1.0","event_id":"sha256:0a6ccb23985f9d11eb0a56cf1f036a853b5223039a289fbd1c829ea97b62c210"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/bundle.json","state_url":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T00:38:50Z","links":{"resolver":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3","bundle":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/bundle.json","state":"https://pith.science/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EO3YZEMRVPXUV3Z6YOKBJUIYG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EO3YZEMRVPXUV3Z6YOKBJUIYG3","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":"6b122824c3a38d4440fa21418ad0c99effe5d777c224fa2a15ce921f6189c28a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-18T17:11:56Z","title_canon_sha256":"099e3538dce21c43a33c2aced8101a59d27c57d24f1220b38621ebdb01c1dbc3"},"schema_version":"1.0","source":{"id":"1401.4568","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4568","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4568v3","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4568","created_at":"2026-05-18T02:47:15Z"},{"alias_kind":"pith_short_12","alias_value":"EO3YZEMRVPXU","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EO3YZEMRVPXUV3Z6","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EO3YZEMR","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:0a6ccb23985f9d11eb0a56cf1f036a853b5223039a289fbd1c829ea97b62c210","target":"graph","created_at":"2026-05-18T02:47:15Z","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":"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.","authors_text":"Ararat Harutyunyan (MI), Herv\\'e Hocquard (LaBRI), Julien Bensmail (LaBRI), Petru Valicov (LIP)","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-18T17:11:56Z","title":"Strong edge-colouring of sparse planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4568","kind":"arxiv","version":3},"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:39b83dc05644e4bcecafd048c723ad1d474019b3e5203b0c07ae84918e1cd80d","target":"record","created_at":"2026-05-18T02:47:15Z","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":"6b122824c3a38d4440fa21418ad0c99effe5d777c224fa2a15ce921f6189c28a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-18T17:11:56Z","title_canon_sha256":"099e3538dce21c43a33c2aced8101a59d27c57d24f1220b38621ebdb01c1dbc3"},"schema_version":"1.0","source":{"id":"1401.4568","kind":"arxiv","version":3}},"canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23b78c9191abef4aef3ec39414d11836f1bfa92de16f242810afdb89e0e9a8a6","first_computed_at":"2026-05-18T02:47:15.702807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:15.702807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zV3X7FuEfgGQQQ+wIqXk59bipXrqo17Jyp3Yx0/SKyLowYx6CARDYZ5zzIJ+nt2B8/hs+p4wL3Uv/70pWD/8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:15.703407Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4568","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39b83dc05644e4bcecafd048c723ad1d474019b3e5203b0c07ae84918e1cd80d","sha256:0a6ccb23985f9d11eb0a56cf1f036a853b5223039a289fbd1c829ea97b62c210"],"state_sha256":"e9a694d020edee140fea85b9aacc664413e02042e4b8630517eee0bffdc77e5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6YhB9jIUxeZjGlKUDIqwCei/LpV3Fy5Jp6+rghG7sl4KllYxdymX1Ncd1zPlM+LUhTvhODVkNJTbQXJmVYRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:38:50.461026Z","bundle_sha256":"29367f8403e6343ee5e639e13bed07982f4be865e7ab6fce1d7e223549cde39f"}}