{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HINDQNFQJTSUOEI7EOSOPDCORA","short_pith_number":"pith:HINDQNFQ","schema_version":"1.0","canonical_sha256":"3a1a3834b04ce547111f23a4e78c4e880de340cbaaa6636730166ca9ec5d4ce0","source":{"kind":"arxiv","id":"1602.00922","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.00922","created_at":"2026-05-18T01:21:24.287038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.00922v1","created_at":"2026-05-18T01:21:24.287038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.00922","created_at":"2026-05-18T01:21:24.287038+00:00"},{"alias_kind":"pith_short_12","alias_value":"HINDQNFQJTSU","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HINDQNFQJTSUOEI7","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HINDQNFQ","created_at":"2026-05-18T12:30:19.053100+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/HINDQNFQJTSUOEI7EOSOPDCORA","json":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA.json","graph_json":"https://pith.science/api/pith-number/HINDQNFQJTSUOEI7EOSOPDCORA/graph.json","events_json":"https://pith.science/api/pith-number/HINDQNFQJTSUOEI7EOSOPDCORA/events.json","paper":"https://pith.science/paper/HINDQNFQ"},"agent_actions":{"view_html":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA","download_json":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA.json","view_paper":"https://pith.science/paper/HINDQNFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.00922&json=true","fetch_graph":"https://pith.science/api/pith-number/HINDQNFQJTSUOEI7EOSOPDCORA/graph.json","fetch_events":"https://pith.science/api/pith-number/HINDQNFQJTSUOEI7EOSOPDCORA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/action/storage_attestation","attest_author":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/action/author_attestation","sign_citation":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/action/citation_signature","submit_replication":"https://pith.science/pith/HINDQNFQJTSUOEI7EOSOPDCORA/action/replication_record"}},"created_at":"2026-05-18T01:21:24.287038+00:00","updated_at":"2026-05-18T01:21:24.287038+00:00"}