{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VJ4UBSQIGFTXD6KIKN7AIMKWAX","short_pith_number":"pith:VJ4UBSQI","canonical_record":{"source":{"id":"1607.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T12:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"9863694569e6a9ce2097fed0c6e69e20b79f314cc48bb456961ca5012f198f1e","abstract_canon_sha256":"70283f75a3a9f5c7f958e195549f5c1d0d8c72d32e7bea85b3c12097f35627c6"},"schema_version":"1.0"},"canonical_sha256":"aa7940ca08316771f948537e04315605eddab9e41966f6ea8e9bba541862727b","source":{"kind":"arxiv","id":"1607.05930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05930","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05930v1","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05930","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"VJ4UBSQIGFTX","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJ4UBSQIGFTXD6KI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJ4UBSQI","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VJ4UBSQIGFTXD6KIKN7AIMKWAX","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T12:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"9863694569e6a9ce2097fed0c6e69e20b79f314cc48bb456961ca5012f198f1e","abstract_canon_sha256":"70283f75a3a9f5c7f958e195549f5c1d0d8c72d32e7bea85b3c12097f35627c6"},"schema_version":"1.0"},"canonical_sha256":"aa7940ca08316771f948537e04315605eddab9e41966f6ea8e9bba541862727b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:43.683433Z","signature_b64":"iw9N/Z1ZdJsDQZgnp0o7JhcQ5mtj7dbSEUGeF650sf8mnpYLlBluWFNyQ7TkMukOGo2htCH0f0GJAvaEmeNCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa7940ca08316771f948537e04315605eddab9e41966f6ea8e9bba541862727b","last_reissued_at":"2026-05-18T01:10:43.682949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:43.682949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05930","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSTE7jaAcT36BzwJVh4aT6OIBRLTNRweqXNLOz6h1C2+7NQi9/Wmh+No+qmKyGEcxK85grncDZlp6h6dlNZaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:58:28.979650Z"},"content_sha256":"5ffefba9b68bd790297fe60acfdc450f8e25b89e39fc8b261d82a6968c112745","schema_version":"1.0","event_id":"sha256:5ffefba9b68bd790297fe60acfdc450f8e25b89e39fc8b261d82a6968c112745"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VJ4UBSQIGFTXD6KIKN7AIMKWAX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance proper connection of graphs and their complements","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-07-20T12:07:50Z","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 can appear with less than $\\ell$ edges in between on $P$. The graph $G$ is called $(k,\\ell)$-proper connected if there is an edge-coloring such that every pair of distinct vertices of $G$ are connected by $k$ pairwise internally vertex-disjoint distance $\\ell$-proper paths in $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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05930","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:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TZDqeksQyzztNhPlMolDpd8jB+YFuv7h2mFgA3ElOfT75PXfgfK97WOqUihCr/Qhrii2pYsY7GCnlsRVlyGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:58:28.980252Z"},"content_sha256":"decec989f92f4695a6dc5a8fe7f3dabfb57dbc7cc98c6c2e031733419693b324","schema_version":"1.0","event_id":"sha256:decec989f92f4695a6dc5a8fe7f3dabfb57dbc7cc98c6c2e031733419693b324"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/bundle.json","state_url":"https://pith.science/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/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-28T19:58:28Z","links":{"resolver":"https://pith.science/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX","bundle":"https://pith.science/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/bundle.json","state":"https://pith.science/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VJ4UBSQIGFTXD6KIKN7AIMKWAX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VJ4UBSQIGFTXD6KIKN7AIMKWAX","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":"70283f75a3a9f5c7f958e195549f5c1d0d8c72d32e7bea85b3c12097f35627c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T12:07:50Z","title_canon_sha256":"9863694569e6a9ce2097fed0c6e69e20b79f314cc48bb456961ca5012f198f1e"},"schema_version":"1.0","source":{"id":"1607.05930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05930","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05930v1","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05930","created_at":"2026-05-18T01:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"VJ4UBSQIGFTX","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VJ4UBSQIGFTXD6KI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VJ4UBSQI","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:decec989f92f4695a6dc5a8fe7f3dabfb57dbc7cc98c6c2e031733419693b324","target":"graph","created_at":"2026-05-18T01:10:43Z","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 can appear with less than $\\ell$ edges in between on $P$. The graph $G$ is called $(k,\\ell)$-proper connected if there is an edge-coloring such that every pair of distinct vertices of $G$ are connected by $k$ pairwise internally vertex-disjoint distance $\\ell$-proper paths in $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","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-07-20T12:07:50Z","title":"Distance proper connection of graphs and their complements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05930","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:5ffefba9b68bd790297fe60acfdc450f8e25b89e39fc8b261d82a6968c112745","target":"record","created_at":"2026-05-18T01:10:43Z","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":"70283f75a3a9f5c7f958e195549f5c1d0d8c72d32e7bea85b3c12097f35627c6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-20T12:07:50Z","title_canon_sha256":"9863694569e6a9ce2097fed0c6e69e20b79f314cc48bb456961ca5012f198f1e"},"schema_version":"1.0","source":{"id":"1607.05930","kind":"arxiv","version":1}},"canonical_sha256":"aa7940ca08316771f948537e04315605eddab9e41966f6ea8e9bba541862727b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa7940ca08316771f948537e04315605eddab9e41966f6ea8e9bba541862727b","first_computed_at":"2026-05-18T01:10:43.682949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:43.682949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iw9N/Z1ZdJsDQZgnp0o7JhcQ5mtj7dbSEUGeF650sf8mnpYLlBluWFNyQ7TkMukOGo2htCH0f0GJAvaEmeNCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:43.683433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ffefba9b68bd790297fe60acfdc450f8e25b89e39fc8b261d82a6968c112745","sha256:decec989f92f4695a6dc5a8fe7f3dabfb57dbc7cc98c6c2e031733419693b324"],"state_sha256":"f49473bcda3a477f743ae183aaee2e5923315ac8c32f5bdbcb5fdb3a94a70ae7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"obH++/4pav4nKkTPYKuIqg+YxQ0Wv1hVKkha6dgikjty/3j42fcu3C11EyXtVCkWDvzfRlykbwp9PoGp3F2CBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:58:28.983328Z","bundle_sha256":"fb7ef32d99e2eefb330408853452ab3c854f316cf8370e600a7405b3cfc67d39"}}