{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7JRQ7KAE46YDMX6MSJSGM3TRTU","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":"6ab47f43025af92d87d3c9085f7e0009bee621ce0d55721adf4f182dd41e4c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T13:16:37Z","title_canon_sha256":"8342fd12c456f98841dcf8e10b0d861411e4c6f00f418ce1accaf15dad8bbe9b"},"schema_version":"1.0","source":{"id":"1505.04986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04986","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04986v1","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04986","created_at":"2026-05-18T02:05:22Z"},{"alias_kind":"pith_short_12","alias_value":"7JRQ7KAE46YD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7JRQ7KAE46YDMX6M","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7JRQ7KAE","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:29634c4800f00797cfb0cf3dae86453a63d29545b97c2270bb8241840fedf47b","target":"graph","created_at":"2026-05-18T02:05:22Z","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 path in a vertex-colored graph is a {\\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\\it proper vertex $k$-connected} if any two vertices of the graph are connected by $k$ disjoint vertex-proper paths of the graph. For a $k$-connected graph $G$, the {\\it proper vertex $k$-connection number} of $G$, denoted by $pvc_{k}(G)$, is defined as the smallest number of colors required to make $G$ proper vertex $k$-connected. A vertex-colored graph is {\\it strong proper vertex-connected}, if for any two vertices $u,v$ of the graph, there exists ","authors_text":"Hui Jiang, Xueliang Li, Yan Zhao, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T13:16:37Z","title":"On (strong) proper vertex-connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04986","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:11c25f6b51db067a1d3af6df81c5f818b0c93c638fcda27c1d1c43341da0e691","target":"record","created_at":"2026-05-18T02:05:22Z","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":"6ab47f43025af92d87d3c9085f7e0009bee621ce0d55721adf4f182dd41e4c1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T13:16:37Z","title_canon_sha256":"8342fd12c456f98841dcf8e10b0d861411e4c6f00f418ce1accaf15dad8bbe9b"},"schema_version":"1.0","source":{"id":"1505.04986","kind":"arxiv","version":1}},"canonical_sha256":"fa630fa804e7b0365fcc9264666e719d189f67136160a46b73f37bf99f02654c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa630fa804e7b0365fcc9264666e719d189f67136160a46b73f37bf99f02654c","first_computed_at":"2026-05-18T02:05:22.562057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:22.562057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lNtmcukWzkDpVvbfK22oPnNGqu3OLxjmNKZc8Y68O0dpxX6Tja11xIwDvlB4YlXJYCS2WzdibRfa82uq3ewXAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:22.562815Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11c25f6b51db067a1d3af6df81c5f818b0c93c638fcda27c1d1c43341da0e691","sha256:29634c4800f00797cfb0cf3dae86453a63d29545b97c2270bb8241840fedf47b"],"state_sha256":"ed84d47ba365d60e99178a9e4c86031ef4838948180b34955f03f484ffbea25f"}