{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:PJLEHCMSAIEQRWQHPE5GLHOASE","short_pith_number":"pith:PJLEHCMS","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"},"canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","source":{"kind":"arxiv","id":"2011.09384","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09384","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09384v1","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09384","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"PJLEHCMSAIEQ","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJLEHCMSAIEQRWQH","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJLEHCMS","created_at":"2026-07-05T01:52:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:PJLEHCMSAIEQRWQHPE5GLHOASE","target":"record","payload":{"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"},"canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","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"},"source_kind":"arxiv","source_id":"2011.09384","source_version":1,"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-07-05T01:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoTxmJT65uqJxU+wPFS9etGQ1vAVFNipQPkneoZybj5LrdUUsHBna31cg1hLtIZYqba021d4AvAdej3UfzrYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:32:28.340879Z"},"content_sha256":"c4d9a406f7ff722ab06017d1be0643ea78f7772fc5819b78e7b67857d0b55cba","schema_version":"1.0","event_id":"sha256:c4d9a406f7ff722ab06017d1be0643ea78f7772fc5819b78e7b67857d0b55cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:PJLEHCMSAIEQRWQHPE5GLHOASE","target":"graph","payload":{"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"},"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-07-05T01:52:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPURWQr1Scr0hJupXJMi/ET0uch64NJGHOF0loFuLC2yrnCMAC2+AC/EiPrgTfAxmLa/jybuM0x2hah/AA/hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:32:28.341432Z"},"content_sha256":"5979394cc8fb98436bd1705dafd993152e09436cb3180fde24f4093133b98bc2","schema_version":"1.0","event_id":"sha256:5979394cc8fb98436bd1705dafd993152e09436cb3180fde24f4093133b98bc2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/bundle.json","state_url":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/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-08-06T14:32:28Z","links":{"resolver":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE","bundle":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/bundle.json","state":"https://pith.science/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJLEHCMSAIEQRWQHPE5GLHOASE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PJLEHCMSAIEQRWQHPE5GLHOASE","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":"6af2dc79abf8a0d288fe20a3d6fd7bee60e0cbe0971f19c66462631bc137959a","cross_cats_sorted":["cs.AI","cs.CG","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-18T16:31:34Z","title_canon_sha256":"13db4f54d3ce0f6433931560693ed8a8c7c6fe722275a1decb84becef5181298"},"schema_version":"1.0","source":{"id":"2011.09384","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09384","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09384v1","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09384","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_12","alias_value":"PJLEHCMSAIEQ","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJLEHCMSAIEQRWQH","created_at":"2026-07-05T01:52:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJLEHCMS","created_at":"2026-07-05T01:52:43Z"}],"graph_snapshots":[{"event_id":"sha256:5979394cc8fb98436bd1705dafd993152e09436cb3180fde24f4093133b98bc2","target":"graph","created_at":"2026-07-05T01:52:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.09384/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dan Feldman","cross_cats":["cs.AI","cs.CG","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-18T16:31:34Z","title":"Introduction to Core-sets: an Updated Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09384","kind":"arxiv","version":1},"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:c4d9a406f7ff722ab06017d1be0643ea78f7772fc5819b78e7b67857d0b55cba","target":"record","created_at":"2026-07-05T01:52:43Z","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":"6af2dc79abf8a0d288fe20a3d6fd7bee60e0cbe0971f19c66462631bc137959a","cross_cats_sorted":["cs.AI","cs.CG","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2020-11-18T16:31:34Z","title_canon_sha256":"13db4f54d3ce0f6433931560693ed8a8c7c6fe722275a1decb84becef5181298"},"schema_version":"1.0","source":{"id":"2011.09384","kind":"arxiv","version":1}},"canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a56438992020908da07793a659dc0913b9a49b09a5f70a4aa8cb2f4fbb4585a","first_computed_at":"2026-07-05T01:52:43.516207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:43.516207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"we6bL23YymkiVga2X/icb1Fk8n9vCcw7ooDuVJjj7AF8G1E1udOn/8JrZZhMlTTbRtF+CrrNppAfWf0VbPMQDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:43.516640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09384","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4d9a406f7ff722ab06017d1be0643ea78f7772fc5819b78e7b67857d0b55cba","sha256:5979394cc8fb98436bd1705dafd993152e09436cb3180fde24f4093133b98bc2"],"state_sha256":"40828a79677271a7e10c9266fa086bf2775169211e4ad8197e937d94f8610e6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HJQPBYIpa8j9BeaoYDrpdCST3MpzIpN5TfiPA4I3xNUinNGKubOXOnc4pdOCr6Z50XF4ABrU4705uHcPeraMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T14:32:28.350381Z","bundle_sha256":"59d81cf57f2b56fe53d531c10f009b15a68bb34319960433d2569efc17e748c4"}}