{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VAEXOYXU7EAO46BFRND3TXK3U4","short_pith_number":"pith:VAEXOYXU","schema_version":"1.0","canonical_sha256":"a8097762f4f900ee78258b47b9dd5ba735816d96a02674c132d17896b9612428","source":{"kind":"arxiv","id":"1508.03052","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.03052","created_at":"2026-05-18T01:32:07.731037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03052v3","created_at":"2026-05-18T01:32:07.731037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03052","created_at":"2026-05-18T01:32:07.731037+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAEXOYXU7EAO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAEXOYXU7EAO46BF","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAEXOYXU","created_at":"2026-05-18T12:29:44.643036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4","json":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4.json","graph_json":"https://pith.science/api/pith-number/VAEXOYXU7EAO46BFRND3TXK3U4/graph.json","events_json":"https://pith.science/api/pith-number/VAEXOYXU7EAO46BFRND3TXK3U4/events.json","paper":"https://pith.science/paper/VAEXOYXU"},"agent_actions":{"view_html":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4","download_json":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4.json","view_paper":"https://pith.science/paper/VAEXOYXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03052&json=true","fetch_graph":"https://pith.science/api/pith-number/VAEXOYXU7EAO46BFRND3TXK3U4/graph.json","fetch_events":"https://pith.science/api/pith-number/VAEXOYXU7EAO46BFRND3TXK3U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/action/storage_attestation","attest_author":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/action/author_attestation","sign_citation":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/action/citation_signature","submit_replication":"https://pith.science/pith/VAEXOYXU7EAO46BFRND3TXK3U4/action/replication_record"}},"created_at":"2026-05-18T01:32:07.731037+00:00","updated_at":"2026-05-18T01:32:07.731037+00:00"}