{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:RCPO2GGIC3M7MSJH3LLSOYNUTH","short_pith_number":"pith:RCPO2GGI","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"},"canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","source":{"kind":"arxiv","id":"1311.6668","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6668","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6668v2","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6668","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"RCPO2GGIC3M7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCPO2GGIC3M7MSJH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCPO2GGI","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:RCPO2GGIC3M7MSJH3LLSOYNUTH","target":"record","payload":{"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"},"canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","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"},"source_kind":"arxiv","source_id":"1311.6668","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bgz6T3j9o9pIGdQ1CwHvg8VNaUhbsSGh9vcTI1PZd4UzWF2jvBdNh13U07PREF12+2or5+aZqvaGt7xMNA0nBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:54:48.658667Z"},"content_sha256":"64bd02adf07e09878d2aadd73f23d03b6c214275ea2df5340067c48ecd5e2eaa","schema_version":"1.0","event_id":"sha256:64bd02adf07e09878d2aadd73f23d03b6c214275ea2df5340067c48ecd5e2eaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:RCPO2GGIC3M7MSJH3LLSOYNUTH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6K2r4qVpVZyBqPPEKYCBNxz2WCX9TXhW52YHdczYlAC2r1fHXcd+KyOgS0PFl/OFVPQnh9XAXqeIEt+IhEjEDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T07:54:48.659297Z"},"content_sha256":"917f341439af45eacfd8c5863aa938531157a76739e4b64521eb154d7e1e1dc3","schema_version":"1.0","event_id":"sha256:917f341439af45eacfd8c5863aa938531157a76739e4b64521eb154d7e1e1dc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/bundle.json","state_url":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T07:54:48Z","links":{"resolver":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH","bundle":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/bundle.json","state":"https://pith.science/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCPO2GGIC3M7MSJH3LLSOYNUTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RCPO2GGIC3M7MSJH3LLSOYNUTH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fecfb86c14630d0649d5d819b527a366a9019f54887412e3d7650b8eb5c88083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T13:54:22Z","title_canon_sha256":"3c001bd03df9e155a255778470a463e361084c4119813903f78cc1aaf302be75"},"schema_version":"1.0","source":{"id":"1311.6668","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6668","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6668v2","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6668","created_at":"2026-05-18T03:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"RCPO2GGIC3M7","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCPO2GGIC3M7MSJH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCPO2GGI","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:917f341439af45eacfd8c5863aa938531157a76739e4b64521eb154d7e1e1dc3","target":"graph","created_at":"2026-05-18T03:05:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Borut Lu\\v{z}ar, Martina Mockov\\v{c}iakov\\'a, Riste \\v{S}krekovski, Roman Sot\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T13:54:22Z","title":"Strong edge coloring of subcubic bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6668","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64bd02adf07e09878d2aadd73f23d03b6c214275ea2df5340067c48ecd5e2eaa","target":"record","created_at":"2026-05-18T03:05:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fecfb86c14630d0649d5d819b527a366a9019f54887412e3d7650b8eb5c88083","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-26T13:54:22Z","title_canon_sha256":"3c001bd03df9e155a255778470a463e361084c4119813903f78cc1aaf302be75"},"schema_version":"1.0","source":{"id":"1311.6668","kind":"arxiv","version":2}},"canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"889eed18c816d9f64927dad72761b499cf22e225d8a9e7109425ec093d0d5fff","first_computed_at":"2026-05-18T03:05:20.024454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:20.024454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HrP7UynHAbHZNjV6dTWNp1QVHgyLa5LyXx3O3ILo344KerSsx79Y258rxu91XCwNUg/WcPrwTi1kzKK6FSSdBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:20.024836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6668","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64bd02adf07e09878d2aadd73f23d03b6c214275ea2df5340067c48ecd5e2eaa","sha256:917f341439af45eacfd8c5863aa938531157a76739e4b64521eb154d7e1e1dc3"],"state_sha256":"7316ed350098fe4c460f6c8075499385eecce7dcb195c23f3f6dfc3dab083a4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+Covtr2v4eoMXfHBu0p1fgigP/Hp9F7aHjK7AMR94MWykikyMek80TlDcm2JSNGYSHAz0kZV2hJRdYkcR7FDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T07:54:48.663289Z","bundle_sha256":"87e729935e9e470517f28f24bf57258d4919f34051308493c4a388c4b2344748"}}