{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HINDQNFQJTSUOEI7EOSOPDCORA","short_pith_number":"pith:HINDQNFQ","canonical_record":{"source":{"id":"1602.00922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T13:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"dc22e9df0bae00b5f18022d317f5fd44b840458f01c0c1a58726df7316479339","abstract_canon_sha256":"7ad19721763c74d1d9ffba7da7c3c25d827ea85a487288361fbc667f0adc7f83"},"schema_version":"1.0"},"canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","source":{"kind":"arxiv","id":"1602.00922","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00922","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00922v1","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00922","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"HINDQNFQJTSU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HINDQNFQJTSUOEI7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HINDQNFQ","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HINDQNFQJTSUOEI7EOSOPDCORA","target":"record","payload":{"canonical_record":{"source":{"id":"1602.00922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T13:52:00Z","cross_cats_sorted":[],"title_canon_sha256":"dc22e9df0bae00b5f18022d317f5fd44b840458f01c0c1a58726df7316479339","abstract_canon_sha256":"7ad19721763c74d1d9ffba7da7c3c25d827ea85a487288361fbc667f0adc7f83"},"schema_version":"1.0"},"canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:24.287641Z","signature_b64":"WT8WnGcmjbmFgHQHcPcihQQA2XKBGHyE89u6N1Jj7dQtCmgwEQhroUHEHhJ0a5/NB2aXhCAmpSLC0kkyc6wbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","last_reissued_at":"2026-05-18T01:21:24.286931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:24.286931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.00922","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-18T01:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suhoYn6hFYAQ/3HhAgLvXjiAyrfZ0UmnXB5mmOmoVcprUjqSW5UPE4qEuahZsB5NXJVAH5miHabUEH66SwvZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:07.885022Z"},"content_sha256":"888a9bf3b560a8fc4d4824e68623b675ebc97c9bbad91197fa7d88a7e68be5ff","schema_version":"1.0","event_id":"sha256:888a9bf3b560a8fc4d4824e68623b675ebc97c9bbad91197fa7d88a7e68be5ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HINDQNFQJTSUOEI7EOSOPDCORA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow vertex-connection and forbidden subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","submitted_at":"2016-02-02T13:52:00Z","abstract_excerpt":"A path in a vertex-colored graph is called \\emph{vertex-rainbow} if its internal vertices have pairwise distinct colors. A graph $G$ is \\emph{rainbow vertex-connected} if for any two distinct vertices of $G$, there is a vertex-rainbow path connecting them. For a connected graph $G$, the \\emph{rainbow vertex-connection number} of $G$, denoted by $rvc(G)$, is defined as the minimum number of colors that are required to make $G$ rainbow vertex-connected. In this paper, we find all the families $\\mathcal{F}$ of connected graphs with $|\\mathcal{F}|\\in\\{1,2\\}$, for which there is a constant $k_\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00922","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-18T01:21:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sojxr+uu+g9TKa4INJQLxzjuAoZ362NlfT+MCHcU5kgz4rkGZyjaPzo86MtQFIyrB2O3qyOWIiwgg0nBV8BxBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:46:07.885499Z"},"content_sha256":"b79982f4eba37273050a5974cc627d8e381d04893106a6b639e283286e87ccc4","schema_version":"1.0","event_id":"sha256:b79982f4eba37273050a5974cc627d8e381d04893106a6b639e283286e87ccc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/bundle.json","state_url":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HINDQNFQJTSUOEI7EOSOPDCORA/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-06-01T16:46:07Z","links":{"resolver":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA","bundle":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/bundle.json","state":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HINDQNFQJTSUOEI7EOSOPDCORA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HINDQNFQJTSUOEI7EOSOPDCORA","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":"7ad19721763c74d1d9ffba7da7c3c25d827ea85a487288361fbc667f0adc7f83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T13:52:00Z","title_canon_sha256":"dc22e9df0bae00b5f18022d317f5fd44b840458f01c0c1a58726df7316479339"},"schema_version":"1.0","source":{"id":"1602.00922","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.00922","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"arxiv_version","alias_value":"1602.00922v1","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00922","created_at":"2026-05-18T01:21:24Z"},{"alias_kind":"pith_short_12","alias_value":"HINDQNFQJTSU","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HINDQNFQJTSUOEI7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HINDQNFQ","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:b79982f4eba37273050a5974cc627d8e381d04893106a6b639e283286e87ccc4","target":"graph","created_at":"2026-05-18T01:21:24Z","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 is called \\emph{vertex-rainbow} if its internal vertices have pairwise distinct colors. A graph $G$ is \\emph{rainbow vertex-connected} if for any two distinct vertices of $G$, there is a vertex-rainbow path connecting them. For a connected graph $G$, the \\emph{rainbow vertex-connection number} of $G$, denoted by $rvc(G)$, is defined as the minimum number of colors that are required to make $G$ rainbow vertex-connected. In this paper, we find all the families $\\mathcal{F}$ of connected graphs with $|\\mathcal{F}|\\in\\{1,2\\}$, for which there is a constant $k_\\math","authors_text":"Jingshu Zhang, Wenjing Li, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T13:52:00Z","title":"Rainbow vertex-connection and forbidden subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.00922","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:888a9bf3b560a8fc4d4824e68623b675ebc97c9bbad91197fa7d88a7e68be5ff","target":"record","created_at":"2026-05-18T01:21:24Z","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":"7ad19721763c74d1d9ffba7da7c3c25d827ea85a487288361fbc667f0adc7f83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-02T13:52:00Z","title_canon_sha256":"dc22e9df0bae00b5f18022d317f5fd44b840458f01c0c1a58726df7316479339"},"schema_version":"1.0","source":{"id":"1602.00922","kind":"arxiv","version":1}},"canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","first_computed_at":"2026-05-18T01:21:24.286931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:24.286931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WT8WnGcmjbmFgHQHcPcihQQA2XKBGHyE89u6N1Jj7dQtCmgwEQhroUHEHhJ0a5/NB2aXhCAmpSLC0kkyc6wbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:24.287641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.00922","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:888a9bf3b560a8fc4d4824e68623b675ebc97c9bbad91197fa7d88a7e68be5ff","sha256:b79982f4eba37273050a5974cc627d8e381d04893106a6b639e283286e87ccc4"],"state_sha256":"f73d2a7da76e7923a4060427dd69513418e3798bc7a7cbce08bdf2e4a50966c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yy/tumsBg5QcFZXvO2Ox9aXatvhts3r7MtQPWUm9otX42ZJpnZ+6WGQYuZ4mRgPYjT8fFNwGeUNJJ31AanWrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:46:07.887584Z","bundle_sha256":"633e10995fe814bb21ea8825c98f709cedcacb84409c75595730fa354d4dd7b3"}}