{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JIMSIGAAWRPXTBKLZQ2C4M5BK6","short_pith_number":"pith:JIMSIGAA","schema_version":"1.0","canonical_sha256":"4a19241800b45f79854bcc342e33a157854fc9de786d38807868a505a54a0eb0","source":{"kind":"arxiv","id":"1610.05406","version":2},"attestation_state":"computed","paper":{"title":"Strong edge-colorings of sparse graphs with large maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andr\\'e Raspaud, Ilkyoo Choi, Jaehoon Kim","submitted_at":"2016-10-18T02:24:14Z","abstract_excerpt":"A {\\em strong $k$-edge-coloring} of a graph $G$ is a mapping from $E(G)$ to $\\{1,2,\\ldots,k\\}$ such that every two adjacent edges or two edges adjacent to the same edge receive distinct colors. The {\\em strong chromatic index} $\\chi_s'(G)$ of a graph $G$ is the smallest integer $k$ such that $G$ admits a strong $k$-edge-coloring. We give bounds on $\\chi_s'(G)$ in terms of the maximum degree $\\Delta(G)$ of a graph $G$. when $G$ is sparse, namely, when $G$ is $2$-degenerate or when the maximum average degree ${\\rm Mad}(G)$ is small. We prove that the strong chromatic index of each $2$-degenerate"},"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":"1610.05406","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-18T02:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"0e5a1dfeaf6b8580f28b101d210e378785feb22549d17b75d55f9ffcd7f9983d","abstract_canon_sha256":"3d92b5f3663a73a0e484c0e58b4d6be02e81c8830e47f1e71ac295a5de2fab83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:21.283182Z","signature_b64":"gGrOMrO6eYXxr1TlqWn3XpgKuGxRUh8c63sN2oHN0KWuG5/3tq4a46MlVaRofq9nOswFq1l9swQCP9qYLgSXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a19241800b45f79854bcc342e33a157854fc9de786d38807868a505a54a0eb0","last_reissued_at":"2026-05-18T00:25:21.282487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:21.282487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong edge-colorings of sparse graphs with large maximum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr V. Kostochka, Andr\\'e Raspaud, Ilkyoo Choi, Jaehoon Kim","submitted_at":"2016-10-18T02:24:14Z","abstract_excerpt":"A {\\em strong $k$-edge-coloring} of a graph $G$ is a mapping from $E(G)$ to $\\{1,2,\\ldots,k\\}$ such that every two adjacent edges or two edges adjacent to the same edge receive distinct colors. The {\\em strong chromatic index} $\\chi_s'(G)$ of a graph $G$ is the smallest integer $k$ such that $G$ admits a strong $k$-edge-coloring. We give bounds on $\\chi_s'(G)$ in terms of the maximum degree $\\Delta(G)$ of a graph $G$. when $G$ is sparse, namely, when $G$ is $2$-degenerate or when the maximum average degree ${\\rm Mad}(G)$ is small. We prove that the strong chromatic index of each $2$-degenerate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.05406","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.05406","created_at":"2026-05-18T00:25:21.282606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.05406v2","created_at":"2026-05-18T00:25:21.282606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.05406","created_at":"2026-05-18T00:25:21.282606+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIMSIGAAWRPX","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIMSIGAAWRPXTBKL","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIMSIGAA","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6","json":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6.json","graph_json":"https://pith.science/api/pith-number/JIMSIGAAWRPXTBKLZQ2C4M5BK6/graph.json","events_json":"https://pith.science/api/pith-number/JIMSIGAAWRPXTBKLZQ2C4M5BK6/events.json","paper":"https://pith.science/paper/JIMSIGAA"},"agent_actions":{"view_html":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6","download_json":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6.json","view_paper":"https://pith.science/paper/JIMSIGAA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.05406&json=true","fetch_graph":"https://pith.science/api/pith-number/JIMSIGAAWRPXTBKLZQ2C4M5BK6/graph.json","fetch_events":"https://pith.science/api/pith-number/JIMSIGAAWRPXTBKLZQ2C4M5BK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6/action/storage_attestation","attest_author":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6/action/author_attestation","sign_citation":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6/action/citation_signature","submit_replication":"https://pith.science/pith/JIMSIGAAWRPXTBKLZQ2C4M5BK6/action/replication_record"}},"created_at":"2026-05-18T00:25:21.282606+00:00","updated_at":"2026-05-18T00:25:21.282606+00:00"}