{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZVJTZN4T647UCV7YFGOTUDRCZJ","short_pith_number":"pith:ZVJTZN4T","schema_version":"1.0","canonical_sha256":"cd533cb793f73f4157f8299d3a0e22ca69eb37cf7b8315b509eb7383b447a0c9","source":{"kind":"arxiv","id":"1106.1379","version":4},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.1379","created_at":"2026-05-18T01:13:29.058524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.1379v4","created_at":"2026-05-18T01:13:29.058524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.1379","created_at":"2026-05-18T01:13:29.058524+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVJTZN4T647U","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVJTZN4T647UCV7Y","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVJTZN4T","created_at":"2026-05-18T12:26:50.516681+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ","json":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ.json","graph_json":"https://pith.science/api/pith-number/ZVJTZN4T647UCV7YFGOTUDRCZJ/graph.json","events_json":"https://pith.science/api/pith-number/ZVJTZN4T647UCV7YFGOTUDRCZJ/events.json","paper":"https://pith.science/paper/ZVJTZN4T"},"agent_actions":{"view_html":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ","download_json":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ.json","view_paper":"https://pith.science/paper/ZVJTZN4T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.1379&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVJTZN4T647UCV7YFGOTUDRCZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVJTZN4T647UCV7YFGOTUDRCZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZVJTZN4T647UCV7YFGOTUDRCZJ/action/replication_record"}},"created_at":"2026-05-18T01:13:29.058524+00:00","updated_at":"2026-05-18T01:13:29.058524+00:00"}