{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YZDNXQJLQBRVXFHTCRJLX3YVDG","short_pith_number":"pith:YZDNXQJL","canonical_record":{"source":{"id":"1507.01426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T12:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"88124cd85245bfb6a7fda4ce97f48a637eb8e835baa2e1344431a574396c8af8","abstract_canon_sha256":"ca72f8dde945065d9310c184a4a8f48f5ceeae266e0e5a25f1fc62ed34f8fe74"},"schema_version":"1.0"},"canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","source":{"kind":"arxiv","id":"1507.01426","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01426","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01426v2","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01426","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"YZDNXQJLQBRV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YZDNXQJLQBRVXFHT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YZDNXQJL","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YZDNXQJLQBRVXFHTCRJLX3YVDG","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01426","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T12:51:51Z","cross_cats_sorted":[],"title_canon_sha256":"88124cd85245bfb6a7fda4ce97f48a637eb8e835baa2e1344431a574396c8af8","abstract_canon_sha256":"ca72f8dde945065d9310c184a4a8f48f5ceeae266e0e5a25f1fc62ed34f8fe74"},"schema_version":"1.0"},"canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.466583Z","signature_b64":"ANz73mnJ/c2ztfpZHXhZS4cHx+AXsMaTiCkMAgK/793ru1K12uVZjsQykFcG8Jzr1OpXlBvGf/uQjLa7bU9BCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","last_reissued_at":"2026-05-18T01:37:03.466167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.466167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01426","source_version":2,"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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yVJyNowfTqq685mTRVhOUCmYglxZYFmS4zWOekGUMNFLc0p+Wk2C3TVDAvTjwLqRBnTPavlZuv0plAw/8wf+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:44:45.033266Z"},"content_sha256":"de50b930e42f00371710f0054ea8566b1d072b0a0dfe4c621267af243d70ba80","schema_version":"1.0","event_id":"sha256:de50b930e42f00371710f0054ea8566b1d072b0a0dfe4c621267af243d70ba80"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YZDNXQJLQBRVXFHTCRJLX3YVDG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proper connection number and 2-proper connection number of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","submitted_at":"2015-07-06T12:51:51Z","abstract_excerpt":"A path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored with one same color. An edge-colored graph is called $k$-proper connected if any two vertices of the graph are connected by $k$ internally pairwise vertex-disjoint proper paths in the graph. The $k$-proper connection number of a $k$-connected graph $G$, denoted by $pc_k(G)$, is defined as the smallest number of colors that are needed in order to make $G$ $k$-proper connected. For $k=1$, we write $pc(G)$ other than $pc_1(G)$, and call it the proper connection number of $G$. In this paper, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01426","kind":"arxiv","version":2},"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-18T01:37:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j09VbrKLGp462HPNz+aaWuLrkmXI5AMMBuNcxzopHwzhRIhA5Jbm+3gALqGYWmwFwTgkgRjOCIK4YdrmQpfeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:44:45.033932Z"},"content_sha256":"8d30532cad7e91ddc9ab691a37cfdc21b65c35acf70862d10ffcb312a00b682f","schema_version":"1.0","event_id":"sha256:8d30532cad7e91ddc9ab691a37cfdc21b65c35acf70862d10ffcb312a00b682f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/bundle.json","state_url":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/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-27T12:44:45Z","links":{"resolver":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG","bundle":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/bundle.json","state":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YZDNXQJLQBRVXFHTCRJLX3YVDG","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":"ca72f8dde945065d9310c184a4a8f48f5ceeae266e0e5a25f1fc62ed34f8fe74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T12:51:51Z","title_canon_sha256":"88124cd85245bfb6a7fda4ce97f48a637eb8e835baa2e1344431a574396c8af8"},"schema_version":"1.0","source":{"id":"1507.01426","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01426","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01426v2","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01426","created_at":"2026-05-18T01:37:03Z"},{"alias_kind":"pith_short_12","alias_value":"YZDNXQJLQBRV","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YZDNXQJLQBRVXFHT","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YZDNXQJL","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:8d30532cad7e91ddc9ab691a37cfdc21b65c35acf70862d10ffcb312a00b682f","target":"graph","created_at":"2026-05-18T01:37: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 path in an edge-colored graph is called a proper path if no two adjacent edges of the path are colored with one same color. An edge-colored graph is called $k$-proper connected if any two vertices of the graph are connected by $k$ internally pairwise vertex-disjoint proper paths in the graph. The $k$-proper connection number of a $k$-connected graph $G$, denoted by $pc_k(G)$, is defined as the smallest number of colors that are needed in order to make $G$ $k$-proper connected. For $k=1$, we write $pc(G)$ other than $pc_1(G)$, and call it the proper connection number of $G$. In this paper, we","authors_text":"Fei Huang, Shujing Wang, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T12:51:51Z","title":"Proper connection number and 2-proper connection number of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01426","kind":"arxiv","version":2},"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:de50b930e42f00371710f0054ea8566b1d072b0a0dfe4c621267af243d70ba80","target":"record","created_at":"2026-05-18T01:37: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":"ca72f8dde945065d9310c184a4a8f48f5ceeae266e0e5a25f1fc62ed34f8fe74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-06T12:51:51Z","title_canon_sha256":"88124cd85245bfb6a7fda4ce97f48a637eb8e835baa2e1344431a574396c8af8"},"schema_version":"1.0","source":{"id":"1507.01426","kind":"arxiv","version":2}},"canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","first_computed_at":"2026-05-18T01:37:03.466167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:03.466167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ANz73mnJ/c2ztfpZHXhZS4cHx+AXsMaTiCkMAgK/793ru1K12uVZjsQykFcG8Jzr1OpXlBvGf/uQjLa7bU9BCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:03.466583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01426","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de50b930e42f00371710f0054ea8566b1d072b0a0dfe4c621267af243d70ba80","sha256:8d30532cad7e91ddc9ab691a37cfdc21b65c35acf70862d10ffcb312a00b682f"],"state_sha256":"195a27f0b1969d0783138b7dddc9ff7f84e2ae1ed25e5e752916f958c73151c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnW2KrtFJAwxKFVdzfQebWYramRRZ3KWXMa0vpLUbSolkFVbTxGMOGUYJGM6h0BwZ31qV4l8zZMC5CzjUL4YBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:44:45.036873Z","bundle_sha256":"3c9dcd9cbbbca0b9b1edd5d5602f4406b5e0540f3ff01f8a0bcb9b6698d4485c"}}