{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4K4B7MGCK5EI5DXAOEU7LCW2M5","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":"65781c090f87643d84cb8d2392260b56866c3f46f4f28028bba9f51a9daa0b37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:53:24Z","title_canon_sha256":"37c4955144b4afd64bb740ccf9f9d2a14bb262beb4ccd051113d9700bc8668a6"},"schema_version":"1.0","source":{"id":"1110.5770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5770","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5770v1","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5770","created_at":"2026-05-18T04:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"4K4B7MGCK5EI","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4K4B7MGCK5EI5DXA","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4K4B7MGC","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:2e9fdc820ae1918b9013b1ebc0b57a1e11b2e44d6cfcac15d3a75563b0e5fa5b","target":"graph","created_at":"2026-05-18T04:10:11Z","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":"The {\\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors. In this paper we first determine the rainbow vertex-connection number of cycle $C_n$ of order $n\\geq 3$, and then, based on it, prove that for any 2-connected graph $G$, $rvc(G)\\leq rvc(C_n)$, giving a tight upper bound for the rainbow vertex-connection. As a consequence, we show that for a connected graph $G$ with a block decomposition $B_1, B_","authors_text":"Sujuan Liu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:53:24Z","title":"Rainbow vertex-connection number of 2-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5770","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:8f9289bbc5c956470871940e9640785d14f5522752814497295223ffde30d31f","target":"record","created_at":"2026-05-18T04:10:11Z","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":"65781c090f87643d84cb8d2392260b56866c3f46f4f28028bba9f51a9daa0b37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T11:53:24Z","title_canon_sha256":"37c4955144b4afd64bb740ccf9f9d2a14bb262beb4ccd051113d9700bc8668a6"},"schema_version":"1.0","source":{"id":"1110.5770","kind":"arxiv","version":1}},"canonical_sha256":"e2b81fb0c257488e8ee07129f58ada67635d99713e290dba8998814f47014f58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2b81fb0c257488e8ee07129f58ada67635d99713e290dba8998814f47014f58","first_computed_at":"2026-05-18T04:10:11.332206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:11.332206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5PHfCJRiWgq/mORD4LJwwtssyj8lhIjzATR8yijQgBh1S4VVJ3VaZK1DmV3ejzdgcA2uGC0KF2cGYeEiQXLNAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:11.333048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f9289bbc5c956470871940e9640785d14f5522752814497295223ffde30d31f","sha256:2e9fdc820ae1918b9013b1ebc0b57a1e11b2e44d6cfcac15d3a75563b0e5fa5b"],"state_sha256":"89abbd176cc6f0f9d7908dbdf65cb11a7f58619bb56b9358503e15cafac8eb75"}