{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZVJTZN4T647UCV7YFGOTUDRCZJ","short_pith_number":"pith:ZVJTZN4T","canonical_record":{"source":{"id":"1106.1379","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-07T15:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"baacf17df084fb9cdb68c9ef9044ff24c5696338cf68489a0daa6efb8e4cd8f6","abstract_canon_sha256":"5b609b5b48a679524d3e0bdc21486df5f7a64ec754531fac78ddc904fd49350d"},"schema_version":"1.0"},"canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","source":{"kind":"arxiv","id":"1106.1379","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1379","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1379v4","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1379","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZVJTZN4T647U","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZVJTZN4T647UCV7Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZVJTZN4T","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZVJTZN4T647UCV7YFGOTUDRCZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1106.1379","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-07T15:52:39Z","cross_cats_sorted":[],"title_canon_sha256":"baacf17df084fb9cdb68c9ef9044ff24c5696338cf68489a0daa6efb8e4cd8f6","abstract_canon_sha256":"5b609b5b48a679524d3e0bdc21486df5f7a64ec754531fac78ddc904fd49350d"},"schema_version":"1.0"},"canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.058953Z","signature_b64":"oE4YrTCU0Fu3+YKSw9GHD7rKmisJLU+jo6WuY5g3/Q+A05fImJIWJ9WIuN0x1MhXiIVID3KVnY9kM/ZAh+MuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","last_reissued_at":"2026-05-18T01:13:29.058454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.058454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.1379","source_version":4,"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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+7MxICj+E/NaGxZCZ1gBy4p0s4osnP9KkG3jq007KtPIzT1RzjvuOilOzpOGMDqs6EIy6j7uG+NQBOX6aotDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:38:47.387688Z"},"content_sha256":"d3e3ee793d500be24700a5c31a1932d230754f66929ee4bb87272b68b484893f","schema_version":"1.0","event_id":"sha256:d3e3ee793d500be24700a5c31a1932d230754f66929ee4bb87272b68b484893f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZVJTZN4T647UCV7YFGOTUDRCZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Framework for Approximating and Clustering Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Michael Langberg","submitted_at":"2011-06-07T15:52:39Z","abstract_excerpt":"Given a set $F$ of $n$ positive functions over a ground set $X$, we consider the problem of computing $x^*$ that minimizes the expression $\\sum_{f\\in F}f(x)$, over $x\\in X$. A typical application is \\emph{shape fitting}, where we wish to approximate a set $P$ of $n$ elements (say, points) by a shape $x$ from a (possibly infinite) family $X$ of shapes. Here, each point $p\\in P$ corresponds to a function $f$ such that $f(x)$ is the distance from $p$ to $x$, and we seek a shape $x$ that minimizes the sum of distances from each point in $P$. In the $k$-clustering variant, each $x\\in X$ is a tuple "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1379","kind":"arxiv","version":4},"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:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+Jf3ZIw07MprwR5VI9A3mc85w4sS1oNRiYXDS4dEErrr/ZdCr5R5clf9/xg7ENjNlr1oIuJIT/OERyWHTC9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:38:47.388337Z"},"content_sha256":"28a9c9adb230d1f3219a60e7bff29dcb23c837d79a93dff9c9334ce101c653a8","schema_version":"1.0","event_id":"sha256:28a9c9adb230d1f3219a60e7bff29dcb23c837d79a93dff9c9334ce101c653a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/bundle.json","state_url":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/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-09T02:38:47Z","links":{"resolver":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ","bundle":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/bundle.json","state":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZVJTZN4T647UCV7YFGOTUDRCZJ","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":"5b609b5b48a679524d3e0bdc21486df5f7a64ec754531fac78ddc904fd49350d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-07T15:52:39Z","title_canon_sha256":"baacf17df084fb9cdb68c9ef9044ff24c5696338cf68489a0daa6efb8e4cd8f6"},"schema_version":"1.0","source":{"id":"1106.1379","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.1379","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1106.1379v4","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1379","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"ZVJTZN4T647U","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZVJTZN4T647UCV7Y","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZVJTZN4T","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:28a9c9adb230d1f3219a60e7bff29dcb23c837d79a93dff9c9334ce101c653a8","target":"graph","created_at":"2026-05-18T01:13:29Z","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":"Given a set $F$ of $n$ positive functions over a ground set $X$, we consider the problem of computing $x^*$ that minimizes the expression $\\sum_{f\\in F}f(x)$, over $x\\in X$. A typical application is \\emph{shape fitting}, where we wish to approximate a set $P$ of $n$ elements (say, points) by a shape $x$ from a (possibly infinite) family $X$ of shapes. Here, each point $p\\in P$ corresponds to a function $f$ such that $f(x)$ is the distance from $p$ to $x$, and we seek a shape $x$ that minimizes the sum of distances from each point in $P$. In the $k$-clustering variant, each $x\\in X$ is a tuple ","authors_text":"Dan Feldman, Michael Langberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-07T15:52:39Z","title":"A Unified Framework for Approximating and Clustering Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.1379","kind":"arxiv","version":4},"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:d3e3ee793d500be24700a5c31a1932d230754f66929ee4bb87272b68b484893f","target":"record","created_at":"2026-05-18T01:13:29Z","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":"5b609b5b48a679524d3e0bdc21486df5f7a64ec754531fac78ddc904fd49350d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-06-07T15:52:39Z","title_canon_sha256":"baacf17df084fb9cdb68c9ef9044ff24c5696338cf68489a0daa6efb8e4cd8f6"},"schema_version":"1.0","source":{"id":"1106.1379","kind":"arxiv","version":4}},"canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","first_computed_at":"2026-05-18T01:13:29.058454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.058454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oE4YrTCU0Fu3+YKSw9GHD7rKmisJLU+jo6WuY5g3/Q+A05fImJIWJ9WIuN0x1MhXiIVID3KVnY9kM/ZAh+MuDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.058953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.1379","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e3ee793d500be24700a5c31a1932d230754f66929ee4bb87272b68b484893f","sha256:28a9c9adb230d1f3219a60e7bff29dcb23c837d79a93dff9c9334ce101c653a8"],"state_sha256":"a09ff7692ad27d440b6b4611bfc7919ff4b86e181ea8b7fb8981b403514b2d06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2guqbmvr/39HxuuaftvE5lM/U6nX/E5nmEuEw4s7Gri50QSiwK8h3+HQzGmrOLeMmCE44obWzZUPM6Y2NHHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:38:47.392073Z","bundle_sha256":"40f21b3a085eb0407a54eccf739296ae4756ed2d0adcba48e1dd28d9d6d86538"}}