{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UBVTA67FW3424NCNER5CAQLFJ4","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":"c5431f60fef363d6cd68f2484cf79817b456ac8f9bd66a59455c46115b0154ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T12:53:02Z","title_canon_sha256":"6c5ffda9ae926a952612ef1a9406bb3a887dca03af4538857d0e1766b70c30f8"},"schema_version":"1.0","source":{"id":"1606.06547","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06547","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06547v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06547","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"UBVTA67FW342","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UBVTA67FW3424NCN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UBVTA67F","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:4a60a02230817c99ccc7ae67551146f68068a3b61e438a799acf6338e259e989","target":"graph","created_at":"2026-05-18T01:12:09Z","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":"Let $G$ be an edge-colored connected graph. A path $P$ in $G$ is called a distance $\\ell$-proper path if no two edges of the same color appear with fewer than $\\ell$ edges in between on $P$. The graph $G$ is called $(k,\\ell)$-proper connected if every pair of distinct vertices of $G$ are connected by $k$ pairwise internally vertex-disjoint distance $\\ell$-proper paths in $G$. For a $k$-connected graph $G$, the minimum number of colors needed to make $G$ $(k,\\ell)$-proper connected is called the $(k,\\ell)$-proper connection number of $G$ and denoted by $pc_{k,\\ell}(G)$. In this paper, we prove ","authors_text":"Colton Magnant, Meiqin Wei, Xiaoyu Zhu, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T12:53:02Z","title":"Distance proper connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06547","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:c287f598b063c0809a2ba427617e791aaa105186752c1a0df20d56835f721c27","target":"record","created_at":"2026-05-18T01:12:09Z","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":"c5431f60fef363d6cd68f2484cf79817b456ac8f9bd66a59455c46115b0154ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T12:53:02Z","title_canon_sha256":"6c5ffda9ae926a952612ef1a9406bb3a887dca03af4538857d0e1766b70c30f8"},"schema_version":"1.0","source":{"id":"1606.06547","kind":"arxiv","version":1}},"canonical_sha256":"a06b307be5b6f9ae344d247a2041654f1e22964e84e22db6bb1adde9403581a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a06b307be5b6f9ae344d247a2041654f1e22964e84e22db6bb1adde9403581a4","first_computed_at":"2026-05-18T01:12:09.278985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.278985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCGOSpjrOlgdpx0lQ4FvA8E9gDjFks+8GK42cRRpFi5rJUmmGbdNRRuBMRTrR6tAMEv2FraBjlRhfThxCiLtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.279395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06547","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c287f598b063c0809a2ba427617e791aaa105186752c1a0df20d56835f721c27","sha256:4a60a02230817c99ccc7ae67551146f68068a3b61e438a799acf6338e259e989"],"state_sha256":"f18236e839ab18aa43485a69af9fc94b499412b70e2688ce9cfb3ad64dca88dd"}