{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:PMIGAPOUPZO3K7JM4BZVZOATAW","short_pith_number":"pith:PMIGAPOU","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"},"canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","source":{"kind":"arxiv","id":"1012.3504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3504","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3504v1","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3504","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"PMIGAPOUPZO3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PMIGAPOUPZO3K7JM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PMIGAPOU","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:PMIGAPOUPZO3K7JM4BZVZOATAW","target":"record","payload":{"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"},"canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","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"},"source_kind":"arxiv","source_id":"1012.3504","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:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCKPXJC9Od8uLn6o4CRjBvGgBVfjVVnYNHyx0B5tKPQZmiyAvQNuL36fKwk9ymujsiI52+O23anikB/aSv09Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:13.768274Z"},"content_sha256":"779a0d75b11334516e5ce09f687fa17b0ba99f0d7f41863361d9f4822c6e5b96","schema_version":"1.0","event_id":"sha256:779a0d75b11334516e5ce09f687fa17b0ba99f0d7f41863361d9f4822c6e5b96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:PMIGAPOUPZO3K7JM4BZVZOATAW","target":"graph","payload":{"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"},"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:33:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Jn1/vDSnP0PJz7u2tCAzZ4NDF/9KHIOhCmqs6LIBQuWJA0ARAUVi7ku8cst6hIE6YNJpkIF5QC+D1H+iiiMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:22:13.769012Z"},"content_sha256":"cd175538e878e3d25a0c0674edcf347e76020741b46aac27e7c1a27d9f3caa58","schema_version":"1.0","event_id":"sha256:cd175538e878e3d25a0c0674edcf347e76020741b46aac27e7c1a27d9f3caa58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/bundle.json","state_url":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/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-25T10:22:13Z","links":{"resolver":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW","bundle":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/bundle.json","state":"https://pith.science/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMIGAPOUPZO3K7JM4BZVZOATAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:PMIGAPOUPZO3K7JM4BZVZOATAW","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":"3f99d6d0fe85012080a96c39f39491a7199ca79beb0bd975cea1515d6e1047c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-16T03:03:59Z","title_canon_sha256":"b07ff3793d874aa3da9275c8a1144b0a80a86bbe5b68c2298fa0376cd3ed834b"},"schema_version":"1.0","source":{"id":"1012.3504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3504","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3504v1","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3504","created_at":"2026-05-18T04:33:06Z"},{"alias_kind":"pith_short_12","alias_value":"PMIGAPOUPZO3","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"PMIGAPOUPZO3K7JM","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"PMIGAPOU","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:cd175538e878e3d25a0c0674edcf347e76020741b46aac27e7c1a27d9f3caa58","target":"graph","created_at":"2026-05-18T04:33:06Z","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. 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$, ","authors_text":"Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-16T03:03:59Z","title":"On the rainbow vertex-connection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3504","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:779a0d75b11334516e5ce09f687fa17b0ba99f0d7f41863361d9f4822c6e5b96","target":"record","created_at":"2026-05-18T04:33:06Z","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":"3f99d6d0fe85012080a96c39f39491a7199ca79beb0bd975cea1515d6e1047c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-12-16T03:03:59Z","title_canon_sha256":"b07ff3793d874aa3da9275c8a1144b0a80a86bbe5b68c2298fa0376cd3ed834b"},"schema_version":"1.0","source":{"id":"1012.3504","kind":"arxiv","version":1}},"canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b10603dd47e5db57d2ce0735cb81305880b2bd3983096ee6f6d1dc257195373","first_computed_at":"2026-05-18T04:33:06.549825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:06.549825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CSUIWAMfuq1+r1aupCYLy/HLfWMf44gPTZRVCJ9m/KnCPTMABa838zKj3CBFr+E9IQOMSoIka7PeFGuEhQqNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:06.551210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:779a0d75b11334516e5ce09f687fa17b0ba99f0d7f41863361d9f4822c6e5b96","sha256:cd175538e878e3d25a0c0674edcf347e76020741b46aac27e7c1a27d9f3caa58"],"state_sha256":"06a2aed4438a3c605cd6cd2298fee82e313c717ca241b46d49020534f4a9db0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBj7hA2F8z2QfUw/Q+MLzkw6Y3ifIT3WVDhjmD4+k9DVrC6V9Mw22+rtzB/CqvYXaXFrtRzB9OzOTeYbfmhPAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:22:13.772254Z","bundle_sha256":"ff8d9464ec170ec35844419490b40551ca55a31aeaa9661b191fce7b0ad45079"}}