{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PMIGAPOUPZO3K7JM4BZVZOATAW","short_pith_number":"pith:PMIGAPOU","schema_version":"1.0","canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","source":{"kind":"arxiv","id":"1012.3504","version":1},"attestation_state":"computed","paper":{"title":"On the rainbow vertex-connection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yongtang Shi","submitted_at":"2010-12-16T03:03:59Z","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. Krivelevich and Yuster proved that if $G$ is a graph of order $n$ with minimum degree $\\delta$, then $rvc(G)<11n/\\delta$. In this paper, we show that $rvc(G)\\leq 3n/(\\delta+1)+5$ for $\\delta\\geq \\sqrt{n-1}-1$ and $n\\geq 290$, "},"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":"1012.3504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-16T03:03:59Z","cross_cats_sorted":[],"title_canon_sha256":"b07ff3793d874aa3da9275c8a1144b0a80a86bbe5b68c2298fa0376cd3ed834b","abstract_canon_sha256":"3f99d6d0fe85012080a96c39f39491a7199ca79beb0bd975cea1515d6e1047c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:06.551210Z","signature_b64":"CSUIWAMfuq1+r1aupCYLy/HLfWMf44gPTZRVCJ9m/KnCPTMABa838zKj3CBFr+E9IQOMSoIka7PeFGuEhQqNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","last_reissued_at":"2026-05-18T04:33:06.549825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:06.549825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the rainbow vertex-connection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yongtang Shi","submitted_at":"2010-12-16T03:03:59Z","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. Krivelevich and Yuster proved that if $G$ is a graph of order $n$ with minimum degree $\\delta$, then $rvc(G)<11n/\\delta$. In this paper, we show that $rvc(G)\\leq 3n/(\\delta+1)+5$ for $\\delta\\geq \\sqrt{n-1}-1$ and $n\\geq 290$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3504","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":"1012.3504","created_at":"2026-05-18T04:33:06.550107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.3504v1","created_at":"2026-05-18T04:33:06.550107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3504","created_at":"2026-05-18T04:33:06.550107+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMIGAPOUPZO3","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMIGAPOUPZO3K7JM","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMIGAPOU","created_at":"2026-05-18T12:26:12.377268+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/PMIGAPOUPZO3K7JM4BZVZOATAW","json":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW.json","graph_json":"https://pith.science/api/pith-number/PMIGAPOUPZO3K7JM4BZVZOATAW/graph.json","events_json":"https://pith.science/api/pith-number/PMIGAPOUPZO3K7JM4BZVZOATAW/events.json","paper":"https://pith.science/paper/PMIGAPOU"},"agent_actions":{"view_html":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW","download_json":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW.json","view_paper":"https://pith.science/paper/PMIGAPOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.3504&json=true","fetch_graph":"https://pith.science/api/pith-number/PMIGAPOUPZO3K7JM4BZVZOATAW/graph.json","fetch_events":"https://pith.science/api/pith-number/PMIGAPOUPZO3K7JM4BZVZOATAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/action/storage_attestation","attest_author":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/action/author_attestation","sign_citation":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/action/citation_signature","submit_replication":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/action/replication_record"}},"created_at":"2026-05-18T04:33:06.550107+00:00","updated_at":"2026-05-18T04:33:06.550107+00:00"}