{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4V2IDGBBQT6BCDJRCWZ3VETY2H","short_pith_number":"pith:4V2IDGBB","canonical_record":{"source":{"id":"1101.3126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T05:44:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"49de11e077efc115a677e902951db7a4e70be14010bb9d35526f24af3db09ea0","abstract_canon_sha256":"9aed681f690298d964b4e21c570afda90b5cfc24ecaf5fca3a03cc43484b2d69"},"schema_version":"1.0"},"canonical_sha256":"e57481982184fc110d3115b3ba9278d1f0a6092452ddf56587cdc44b63d779c0","source":{"kind":"arxiv","id":"1101.3126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3126","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3126v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3126","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"4V2IDGBBQT6B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4V2IDGBBQT6BCDJR","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4V2IDGBB","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4V2IDGBBQT6BCDJRCWZ3VETY2H","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T05:44:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"49de11e077efc115a677e902951db7a4e70be14010bb9d35526f24af3db09ea0","abstract_canon_sha256":"9aed681f690298d964b4e21c570afda90b5cfc24ecaf5fca3a03cc43484b2d69"},"schema_version":"1.0"},"canonical_sha256":"e57481982184fc110d3115b3ba9278d1f0a6092452ddf56587cdc44b63d779c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:30.454446Z","signature_b64":"Uu5yVd+RizlBcULYed/I+okyh922iDdeEHwXAp88QW7Ldzp5SGgNWiVvn6WwqAAFD/KalIQ1jgKn9Hz/ALw5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57481982184fc110d3115b3ba9278d1f0a6092452ddf56587cdc44b63d779c0","last_reissued_at":"2026-05-18T04:31:30.454038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:30.454038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3126","source_version":1,"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-18T04:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6o8OjUpmv0RRxvvU/Nih/3/+OLJxeYZPOFtJP/yqjQSaPyhnvbHY4IwnSdAbVqKaCTx7InEmrnV28VdasGsIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:00:35.642565Z"},"content_sha256":"08d311d36d843a4bd9b55faad923e45bfc4da3e8f423fc0ef6bf4931e82b348f","schema_version":"1.0","event_id":"sha256:08d311d36d843a4bd9b55faad923e45bfc4da3e8f423fc0ef6bf4931e82b348f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4V2IDGBBQT6BCDJRCWZ3VETY2H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of determining the rainbow vertex-connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Lily Chen, Xueliang Li, Yongtang Shi","submitted_at":"2011-01-17T05:44:18Z","abstract_excerpt":"A vertex-colored graph is {\\it rainbow vertex-connected} if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\\it rainbow vertex-connection} 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 this paper, we study the computational complexity of vertex-rainbow connection of graphs and prove that computing $rvc(G)$ is NP-Hard. Moreover, we show that it is already NP-Complete to decide whether $rvc(G)=2$. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3126","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"},"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-18T04:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4S6npu3lPYrXzIVMhod05z9jYl6iEMYf4RaPhXHrSg9xLWNM48Ea9XrCYYVGFoO1pwAbtDGkr2jc/iDg/qFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T14:00:35.642917Z"},"content_sha256":"c4941519f64e3262cb4669a7e8e861a6344acc58e25b3d31e1560c44a2d214d4","schema_version":"1.0","event_id":"sha256:c4941519f64e3262cb4669a7e8e861a6344acc58e25b3d31e1560c44a2d214d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/bundle.json","state_url":"https://pith.science/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/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-05-28T14:00:35Z","links":{"resolver":"https://pith.science/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H","bundle":"https://pith.science/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/bundle.json","state":"https://pith.science/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4V2IDGBBQT6BCDJRCWZ3VETY2H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4V2IDGBBQT6BCDJRCWZ3VETY2H","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":"9aed681f690298d964b4e21c570afda90b5cfc24ecaf5fca3a03cc43484b2d69","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T05:44:18Z","title_canon_sha256":"49de11e077efc115a677e902951db7a4e70be14010bb9d35526f24af3db09ea0"},"schema_version":"1.0","source":{"id":"1101.3126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3126","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3126v1","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3126","created_at":"2026-05-18T04:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"4V2IDGBBQT6B","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4V2IDGBBQT6BCDJR","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4V2IDGBB","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:c4941519f64e3262cb4669a7e8e861a6344acc58e25b3d31e1560c44a2d214d4","target":"graph","created_at":"2026-05-18T04:31:30Z","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 vertex-colored graph is {\\it rainbow vertex-connected} if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevich and Yuster. The {\\it rainbow vertex-connection} 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 this paper, we study the computational complexity of vertex-rainbow connection of graphs and prove that computing $rvc(G)$ is NP-Hard. Moreover, we show that it is already NP-Complete to decide whether $rvc(G)=2$. We also p","authors_text":"Lily Chen, Xueliang Li, Yongtang Shi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T05:44:18Z","title":"The complexity of determining the rainbow vertex-connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3126","kind":"arxiv","version":1},"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:08d311d36d843a4bd9b55faad923e45bfc4da3e8f423fc0ef6bf4931e82b348f","target":"record","created_at":"2026-05-18T04:31:30Z","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":"9aed681f690298d964b4e21c570afda90b5cfc24ecaf5fca3a03cc43484b2d69","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-17T05:44:18Z","title_canon_sha256":"49de11e077efc115a677e902951db7a4e70be14010bb9d35526f24af3db09ea0"},"schema_version":"1.0","source":{"id":"1101.3126","kind":"arxiv","version":1}},"canonical_sha256":"e57481982184fc110d3115b3ba9278d1f0a6092452ddf56587cdc44b63d779c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e57481982184fc110d3115b3ba9278d1f0a6092452ddf56587cdc44b63d779c0","first_computed_at":"2026-05-18T04:31:30.454038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:30.454038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uu5yVd+RizlBcULYed/I+okyh922iDdeEHwXAp88QW7Ldzp5SGgNWiVvn6WwqAAFD/KalIQ1jgKn9Hz/ALw5BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:30.454446Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08d311d36d843a4bd9b55faad923e45bfc4da3e8f423fc0ef6bf4931e82b348f","sha256:c4941519f64e3262cb4669a7e8e861a6344acc58e25b3d31e1560c44a2d214d4"],"state_sha256":"0e05b6b041789104da0060375572326318a9f154760a1486cabd5d413bc0b75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwJEoVPwkGUFDaU5I2jXznggGlcdoSh7IMlh/6zmDcUOI6uRa0lcWNKFi31UZcJZNSTWAHBzmUUz0uNthqmDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T14:00:35.644918Z","bundle_sha256":"1ade0e901b01a7bcdf59a7459dc55f3c86cbaf23e7097d7f7c281911dcb4a4a8"}}