{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PJLEHCMSAIEQRWQHPE5GLHOASE","short_pith_number":"pith:PJLEHCMS","schema_version":"1.0","canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","source":{"kind":"arxiv","id":"2011.09384","version":1},"attestation_state":"computed","paper":{"title":"Introduction to Core-sets: an Updated Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CG","cs.DS"],"primary_cat":"cs.LG","authors_text":"Dan Feldman","submitted_at":"2020-11-18T16:31:34Z","abstract_excerpt":"In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a some for a specific query set of $k$ centers.\n  However, traditional algorithms cannot handle modern syste"},"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":"2011.09384","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-18T16:31:34Z","cross_cats_sorted":["cs.AI","cs.CG","cs.DS"],"title_canon_sha256":"13db4f54d3ce0f6433931560693ed8a8c7c6fe722275a1decb84becef5181298","abstract_canon_sha256":"6af2dc79abf8a0d288fe20a3d6fd7bee60e0cbe0971f19c66462631bc137959a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:43.516640Z","signature_b64":"we6bL23YymkiVga2X/icb1Fk8n9vCcw7ooDuVJjj7AF8G1E1udOn/8JrZZhMlTTbRtF+CrrNppAfWf0VbPMQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","last_reissued_at":"2026-07-05T01:52:43.516207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:43.516207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Introduction to Core-sets: an Updated Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CG","cs.DS"],"primary_cat":"cs.LG","authors_text":"Dan Feldman","submitted_at":"2020-11-18T16:31:34Z","abstract_excerpt":"In optimization or machine learning problems we are given a set of items, usually points in some metric space, and the goal is to minimize or maximize an objective function over some space of candidate solutions. For example, in clustering problems, the input is a set of points in some metric space, and a common goal is to compute a set of centers in some other space (points, lines) that will minimize the sum of distances to these points. In database queries, we may need to compute such a some for a specific query set of $k$ centers.\n  However, traditional algorithms cannot handle modern syste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09384","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.09384/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":"2011.09384","created_at":"2026-07-05T01:52:43.516263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.09384v1","created_at":"2026-07-05T01:52:43.516263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09384","created_at":"2026-07-05T01:52:43.516263+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJLEHCMSAIEQ","created_at":"2026-07-05T01:52:43.516263+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJLEHCMSAIEQRWQH","created_at":"2026-07-05T01:52:43.516263+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJLEHCMS","created_at":"2026-07-05T01:52:43.516263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14785","citing_title":"Understanding Imbalanced Forgetting in Rehearsal-Based Class-Incremental Learning","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11810","citing_title":"GRACE: A Dynamic Coreset Selection Framework for Large Language Model Optimization","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE","json":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE.json","graph_json":"https://pith.science/api/pith-number/PJLEHCMSAIEQRWQHPE5GLHOASE/graph.json","events_json":"https://pith.science/api/pith-number/PJLEHCMSAIEQRWQHPE5GLHOASE/events.json","paper":"https://pith.science/paper/PJLEHCMS"},"agent_actions":{"view_html":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE","download_json":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE.json","view_paper":"https://pith.science/paper/PJLEHCMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.09384&json=true","fetch_graph":"https://pith.science/api/pith-number/PJLEHCMSAIEQRWQHPE5GLHOASE/graph.json","fetch_events":"https://pith.science/api/pith-number/PJLEHCMSAIEQRWQHPE5GLHOASE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/action/storage_attestation","attest_author":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/action/author_attestation","sign_citation":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/action/citation_signature","submit_replication":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/action/replication_record"}},"created_at":"2026-07-05T01:52:43.516263+00:00","updated_at":"2026-07-05T01:52:43.516263+00:00"}