{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EYWLLEJIP3A3M47PHSOW37FIYR","short_pith_number":"pith:EYWLLEJI","schema_version":"1.0","canonical_sha256":"262cb591287ec1b673ef3c9d6dfca8c4460ba034640cf6b70aeec3d68c440d54","source":{"kind":"arxiv","id":"1809.01805","version":2},"attestation_state":"computed","paper":{"title":"Strong list-chromatic index of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Gexin Yu, Guanghui Wang, Tianjiao Dai","submitted_at":"2018-09-06T03:39:11Z","abstract_excerpt":"A strong $k$-edge-coloring of a graph G is an edge-coloring with $k$ colors in which every color class is an induced matching. The strong chromatic index of $G$, denoted by $\\chi'_{s}(G)$, is the minimum $k$ for which $G$ has a strong $k$-edge-coloring. In 1985, Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured that $\\chi'_{s}(G)\\leq\\frac{5}{4}\\Delta(G)^2$, where $\\Delta(G)$ is the maximum degree of $G$. When $G$ is a graph with maximum degree at most 3, the conjecture was verified independently by Andersen and Hor\\'{a}k, Qing, and Trotter. In this paper, we consider the list version of strong edge-c"},"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":"1809.01805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-06T03:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"45062315f9fa569590b65bc223c97ddd9bc00ca944b8fd0e99f4e234d5f942ec","abstract_canon_sha256":"5047de214c8f84f1c91729809d68266906ef686f019c1eee5ae346f753ef9ca2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:15.792091Z","signature_b64":"wfEbom3Jdd+0R5brpSTQZcwxFvqBoWAHsxsTpnDJBCrb2bWicHc4A8egQd6OHS/XB0laYbQNcqcnnEUndtxnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"262cb591287ec1b673ef3c9d6dfca8c4460ba034640cf6b70aeec3d68c440d54","last_reissued_at":"2026-05-18T00:06:15.791488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:15.791488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong list-chromatic index of subcubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Gexin Yu, Guanghui Wang, Tianjiao Dai","submitted_at":"2018-09-06T03:39:11Z","abstract_excerpt":"A strong $k$-edge-coloring of a graph G is an edge-coloring with $k$ colors in which every color class is an induced matching. The strong chromatic index of $G$, denoted by $\\chi'_{s}(G)$, is the minimum $k$ for which $G$ has a strong $k$-edge-coloring. In 1985, Erd\\H{o}s and Ne\\v{s}et\\v{r}il conjectured that $\\chi'_{s}(G)\\leq\\frac{5}{4}\\Delta(G)^2$, where $\\Delta(G)$ is the maximum degree of $G$. When $G$ is a graph with maximum degree at most 3, the conjecture was verified independently by Andersen and Hor\\'{a}k, Qing, and Trotter. In this paper, we consider the list version of strong edge-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01805","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":"1809.01805","created_at":"2026-05-18T00:06:15.791564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.01805v2","created_at":"2026-05-18T00:06:15.791564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01805","created_at":"2026-05-18T00:06:15.791564+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYWLLEJIP3A3","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYWLLEJIP3A3M47P","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYWLLEJI","created_at":"2026-05-18T12:32:22.470017+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/EYWLLEJIP3A3M47PHSOW37FIYR","json":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR.json","graph_json":"https://pith.science/api/pith-number/EYWLLEJIP3A3M47PHSOW37FIYR/graph.json","events_json":"https://pith.science/api/pith-number/EYWLLEJIP3A3M47PHSOW37FIYR/events.json","paper":"https://pith.science/paper/EYWLLEJI"},"agent_actions":{"view_html":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR","download_json":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR.json","view_paper":"https://pith.science/paper/EYWLLEJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.01805&json=true","fetch_graph":"https://pith.science/api/pith-number/EYWLLEJIP3A3M47PHSOW37FIYR/graph.json","fetch_events":"https://pith.science/api/pith-number/EYWLLEJIP3A3M47PHSOW37FIYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR/action/storage_attestation","attest_author":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR/action/author_attestation","sign_citation":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR/action/citation_signature","submit_replication":"https://pith.science/pith/EYWLLEJIP3A3M47PHSOW37FIYR/action/replication_record"}},"created_at":"2026-05-18T00:06:15.791564+00:00","updated_at":"2026-05-18T00:06:15.791564+00:00"}