{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ONSTD53PF6FMPQTNS2S3LEWZZE","short_pith_number":"pith:ONSTD53P","canonical_record":{"source":{"id":"1705.02486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"fc54fbd6ca3a5f4f8a9a83dad99e5e8de02a9330db46acc6faa2b34ac75a8115","abstract_canon_sha256":"8d2140aa3420e53d5739cae03e558c052b4ad1da3a79d60aadd50f169b415527"},"schema_version":"1.0"},"canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","source":{"kind":"arxiv","id":"1705.02486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02486","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02486v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02486","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"ONSTD53PF6FM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONSTD53PF6FMPQTN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONSTD53P","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ONSTD53PF6FMPQTNS2S3LEWZZE","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"fc54fbd6ca3a5f4f8a9a83dad99e5e8de02a9330db46acc6faa2b34ac75a8115","abstract_canon_sha256":"8d2140aa3420e53d5739cae03e558c052b4ad1da3a79d60aadd50f169b415527"},"schema_version":"1.0"},"canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:56.407955Z","signature_b64":"YB/MHzBsSJBS04/0HY58rNjwu6sEIinAlIbbnFOmN1O7Pxi8ns0tTRIHGDh8FUmTRyi7IPuyRGj+9YHmfcZnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","last_reissued_at":"2026-05-18T00:44:56.407365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:56.407365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02486","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-18T00:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/dUYCQwBodT3edutZ7BZb/7YqrBL6rAOlC433O4vcgmMaBhYW9cuzZJHpNvVCjrs5+t8RBWEbNdivkyJ782CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:34.173228Z"},"content_sha256":"f0af1abc7df2ee6d4c02f244194c182dd72e742c51e3b13c6eb41ace85cd0e2b","schema_version":"1.0","event_id":"sha256:f0af1abc7df2ee6d4c02f244194c182dd72e742c51e3b13c6eb41ace85cd0e2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ONSTD53PF6FMPQTNS2S3LEWZZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proper vertex connection and graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Yingying Zhang","submitted_at":"2017-05-06T14:12:11Z","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":"1705.02486","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-18T00:44:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ldrrHI9M4c6Up3sy6XNZSymVCzJcDDkb6o1ZDJwarM0Hrkjp5jp9moXfDn9pYSNBtONRslMuzshwBgmeagPMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:34.173876Z"},"content_sha256":"ba9f9b9da6581ebe86818da4199abe1cd66f6e5e09c9440b5f31458ae0ed5fc9","schema_version":"1.0","event_id":"sha256:ba9f9b9da6581ebe86818da4199abe1cd66f6e5e09c9440b5f31458ae0ed5fc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/bundle.json","state_url":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/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-30T23:51:34Z","links":{"resolver":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE","bundle":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/bundle.json","state":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ONSTD53PF6FMPQTNS2S3LEWZZE","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":"8d2140aa3420e53d5739cae03e558c052b4ad1da3a79d60aadd50f169b415527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:12:11Z","title_canon_sha256":"fc54fbd6ca3a5f4f8a9a83dad99e5e8de02a9330db46acc6faa2b34ac75a8115"},"schema_version":"1.0","source":{"id":"1705.02486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02486","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02486v1","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02486","created_at":"2026-05-18T00:44:56Z"},{"alias_kind":"pith_short_12","alias_value":"ONSTD53PF6FM","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ONSTD53PF6FMPQTN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ONSTD53P","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:ba9f9b9da6581ebe86818da4199abe1cd66f6e5e09c9440b5f31458ae0ed5fc9","target":"graph","created_at":"2026-05-18T00:44:56Z","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":"Xiaoyu Zhu, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:12:11Z","title":"Proper vertex connection and graph operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02486","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:f0af1abc7df2ee6d4c02f244194c182dd72e742c51e3b13c6eb41ace85cd0e2b","target":"record","created_at":"2026-05-18T00:44:56Z","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":"8d2140aa3420e53d5739cae03e558c052b4ad1da3a79d60aadd50f169b415527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-06T14:12:11Z","title_canon_sha256":"fc54fbd6ca3a5f4f8a9a83dad99e5e8de02a9330db46acc6faa2b34ac75a8115"},"schema_version":"1.0","source":{"id":"1705.02486","kind":"arxiv","version":1}},"canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","first_computed_at":"2026-05-18T00:44:56.407365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:56.407365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YB/MHzBsSJBS04/0HY58rNjwu6sEIinAlIbbnFOmN1O7Pxi8ns0tTRIHGDh8FUmTRyi7IPuyRGj+9YHmfcZnBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:56.407955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0af1abc7df2ee6d4c02f244194c182dd72e742c51e3b13c6eb41ace85cd0e2b","sha256:ba9f9b9da6581ebe86818da4199abe1cd66f6e5e09c9440b5f31458ae0ed5fc9"],"state_sha256":"171666743df253c589b74e033c5a64273e321cf96da4c2e05373f1b433e342a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgUwbM9IozPSLaUYC6lPyNWJU1TW4BVLX4WTurthtSiuMQErgChuBPbJYO8BZR5bx9SV/yxDNcuPqrtcMfYQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:34.177929Z","bundle_sha256":"0732e1fe015fc1f79c4a4367961f5cef5a3ab1e4b8960efecda8eeef118345b0"}}