{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IU4N46JYBTUG2DCMHQBGFKRN2Q","short_pith_number":"pith:IU4N46JY","schema_version":"1.0","canonical_sha256":"4538de79380ce86d0c4c3c0262aa2dd429fbe5a2716006798c0c735cbac144ac","source":{"kind":"arxiv","id":"1806.07017","version":1},"attestation_state":"computed","paper":{"title":"The strong chromatic index of $(3,\\Delta)$-bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Mingfang Huang, Xiangqian Zhou","submitted_at":"2018-06-19T02:34:41Z","abstract_excerpt":"A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $\\Delta$. We show that every such graph has a strong edge-coloring using at most $3 \\Delta$ colors. Our result confirms a conjecture of Brualdi and Quinn Massey ~\\cite{[BQ]} for this class of bipartite graphs."},"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":"1806.07017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-06-19T02:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"7eb64735688fcd4ee50334fff46bbf673e60c2e808da6c895ddb615d6c3140aa","abstract_canon_sha256":"b53fb42175b874b342b5e9f0607482c7d77870ed8981d85ae7bf2866703cdac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:57.714184Z","signature_b64":"z9bNMAOsY53bSilOV74zlZ9xmqREbEXKY2pjLjSDU5FACAZ99lG3G+EmOxHEq4rDnnKYBIOGg9oYN/EE+10pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4538de79380ce86d0c4c3c0262aa2dd429fbe5a2716006798c0c735cbac144ac","last_reissued_at":"2026-05-18T00:12:57.713578Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:57.713578Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The strong chromatic index of $(3,\\Delta)$-bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Mingfang Huang, Xiangqian Zhou","submitted_at":"2018-06-19T02:34:41Z","abstract_excerpt":"A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $\\Delta$. We show that every such graph has a strong edge-coloring using at most $3 \\Delta$ colors. Our result confirms a conjecture of Brualdi and Quinn Massey ~\\cite{[BQ]} for this class of bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07017","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":""},"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":"1806.07017","created_at":"2026-05-18T00:12:57.713661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07017v1","created_at":"2026-05-18T00:12:57.713661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07017","created_at":"2026-05-18T00:12:57.713661+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU4N46JYBTUG","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU4N46JYBTUG2DCM","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU4N46JY","created_at":"2026-05-18T12:32:31.084164+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/IU4N46JYBTUG2DCMHQBGFKRN2Q","json":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q.json","graph_json":"https://pith.science/api/pith-number/IU4N46JYBTUG2DCMHQBGFKRN2Q/graph.json","events_json":"https://pith.science/api/pith-number/IU4N46JYBTUG2DCMHQBGFKRN2Q/events.json","paper":"https://pith.science/paper/IU4N46JY"},"agent_actions":{"view_html":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q","download_json":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q.json","view_paper":"https://pith.science/paper/IU4N46JY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07017&json=true","fetch_graph":"https://pith.science/api/pith-number/IU4N46JYBTUG2DCMHQBGFKRN2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/IU4N46JYBTUG2DCMHQBGFKRN2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q/action/storage_attestation","attest_author":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q/action/author_attestation","sign_citation":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q/action/citation_signature","submit_replication":"https://pith.science/pith/IU4N46JYBTUG2DCMHQBGFKRN2Q/action/replication_record"}},"created_at":"2026-05-18T00:12:57.713661+00:00","updated_at":"2026-05-18T00:12:57.713661+00:00"}