{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OW2SAXZY5XMOWTIGNZDVOM66SR","short_pith_number":"pith:OW2SAXZY","schema_version":"1.0","canonical_sha256":"75b5205f38edd8eb4d066e475733de944278b5aeb5f37389d776d4e65ac9284f","source":{"kind":"arxiv","id":"2606.23824","version":1},"attestation_state":"computed","paper":{"title":"Strong chromatic index of bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianchi Yang, Xingxing Yu, Yanli Hao","submitted_at":"2026-06-22T18:07:32Z","abstract_excerpt":"An edge-coloring of a graph $G$ is called a strong edge-coloring if all its color classes are induced matchings in $G$; the minimum number of colors required for such a coloring, denoted by $\\chi_{s}'(G)$, is known as the strong chromatic index of $G$. For each vertex $v$ of a graph $G$, let $d_G(v)$ denote the degree of $v$ in $G$. Let $G$ be a bipartite graph with partite sets $A$ and $B$, and let $\\Delta_A=\\max\\{d_G(a): a\\in A\\}$ and $\\Delta_B=\\max\\{d_G(b): b\\in B\\}$. A conjecture of Brualdi and Quinn Massey asserts that \\( \\chi_s'(G) \\le \\Delta_A \\Delta_B\\). In this paper, we show that \\(\\"},"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":"2606.23824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T18:07:32Z","cross_cats_sorted":[],"title_canon_sha256":"e28cb229504405077de13726f3a1a1b7352f7d1756247670c96c6c1397ae8e9a","abstract_canon_sha256":"dfb8c761887d98cfa0f918a4677b93f55bc39dd3a8d6610a4806da02fd93c1f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:27.925393Z","signature_b64":"fDzQq8g4wz2f2H9hkyXNwhBy42SN1cFtMZ5b5UiO+BaFmdGqd9SwzWB7q1Z/6IfzUXSeIn2NfNbxMTKMzM0EDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b5205f38edd8eb4d066e475733de944278b5aeb5f37389d776d4e65ac9284f","last_reissued_at":"2026-06-24T00:14:27.924997Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:27.924997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong chromatic index of bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tianchi Yang, Xingxing Yu, Yanli Hao","submitted_at":"2026-06-22T18:07:32Z","abstract_excerpt":"An edge-coloring of a graph $G$ is called a strong edge-coloring if all its color classes are induced matchings in $G$; the minimum number of colors required for such a coloring, denoted by $\\chi_{s}'(G)$, is known as the strong chromatic index of $G$. For each vertex $v$ of a graph $G$, let $d_G(v)$ denote the degree of $v$ in $G$. Let $G$ be a bipartite graph with partite sets $A$ and $B$, and let $\\Delta_A=\\max\\{d_G(a): a\\in A\\}$ and $\\Delta_B=\\max\\{d_G(b): b\\in B\\}$. A conjecture of Brualdi and Quinn Massey asserts that \\( \\chi_s'(G) \\le \\Delta_A \\Delta_B\\). In this paper, we show that \\(\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23824","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.23824/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.23824","created_at":"2026-06-24T00:14:27.925060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23824v1","created_at":"2026-06-24T00:14:27.925060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23824","created_at":"2026-06-24T00:14:27.925060+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW2SAXZY5XMO","created_at":"2026-06-24T00:14:27.925060+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW2SAXZY5XMOWTIG","created_at":"2026-06-24T00:14:27.925060+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW2SAXZY","created_at":"2026-06-24T00:14:27.925060+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/OW2SAXZY5XMOWTIGNZDVOM66SR","json":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR.json","graph_json":"https://pith.science/api/pith-number/OW2SAXZY5XMOWTIGNZDVOM66SR/graph.json","events_json":"https://pith.science/api/pith-number/OW2SAXZY5XMOWTIGNZDVOM66SR/events.json","paper":"https://pith.science/paper/OW2SAXZY"},"agent_actions":{"view_html":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR","download_json":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR.json","view_paper":"https://pith.science/paper/OW2SAXZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23824&json=true","fetch_graph":"https://pith.science/api/pith-number/OW2SAXZY5XMOWTIGNZDVOM66SR/graph.json","fetch_events":"https://pith.science/api/pith-number/OW2SAXZY5XMOWTIGNZDVOM66SR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR/action/storage_attestation","attest_author":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR/action/author_attestation","sign_citation":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR/action/citation_signature","submit_replication":"https://pith.science/pith/OW2SAXZY5XMOWTIGNZDVOM66SR/action/replication_record"}},"created_at":"2026-06-24T00:14:27.925060+00:00","updated_at":"2026-06-24T00:14:27.925060+00:00"}