{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PD3GHKTJWMXEQXMPQRSOAL3Y62","short_pith_number":"pith:PD3GHKTJ","schema_version":"1.0","canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","source":{"kind":"arxiv","id":"1109.5534","version":2},"attestation_state":"computed","paper":{"title":"Note on the complexity of deciding the rainbow connectedness for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Shasha Li, Xueliang Li","submitted_at":"2011-09-26T12:21:48Z","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"},"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":"1109.5534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-09-26T12:21:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"474aa3688697f370ce9aa7f4cbef233c7278880339b66c47e4bcf4e98314868b","abstract_canon_sha256":"886c4a296f49e1bd6bf603b797680e5cfade8697900910d29a39eccaf03185a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:11.414151Z","signature_b64":"dVrdmEGRsBDbGRqS3/GKNzppsyJllWmnLYgM40QbOwe+Mk6WLDi8Y2Wm2h00QXndPf2iaZUxQFOqfIwwGtEvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78f663aa69b32e485d8f8464e02f78f6a64d85691392cc3ead8f00fd1ffe6d8f","last_reissued_at":"2026-05-18T04:12:11.413665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:11.413665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on the complexity of deciding the rainbow connectedness for bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Shasha Li, Xueliang Li","submitted_at":"2011-09-26T12:21:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5534","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":"1109.5534","created_at":"2026-05-18T04:12:11.413738+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5534v2","created_at":"2026-05-18T04:12:11.413738+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5534","created_at":"2026-05-18T04:12:11.413738+00:00"},{"alias_kind":"pith_short_12","alias_value":"PD3GHKTJWMXE","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PD3GHKTJWMXEQXMP","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PD3GHKTJ","created_at":"2026-05-18T12:26:39.201973+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/PD3GHKTJWMXEQXMPQRSOAL3Y62","json":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62.json","graph_json":"https://pith.science/api/pith-number/PD3GHKTJWMXEQXMPQRSOAL3Y62/graph.json","events_json":"https://pith.science/api/pith-number/PD3GHKTJWMXEQXMPQRSOAL3Y62/events.json","paper":"https://pith.science/paper/PD3GHKTJ"},"agent_actions":{"view_html":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62","download_json":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62.json","view_paper":"https://pith.science/paper/PD3GHKTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5534&json=true","fetch_graph":"https://pith.science/api/pith-number/PD3GHKTJWMXEQXMPQRSOAL3Y62/graph.json","fetch_events":"https://pith.science/api/pith-number/PD3GHKTJWMXEQXMPQRSOAL3Y62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/action/storage_attestation","attest_author":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/action/author_attestation","sign_citation":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/action/citation_signature","submit_replication":"https://pith.science/pith/PD3GHKTJWMXEQXMPQRSOAL3Y62/action/replication_record"}},"created_at":"2026-05-18T04:12:11.413738+00:00","updated_at":"2026-05-18T04:12:11.413738+00:00"}