{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JNFOEO3HVLHYMMZEHB4YKMPWIT","short_pith_number":"pith:JNFOEO3H","canonical_record":{"source":{"id":"1803.08021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-21T17:19:41Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"3ea8c57e9532e90cd887166b2f929ddf81884b2800b5a9665bb2f185c9453ff9","abstract_canon_sha256":"24ee712e5fe7648e813ca42e18fc5525363dbfaed6ff0f09f5a3f9d587933a46"},"schema_version":"1.0"},"canonical_sha256":"4b4ae23b67aacf86332438798531f644ec7e7ede005aae8e1d3619c1a6a4e261","source":{"kind":"arxiv","id":"1803.08021","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08021","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08021v2","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08021","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"JNFOEO3HVLHY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNFOEO3HVLHYMMZE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNFOEO3H","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JNFOEO3HVLHYMMZEHB4YKMPWIT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08021","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-21T17:19:41Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"3ea8c57e9532e90cd887166b2f929ddf81884b2800b5a9665bb2f185c9453ff9","abstract_canon_sha256":"24ee712e5fe7648e813ca42e18fc5525363dbfaed6ff0f09f5a3f9d587933a46"},"schema_version":"1.0"},"canonical_sha256":"4b4ae23b67aacf86332438798531f644ec7e7ede005aae8e1d3619c1a6a4e261","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.073101Z","signature_b64":"zsQMbmTw2Jw92S6ECX41mhjkKX1fUpLWJYItbBJJWHLHfkRDLdf+3WjePm84lsAb20AkpPgR2Kywb1kFEHbEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b4ae23b67aacf86332438798531f644ec7e7ede005aae8e1d3619c1a6a4e261","last_reissued_at":"2026-05-18T00:06:25.072409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.072409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08021","source_version":2,"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:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuIqh9mkhB0/INFdA0q0N+xkVjMa0ijZaVpX3vlJC+/1dHnYjDBWPOnCD88gd0dWB4lJoSbpwRmoBL0vrg/8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:40:00.877745Z"},"content_sha256":"571e974f4e2b0629c364dd278427c938a9d3efaec7d71c8c2758810908af3f52","schema_version":"1.0","event_id":"sha256:571e974f4e2b0629c364dd278427c938a9d3efaec7d71c8c2758810908af3f52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JNFOEO3HVLHYMMZEHB4YKMPWIT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Michael W. Mahoney, Miles E. Lopes, Shusen Wang","submitted_at":"2018-03-21T17:19:41Z","abstract_excerpt":"Over the course of the past decade, a variety of randomized algorithms have been proposed for computing approximate least-squares (LS) solutions in large-scale settings. A longstanding practical issue is that, for any given input, the user rarely knows the actual error of an approximate solution (relative to the exact solution). Likewise, it is difficult for the user to know precisely how much computation is needed to achieve the desired error tolerance. Consequently, the user often appeals to worst-case error bounds that tend to offer only qualitative guidance. As a more practical alternative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08021","kind":"arxiv","version":2},"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:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cws5UxLpEQHZQarwGTD8CzjDPevVe6oFRALOGFF/wzN/1ckZy6dlmsoBBRkJXPp5sNVJQaCrY+rpJ03cWrT7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:40:00.878097Z"},"content_sha256":"90efe41b2cc8fcb7100f6cfa582316797eec9040df98f60d8a671aa466e2664b","schema_version":"1.0","event_id":"sha256:90efe41b2cc8fcb7100f6cfa582316797eec9040df98f60d8a671aa466e2664b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/bundle.json","state_url":"https://pith.science/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/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-30T07:40:00Z","links":{"resolver":"https://pith.science/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT","bundle":"https://pith.science/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/bundle.json","state":"https://pith.science/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNFOEO3HVLHYMMZEHB4YKMPWIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JNFOEO3HVLHYMMZEHB4YKMPWIT","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":"24ee712e5fe7648e813ca42e18fc5525363dbfaed6ff0f09f5a3f9d587933a46","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-21T17:19:41Z","title_canon_sha256":"3ea8c57e9532e90cd887166b2f929ddf81884b2800b5a9665bb2f185c9453ff9"},"schema_version":"1.0","source":{"id":"1803.08021","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08021","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08021v2","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08021","created_at":"2026-05-18T00:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"JNFOEO3HVLHY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JNFOEO3HVLHYMMZE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JNFOEO3H","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:90efe41b2cc8fcb7100f6cfa582316797eec9040df98f60d8a671aa466e2664b","target":"graph","created_at":"2026-05-18T00:06:25Z","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":"Over the course of the past decade, a variety of randomized algorithms have been proposed for computing approximate least-squares (LS) solutions in large-scale settings. A longstanding practical issue is that, for any given input, the user rarely knows the actual error of an approximate solution (relative to the exact solution). Likewise, it is difficult for the user to know precisely how much computation is needed to achieve the desired error tolerance. Consequently, the user often appeals to worst-case error bounds that tend to offer only qualitative guidance. As a more practical alternative","authors_text":"Michael W. Mahoney, Miles E. Lopes, Shusen Wang","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-21T17:19:41Z","title":"Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08021","kind":"arxiv","version":2},"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:571e974f4e2b0629c364dd278427c938a9d3efaec7d71c8c2758810908af3f52","target":"record","created_at":"2026-05-18T00:06:25Z","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":"24ee712e5fe7648e813ca42e18fc5525363dbfaed6ff0f09f5a3f9d587933a46","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-21T17:19:41Z","title_canon_sha256":"3ea8c57e9532e90cd887166b2f929ddf81884b2800b5a9665bb2f185c9453ff9"},"schema_version":"1.0","source":{"id":"1803.08021","kind":"arxiv","version":2}},"canonical_sha256":"4b4ae23b67aacf86332438798531f644ec7e7ede005aae8e1d3619c1a6a4e261","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b4ae23b67aacf86332438798531f644ec7e7ede005aae8e1d3619c1a6a4e261","first_computed_at":"2026-05-18T00:06:25.072409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:25.072409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zsQMbmTw2Jw92S6ECX41mhjkKX1fUpLWJYItbBJJWHLHfkRDLdf+3WjePm84lsAb20AkpPgR2Kywb1kFEHbEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:25.073101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08021","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:571e974f4e2b0629c364dd278427c938a9d3efaec7d71c8c2758810908af3f52","sha256:90efe41b2cc8fcb7100f6cfa582316797eec9040df98f60d8a671aa466e2664b"],"state_sha256":"6a55d5edcfb0dd8e7b31f4a6164cfbef7c99c0e94c9d691a49064dc50c7fa818"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/DHX/JzLFLVQcGgaz7eZeTGeAN3Sc2sfDRr9W/m9gR4FAJcYaRqtB1TJ2r9mUWXgeBcSHnUo1c7zefui1qVcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:40:00.880342Z","bundle_sha256":"bb3ae772d1033192d25a10904824c7f4cb7f323aea3b94f20a1c02032425d91f"}}