{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UBVTA67FW3424NCNER5CAQLFJ4","short_pith_number":"pith:UBVTA67F","canonical_record":{"source":{"id":"1606.06547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T12:53:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c5ffda9ae926a952612ef1a9406bb3a887dca03af4538857d0e1766b70c30f8","abstract_canon_sha256":"c5431f60fef363d6cd68f2484cf79817b456ac8f9bd66a59455c46115b0154ba"},"schema_version":"1.0"},"canonical_sha256":"a06b307be5b6f9ae344d247a2041654f1e22964e84e22db6bb1adde9403581a4","source":{"kind":"arxiv","id":"1606.06547","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UBVTA67FW3424NCNER5CAQLFJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06547","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-21T12:53:02Z","cross_cats_sorted":[],"title_canon_sha256":"6c5ffda9ae926a952612ef1a9406bb3a887dca03af4538857d0e1766b70c30f8","abstract_canon_sha256":"c5431f60fef363d6cd68f2484cf79817b456ac8f9bd66a59455c46115b0154ba"},"schema_version":"1.0"},"canonical_sha256":"a06b307be5b6f9ae344d247a2041654f1e22964e84e22db6bb1adde9403581a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.279395Z","signature_b64":"vCGOSpjrOlgdpx0lQ4FvA8E9gDjFks+8GK42cRRpFi5rJUmmGbdNRRuBMRTrR6tAMEv2FraBjlRhfThxCiLtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a06b307be5b6f9ae344d247a2041654f1e22964e84e22db6bb1adde9403581a4","last_reissued_at":"2026-05-18T01:12:09.278985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.278985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06547","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goJgfxuhl2WnSEbCuASMK1Dhm4P59Ipa4zaNL3KUv4d0Y/Tar1/7INBN4ju34FKO5Jts4V88GOWWB7oNqXDxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:45:01.636031Z"},"content_sha256":"c287f598b063c0809a2ba427617e791aaa105186752c1a0df20d56835f721c27","schema_version":"1.0","event_id":"sha256:c287f598b063c0809a2ba427617e791aaa105186752c1a0df20d56835f721c27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UBVTA67FW3424NCNER5CAQLFJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance proper connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Colton Magnant, Meiqin Wei, Xiaoyu Zhu, Xueliang Li","submitted_at":"2016-06-21T12:53:02Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06547","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-18T01:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JJWfb3wbaqPXV8ie7VBuBpKB9uyqj6McpRri8TUq6qji9AOxbtiN+Sl4rrlPxE4R99tzeuZnqqtGhBcGJZSrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:45:01.636712Z"},"content_sha256":"4a60a02230817c99ccc7ae67551146f68068a3b61e438a799acf6338e259e989","schema_version":"1.0","event_id":"sha256:4a60a02230817c99ccc7ae67551146f68068a3b61e438a799acf6338e259e989"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UBVTA67FW3424NCNER5CAQLFJ4/bundle.json","state_url":"https://pith.science/pith/UBVTA67FW3424NCNER5CAQLFJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UBVTA67FW3424NCNER5CAQLFJ4/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-26T08:45:01Z","links":{"resolver":"https://pith.science/pith/UBVTA67FW3424NCNER5CAQLFJ4","bundle":"https://pith.science/pith/UBVTA67FW3424NCNER5CAQLFJ4/bundle.json","state":"https://pith.science/pith/UBVTA67FW3424NCNER5CAQLFJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UBVTA67FW3424NCNER5CAQLFJ4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPY/5Sr32all+OLVzUmIODo+sOR9QsCYvMNg8/ubp18NuDq6vDsKFgQCdzmAEwL/lZaE/8CwO1wfUtzh2iyQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:45:01.640414Z","bundle_sha256":"ddb6fd5470c9b520ea810fdb35265caf51fcb7216472cc8268ccf1131c359e50"}}