{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7JRQ7KAE46YDMX6MSJSGM3TRTU","short_pith_number":"pith:7JRQ7KAE","canonical_record":{"source":{"id":"1505.04986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T13:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"8342fd12c456f98841dcf8e10b0d861411e4c6f00f418ce1accaf15dad8bbe9b","abstract_canon_sha256":"6ab47f43025af92d87d3c9085f7e0009bee621ce0d55721adf4f182dd41e4c1e"},"schema_version":"1.0"},"canonical_sha256":"fa630fa804e7b0365fcc9264666e719d189f67136160a46b73f37bf99f02654c","source":{"kind":"arxiv","id":"1505.04986","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7JRQ7KAE46YDMX6MSJSGM3TRTU","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-19T13:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"8342fd12c456f98841dcf8e10b0d861411e4c6f00f418ce1accaf15dad8bbe9b","abstract_canon_sha256":"6ab47f43025af92d87d3c9085f7e0009bee621ce0d55721adf4f182dd41e4c1e"},"schema_version":"1.0"},"canonical_sha256":"fa630fa804e7b0365fcc9264666e719d189f67136160a46b73f37bf99f02654c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:22.562815Z","signature_b64":"lNtmcukWzkDpVvbfK22oPnNGqu3OLxjmNKZc8Y68O0dpxX6Tja11xIwDvlB4YlXJYCS2WzdibRfa82uq3ewXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa630fa804e7b0365fcc9264666e719d189f67136160a46b73f37bf99f02654c","last_reissued_at":"2026-05-18T02:05:22.562057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:22.562057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04986","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-18T02:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxjjL7SA7bYK2SMGBvSQYlyCsHTrhUIXU8GRyQOrVHCx86qyZ17/U7X27swHupO37TqN71xC0ZSLvOL+LFbiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:03:30.733100Z"},"content_sha256":"11c25f6b51db067a1d3af6df81c5f818b0c93c638fcda27c1d1c43341da0e691","schema_version":"1.0","event_id":"sha256:11c25f6b51db067a1d3af6df81c5f818b0c93c638fcda27c1d1c43341da0e691"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7JRQ7KAE46YDMX6MSJSGM3TRTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On (strong) proper vertex-connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Jiang, Xueliang Li, Yan Zhao, Yingying Zhang","submitted_at":"2015-05-19T13:16:37Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04986","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-18T02:05:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEvigic1nJI8UcYxquqMMw/MJHt5UQWaLvuQkIcsOTve3WKi+rBlcU9M9OGUGqezqqH3WO1KurA53bOYS0kYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:03:30.733451Z"},"content_sha256":"29634c4800f00797cfb0cf3dae86453a63d29545b97c2270bb8241840fedf47b","schema_version":"1.0","event_id":"sha256:29634c4800f00797cfb0cf3dae86453a63d29545b97c2270bb8241840fedf47b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/bundle.json","state_url":"https://pith.science/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/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-03T22:03:30Z","links":{"resolver":"https://pith.science/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU","bundle":"https://pith.science/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/bundle.json","state":"https://pith.science/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JRQ7KAE46YDMX6MSJSGM3TRTU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34fR9yWWj+G/J9qva4vcrUxpzEOOlRC0oXU8OyFozcMQh33ckcHV0WpX00GtjYOSv0yKdo4Jzr93YgNtimrTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:03:30.735739Z","bundle_sha256":"d510f41d25939dffd1650ea743e10c1deac987fc08cb55d81562eb253a3048c5"}}