{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:BYJHHFMUFO5KZEJNVMA5I36TZ4","short_pith_number":"pith:BYJHHFMU","canonical_record":{"source":{"id":"math/0601623","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-01-25T19:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"31acfd6c8ae450d23fb6e9a744b19303f50af8665d17dc0a6520623a41079aa0","abstract_canon_sha256":"6d2b8f63872fb35ee902d1b9c9cd85e90f3c51efa1b6f659531393415147aa23"},"schema_version":"1.0"},"canonical_sha256":"0e127395942bbaac912dab01d46fd3cf08a70645396773853c7139b3f1f07c11","source":{"kind":"arxiv","id":"math/0601623","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601623","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601623v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601623","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"BYJHHFMUFO5K","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"BYJHHFMUFO5KZEJN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"BYJHHFMU","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:BYJHHFMUFO5KZEJNVMA5I36TZ4","target":"record","payload":{"canonical_record":{"source":{"id":"math/0601623","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-01-25T19:59:29Z","cross_cats_sorted":[],"title_canon_sha256":"31acfd6c8ae450d23fb6e9a744b19303f50af8665d17dc0a6520623a41079aa0","abstract_canon_sha256":"6d2b8f63872fb35ee902d1b9c9cd85e90f3c51efa1b6f659531393415147aa23"},"schema_version":"1.0"},"canonical_sha256":"0e127395942bbaac912dab01d46fd3cf08a70645396773853c7139b3f1f07c11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:08.921901Z","signature_b64":"OMdm/u0bDk5w/FX7cCJYchSoZ5+8goYk8gsCfIHx+aRHJvnN+HYQWdAYStqNryKF3nSqJ4Mb9CMU418Eu8wYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e127395942bbaac912dab01d46fd3cf08a70645396773853c7139b3f1f07c11","last_reissued_at":"2026-05-18T04:11:08.921383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:08.921383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0601623","source_version":1,"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-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"czC89pqhu2qbx6rYt7QjPwAot1DWY0PHZBJcrjPXFmEN4BMs86ENfGj+tmJ+CvIy7x9gRd7OyItUbCDkNdYrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:18:21.070281Z"},"content_sha256":"7cfb1181751cbf08d87796665ac6e12b37cf997a88422f99102da567c228a5d9","schema_version":"1.0","event_id":"sha256:7cfb1181751cbf08d87796665ac6e12b37cf997a88422f99102da567c228a5d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:BYJHHFMUFO5KZEJNVMA5I36TZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Cranston","submitted_at":"2006-01-25T19:59:29Z","abstract_excerpt":"In 1985, Erd\\H{o}s and Ne\\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\\Delta^2$ when $\\Delta$ is even and ${1/4}(5\\Delta^2-2\\Delta+1)$ when $\\Delta$ is odd. They gave a simple construction which requires this many colors. The conjecture has been verified for $\\Delta\\leq 3$. For $\\Delta=4$, the conjectured bound is 20. Previously, the best known upper bound was 23 due to Horak. In this paper we give an algorithm that uses at most 22 colors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601623","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"},"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-18T04:11:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uEWdDwAe5vDPfvV4ZG1UYv0521e7tBMWc2rCYNR8XjgRjmz0q11YsBwbxIe4xFWKkNkdBAIUwt5JbWa9ALJoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:18:21.070642Z"},"content_sha256":"a4e59d5cb3bc1fd2f9e0bec2c303ec7f66331305a199c39132ccb8533d5d1e25","schema_version":"1.0","event_id":"sha256:a4e59d5cb3bc1fd2f9e0bec2c303ec7f66331305a199c39132ccb8533d5d1e25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/bundle.json","state_url":"https://pith.science/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/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-03T16:18:21Z","links":{"resolver":"https://pith.science/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4","bundle":"https://pith.science/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/bundle.json","state":"https://pith.science/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BYJHHFMUFO5KZEJNVMA5I36TZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:BYJHHFMUFO5KZEJNVMA5I36TZ4","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":"6d2b8f63872fb35ee902d1b9c9cd85e90f3c51efa1b6f659531393415147aa23","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-01-25T19:59:29Z","title_canon_sha256":"31acfd6c8ae450d23fb6e9a744b19303f50af8665d17dc0a6520623a41079aa0"},"schema_version":"1.0","source":{"id":"math/0601623","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0601623","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"arxiv_version","alias_value":"math/0601623v1","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0601623","created_at":"2026-05-18T04:11:08Z"},{"alias_kind":"pith_short_12","alias_value":"BYJHHFMUFO5K","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"BYJHHFMUFO5KZEJN","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"BYJHHFMU","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:a4e59d5cb3bc1fd2f9e0bec2c303ec7f66331305a199c39132ccb8533d5d1e25","target":"graph","created_at":"2026-05-18T04:11:08Z","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":"In 1985, Erd\\H{o}s and Ne\\'{s}etril conjectured that the strong edge-coloring number of a graph is bounded above by ${5/4}\\Delta^2$ when $\\Delta$ is even and ${1/4}(5\\Delta^2-2\\Delta+1)$ when $\\Delta$ is odd. They gave a simple construction which requires this many colors. The conjecture has been verified for $\\Delta\\leq 3$. For $\\Delta=4$, the conjectured bound is 20. Previously, the best known upper bound was 23 due to Horak. In this paper we give an algorithm that uses at most 22 colors.","authors_text":"Daniel Cranston","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2006-01-25T19:59:29Z","title":"A Strong Edge-Coloring of Graphs with Maximum Degree 4 Using 22 Colors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0601623","kind":"arxiv","version":1},"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:7cfb1181751cbf08d87796665ac6e12b37cf997a88422f99102da567c228a5d9","target":"record","created_at":"2026-05-18T04:11:08Z","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":"6d2b8f63872fb35ee902d1b9c9cd85e90f3c51efa1b6f659531393415147aa23","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"2006-01-25T19:59:29Z","title_canon_sha256":"31acfd6c8ae450d23fb6e9a744b19303f50af8665d17dc0a6520623a41079aa0"},"schema_version":"1.0","source":{"id":"math/0601623","kind":"arxiv","version":1}},"canonical_sha256":"0e127395942bbaac912dab01d46fd3cf08a70645396773853c7139b3f1f07c11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e127395942bbaac912dab01d46fd3cf08a70645396773853c7139b3f1f07c11","first_computed_at":"2026-05-18T04:11:08.921383Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:08.921383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OMdm/u0bDk5w/FX7cCJYchSoZ5+8goYk8gsCfIHx+aRHJvnN+HYQWdAYStqNryKF3nSqJ4Mb9CMU418Eu8wYBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:08.921901Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0601623","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cfb1181751cbf08d87796665ac6e12b37cf997a88422f99102da567c228a5d9","sha256:a4e59d5cb3bc1fd2f9e0bec2c303ec7f66331305a199c39132ccb8533d5d1e25"],"state_sha256":"3c79bc9638a4ad10a5cc2fc3d41655988543684186588d6fc7db064a59f9b651"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qWgDUeLqy0C8C4EQXmtmUuz7WztBwwSnBfhEW1G87uHrV598NsPP06lwLxjkoQd8aqfHZ47PLRJDLJnMw9cAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:18:21.072556Z","bundle_sha256":"582061252a657861d1f59bab08d52c3388f6057b5e4c55b97167210d8841020a"}}