{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YZDNXQJLQBRVXFHTCRJLX3YVDG","short_pith_number":"pith:YZDNXQJL","schema_version":"1.0","canonical_sha256":"c646dbc12b80635b94f31452bbef1519ba71e886d61f4a88f1d5dbab099db856","source":{"kind":"arxiv","id":"1507.01426","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.01426","created_at":"2026-05-18T01:37:03.466228+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01426v2","created_at":"2026-05-18T01:37:03.466228+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01426","created_at":"2026-05-18T01:37:03.466228+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZDNXQJLQBRV","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZDNXQJLQBRVXFHT","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZDNXQJL","created_at":"2026-05-18T12:29:52.810259+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/YZDNXQJLQBRVXFHTCRJLX3YVDG","json":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG.json","graph_json":"https://pith.science/api/pith-number/YZDNXQJLQBRVXFHTCRJLX3YVDG/graph.json","events_json":"https://pith.science/api/pith-number/YZDNXQJLQBRVXFHTCRJLX3YVDG/events.json","paper":"https://pith.science/paper/YZDNXQJL"},"agent_actions":{"view_html":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG","download_json":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG.json","view_paper":"https://pith.science/paper/YZDNXQJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01426&json=true","fetch_graph":"https://pith.science/api/pith-number/YZDNXQJLQBRVXFHTCRJLX3YVDG/graph.json","fetch_events":"https://pith.science/api/pith-number/YZDNXQJLQBRVXFHTCRJLX3YVDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/action/storage_attestation","attest_author":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/action/author_attestation","sign_citation":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/action/citation_signature","submit_replication":"https://pith.science/pith/YZDNXQJLQBRVXFHTCRJLX3YVDG/action/replication_record"}},"created_at":"2026-05-18T01:37:03.466228+00:00","updated_at":"2026-05-18T01:37:03.466228+00:00"}