{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","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":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b"},"schema_version":"1.0","source":{"id":"1109.5534","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5534v2","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5534","created_at":"2026-05-18T04:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"PD3GHKTJWMXE","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PD3GHKTJWMXEQXMP","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PD3GHKTJ","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb","target":"graph","created_at":"2026-05-18T04:12:11Z","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 path in an edge-colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge-colored graph is (strongly) rainbow connected if there exists a rainbow (geodesic) path between every pair of vertices. The (strong) rainbow connection number of $G$, denoted by ($scr(G)$, respectively) $rc(G)$, is the smallest number of colors that are needed in order to make $G$ (strongly) rainbow connected. Though for a general graph $G$ it is NP-Complete to decide whether $rc(G)=2$, in this paper, we show that the problem becomes easy when $G$ is a bipartite graph. Moreover","authors_text":"Shasha Li, Xueliang Li","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title":"Note on the complexity of deciding the rainbow connectedness for bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5534","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:db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52","target":"record","created_at":"2026-05-18T04:12:11Z","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":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b"},"schema_version":"1.0","source":{"id":"1109.5534","kind":"arxiv","version":2}},"canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","first_computed_at":"2026-05-18T04:12:11.413665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:12:11.413665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVrdmEGRsBDbGRqS3/GKNzppsyJllWmnLYgM40QbOwe+Mk6WLDi8Y2Wm2h00QXndPf2iaZUxQFOqfIwwGtEvDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:12:11.414151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5534","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db53bc7a9e532a0a3f79439e10c67c9053451bb01679766a2ecad621130edd52","sha256:e739e213b4afc7938fec268cc2c8c2550c1f22510fe2ba8ff35a8dc771759edb"],"state_sha256":"a15eb1d173e5f6bb125bfda5a2c0b747520dc6e9082efd843a3a3a192da1875e"}