{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PYRNCPJNF4L7TIU5EURTTQMUK3","short_pith_number":"pith:PYRNCPJN","canonical_record":{"source":{"id":"1801.06758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T03:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"3a926bfcdc36b4a89b1d1706adce3bd1bce800fb186d4b686cc906159d7994ac","abstract_canon_sha256":"e3766cf2c341efed4370a544f8f923abd82f05468d8a0c1dccea6966c772dbbc"},"schema_version":"1.0"},"canonical_sha256":"7e22d13d2d2f17f9a29d252339c19456c1ff31e3be92230a28f47419cf29656a","source":{"kind":"arxiv","id":"1801.06758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06758","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06758v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06758","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PYRNCPJNF4L7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYRNCPJNF4L7TIU5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYRNCPJN","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PYRNCPJNF4L7TIU5EURTTQMUK3","target":"record","payload":{"canonical_record":{"source":{"id":"1801.06758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T03:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"3a926bfcdc36b4a89b1d1706adce3bd1bce800fb186d4b686cc906159d7994ac","abstract_canon_sha256":"e3766cf2c341efed4370a544f8f923abd82f05468d8a0c1dccea6966c772dbbc"},"schema_version":"1.0"},"canonical_sha256":"7e22d13d2d2f17f9a29d252339c19456c1ff31e3be92230a28f47419cf29656a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:27.833461Z","signature_b64":"95IzMubN4rlF3+9Kr0MiIVZPrboerk9wJ5s97J1QF8F8Qyc0PkW9DDb9yrOHr6WvSrKmW7Rq/gsW5xfLQ6TpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e22d13d2d2f17f9a29d252339c19456c1ff31e3be92230a28f47419cf29656a","last_reissued_at":"2026-05-18T00:25:27.832888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:27.832888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.06758","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-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcm0OdQVEIPrY8m07I7ulryM5UUx7bZqKwSZptcAvkc2nR3Ys6zMM8qix7IioKabiC0bfguknKt7N5RXv9R8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:13:52.822467Z"},"content_sha256":"b486770a10a4acc9ed50fbc3cf2bac258f60466d9d020837ea591e875a31f9d1","schema_version":"1.0","event_id":"sha256:b486770a10a4acc9ed50fbc3cf2bac258f60466d9d020837ea591e875a31f9d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PYRNCPJNF4L7TIU5EURTTQMUK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"List strong edge-coloring of graphs with maximum degree 4","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Baochen Zhang, Donglei Yang, Jie Hu, Meijie Ma, Yulin Chang","submitted_at":"2018-01-21T03:21:37Z","abstract_excerpt":"A strong edge-coloring of a graph $G$ is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $\\chi_{s}'(G)$ which is the minimum number of colors that allow a strong edge-coloring of $G$. Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured in 1985 that the upper bound of $\\chi_{s}'(G)$ is $\\frac{5}{4}\\Delta^{2}$ when $\\Delta$ is even and $\\frac{1}{4}(5\\Delta^{2}-2\\Delta +1)$ when $\\Delta$ is odd, where $\\Delta$ is the maximum degree of $G$. The conjecture is proved right when $\\Delta\\leq3$. The best known upper bound for $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06758","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-18T00:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHNSFCFTE0YWa9INZYYJdzpXrLEszmixa4mdZSCRZf+MCryZ9JKKCbL/rsp9Agks7D7jisyetcCOZFyTOEaIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:13:52.823180Z"},"content_sha256":"64fc8abb37a5c9eca5a2e478db4d728d55e78cba450254e67df31e72138ae019","schema_version":"1.0","event_id":"sha256:64fc8abb37a5c9eca5a2e478db4d728d55e78cba450254e67df31e72138ae019"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/bundle.json","state_url":"https://pith.science/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/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-26T17:13:52Z","links":{"resolver":"https://pith.science/pith/PYRNCPJNF4L7TIU5EURTTQMUK3","bundle":"https://pith.science/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/bundle.json","state":"https://pith.science/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYRNCPJNF4L7TIU5EURTTQMUK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PYRNCPJNF4L7TIU5EURTTQMUK3","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":"e3766cf2c341efed4370a544f8f923abd82f05468d8a0c1dccea6966c772dbbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T03:21:37Z","title_canon_sha256":"3a926bfcdc36b4a89b1d1706adce3bd1bce800fb186d4b686cc906159d7994ac"},"schema_version":"1.0","source":{"id":"1801.06758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.06758","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1801.06758v1","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.06758","created_at":"2026-05-18T00:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PYRNCPJNF4L7","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PYRNCPJNF4L7TIU5","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PYRNCPJN","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:64fc8abb37a5c9eca5a2e478db4d728d55e78cba450254e67df31e72138ae019","target":"graph","created_at":"2026-05-18T00:25:27Z","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 $G$ is an edge-coloring such that any two edges on a path of length three receive distinct colors. We denote the strong chromatic index by $\\chi_{s}'(G)$ which is the minimum number of colors that allow a strong edge-coloring of $G$. Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured in 1985 that the upper bound of $\\chi_{s}'(G)$ is $\\frac{5}{4}\\Delta^{2}$ when $\\Delta$ is even and $\\frac{1}{4}(5\\Delta^{2}-2\\Delta +1)$ when $\\Delta$ is odd, where $\\Delta$ is the maximum degree of $G$. The conjecture is proved right when $\\Delta\\leq3$. The best known upper bound for $\\","authors_text":"Baochen Zhang, Donglei Yang, Jie Hu, Meijie Ma, Yulin Chang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T03:21:37Z","title":"List strong edge-coloring of graphs with maximum degree 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.06758","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:b486770a10a4acc9ed50fbc3cf2bac258f60466d9d020837ea591e875a31f9d1","target":"record","created_at":"2026-05-18T00:25:27Z","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":"e3766cf2c341efed4370a544f8f923abd82f05468d8a0c1dccea6966c772dbbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-21T03:21:37Z","title_canon_sha256":"3a926bfcdc36b4a89b1d1706adce3bd1bce800fb186d4b686cc906159d7994ac"},"schema_version":"1.0","source":{"id":"1801.06758","kind":"arxiv","version":1}},"canonical_sha256":"7e22d13d2d2f17f9a29d252339c19456c1ff31e3be92230a28f47419cf29656a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e22d13d2d2f17f9a29d252339c19456c1ff31e3be92230a28f47419cf29656a","first_computed_at":"2026-05-18T00:25:27.832888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:27.832888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"95IzMubN4rlF3+9Kr0MiIVZPrboerk9wJ5s97J1QF8F8Qyc0PkW9DDb9yrOHr6WvSrKmW7Rq/gsW5xfLQ6TpAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:27.833461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.06758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b486770a10a4acc9ed50fbc3cf2bac258f60466d9d020837ea591e875a31f9d1","sha256:64fc8abb37a5c9eca5a2e478db4d728d55e78cba450254e67df31e72138ae019"],"state_sha256":"334542a6c9c6131fa345193dc4198f63252ec24c89f7eaf42ab226be7f0edb32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aGgBX4HFJbO20lBqsLdHme7uOyrWN65YLQkr5wobV52jlSRb/P5DAZjpXTonAJ3OqWkXhA5QJkXrRi+OI3/MAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:13:52.826202Z","bundle_sha256":"d4dbcd767cd006e1ec3e77756b80f6cc365db9d44fc6409ddaf4c895ebe60ee9"}}