{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NCVFJDEMCIWAQOAB6WKH76FT6A","short_pith_number":"pith:NCVFJDEM","schema_version":"1.0","canonical_sha256":"68aa548c8c122c083801f5947ff8b3f0045d1d1976f0122b9c48dcbb641bbadb","source":{"kind":"arxiv","id":"1110.1915","version":1},"attestation_state":"computed","paper":{"title":"Further hardness results on the rainbow vertex-connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Huishu Lian, Lily Chen, Xueliang Li","submitted_at":"2011-10-10T03:19:42Z","abstract_excerpt":"A vertex-colored graph $G$ is {\\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\\it rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow vertex-connected. In a previous paper we showed that it is NP-Complete to decide whether a given graph $G$ has $rvc(G)=2$. In this paper we show that for every integer $k\\geq 2$, deciding whether $rvc(G)\\leq k$ is NP-Hard."},"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":"1110.1915","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-10T03:19:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"f95e9ab582d8ee0dcde0f893be3698ede5ff5eacf0f3caa776373ef3cd25ef88","abstract_canon_sha256":"60981e83ad1f65a39d6eba9b90bf41020f40e6ba79532cb5a4500d24699a0b19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.327043Z","signature_b64":"45FCRMvMb/fHOzVxQjQPu9ZODSN6TEOheJfZ8Fm+YXF9UIUNDWYrkTf1PPCCiQ4QouV5+t29ROBizxXy60JgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68aa548c8c122c083801f5947ff8b3f0045d1d1976f0122b9c48dcbb641bbadb","last_reissued_at":"2026-05-18T04:11:19.326580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.326580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Further hardness results on the rainbow vertex-connection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Huishu Lian, Lily Chen, Xueliang Li","submitted_at":"2011-10-10T03:19:42Z","abstract_excerpt":"A vertex-colored graph $G$ is {\\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\\it rainbow vertex-connection number} of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow vertex-connected. In a previous paper we showed that it is NP-Complete to decide whether a given graph $G$ has $rvc(G)=2$. In this paper we show that for every integer $k\\geq 2$, deciding whether $rvc(G)\\leq k$ is NP-Hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1915","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":"1110.1915","created_at":"2026-05-18T04:11:19.326645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.1915v1","created_at":"2026-05-18T04:11:19.326645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1915","created_at":"2026-05-18T04:11:19.326645+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCVFJDEMCIWA","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCVFJDEMCIWAQOAB","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCVFJDEM","created_at":"2026-05-18T12:26:37.096874+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/NCVFJDEMCIWAQOAB6WKH76FT6A","json":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A.json","graph_json":"https://pith.science/api/pith-number/NCVFJDEMCIWAQOAB6WKH76FT6A/graph.json","events_json":"https://pith.science/api/pith-number/NCVFJDEMCIWAQOAB6WKH76FT6A/events.json","paper":"https://pith.science/paper/NCVFJDEM"},"agent_actions":{"view_html":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A","download_json":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A.json","view_paper":"https://pith.science/paper/NCVFJDEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.1915&json=true","fetch_graph":"https://pith.science/api/pith-number/NCVFJDEMCIWAQOAB6WKH76FT6A/graph.json","fetch_events":"https://pith.science/api/pith-number/NCVFJDEMCIWAQOAB6WKH76FT6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A/action/storage_attestation","attest_author":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A/action/author_attestation","sign_citation":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A/action/citation_signature","submit_replication":"https://pith.science/pith/NCVFJDEMCIWAQOAB6WKH76FT6A/action/replication_record"}},"created_at":"2026-05-18T04:11:19.326645+00:00","updated_at":"2026-05-18T04:11:19.326645+00:00"}