{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7IVNDKGUSHF6UVCATDZQW7GCVM","short_pith_number":"pith:7IVNDKGU","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"},"canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","source":{"kind":"arxiv","id":"1303.4580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4580","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4580v2","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4580","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"7IVNDKGUSHF6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7IVNDKGUSHF6UVCA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7IVNDKGU","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7IVNDKGUSHF6UVCATDZQW7GCVM","target":"record","payload":{"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"},"canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","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"},"source_kind":"arxiv","source_id":"1303.4580","source_version":2,"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:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cQBhtZo06Z0PhQtXMM673ul0rUxUt5HlDReGBUimWzktpQKGwJtxRNvEobJi2WTTgi/pOfIoRqYQiixBmzE7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:13.678967Z"},"content_sha256":"0d3bc514e9313e9ec05010e2ec38b4063605011a6c7ce2beab309deb4139b8d2","schema_version":"1.0","event_id":"sha256:0d3bc514e9313e9ec05010e2ec38b4063605011a6c7ce2beab309deb4139b8d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7IVNDKGUSHF6UVCATDZQW7GCVM","target":"graph","payload":{"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"},"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:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEznzbWGK6rop03SPZ/MsdIjzqPkvz4NsHtfaxh7LE9qd8z9HyvT6ZlWwqyCQJ8U8yuJuOzjyBn+GT0xYgYmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:01:13.679552Z"},"content_sha256":"2b29e40cf9432f4d7834001afa4909dcf227277ad002bf500335978f36d2726f","schema_version":"1.0","event_id":"sha256:2b29e40cf9432f4d7834001afa4909dcf227277ad002bf500335978f36d2726f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/bundle.json","state_url":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/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-06-07T12:01:13Z","links":{"resolver":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM","bundle":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/bundle.json","state":"https://pith.science/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7IVNDKGUSHF6UVCATDZQW7GCVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7IVNDKGUSHF6UVCATDZQW7GCVM","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":"ae04b0c38267b9b81737a8eac1cb2efb27caa4f30f76c4ad4d9d80415de243f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T13:11:27Z","title_canon_sha256":"3946446a487e4026c405081374cef88688903944cf58f7df51664a132f1ce12e"},"schema_version":"1.0","source":{"id":"1303.4580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4580","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4580v2","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4580","created_at":"2026-05-18T02:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"7IVNDKGUSHF6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7IVNDKGUSHF6UVCA","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7IVNDKGU","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:2b29e40cf9432f4d7834001afa4909dcf227277ad002bf500335978f36d2726f","target":"graph","created_at":"2026-05-18T02:58:23Z","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 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.","authors_text":"Borut Lu\\v{z}ar, D\\'avid Hud\\'ak, Riste \\v{S}krekovski, Roman Sot\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T13:11:27Z","title":"Strong edge coloring of planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4580","kind":"arxiv","version":2},"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:0d3bc514e9313e9ec05010e2ec38b4063605011a6c7ce2beab309deb4139b8d2","target":"record","created_at":"2026-05-18T02:58:23Z","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":"ae04b0c38267b9b81737a8eac1cb2efb27caa4f30f76c4ad4d9d80415de243f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T13:11:27Z","title_canon_sha256":"3946446a487e4026c405081374cef88688903944cf58f7df51664a132f1ce12e"},"schema_version":"1.0","source":{"id":"1303.4580","kind":"arxiv","version":2}},"canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa2ad1a8d491cbea544098f30b7cc2ab23832ab9f047e999b14732aa478da6c5","first_computed_at":"2026-05-18T02:58:23.627518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:23.627518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zmVddEpmcqLixF7RKzLwkX7Nwiawsd5v/I6N3V3dzDPID9NOgIlTpjATnZOvRmwlYwHJOMWTQsnb47lBvkdnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:23.628076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d3bc514e9313e9ec05010e2ec38b4063605011a6c7ce2beab309deb4139b8d2","sha256:2b29e40cf9432f4d7834001afa4909dcf227277ad002bf500335978f36d2726f"],"state_sha256":"8420e44a970a4ed5283dbb8049f0aa163d9510e9bf9807c3913ea63cd86b1bcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FujzQ7LrNbkjAlmLtP+a7VidzduE/NTL3qE3dX7XbbAymgJnsmJYMucNUzikI6FloHRGxakshnVgJsmDH9FdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:01:13.682676Z","bundle_sha256":"9ac350665ddfccf9caa89886364f84602247161035aace63eead62395fa5eb23"}}