{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:OITLSMIMB643MGEAXOSEEF7PBD","short_pith_number":"pith:OITLSMIM","canonical_record":{"source":{"id":"2501.01801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T13:17:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fe25321ae6970b5f4c01bded1ae688b7edc9ca91c7be3cf897f75f38b40d4dfb","abstract_canon_sha256":"1fc6898d3065ab398f338c36ce4e10100b060b391e517d0a98ee23ac0b0f675f"},"schema_version":"1.0"},"canonical_sha256":"7226b9310c0fb9b61880bba44217ef08febaccd1aa5a8a295a835b9281c24aa0","source":{"kind":"arxiv","id":"2501.01801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.01801","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"2501.01801v1","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01801","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"OITLSMIMB643","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_16","alias_value":"OITLSMIMB643MGEA","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_8","alias_value":"OITLSMIM","created_at":"2026-07-05T09:56:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:OITLSMIMB643MGEAXOSEEF7PBD","target":"record","payload":{"canonical_record":{"source":{"id":"2501.01801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T13:17:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fe25321ae6970b5f4c01bded1ae688b7edc9ca91c7be3cf897f75f38b40d4dfb","abstract_canon_sha256":"1fc6898d3065ab398f338c36ce4e10100b060b391e517d0a98ee23ac0b0f675f"},"schema_version":"1.0"},"canonical_sha256":"7226b9310c0fb9b61880bba44217ef08febaccd1aa5a8a295a835b9281c24aa0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:41.186519Z","signature_b64":"1rEGKg39Mt/Og1d3/YRCJTVoJdxZATZ73kKt+mCJyD57axWGD1MGISzO0/8d8HUbWNQFzh8c5gBz308Ro8UhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7226b9310c0fb9b61880bba44217ef08febaccd1aa5a8a295a835b9281c24aa0","last_reissued_at":"2026-07-05T09:56:41.186038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:41.186038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.01801","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-05T09:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYzdEns0qXDplxwG3avuL025o7JHFrkMN70chumHTCqw8YW1rmkbJTblfUuIInIFwHI0GqQ1G503Z3ZTMCtJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:30:43.142532Z"},"content_sha256":"0f225f19338ab19e275e3f3fa4325f380515b52991fc5f24f955d0dd2231ce78","schema_version":"1.0","event_id":"sha256:0f225f19338ab19e275e3f3fa4325f380515b52991fc5f24f955d0dd2231ce78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:OITLSMIMB643MGEAXOSEEF7PBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"John Ellipsoids via Lazy Updates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Taisuke Yasuda","submitted_at":"2025-01-03T13:17:55Z","abstract_excerpt":"We give a faster algorithm for computing an approximate John ellipsoid around $n$ points in $d$ dimensions. The best known prior algorithms are based on repeatedly computing the leverage scores of the points and reweighting them by these scores [CCLY19]. We show that this algorithm can be substantially sped up by delaying the computation of high accuracy leverage scores by using sampling, and then later computing multiple batches of high accuracy leverage scores via fast rectangular matrix multiplication. We also give low-space streaming algorithms for John ellipsoids using similar ideas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01801","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/2501.01801/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-05T09:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WInqRjp4ocwhXuq74h7x9ZaFVrMtgp2nTuecQ62pxaB8yaAHYqekBLPfz9OZcqZiwdDnzu4ufdWC4GT6FBGZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T13:30:43.143660Z"},"content_sha256":"6d9f381ea80bd7351157b899056737c1ca90a5a4b6de3306e2efb8931d2afee9","schema_version":"1.0","event_id":"sha256:6d9f381ea80bd7351157b899056737c1ca90a5a4b6de3306e2efb8931d2afee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OITLSMIMB643MGEAXOSEEF7PBD/bundle.json","state_url":"https://pith.science/pith/OITLSMIMB643MGEAXOSEEF7PBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OITLSMIMB643MGEAXOSEEF7PBD/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-14T13:30:43Z","links":{"resolver":"https://pith.science/pith/OITLSMIMB643MGEAXOSEEF7PBD","bundle":"https://pith.science/pith/OITLSMIMB643MGEAXOSEEF7PBD/bundle.json","state":"https://pith.science/pith/OITLSMIMB643MGEAXOSEEF7PBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OITLSMIMB643MGEAXOSEEF7PBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:OITLSMIMB643MGEAXOSEEF7PBD","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":"1fc6898d3065ab398f338c36ce4e10100b060b391e517d0a98ee23ac0b0f675f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T13:17:55Z","title_canon_sha256":"fe25321ae6970b5f4c01bded1ae688b7edc9ca91c7be3cf897f75f38b40d4dfb"},"schema_version":"1.0","source":{"id":"2501.01801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.01801","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"2501.01801v1","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.01801","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"OITLSMIMB643","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_16","alias_value":"OITLSMIMB643MGEA","created_at":"2026-07-05T09:56:41Z"},{"alias_kind":"pith_short_8","alias_value":"OITLSMIM","created_at":"2026-07-05T09:56:41Z"}],"graph_snapshots":[{"event_id":"sha256:6d9f381ea80bd7351157b899056737c1ca90a5a4b6de3306e2efb8931d2afee9","target":"graph","created_at":"2026-07-05T09:56:41Z","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/2501.01801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a faster algorithm for computing an approximate John ellipsoid around $n$ points in $d$ dimensions. The best known prior algorithms are based on repeatedly computing the leverage scores of the points and reweighting them by these scores [CCLY19]. We show that this algorithm can be substantially sped up by delaying the computation of high accuracy leverage scores by using sampling, and then later computing multiple batches of high accuracy leverage scores via fast rectangular matrix multiplication. We also give low-space streaming algorithms for John ellipsoids using similar ideas.","authors_text":"David P. Woodruff, Taisuke Yasuda","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T13:17:55Z","title":"John Ellipsoids via Lazy Updates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.01801","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:0f225f19338ab19e275e3f3fa4325f380515b52991fc5f24f955d0dd2231ce78","target":"record","created_at":"2026-07-05T09:56:41Z","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":"1fc6898d3065ab398f338c36ce4e10100b060b391e517d0a98ee23ac0b0f675f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-01-03T13:17:55Z","title_canon_sha256":"fe25321ae6970b5f4c01bded1ae688b7edc9ca91c7be3cf897f75f38b40d4dfb"},"schema_version":"1.0","source":{"id":"2501.01801","kind":"arxiv","version":1}},"canonical_sha256":"7226b9310c0fb9b61880bba44217ef08febaccd1aa5a8a295a835b9281c24aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7226b9310c0fb9b61880bba44217ef08febaccd1aa5a8a295a835b9281c24aa0","first_computed_at":"2026-07-05T09:56:41.186038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:56:41.186038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1rEGKg39Mt/Og1d3/YRCJTVoJdxZATZ73kKt+mCJyD57axWGD1MGISzO0/8d8HUbWNQFzh8c5gBz308Ro8UhAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:56:41.186519Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.01801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f225f19338ab19e275e3f3fa4325f380515b52991fc5f24f955d0dd2231ce78","sha256:6d9f381ea80bd7351157b899056737c1ca90a5a4b6de3306e2efb8931d2afee9"],"state_sha256":"705e6df038b1920aa3109d8ff36f0b2442fdd38e2c02b9942c436c111aa600ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOmyD2Ex1qo6wIaJW4TYUiDzU6zcK5LvpB8kRTJqcINJj2AAdEHGKx5jnU7+9Vhu7xOf4VFsuAzlIvwgiH9kBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T13:30:43.149840Z","bundle_sha256":"49aff4c6cb38a1fe9ae2c87451ac2e732f669419731e71fde63de60dd7e1a5c6"}}