{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YU3SICGJMLP7T6RSNKGWZFE5SR","short_pith_number":"pith:YU3SICGJ","canonical_record":{"source":{"id":"1806.11096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-28T17:36:23Z","cross_cats_sorted":["cs.LG","math.FA"],"title_canon_sha256":"5112f1fe7c546f24c37d0877165b029b9785b58bd04c5cdc6db35679e796086b","abstract_canon_sha256":"5e67417ca756f9c4b7395c7605bf41053d33a7a3707f2185cb9aa3dcb1cd0038"},"schema_version":"1.0"},"canonical_sha256":"c5372408c962dff9fa326a8d6c949d9478ca7ee131baac28aa3b7c41e3ebb2d0","source":{"kind":"arxiv","id":"1806.11096","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11096","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11096v2","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11096","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"YU3SICGJMLP7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YU3SICGJMLP7T6RS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YU3SICGJ","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YU3SICGJMLP7T6RSNKGWZFE5SR","target":"record","payload":{"canonical_record":{"source":{"id":"1806.11096","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-28T17:36:23Z","cross_cats_sorted":["cs.LG","math.FA"],"title_canon_sha256":"5112f1fe7c546f24c37d0877165b029b9785b58bd04c5cdc6db35679e796086b","abstract_canon_sha256":"5e67417ca756f9c4b7395c7605bf41053d33a7a3707f2185cb9aa3dcb1cd0038"},"schema_version":"1.0"},"canonical_sha256":"c5372408c962dff9fa326a8d6c949d9478ca7ee131baac28aa3b7c41e3ebb2d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:03.569388Z","signature_b64":"iMTVOO198VLf46xb1+zzeR0EOO/LGegZKqen4qvYvqsq5IWgKPD969+L3+0Z0bD3nL2C79WLmKSS9N6Tx8hNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5372408c962dff9fa326a8d6c949d9478ca7ee131baac28aa3b7c41e3ebb2d0","last_reissued_at":"2026-05-18T00:12:03.568864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:03.568864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.11096","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-18T00:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IL76jWZnpe5xTsYDsydMzg1A4AtsAaZfW6LWlMb33AHGGs4YiG7mFlszfu8ZT8US0nMY6KVmf2wja/n+v1sCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:36:14.755226Z"},"content_sha256":"b020eb973fbd4fe3907d6ffb91e18bd1ae7d6123f1059fdff8ed7b8e0652a003","schema_version":"1.0","event_id":"sha256:b020eb973fbd4fe3907d6ffb91e18bd1ae7d6123f1059fdff8ed7b8e0652a003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YU3SICGJMLP7T6RSNKGWZFE5SR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recovering Trees with Convex Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.FA"],"primary_cat":"stat.ML","authors_text":"Eric C. Chi, Stefan Steinerberger","submitted_at":"2018-06-28T17:36:23Z","abstract_excerpt":"Convex clustering refers, for given $\\left\\{x_1, \\dots, x_n\\right\\} \\subset \\mathbb{R}^p$, to the minimization of \\begin{eqnarray*} u(\\gamma) & = & \\underset{u_1, \\dots, u_n }{\\arg\\min}\\;\\sum_{i=1}^{n}{\\lVert x_i - u_i \\rVert^2} + \\gamma \\sum_{i,j=1}^{n}{w_{ij} \\lVert u_i - u_j\\rVert},\\\\ \\end{eqnarray*} where $w_{ij} \\geq 0$ is an affinity that quantifies the similarity between $x_i$ and $x_j$. We prove that if the affinities $w_{ij}$ reflect a tree structure in the $\\left\\{x_1, \\dots, x_n\\right\\}$, then the convex clustering solution path reconstructs the tree exactly. The main technical ingr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11096","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-18T00:12:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqAlFvkJU74FtM0Y+tniE/HhJaNbC0n90g42ny5wWNhm/CPBwCeh1V/Bvbhx4AVw0BN/zjNT0JU8cA1x928uCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:36:14.755743Z"},"content_sha256":"90095d64c0d861f9705c6d91e357e851a03d7239affbb81b44abb89edb213b33","schema_version":"1.0","event_id":"sha256:90095d64c0d861f9705c6d91e357e851a03d7239affbb81b44abb89edb213b33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/bundle.json","state_url":"https://pith.science/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/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-06-01T06:36:14Z","links":{"resolver":"https://pith.science/pith/YU3SICGJMLP7T6RSNKGWZFE5SR","bundle":"https://pith.science/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/bundle.json","state":"https://pith.science/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YU3SICGJMLP7T6RSNKGWZFE5SR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YU3SICGJMLP7T6RSNKGWZFE5SR","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":"5e67417ca756f9c4b7395c7605bf41053d33a7a3707f2185cb9aa3dcb1cd0038","cross_cats_sorted":["cs.LG","math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-28T17:36:23Z","title_canon_sha256":"5112f1fe7c546f24c37d0877165b029b9785b58bd04c5cdc6db35679e796086b"},"schema_version":"1.0","source":{"id":"1806.11096","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.11096","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"arxiv_version","alias_value":"1806.11096v2","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11096","created_at":"2026-05-18T00:12:03Z"},{"alias_kind":"pith_short_12","alias_value":"YU3SICGJMLP7","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YU3SICGJMLP7T6RS","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YU3SICGJ","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:90095d64c0d861f9705c6d91e357e851a03d7239affbb81b44abb89edb213b33","target":"graph","created_at":"2026-05-18T00:12: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":"Convex clustering refers, for given $\\left\\{x_1, \\dots, x_n\\right\\} \\subset \\mathbb{R}^p$, to the minimization of \\begin{eqnarray*} u(\\gamma) & = & \\underset{u_1, \\dots, u_n }{\\arg\\min}\\;\\sum_{i=1}^{n}{\\lVert x_i - u_i \\rVert^2} + \\gamma \\sum_{i,j=1}^{n}{w_{ij} \\lVert u_i - u_j\\rVert},\\\\ \\end{eqnarray*} where $w_{ij} \\geq 0$ is an affinity that quantifies the similarity between $x_i$ and $x_j$. We prove that if the affinities $w_{ij}$ reflect a tree structure in the $\\left\\{x_1, \\dots, x_n\\right\\}$, then the convex clustering solution path reconstructs the tree exactly. The main technical ingr","authors_text":"Eric C. Chi, Stefan Steinerberger","cross_cats":["cs.LG","math.FA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-28T17:36:23Z","title":"Recovering Trees with Convex Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11096","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:b020eb973fbd4fe3907d6ffb91e18bd1ae7d6123f1059fdff8ed7b8e0652a003","target":"record","created_at":"2026-05-18T00:12: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":"5e67417ca756f9c4b7395c7605bf41053d33a7a3707f2185cb9aa3dcb1cd0038","cross_cats_sorted":["cs.LG","math.FA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-06-28T17:36:23Z","title_canon_sha256":"5112f1fe7c546f24c37d0877165b029b9785b58bd04c5cdc6db35679e796086b"},"schema_version":"1.0","source":{"id":"1806.11096","kind":"arxiv","version":2}},"canonical_sha256":"c5372408c962dff9fa326a8d6c949d9478ca7ee131baac28aa3b7c41e3ebb2d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5372408c962dff9fa326a8d6c949d9478ca7ee131baac28aa3b7c41e3ebb2d0","first_computed_at":"2026-05-18T00:12:03.568864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:03.568864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMTVOO198VLf46xb1+zzeR0EOO/LGegZKqen4qvYvqsq5IWgKPD969+L3+0Z0bD3nL2C79WLmKSS9N6Tx8hNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:03.569388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.11096","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b020eb973fbd4fe3907d6ffb91e18bd1ae7d6123f1059fdff8ed7b8e0652a003","sha256:90095d64c0d861f9705c6d91e357e851a03d7239affbb81b44abb89edb213b33"],"state_sha256":"af29d0d1eacdce7fac051c95ea9a180e539f4025218f5882bef45cb653e3edde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+2URXvopK52tzTNDEa45hUTt1E8H448xKqmRuE1yS3u0jAfsilYT6PefHS2QFqv7K4y7QSyzRApzzq2K086mDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:36:14.758064Z","bundle_sha256":"6c7d6003a58fdbddd91e27cb0a2a4e9615a4e2b1966c59defebb9e19165a23fa"}}