{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:IELRGIIXFCJLZFNYKRRPVNZTJU","short_pith_number":"pith:IELRGIIX","canonical_record":{"source":{"id":"2011.13476","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-26T21:04:41Z","cross_cats_sorted":[],"title_canon_sha256":"d22760b0ddde969e9633ad23ee65efb5ce88ca5b77619c68f351fd2e3ecd77e0","abstract_canon_sha256":"ee7c570e25d3ec3493b34873503a15620cf75e3184db2fb84944d5c06927dfdd"},"schema_version":"1.0"},"canonical_sha256":"41171321172892bc95b85462fab7334d26afb4cf2ac3e73aeb578996245a8bfb","source":{"kind":"arxiv","id":"2011.13476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13476","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13476v1","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13476","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"IELRGIIXFCJL","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_16","alias_value":"IELRGIIXFCJLZFNY","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_8","alias_value":"IELRGIIX","created_at":"2026-07-05T01:54:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:IELRGIIXFCJLZFNYKRRPVNZTJU","target":"record","payload":{"canonical_record":{"source":{"id":"2011.13476","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-26T21:04:41Z","cross_cats_sorted":[],"title_canon_sha256":"d22760b0ddde969e9633ad23ee65efb5ce88ca5b77619c68f351fd2e3ecd77e0","abstract_canon_sha256":"ee7c570e25d3ec3493b34873503a15620cf75e3184db2fb84944d5c06927dfdd"},"schema_version":"1.0"},"canonical_sha256":"41171321172892bc95b85462fab7334d26afb4cf2ac3e73aeb578996245a8bfb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:54:54.599440Z","signature_b64":"ooD/Mt1pF6B6oCYz2ub+CasFOks6ME9RA8pOGUeSPRfuUx6t8VXBvk/a6wd6FADFt4FimC8GVYdvllRWxoDbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41171321172892bc95b85462fab7334d26afb4cf2ac3e73aeb578996245a8bfb","last_reissued_at":"2026-07-05T01:54:54.599010Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:54:54.599010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.13476","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:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SG4uocaAy4dGrhB7I1ChzQWjf8dUUvMCNImlJPa79HBIDvISoOoRmbwLy1Y0pGblzA5b6NpSfDVGmlrQ2MSiAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:33:00.731637Z"},"content_sha256":"0e7e3db783caa2c4bd3dc69472ef96755a7cf2e42d54352b62efed6204ab431b","schema_version":"1.0","event_id":"sha256:0e7e3db783caa2c4bd3dc69472ef96755a7cf2e42d54352b62efed6204ab431b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:IELRGIIXFCJLZFNYKRRPVNZTJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Projective Clustering Approximation of Big Data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adiel Statman, Dan Feldman, Liat Rozenberg","submitted_at":"2020-11-26T21:04:41Z","abstract_excerpt":"In projective clustering we are given a set of n points in $R^d$ and wish to cluster them to a set $S$ of $k$ linear subspaces in $R^d$ according to some given distance function. An $\\eps$-coreset for this problem is a weighted (scaled) subset of the input points such that for every such possible $S$ the sum of these distances is approximated up to a factor of $(1+\\eps)$. We suggest to reduce the size of existing coresets by suggesting the first $O(\\log(m))$ approximation for the case of $m$ lines clustering in $O(ndm)$ time, compared to the existing $\\exp(m)$ solution. We then project the poi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13476","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.13476/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:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v89VFXp8jmCkLXS5WW0RkwYEuPyYCxicLsyUF7Q6pz3et1+AWopt1GrkL8+XIijdi2OisOGYC7kbSGDJibfAAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:33:00.732112Z"},"content_sha256":"3337d4c7e075a74f0bfccefb74b25979c35e7b4ae5cfde9ccf31007c1d86b5c0","schema_version":"1.0","event_id":"sha256:3337d4c7e075a74f0bfccefb74b25979c35e7b4ae5cfde9ccf31007c1d86b5c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/bundle.json","state_url":"https://pith.science/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/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-06T13:33:00Z","links":{"resolver":"https://pith.science/pith/IELRGIIXFCJLZFNYKRRPVNZTJU","bundle":"https://pith.science/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/bundle.json","state":"https://pith.science/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IELRGIIXFCJLZFNYKRRPVNZTJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:IELRGIIXFCJLZFNYKRRPVNZTJU","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":"ee7c570e25d3ec3493b34873503a15620cf75e3184db2fb84944d5c06927dfdd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-26T21:04:41Z","title_canon_sha256":"d22760b0ddde969e9633ad23ee65efb5ce88ca5b77619c68f351fd2e3ecd77e0"},"schema_version":"1.0","source":{"id":"2011.13476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.13476","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"2011.13476v1","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.13476","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"IELRGIIXFCJL","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_16","alias_value":"IELRGIIXFCJLZFNY","created_at":"2026-07-05T01:54:54Z"},{"alias_kind":"pith_short_8","alias_value":"IELRGIIX","created_at":"2026-07-05T01:54:54Z"}],"graph_snapshots":[{"event_id":"sha256:3337d4c7e075a74f0bfccefb74b25979c35e7b4ae5cfde9ccf31007c1d86b5c0","target":"graph","created_at":"2026-07-05T01:54:54Z","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.13476/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In projective clustering we are given a set of n points in $R^d$ and wish to cluster them to a set $S$ of $k$ linear subspaces in $R^d$ according to some given distance function. An $\\eps$-coreset for this problem is a weighted (scaled) subset of the input points such that for every such possible $S$ the sum of these distances is approximated up to a factor of $(1+\\eps)$. We suggest to reduce the size of existing coresets by suggesting the first $O(\\log(m))$ approximation for the case of $m$ lines clustering in $O(ndm)$ time, compared to the existing $\\exp(m)$ solution. We then project the poi","authors_text":"Adiel Statman, Dan Feldman, Liat Rozenberg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-26T21:04:41Z","title":"Faster Projective Clustering Approximation of Big Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.13476","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:0e7e3db783caa2c4bd3dc69472ef96755a7cf2e42d54352b62efed6204ab431b","target":"record","created_at":"2026-07-05T01:54:54Z","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":"ee7c570e25d3ec3493b34873503a15620cf75e3184db2fb84944d5c06927dfdd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2020-11-26T21:04:41Z","title_canon_sha256":"d22760b0ddde969e9633ad23ee65efb5ce88ca5b77619c68f351fd2e3ecd77e0"},"schema_version":"1.0","source":{"id":"2011.13476","kind":"arxiv","version":1}},"canonical_sha256":"41171321172892bc95b85462fab7334d26afb4cf2ac3e73aeb578996245a8bfb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41171321172892bc95b85462fab7334d26afb4cf2ac3e73aeb578996245a8bfb","first_computed_at":"2026-07-05T01:54:54.599010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:54:54.599010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ooD/Mt1pF6B6oCYz2ub+CasFOks6ME9RA8pOGUeSPRfuUx6t8VXBvk/a6wd6FADFt4FimC8GVYdvllRWxoDbBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:54:54.599440Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.13476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e7e3db783caa2c4bd3dc69472ef96755a7cf2e42d54352b62efed6204ab431b","sha256:3337d4c7e075a74f0bfccefb74b25979c35e7b4ae5cfde9ccf31007c1d86b5c0"],"state_sha256":"11f8ad2fa3ec42d2e17c69f2949128f82ff50a6949d59973003827b9141fa4b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEeaR0Q8GMywdNbTPMFLDBkNpais2wC3CzdP7rV59U7gqKfW2GCtkTzfdJGPkWTRIA3sYENuKzN153vwIGK9Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:33:00.735624Z","bundle_sha256":"9d1083050092464180353db6b4fed89a45eaf8c0194679e4b79a3c733736f2b8"}}