{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ONSTD53PF6FMPQTNS2S3LEWZZE","short_pith_number":"pith:ONSTD53P","schema_version":"1.0","canonical_sha256":"736531f76f2f8ac7c26d96a5b592d9c919f6b61f2791b606f091506e9df409a2","source":{"kind":"arxiv","id":"1705.02486","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02486","created_at":"2026-05-18T00:44:56.407452+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02486v1","created_at":"2026-05-18T00:44:56.407452+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02486","created_at":"2026-05-18T00:44:56.407452+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONSTD53PF6FM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONSTD53PF6FMPQTN","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONSTD53P","created_at":"2026-05-18T12:31:34.259226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE","json":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE.json","graph_json":"https://pith.science/api/pith-number/ONSTD53PF6FMPQTNS2S3LEWZZE/graph.json","events_json":"https://pith.science/api/pith-number/ONSTD53PF6FMPQTNS2S3LEWZZE/events.json","paper":"https://pith.science/paper/ONSTD53P"},"agent_actions":{"view_html":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE","download_json":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE.json","view_paper":"https://pith.science/paper/ONSTD53P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02486&json=true","fetch_graph":"https://pith.science/api/pith-number/ONSTD53PF6FMPQTNS2S3LEWZZE/graph.json","fetch_events":"https://pith.science/api/pith-number/ONSTD53PF6FMPQTNS2S3LEWZZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/action/storage_attestation","attest_author":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/action/author_attestation","sign_citation":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/action/citation_signature","submit_replication":"https://pith.science/pith/ONSTD53PF6FMPQTNS2S3LEWZZE/action/replication_record"}},"created_at":"2026-05-18T00:44:56.407452+00:00","updated_at":"2026-05-18T00:44:56.407452+00:00"}