{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VAEXOYXU7EAO46BFRND3TXK3U4","short_pith_number":"pith:VAEXOYXU","canonical_record":{"source":{"id":"1508.03052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T20:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"da233cbddcce01db63dbb3bb59246f94ef8e5a4a03359487bcd820eccc52abd1","abstract_canon_sha256":"0f6ee6511e454ac3540a5b98a4c3b8d05240bdab058d7c754f0606e3754dd8fd"},"schema_version":"1.0"},"canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","source":{"kind":"arxiv","id":"1508.03052","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03052","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03052v3","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03052","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"VAEXOYXU7EAO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VAEXOYXU7EAO46BF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VAEXOYXU","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VAEXOYXU7EAO46BFRND3TXK3U4","target":"record","payload":{"canonical_record":{"source":{"id":"1508.03052","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T20:08:42Z","cross_cats_sorted":[],"title_canon_sha256":"da233cbddcce01db63dbb3bb59246f94ef8e5a4a03359487bcd820eccc52abd1","abstract_canon_sha256":"0f6ee6511e454ac3540a5b98a4c3b8d05240bdab058d7c754f0606e3754dd8fd"},"schema_version":"1.0"},"canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:07.731562Z","signature_b64":"9dJgTvEj6+iymAKk3cCcViECSO/i9Jx6wj+pDhGs2MmM7ErPKlveGNtUOcWQG31cDcytN1Ks7CjpAhf23vE0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","last_reissued_at":"2026-05-18T01:32:07.730899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:07.730899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.03052","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-18T01:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VTRNQjApoq/ADLMfBqD3JrRpdnuM3uLQdp8BICC1msycSoHBiBY20evXvE5eIKN+rvdBrewupwgGvhOF2dMABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:23:05.454870Z"},"content_sha256":"bcc4fa9f99bf9da529b3c8624d80b9d9e2cd0701ca8af5b0808e251ca92fb1b2","schema_version":"1.0","event_id":"sha256:bcc4fa9f99bf9da529b3c8624d80b9d9e2cd0701ca8af5b0808e251ca92fb1b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VAEXOYXU7EAO46BFRND3TXK3U4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the precise value of the strong chromatic-index of a planar graph with a large girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gerard Jennhwa Chang, Guan-Huei Duh","submitted_at":"2015-08-12T20:08:42Z","abstract_excerpt":"A strong $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\\{1,2,\\ldots,k\\}$ such that every pair of distinct edges at distance at most two receive different colors. The strong chromatic index $\\chi'_s(G)$ of a graph $G$ is the minimum $k$ for which $G$ has a strong $k$-edge-coloring. Denote $\\sigma(G)=\\max_{xy\\in E(G)}\\{\\operatorname{deg}(x)+\\operatorname{deg}(y)-1\\}$. It is easy to see that $\\sigma(G) \\le \\chi'_s(G)$ for any graph $G$, and the equality holds when $G$ is a tree. For a planar graph $G$ of maximum degree $\\Delta$, it was proved that $\\chi'_s(G) \\le 4 \\Delta +4$ by u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03052","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-18T01:32:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4EI47gnxn30/6UVEyEqopWKlBERxqWkvpNw5xHkZbwSlEUKeuzAFp7wlGxOPsj55C/33kwuA4eshvtmSUxpQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:23:05.455210Z"},"content_sha256":"6fc9ed5886ad70c429d7f5ac35457f472fb8e9888f6a24d1e04bd97213fc1e66","schema_version":"1.0","event_id":"sha256:6fc9ed5886ad70c429d7f5ac35457f472fb8e9888f6a24d1e04bd97213fc1e66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/bundle.json","state_url":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAEXOYXU7EAO46BFRND3TXK3U4/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-02T00:23:05Z","links":{"resolver":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4","bundle":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/bundle.json","state":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAEXOYXU7EAO46BFRND3TXK3U4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VAEXOYXU7EAO46BFRND3TXK3U4","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":"0f6ee6511e454ac3540a5b98a4c3b8d05240bdab058d7c754f0606e3754dd8fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T20:08:42Z","title_canon_sha256":"da233cbddcce01db63dbb3bb59246f94ef8e5a4a03359487bcd820eccc52abd1"},"schema_version":"1.0","source":{"id":"1508.03052","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.03052","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.03052v3","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03052","created_at":"2026-05-18T01:32:07Z"},{"alias_kind":"pith_short_12","alias_value":"VAEXOYXU7EAO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VAEXOYXU7EAO46BF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VAEXOYXU","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6fc9ed5886ad70c429d7f5ac35457f472fb8e9888f6a24d1e04bd97213fc1e66","target":"graph","created_at":"2026-05-18T01:32:07Z","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 $k$-edge-coloring of a graph $G$ is a mapping from $E(G)$ to $\\{1,2,\\ldots,k\\}$ such that every pair of distinct edges at distance at most two receive different colors. The strong chromatic index $\\chi'_s(G)$ of a graph $G$ is the minimum $k$ for which $G$ has a strong $k$-edge-coloring. Denote $\\sigma(G)=\\max_{xy\\in E(G)}\\{\\operatorname{deg}(x)+\\operatorname{deg}(y)-1\\}$. It is easy to see that $\\sigma(G) \\le \\chi'_s(G)$ for any graph $G$, and the equality holds when $G$ is a tree. For a planar graph $G$ of maximum degree $\\Delta$, it was proved that $\\chi'_s(G) \\le 4 \\Delta +4$ by u","authors_text":"Gerard Jennhwa Chang, Guan-Huei Duh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T20:08:42Z","title":"On the precise value of the strong chromatic-index of a planar graph with a large girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03052","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:bcc4fa9f99bf9da529b3c8624d80b9d9e2cd0701ca8af5b0808e251ca92fb1b2","target":"record","created_at":"2026-05-18T01:32:07Z","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":"0f6ee6511e454ac3540a5b98a4c3b8d05240bdab058d7c754f0606e3754dd8fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-12T20:08:42Z","title_canon_sha256":"da233cbddcce01db63dbb3bb59246f94ef8e5a4a03359487bcd820eccc52abd1"},"schema_version":"1.0","source":{"id":"1508.03052","kind":"arxiv","version":3}},"canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","first_computed_at":"2026-05-18T01:32:07.730899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:07.730899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9dJgTvEj6+iymAKk3cCcViECSO/i9Jx6wj+pDhGs2MmM7ErPKlveGNtUOcWQG31cDcytN1Ks7CjpAhf23vE0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:07.731562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.03052","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bcc4fa9f99bf9da529b3c8624d80b9d9e2cd0701ca8af5b0808e251ca92fb1b2","sha256:6fc9ed5886ad70c429d7f5ac35457f472fb8e9888f6a24d1e04bd97213fc1e66"],"state_sha256":"44698eb5d7dc040cc5a49ff9cc97c31215255e2be903ad84a1da2f5f1e24c037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SMx8gBCesRMEVGMsowJED9+1j3Cd7jP+7XVRbLQ5iUULFqmMcNAkQQix6SyOauaKsWfMdKBV4QR0YEjZxsgMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:23:05.457077Z","bundle_sha256":"aa5628552ad2002bb10e5b6e0124bf7d2b18ad8341fd2d84bffb691883799031"}}