{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2HCV2N76ZCN2XZET7ST53BVO37","short_pith_number":"pith:2HCV2N76","canonical_record":{"source":{"id":"1612.07768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T19:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"1f8e6703cd8410d3cfd86318bfbe3ea35ea62856096c67010f510e16a99565d0","abstract_canon_sha256":"128bcb1c229cccd7aab7b7f3794e21cff9b1f714d13d98e5fe5a7a7c68a559cc"},"schema_version":"1.0"},"canonical_sha256":"d1c55d37fec89babe493fca7dd86aedfe449e66941b44c56e58de862d815387c","source":{"kind":"arxiv","id":"1612.07768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07768","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07768v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07768","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"2HCV2N76ZCN2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HCV2N76ZCN2XZET","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HCV2N76","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2HCV2N76ZCN2XZET7ST53BVO37","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T19:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"1f8e6703cd8410d3cfd86318bfbe3ea35ea62856096c67010f510e16a99565d0","abstract_canon_sha256":"128bcb1c229cccd7aab7b7f3794e21cff9b1f714d13d98e5fe5a7a7c68a559cc"},"schema_version":"1.0"},"canonical_sha256":"d1c55d37fec89babe493fca7dd86aedfe449e66941b44c56e58de862d815387c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.407726Z","signature_b64":"nyjNOGPY2lfaNib2UGCRsjwXtP9MPcnoR5VUwC1hrynb9YsOaVIskhL92i2IUOSW4KV66f2PZzEeHvP8UZolAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1c55d37fec89babe493fca7dd86aedfe449e66941b44c56e58de862d815387c","last_reissued_at":"2026-05-18T00:54:09.407273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.407273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07768","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-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eeQOBP/iiBjJYpQe8WDNABABUyvL5bsNZ7hW0zhEMm3zgdgSFJlYiEUflc1skADDjkynD41HGtpzjB1AvMOFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:37:33.899115Z"},"content_sha256":"6308662bd8d2ddeb6f6fbe9547d2843e31b6b58da3232e245bad74f416554b9d","schema_version":"1.0","event_id":"sha256:6308662bd8d2ddeb6f6fbe9547d2843e31b6b58da3232e245bad74f416554b9d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2HCV2N76ZCN2XZET7ST53BVO37","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Juho Lauri","submitted_at":"2016-12-22T19:52:12Z","abstract_excerpt":"A path in a vertex-colored graph $G$ is \\emph{vertex rainbow} if all of its internal vertices have a distinct color. The graph $G$ is said to be \\emph{rainbow vertex connected} if there is a vertex rainbow path between every pair of its vertices. Similarly, the graph $G$ is \\emph{strongly rainbow vertex connected} if there is a shortest path which is vertex rainbow between every pair of its vertices. We consider the complexity of deciding if a given vertex-colored graph is rainbow or strongly rainbow vertex connected. We call these problems \\probRvc and \\probSrvc, respectively. We prove both p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07768","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-18T00:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12A3coendWZT7VGq18ZUTkV3S4jXpiQNA6ZAvtLT2SZIXnGdtuRC5on/JBDreYWl38trDgrtaBZX4joCwmxUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:37:33.899894Z"},"content_sha256":"f9f15bb89b14808f110fc6e966f81d9e3568adc8c27f20520e0507253fd2d93f","schema_version":"1.0","event_id":"sha256:f9f15bb89b14808f110fc6e966f81d9e3568adc8c27f20520e0507253fd2d93f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HCV2N76ZCN2XZET7ST53BVO37/bundle.json","state_url":"https://pith.science/pith/2HCV2N76ZCN2XZET7ST53BVO37/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HCV2N76ZCN2XZET7ST53BVO37/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-26T06:37:33Z","links":{"resolver":"https://pith.science/pith/2HCV2N76ZCN2XZET7ST53BVO37","bundle":"https://pith.science/pith/2HCV2N76ZCN2XZET7ST53BVO37/bundle.json","state":"https://pith.science/pith/2HCV2N76ZCN2XZET7ST53BVO37/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HCV2N76ZCN2XZET7ST53BVO37/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2HCV2N76ZCN2XZET7ST53BVO37","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":"128bcb1c229cccd7aab7b7f3794e21cff9b1f714d13d98e5fe5a7a7c68a559cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T19:52:12Z","title_canon_sha256":"1f8e6703cd8410d3cfd86318bfbe3ea35ea62856096c67010f510e16a99565d0"},"schema_version":"1.0","source":{"id":"1612.07768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07768","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07768v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07768","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"2HCV2N76ZCN2","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2HCV2N76ZCN2XZET","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2HCV2N76","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f9f15bb89b14808f110fc6e966f81d9e3568adc8c27f20520e0507253fd2d93f","target":"graph","created_at":"2026-05-18T00:54:09Z","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 a vertex-colored graph $G$ is \\emph{vertex rainbow} if all of its internal vertices have a distinct color. The graph $G$ is said to be \\emph{rainbow vertex connected} if there is a vertex rainbow path between every pair of its vertices. Similarly, the graph $G$ is \\emph{strongly rainbow vertex connected} if there is a shortest path which is vertex rainbow between every pair of its vertices. We consider the complexity of deciding if a given vertex-colored graph is rainbow or strongly rainbow vertex connected. We call these problems \\probRvc and \\probSrvc, respectively. We prove both p","authors_text":"Juho Lauri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T19:52:12Z","title":"Complexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07768","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:6308662bd8d2ddeb6f6fbe9547d2843e31b6b58da3232e245bad74f416554b9d","target":"record","created_at":"2026-05-18T00:54:09Z","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":"128bcb1c229cccd7aab7b7f3794e21cff9b1f714d13d98e5fe5a7a7c68a559cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-12-22T19:52:12Z","title_canon_sha256":"1f8e6703cd8410d3cfd86318bfbe3ea35ea62856096c67010f510e16a99565d0"},"schema_version":"1.0","source":{"id":"1612.07768","kind":"arxiv","version":1}},"canonical_sha256":"d1c55d37fec89babe493fca7dd86aedfe449e66941b44c56e58de862d815387c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1c55d37fec89babe493fca7dd86aedfe449e66941b44c56e58de862d815387c","first_computed_at":"2026-05-18T00:54:09.407273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:09.407273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nyjNOGPY2lfaNib2UGCRsjwXtP9MPcnoR5VUwC1hrynb9YsOaVIskhL92i2IUOSW4KV66f2PZzEeHvP8UZolAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:09.407726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6308662bd8d2ddeb6f6fbe9547d2843e31b6b58da3232e245bad74f416554b9d","sha256:f9f15bb89b14808f110fc6e966f81d9e3568adc8c27f20520e0507253fd2d93f"],"state_sha256":"f411949885f246b1c987d672bd71d1b612ffa45ecd0c48dec4f862d18d9b3aba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sxg/1xq6ibthTYcvYFnbGI085GISBmudFUpMoc72zQfoK3ZNmzKytpu3TyWiAeI2z2bdnJPa8CWXUytucvWMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:37:33.903774Z","bundle_sha256":"04086a367d5bdbf291553a0ed067df26423a8108be6cc19cc82950fd6bf86e7d"}}