{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RCPO2GGIC3M7MSJH3LLSOYNUTH","short_pith_number":"pith:RCPO2GGI","schema_version":"1.0","canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","source":{"kind":"arxiv","id":"1311.6668","version":2},"attestation_state":"computed","paper":{"title":"Strong edge coloring of subcubic bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Martina Mockov\\v{c}iakov\\'a, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-11-26T13:54:22Z","abstract_excerpt":"A strong edge coloring of a graph $G$ is a proper edge coloring in which each color class is an induced matching of $G$. In 1993, Brualdi and Quinn Massey proposed a conjecture that every bipartite graph without $4$-cycles and with the maximum degrees of the two partite sets $2$ and $\\Delta$ admits a strong edge coloring with at most $\\Delta+2$ colors. We prove that this conjecture holds for such graphs with $\\Delta=3$. We also confirm the conjecture proposed by Faudree et al. for subcubic 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":"1311.6668","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T13:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"3c001bd03df9e155a255778470a463e361084c4119813903f78cc1aaf302be75","abstract_canon_sha256":"fecfb86c14630d0649d5d819b527a366a9019f54887412e3d7650b8eb5c88083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:20.024836Z","signature_b64":"HrP7UynHAbHZNjV6dTWNp1QVHgyLa5LyXx3O3ILo344KerSsx79Y258rxu91XCwNUg/WcPrwTi1kzKK6FSSdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","last_reissued_at":"2026-05-18T03:05:20.024454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:20.024454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong edge coloring of subcubic bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Borut Lu\\v{z}ar, Martina Mockov\\v{c}iakov\\'a, Riste \\v{S}krekovski, Roman Sot\\'ak","submitted_at":"2013-11-26T13:54:22Z","abstract_excerpt":"A strong edge coloring of a graph $G$ is a proper edge coloring in which each color class is an induced matching of $G$. In 1993, Brualdi and Quinn Massey proposed a conjecture that every bipartite graph without $4$-cycles and with the maximum degrees of the two partite sets $2$ and $\\Delta$ admits a strong edge coloring with at most $\\Delta+2$ colors. We prove that this conjecture holds for such graphs with $\\Delta=3$. We also confirm the conjecture proposed by Faudree et al. for subcubic bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6668","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":"1311.6668","created_at":"2026-05-18T03:05:20.024511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6668v2","created_at":"2026-05-18T03:05:20.024511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6668","created_at":"2026-05-18T03:05:20.024511+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCPO2GGIC3M7","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCPO2GGIC3M7MSJH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCPO2GGI","created_at":"2026-05-18T12:27:57.521954+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/RCPO2GGIC3M7MSJH3LLSOYNUTH","json":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH.json","graph_json":"https://pith.science/api/pith-number/RCPO2GGIC3M7MSJH3LLSOYNUTH/graph.json","events_json":"https://pith.science/api/pith-number/RCPO2GGIC3M7MSJH3LLSOYNUTH/events.json","paper":"https://pith.science/paper/RCPO2GGI"},"agent_actions":{"view_html":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH","download_json":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH.json","view_paper":"https://pith.science/paper/RCPO2GGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6668&json=true","fetch_graph":"https://pith.science/api/pith-number/RCPO2GGIC3M7MSJH3LLSOYNUTH/graph.json","fetch_events":"https://pith.science/api/pith-number/RCPO2GGIC3M7MSJH3LLSOYNUTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/action/storage_attestation","attest_author":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/action/author_attestation","sign_citation":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/action/citation_signature","submit_replication":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/action/replication_record"}},"created_at":"2026-05-18T03:05:20.024511+00:00","updated_at":"2026-05-18T03:05:20.024511+00:00"}