{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FKMLP3AOF5MZCJX7GQEFH6TXRA","short_pith_number":"pith:FKMLP3AO","canonical_record":{"source":{"id":"1807.04518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"a90087c3f9f8d304d7eca6992cc3e220cdd59328a336c6bc18cd819ea8598a0e","abstract_canon_sha256":"17534c209150c20ad100e4fa44a96b000a6776672620e466225eaeac0341bb62"},"schema_version":"1.0"},"canonical_sha256":"2a98b7ec0e2f599126ff340853fa77883c6ab538c13b64f96fa62189a1c48075","source":{"kind":"arxiv","id":"1807.04518","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04518","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04518v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04518","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"FKMLP3AOF5MZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FKMLP3AOF5MZCJX7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FKMLP3AO","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FKMLP3AOF5MZCJX7GQEFH6TXRA","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04518","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:25:12Z","cross_cats_sorted":[],"title_canon_sha256":"a90087c3f9f8d304d7eca6992cc3e220cdd59328a336c6bc18cd819ea8598a0e","abstract_canon_sha256":"17534c209150c20ad100e4fa44a96b000a6776672620e466225eaeac0341bb62"},"schema_version":"1.0"},"canonical_sha256":"2a98b7ec0e2f599126ff340853fa77883c6ab538c13b64f96fa62189a1c48075","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.220077Z","signature_b64":"dLbEsOXsowXn+e4jIXAYZGWwVCSMcoAzwRtjuPNSWNHWxVlcAUAjReP6c5rjHLpHtGdMSOp42yu4jfnodYGhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a98b7ec0e2f599126ff340853fa77883c6ab538c13b64f96fa62189a1c48075","last_reissued_at":"2026-05-18T00:10:53.219390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.219390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04518","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-05-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQuKOg4UWu/FBTz7F9Rl6h1eSuVDuw8e5Dc34QW+XgMOy8JOZZjgRCvGHt3ljxCbmuyAMLD3JLP9xBNHb9woAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:39:14.769369Z"},"content_sha256":"6ec31ec40d89544b3f80975e166be7ccf8b9bae0b2a41c36d29062b1c2d1d9fb","schema_version":"1.0","event_id":"sha256:6ec31ec40d89544b3f80975e166be7ccf8b9bae0b2a41c36d29062b1c2d1d9fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FKMLP3AOF5MZCJX7GQEFH6TXRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Dan Feldman, Melanie Schmidt","submitted_at":"2018-07-12T10:25:12Z","abstract_excerpt":"We develop and analyze a method to reduce the size of a very large set of data points in a high dimensional Euclidean space R d to a small set of weighted points such that the result of a predetermined data analysis task on the reduced set is approximately the same as that for the original point set. For example, computing the first k principal components of the reduced set will return approximately the first k principal components of the original set or computing the centers of a k-means clustering on the reduced set will return an approximation for the original set. Such a reduced set is als"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04518","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":""},"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-18T00:10:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juy2uNy2Wcs0Cg0ZXyS3QGoBuKUaf/fC/kpnYm5ds8xCf3gB5icnxfour8OeSIikrtXuqjSptLiNUZQIhhokDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T04:39:14.770061Z"},"content_sha256":"fb97ae6dc962e4f2e3937f95ab25361515277dacff65d89569f4b4998cb7b10f","schema_version":"1.0","event_id":"sha256:fb97ae6dc962e4f2e3937f95ab25361515277dacff65d89569f4b4998cb7b10f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/bundle.json","state_url":"https://pith.science/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/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-05-20T04:39:14Z","links":{"resolver":"https://pith.science/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA","bundle":"https://pith.science/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/bundle.json","state":"https://pith.science/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FKMLP3AOF5MZCJX7GQEFH6TXRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FKMLP3AOF5MZCJX7GQEFH6TXRA","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":"17534c209150c20ad100e4fa44a96b000a6776672620e466225eaeac0341bb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:25:12Z","title_canon_sha256":"a90087c3f9f8d304d7eca6992cc3e220cdd59328a336c6bc18cd819ea8598a0e"},"schema_version":"1.0","source":{"id":"1807.04518","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04518","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04518v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04518","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"FKMLP3AOF5MZ","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FKMLP3AOF5MZCJX7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FKMLP3AO","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:fb97ae6dc962e4f2e3937f95ab25361515277dacff65d89569f4b4998cb7b10f","target":"graph","created_at":"2026-05-18T00:10:53Z","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":"We develop and analyze a method to reduce the size of a very large set of data points in a high dimensional Euclidean space R d to a small set of weighted points such that the result of a predetermined data analysis task on the reduced set is approximately the same as that for the original point set. For example, computing the first k principal components of the reduced set will return approximately the first k principal components of the original set or computing the centers of a k-means clustering on the reduced set will return an approximation for the original set. Such a reduced set is als","authors_text":"Christian Sohler, Dan Feldman, Melanie Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:25:12Z","title":"Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04518","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:6ec31ec40d89544b3f80975e166be7ccf8b9bae0b2a41c36d29062b1c2d1d9fb","target":"record","created_at":"2026-05-18T00:10:53Z","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":"17534c209150c20ad100e4fa44a96b000a6776672620e466225eaeac0341bb62","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T10:25:12Z","title_canon_sha256":"a90087c3f9f8d304d7eca6992cc3e220cdd59328a336c6bc18cd819ea8598a0e"},"schema_version":"1.0","source":{"id":"1807.04518","kind":"arxiv","version":1}},"canonical_sha256":"2a98b7ec0e2f599126ff340853fa77883c6ab538c13b64f96fa62189a1c48075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a98b7ec0e2f599126ff340853fa77883c6ab538c13b64f96fa62189a1c48075","first_computed_at":"2026-05-18T00:10:53.219390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:53.219390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLbEsOXsowXn+e4jIXAYZGWwVCSMcoAzwRtjuPNSWNHWxVlcAUAjReP6c5rjHLpHtGdMSOp42yu4jfnodYGhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:53.220077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04518","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ec31ec40d89544b3f80975e166be7ccf8b9bae0b2a41c36d29062b1c2d1d9fb","sha256:fb97ae6dc962e4f2e3937f95ab25361515277dacff65d89569f4b4998cb7b10f"],"state_sha256":"1fd97ed085abe15ef8c9cae434a92914ec6c2ffeb1918e3c7160bdca6b410ed8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VO/qetz7com6L1/VYeUuH/Ccwi+FzEDJdcYZqCT8iAFGErjMKaSLohfKpNYMRVCRYMV3mJN6I0MiUFkOlufDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T04:39:14.773867Z","bundle_sha256":"2787b08fd592f9a22f5113dbb9b5b06b088e17044b125ec2faf0cdba7fb21bdc"}}