{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X2N6HPIV5A5M43BISMLNMNLQVC","short_pith_number":"pith:X2N6HPIV","schema_version":"1.0","canonical_sha256":"be9be3bd15e83ace6c289316d63570a8bcd0dfa2aa83e4711594d9d05abf2056","source":{"kind":"arxiv","id":"1612.00889","version":3},"attestation_state":"computed","paper":{"title":"New Frameworks for Offline and Streaming Coreset Constructions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adiel Statman, Dan Feldman, Harry Lang, Samson Zhou, Vladimir Braverman","submitted_at":"2016-12-02T23:04:16Z","abstract_excerpt":"A coreset for a set of points is a small subset of weighted points that approximately preserves important properties of the original set. Specifically, if $P$ is a set of points, $Q$ is a set of queries, and $f:P\\times Q\\to\\mathbb{R}$ is a cost function, then a set $S\\subseteq P$ with weights $w:P\\to[0,\\infty)$ is an $\\epsilon$-coreset for some parameter $\\epsilon>0$ if $\\sum_{s\\in S}w(s)f(s,q)$ is a $(1+\\epsilon)$ multiplicative approximation to $\\sum_{p\\in P}f(p,q)$ for all $q\\in Q$. Coresets are used to solve fundamental problems in machine learning under various big data models of computat"},"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":"1612.00889","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-12-02T23:04:16Z","cross_cats_sorted":[],"title_canon_sha256":"f1713d106f80be18acc4c6dc954355d7489221781f3b9e3659863e968c9ebeb7","abstract_canon_sha256":"cca352cd0d1bcf47d206f15cfc957a6058e6b2e43fbc5e2cb78ff5c3a10c2971"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:24.764894Z","signature_b64":"9ziAk+QXWrUuvXi4iosXpUsAsW/b/of4GifJXajVFXpxdP5yjL4E9URNUXq9kkeTf40ygQoWQlVh/luHyqTVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be9be3bd15e83ace6c289316d63570a8bcd0dfa2aa83e4711594d9d05abf2056","last_reissued_at":"2026-07-05T04:58:24.764469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:24.764469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Frameworks for Offline and Streaming Coreset Constructions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adiel Statman, Dan Feldman, Harry Lang, Samson Zhou, Vladimir Braverman","submitted_at":"2016-12-02T23:04:16Z","abstract_excerpt":"A coreset for a set of points is a small subset of weighted points that approximately preserves important properties of the original set. Specifically, if $P$ is a set of points, $Q$ is a set of queries, and $f:P\\times Q\\to\\mathbb{R}$ is a cost function, then a set $S\\subseteq P$ with weights $w:P\\to[0,\\infty)$ is an $\\epsilon$-coreset for some parameter $\\epsilon>0$ if $\\sum_{s\\in S}w(s)f(s,q)$ is a $(1+\\epsilon)$ multiplicative approximation to $\\sum_{p\\in P}f(p,q)$ for all $q\\in Q$. Coresets are used to solve fundamental problems in machine learning under various big data models of computat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00889","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1612.00889/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1612.00889","created_at":"2026-07-05T04:58:24.764526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00889v3","created_at":"2026-07-05T04:58:24.764526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00889","created_at":"2026-07-05T04:58:24.764526+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2N6HPIV5A5M","created_at":"2026-07-05T04:58:24.764526+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2N6HPIV5A5M43BI","created_at":"2026-07-05T04:58:24.764526+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2N6HPIV","created_at":"2026-07-05T04:58:24.764526+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30337","citing_title":"Efficient Test-Time Finetuning of LLMs via Convex Reconstruction and Gradient Caching","ref_index":67,"is_internal_anchor":false},{"citing_arxiv_id":"1907.01433","citing_title":"Tight Sensitivity Bounds For Smaller Coresets","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"1907.02171","citing_title":"Sketched MinDist","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20897","citing_title":"Creating Robust and Fair Graph Structures for Connectivity and Clustering","ref_index":110,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC","json":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC.json","graph_json":"https://pith.science/api/pith-number/X2N6HPIV5A5M43BISMLNMNLQVC/graph.json","events_json":"https://pith.science/api/pith-number/X2N6HPIV5A5M43BISMLNMNLQVC/events.json","paper":"https://pith.science/paper/X2N6HPIV"},"agent_actions":{"view_html":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC","download_json":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC.json","view_paper":"https://pith.science/paper/X2N6HPIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00889&json=true","fetch_graph":"https://pith.science/api/pith-number/X2N6HPIV5A5M43BISMLNMNLQVC/graph.json","fetch_events":"https://pith.science/api/pith-number/X2N6HPIV5A5M43BISMLNMNLQVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC/action/storage_attestation","attest_author":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC/action/author_attestation","sign_citation":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC/action/citation_signature","submit_replication":"https://pith.science/pith/X2N6HPIV5A5M43BISMLNMNLQVC/action/replication_record"}},"created_at":"2026-07-05T04:58:24.764526+00:00","updated_at":"2026-07-05T04:58:24.764526+00:00"}