{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HPN5TC7JHEKCZY6GCGRFCPETSM","short_pith_number":"pith:HPN5TC7J","canonical_record":{"source":{"id":"1711.08426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-22T18:18:22Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"8ec07099af4559a6028f6714c71109d7773c2f11b97195f8f2a349547a9697e3","abstract_canon_sha256":"b859334bdc67393d1c80404da5fe2722234cc8bb3cf24d145d7aee9229b628a3"},"schema_version":"1.0"},"canonical_sha256":"3bdbd98be939142ce3c611a2513c93930d0b108302b48dc7e203bc54442ac181","source":{"kind":"arxiv","id":"1711.08426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08426","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08426v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08426","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"HPN5TC7JHEKC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HPN5TC7JHEKCZY6G","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HPN5TC7J","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HPN5TC7JHEKCZY6GCGRFCPETSM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-22T18:18:22Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"8ec07099af4559a6028f6714c71109d7773c2f11b97195f8f2a349547a9697e3","abstract_canon_sha256":"b859334bdc67393d1c80404da5fe2722234cc8bb3cf24d145d7aee9229b628a3"},"schema_version":"1.0"},"canonical_sha256":"3bdbd98be939142ce3c611a2513c93930d0b108302b48dc7e203bc54442ac181","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.816818Z","signature_b64":"PnhaLBAcl4lFZ7ggJFKglQFKpDKKAtCc21C/7Kicqf65dBK8nz/Fru550OQyzV2O8RzCiVsJvz4YCSUy1GRMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bdbd98be939142ce3c611a2513c93930d0b108302b48dc7e203bc54442ac181","last_reissued_at":"2026-05-18T00:29:49.816005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.816005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08426","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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8Q0GBf+FcF6MadjV5HjZ1F3I4fWdiga1V5YDmR53K/SHZAeorbVScJX/ZymlA75QXFfRJJ9WYjeYnvsMIEUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:22.528928Z"},"content_sha256":"165b8ca2282cbe885696e343b9d9720a0cca2c4389adaceed015bb7d7e117ae0","schema_version":"1.0","event_id":"sha256:165b8ca2282cbe885696e343b9d9720a0cca2c4389adaceed015bb7d7e117ae0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HPN5TC7JHEKCZY6GCGRFCPETSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Leverage Score Sampling for Faster Accelerated Regression and ERM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Aaron Sidford, Naman Agarwal, Praneeth Netrapalli, Rahul Kidambi, Sham Kakade, Yin Tat Lee","submitted_at":"2017-11-22T18:18:22Z","abstract_excerpt":"Given a matrix $\\mathbf{A}\\in\\mathbb{R}^{n\\times d}$ and a vector $b \\in\\mathbb{R}^{d}$, we show how to compute an $\\epsilon$-approximate solution to the regression problem $ \\min_{x\\in\\mathbb{R}^{d}}\\frac{1}{2} \\|\\mathbf{A} x - b\\|_{2}^{2} $ in time $ \\tilde{O} ((n+\\sqrt{d\\cdot\\kappa_{\\text{sum}}})\\cdot s\\cdot\\log\\epsilon^{-1}) $ where $\\kappa_{\\text{sum}}=\\mathrm{tr}\\left(\\mathbf{A}^{\\top}\\mathbf{A}\\right)/\\lambda_{\\min}(\\mathbf{A}^{T}\\mathbf{A})$ and $s$ is the maximum number of non-zero entries in a row of $\\mathbf{A}$. Our algorithm improves upon the previous best running time of $ \\tilde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08426","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:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgOusoadz/WambqVNd9vMZmcYmP68d3fy3FpOkapv2QvTw3B9hi4fNr6SIfAGrq/gDq73QVTY4smyRVyqDUQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:22.529544Z"},"content_sha256":"5464f6888bfc355741e40ab491a0645edea430577a1eda7fc375991f4ce1acab","schema_version":"1.0","event_id":"sha256:5464f6888bfc355741e40ab491a0645edea430577a1eda7fc375991f4ce1acab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/bundle.json","state_url":"https://pith.science/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/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-27T02:50:22Z","links":{"resolver":"https://pith.science/pith/HPN5TC7JHEKCZY6GCGRFCPETSM","bundle":"https://pith.science/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/bundle.json","state":"https://pith.science/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPN5TC7JHEKCZY6GCGRFCPETSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HPN5TC7JHEKCZY6GCGRFCPETSM","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":"b859334bdc67393d1c80404da5fe2722234cc8bb3cf24d145d7aee9229b628a3","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-22T18:18:22Z","title_canon_sha256":"8ec07099af4559a6028f6714c71109d7773c2f11b97195f8f2a349547a9697e3"},"schema_version":"1.0","source":{"id":"1711.08426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08426","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08426v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08426","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"HPN5TC7JHEKC","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HPN5TC7JHEKCZY6G","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HPN5TC7J","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:5464f6888bfc355741e40ab491a0645edea430577a1eda7fc375991f4ce1acab","target":"graph","created_at":"2026-05-18T00:29:49Z","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":"Given a matrix $\\mathbf{A}\\in\\mathbb{R}^{n\\times d}$ and a vector $b \\in\\mathbb{R}^{d}$, we show how to compute an $\\epsilon$-approximate solution to the regression problem $ \\min_{x\\in\\mathbb{R}^{d}}\\frac{1}{2} \\|\\mathbf{A} x - b\\|_{2}^{2} $ in time $ \\tilde{O} ((n+\\sqrt{d\\cdot\\kappa_{\\text{sum}}})\\cdot s\\cdot\\log\\epsilon^{-1}) $ where $\\kappa_{\\text{sum}}=\\mathrm{tr}\\left(\\mathbf{A}^{\\top}\\mathbf{A}\\right)/\\lambda_{\\min}(\\mathbf{A}^{T}\\mathbf{A})$ and $s$ is the maximum number of non-zero entries in a row of $\\mathbf{A}$. Our algorithm improves upon the previous best running time of $ \\tilde","authors_text":"Aaron Sidford, Naman Agarwal, Praneeth Netrapalli, Rahul Kidambi, Sham Kakade, Yin Tat Lee","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-22T18:18:22Z","title":"Leverage Score Sampling for Faster Accelerated Regression and ERM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08426","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:165b8ca2282cbe885696e343b9d9720a0cca2c4389adaceed015bb7d7e117ae0","target":"record","created_at":"2026-05-18T00:29:49Z","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":"b859334bdc67393d1c80404da5fe2722234cc8bb3cf24d145d7aee9229b628a3","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-22T18:18:22Z","title_canon_sha256":"8ec07099af4559a6028f6714c71109d7773c2f11b97195f8f2a349547a9697e3"},"schema_version":"1.0","source":{"id":"1711.08426","kind":"arxiv","version":1}},"canonical_sha256":"3bdbd98be939142ce3c611a2513c93930d0b108302b48dc7e203bc54442ac181","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bdbd98be939142ce3c611a2513c93930d0b108302b48dc7e203bc54442ac181","first_computed_at":"2026-05-18T00:29:49.816005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:49.816005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PnhaLBAcl4lFZ7ggJFKglQFKpDKKAtCc21C/7Kicqf65dBK8nz/Fru550OQyzV2O8RzCiVsJvz4YCSUy1GRMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:49.816818Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:165b8ca2282cbe885696e343b9d9720a0cca2c4389adaceed015bb7d7e117ae0","sha256:5464f6888bfc355741e40ab491a0645edea430577a1eda7fc375991f4ce1acab"],"state_sha256":"60b51d9e00a14583b8f9ef32d16eb15f93db9804eb4cdba17ceef37d9bf38400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwOH6nvZgaeaiehNocvpCP4Micw2zDQzCmJ8Xk5lpRSsn68w6FjOT4ubx2BZ1R6uGgVb7LWFpHiaymQjHSgGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:50:22.532755Z","bundle_sha256":"602fddc1d4c5f361c733bcd87497c053daa05406839406b40266977c0d26d9bf"}}