{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:HMMQDERDWZ2VEA2HPR55OH3UFY","short_pith_number":"pith:HMMQDERD","canonical_record":{"source":{"id":"0710.1435","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"411a15729d5d73eb804705d00de1d44b5dc2d8092989af04a49de5ed10aadb79","abstract_canon_sha256":"434850cefdfd7233c065534a5c7c435bdbb7db9b8ada9f9b197e461e681c03d1"},"schema_version":"1.0"},"canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","source":{"kind":"arxiv","id":"0710.1435","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1435","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1435v4","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1435","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMMQDERDWZ2V","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"HMMQDERDWZ2VEA2H","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"HMMQDERD","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:HMMQDERDWZ2VEA2HPR55OH3UFY","target":"record","payload":{"canonical_record":{"source":{"id":"0710.1435","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","cross_cats_sorted":[],"title_canon_sha256":"411a15729d5d73eb804705d00de1d44b5dc2d8092989af04a49de5ed10aadb79","abstract_canon_sha256":"434850cefdfd7233c065534a5c7c435bdbb7db9b8ada9f9b197e461e681c03d1"},"schema_version":"1.0"},"canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:20.871690Z","signature_b64":"0kx+B4xGYl9A9Ocd4H0k/TXm/ArF9B4KIlxn90ebrH0Gq0fSewiBeFA9d+H2NgakpGWysBFG0CCgQ/VXuSgEAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","last_reissued_at":"2026-05-18T04:40:20.871184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:20.871184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0710.1435","source_version":4,"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-18T04:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/dMd4E+DFFw5j8SqUWFLC2676g6SF5kNmL4JoUndYeZp6nMwdaDAt/Xs2+kZSWSODDw0Vq7g/AdH+MoIyNyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:16:32.279972Z"},"content_sha256":"14f3246d0287ba324505c1c1554ef740ec0635d7643da8f225320266efc86231","schema_version":"1.0","event_id":"sha256:14f3246d0287ba324505c1c1554ef740ec0635d7643da8f225320266efc86231"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:HMMQDERDWZ2VEA2HPR55OH3UFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Least Squares Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan, Tamas Sarlos","submitted_at":"2007-10-07T17:37:37Z","abstract_excerpt":"Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \\gg d$. Then, existing exact methods find a solution vector in $O(nd^2)$ time. We present two randomized algorithms that provide very accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1435","kind":"arxiv","version":4},"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-18T04:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9YVNXvnk3JovCmXkPQORK3ITxn5fKQgcEOhcdZfpaBBG1t1NmbIcCwa4Lo5MRH6dz7B6Q1qcFMLA/ORI4EIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T23:16:32.280358Z"},"content_sha256":"f2280fa3f295dbbe57705f65a94ffb228354c96bc55ce4205f55fd930384f07a","schema_version":"1.0","event_id":"sha256:f2280fa3f295dbbe57705f65a94ffb228354c96bc55ce4205f55fd930384f07a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/bundle.json","state_url":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/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-06-03T23:16:32Z","links":{"resolver":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY","bundle":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/bundle.json","state":"https://pith.science/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMMQDERDWZ2VEA2HPR55OH3UFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:HMMQDERDWZ2VEA2HPR55OH3UFY","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":"434850cefdfd7233c065534a5c7c435bdbb7db9b8ada9f9b197e461e681c03d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","title_canon_sha256":"411a15729d5d73eb804705d00de1d44b5dc2d8092989af04a49de5ed10aadb79"},"schema_version":"1.0","source":{"id":"0710.1435","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0710.1435","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"0710.1435v4","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0710.1435","created_at":"2026-05-18T04:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"HMMQDERDWZ2V","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"HMMQDERDWZ2VEA2H","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"HMMQDERD","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:f2280fa3f295dbbe57705f65a94ffb228354c96bc55ce4205f55fd930384f07a","target":"graph","created_at":"2026-05-18T04:40:20Z","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":"Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets $n$ be the number of constraints and $d$ be the number of variables, with $n \\gg d$. Then, existing exact methods find a solution vector in $O(nd^2)$ time. We present two randomized algorithms that provide very accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the R","authors_text":"Michael W. Mahoney, Petros Drineas, S. Muthukrishnan, Tamas Sarlos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","title":"Faster Least Squares Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0710.1435","kind":"arxiv","version":4},"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:14f3246d0287ba324505c1c1554ef740ec0635d7643da8f225320266efc86231","target":"record","created_at":"2026-05-18T04:40:20Z","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":"434850cefdfd7233c065534a5c7c435bdbb7db9b8ada9f9b197e461e681c03d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-10-07T17:37:37Z","title_canon_sha256":"411a15729d5d73eb804705d00de1d44b5dc2d8092989af04a49de5ed10aadb79"},"schema_version":"1.0","source":{"id":"0710.1435","kind":"arxiv","version":4}},"canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b19019223b6755203477c7bd71f742e35d9443fa69382694623b5ab4654b38d","first_computed_at":"2026-05-18T04:40:20.871184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:20.871184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0kx+B4xGYl9A9Ocd4H0k/TXm/ArF9B4KIlxn90ebrH0Gq0fSewiBeFA9d+H2NgakpGWysBFG0CCgQ/VXuSgEAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:20.871690Z","signed_message":"canonical_sha256_bytes"},"source_id":"0710.1435","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14f3246d0287ba324505c1c1554ef740ec0635d7643da8f225320266efc86231","sha256:f2280fa3f295dbbe57705f65a94ffb228354c96bc55ce4205f55fd930384f07a"],"state_sha256":"9ff6d2940f0fd665f9b32d08f4c0a1f8bec7b5150328647d21865f2da8d5dd2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlhXFceFctWeBYuYNJh9ssrqhf308l9JMkn9RsYTKQQFnJdEmZcXV0ova6i54OXJUxgiJLilVNWA1v1oSuhWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T23:16:32.282349Z","bundle_sha256":"7d496c0b8295e27351dfbe5c6b1b1020c8e4c29de69359e89fc589c3c88ab40c"}}