{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F7R3KRDEDNU3XIECH3WOJBIAN3","short_pith_number":"pith:F7R3KRDE","canonical_record":{"source":{"id":"1201.1541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-07T10:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"a61161887b639dc7281998ad403be925030c8cb96ab073325411155ff2715c01","abstract_canon_sha256":"12da355df74ded4385a8545c4a3923bd73ca5771565d8597a2ce452726e04de7"},"schema_version":"1.0"},"canonical_sha256":"2fe3b544641b69bba0823eece485006ef865b35697f35a71fcea6384036c3514","source":{"kind":"arxiv","id":"1201.1541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1541","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1541v1","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1541","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"F7R3KRDEDNU3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F7R3KRDEDNU3XIEC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F7R3KRDE","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F7R3KRDEDNU3XIECH3WOJBIAN3","target":"record","payload":{"canonical_record":{"source":{"id":"1201.1541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-07T10:01:37Z","cross_cats_sorted":[],"title_canon_sha256":"a61161887b639dc7281998ad403be925030c8cb96ab073325411155ff2715c01","abstract_canon_sha256":"12da355df74ded4385a8545c4a3923bd73ca5771565d8597a2ce452726e04de7"},"schema_version":"1.0"},"canonical_sha256":"2fe3b544641b69bba0823eece485006ef865b35697f35a71fcea6384036c3514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:03.136571Z","signature_b64":"IO7qIJWbQrRCmDuRCjxogS+bfL3M8zq3a5CiZJ76ROJPiLa3Da9jiX1mzo6fwqkgT2P55x+QR0UIUupxi3P1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe3b544641b69bba0823eece485006ef865b35697f35a71fcea6384036c3514","last_reissued_at":"2026-05-18T04:05:03.135877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:03.135877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.1541","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:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eSZzj83E1lLjznaK1RBjDxutOmKASLaWu8+zIwmANM+4hrTTSGa6pOMpO9TM5sGtPedJiZI4Kg3NagKvESEDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:04:21.645591Z"},"content_sha256":"05938fec9a83de286e6b87f7bc44e5cde8fa85d4b3c3c1a23cc37ff814df85bf","schema_version":"1.0","event_id":"sha256:05938fec9a83de286e6b87f7bc44e5cde8fa85d4b3c3c1a23cc37ff814df85bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F7R3KRDEDNU3XIECH3WOJBIAN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The strong rainbow vertex-connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yaping Mao, Yongtang Shi","submitted_at":"2012-01-07T10:01:37Z","abstract_excerpt":"A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number 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. If for every pair $u, v$ of distinct vertices, $G$ contains a rainbow $u-v$ geodesic, then $G$ is strong rainbow vertex-connected. The minimum number $k$ for which there exists a $k$-vertex-coloring of $G$ that result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1541","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:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5vYVNlTfUhTirpFDzIZslAP/GAegBbcTimoHs9mGAgwpeOUblxAynd0DC8AdmtaozHhAuPwGDu+ARVFeTDEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:04:21.645937Z"},"content_sha256":"a7e428ec7e39ad13f279306165e431ca466de202a0df887c7d732ede4aea777b","schema_version":"1.0","event_id":"sha256:a7e428ec7e39ad13f279306165e431ca466de202a0df887c7d732ede4aea777b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/bundle.json","state_url":"https://pith.science/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/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:04:21Z","links":{"resolver":"https://pith.science/pith/F7R3KRDEDNU3XIECH3WOJBIAN3","bundle":"https://pith.science/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/bundle.json","state":"https://pith.science/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7R3KRDEDNU3XIECH3WOJBIAN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F7R3KRDEDNU3XIECH3WOJBIAN3","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":"12da355df74ded4385a8545c4a3923bd73ca5771565d8597a2ce452726e04de7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-07T10:01:37Z","title_canon_sha256":"a61161887b639dc7281998ad403be925030c8cb96ab073325411155ff2715c01"},"schema_version":"1.0","source":{"id":"1201.1541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.1541","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"1201.1541v1","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1541","created_at":"2026-05-18T04:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"F7R3KRDEDNU3","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F7R3KRDEDNU3XIEC","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F7R3KRDE","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:a7e428ec7e39ad13f279306165e431ca466de202a0df887c7d732ede4aea777b","target":"graph","created_at":"2026-05-18T04:05:03Z","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 $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number 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. If for every pair $u, v$ of distinct vertices, $G$ contains a rainbow $u-v$ geodesic, then $G$ is strong rainbow vertex-connected. The minimum number $k$ for which there exists a $k$-vertex-coloring of $G$ that result","authors_text":"Xueliang Li, Yaping Mao, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-07T10:01:37Z","title":"The strong rainbow vertex-connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1541","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:05938fec9a83de286e6b87f7bc44e5cde8fa85d4b3c3c1a23cc37ff814df85bf","target":"record","created_at":"2026-05-18T04:05:03Z","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":"12da355df74ded4385a8545c4a3923bd73ca5771565d8597a2ce452726e04de7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-01-07T10:01:37Z","title_canon_sha256":"a61161887b639dc7281998ad403be925030c8cb96ab073325411155ff2715c01"},"schema_version":"1.0","source":{"id":"1201.1541","kind":"arxiv","version":1}},"canonical_sha256":"2fe3b544641b69bba0823eece485006ef865b35697f35a71fcea6384036c3514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fe3b544641b69bba0823eece485006ef865b35697f35a71fcea6384036c3514","first_computed_at":"2026-05-18T04:05:03.135877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:03.135877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IO7qIJWbQrRCmDuRCjxogS+bfL3M8zq3a5CiZJ76ROJPiLa3Da9jiX1mzo6fwqkgT2P55x+QR0UIUupxi3P1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:03.136571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.1541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05938fec9a83de286e6b87f7bc44e5cde8fa85d4b3c3c1a23cc37ff814df85bf","sha256:a7e428ec7e39ad13f279306165e431ca466de202a0df887c7d732ede4aea777b"],"state_sha256":"34696e62e5cc0b80f1a780a7a56023d88b6026dadf82f418d4706fdb4ae3b9dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"57Sit70SDsvZT9XVvPdkNcdBQZEAifxB6K08KJrPabf9fwLpTarfpNa3du+DK8QXcflEgENlMBshFHZYHRZUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:04:21.647854Z","bundle_sha256":"a51033d3fadb941778c4272b0ac192339120f49974ea5e94d482bd98b41aedac"}}