{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3NUV65DSA36Z7OJAXBYZ73BEXF","short_pith_number":"pith:3NUV65DS","canonical_record":{"source":{"id":"1807.09386","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-24T23:23:49Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"d9d87755860c073b1f9fd66f0f6b20b4cafa534ef9d32f85d9bb9c04e96d3de6","abstract_canon_sha256":"66ff21771925f66a4ac5414a08baadd5164700adda8df0ef9e294eecdd14765b"},"schema_version":"1.0"},"canonical_sha256":"db695f747206fd9fb920b8719fec24b975adc8b30b5c3a8c55d6ee5ac41e12de","source":{"kind":"arxiv","id":"1807.09386","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09386","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09386v7","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09386","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"3NUV65DSA36Z","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NUV65DSA36Z7OJA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NUV65DS","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3NUV65DSA36Z7OJAXBYZ73BEXF","target":"record","payload":{"canonical_record":{"source":{"id":"1807.09386","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-24T23:23:49Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"d9d87755860c073b1f9fd66f0f6b20b4cafa534ef9d32f85d9bb9c04e96d3de6","abstract_canon_sha256":"66ff21771925f66a4ac5414a08baadd5164700adda8df0ef9e294eecdd14765b"},"schema_version":"1.0"},"canonical_sha256":"db695f747206fd9fb920b8719fec24b975adc8b30b5c3a8c55d6ee5ac41e12de","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.011395Z","signature_b64":"rx5+NNqm9uYW5GS88Wes6hqpYlvmObqSffLnxXNxz/Pa+jP/CqYHiH2p3/1XeOWdNaNOKtfvhzPeh+aK2wiIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db695f747206fd9fb920b8719fec24b975adc8b30b5c3a8c55d6ee5ac41e12de","last_reissued_at":"2026-05-17T23:48:34.010893Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.010893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.09386","source_version":7,"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-17T23:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYHbztbCDHd2A022DRT0QBKJdKimnqZjc6MuxRbYARLkzZlzELZlhcrOGZP/67insT5J8430R7U9lJ17tXvrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:38.381107Z"},"content_sha256":"6da6c06aa4287f2c5bf6415f0d8a01ae41c174151e5e87f8b053f1fac0a5d604","schema_version":"1.0","event_id":"sha256:6da6c06aa4287f2c5bf6415f0d8a01ae41c174151e5e87f8b053f1fac0a5d604"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3NUV65DSA36Z7OJAXBYZ73BEXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Randomized Complexity of Minimizing a Convex Quadratic Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Max Simchowitz","submitted_at":"2018-07-24T23:23:49Z","abstract_excerpt":"Minimizing a convex, quadratic objective of the form $f_{\\mathbf{A},\\mathbf{b}}(x) := \\frac{1}{2}x^\\top \\mathbf{A} x - \\langle \\mathbf{b}, x \\rangle$ for $\\mathbf{A} \\succ 0 $ is a fundamental problem in machine learning and optimization. In this work, we prove gradient-query complexity lower bounds for minimizing convex quadratic functions which apply to both deterministic and \\emph{randomized} algorithms. Specifically, for $\\kappa > 1$, we exhibit a distribution over $(\\mathbf{A},\\mathbf{b})$ with condition number $\\mathrm{cond}(\\mathbf{A}) \\le \\kappa$, such that any \\emph{randomized} algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09386","kind":"arxiv","version":7},"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-17T23:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dotvvEYiny6DAd6wXCpILW3G9TW/lnwxi86XhMbPor44Kdceil7X1d5vvl6/Qwj8fQ0quIyVMXjAbJDCHVMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:19:38.381472Z"},"content_sha256":"4e380f0c73f48ecc30ef0968002239024a84cc4eaee6e530e54a6b49cb6add35","schema_version":"1.0","event_id":"sha256:4e380f0c73f48ecc30ef0968002239024a84cc4eaee6e530e54a6b49cb6add35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/bundle.json","state_url":"https://pith.science/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/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-11T13:19:38Z","links":{"resolver":"https://pith.science/pith/3NUV65DSA36Z7OJAXBYZ73BEXF","bundle":"https://pith.science/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/bundle.json","state":"https://pith.science/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NUV65DSA36Z7OJAXBYZ73BEXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3NUV65DSA36Z7OJAXBYZ73BEXF","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":"66ff21771925f66a4ac5414a08baadd5164700adda8df0ef9e294eecdd14765b","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-24T23:23:49Z","title_canon_sha256":"d9d87755860c073b1f9fd66f0f6b20b4cafa534ef9d32f85d9bb9c04e96d3de6"},"schema_version":"1.0","source":{"id":"1807.09386","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09386","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09386v7","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09386","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"3NUV65DSA36Z","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3NUV65DSA36Z7OJA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3NUV65DS","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:4e380f0c73f48ecc30ef0968002239024a84cc4eaee6e530e54a6b49cb6add35","target":"graph","created_at":"2026-05-17T23:48:34Z","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":"Minimizing a convex, quadratic objective of the form $f_{\\mathbf{A},\\mathbf{b}}(x) := \\frac{1}{2}x^\\top \\mathbf{A} x - \\langle \\mathbf{b}, x \\rangle$ for $\\mathbf{A} \\succ 0 $ is a fundamental problem in machine learning and optimization. In this work, we prove gradient-query complexity lower bounds for minimizing convex quadratic functions which apply to both deterministic and \\emph{randomized} algorithms. Specifically, for $\\kappa > 1$, we exhibit a distribution over $(\\mathbf{A},\\mathbf{b})$ with condition number $\\mathrm{cond}(\\mathbf{A}) \\le \\kappa$, such that any \\emph{randomized} algori","authors_text":"Max Simchowitz","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-24T23:23:49Z","title":"On the Randomized Complexity of Minimizing a Convex Quadratic Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09386","kind":"arxiv","version":7},"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:6da6c06aa4287f2c5bf6415f0d8a01ae41c174151e5e87f8b053f1fac0a5d604","target":"record","created_at":"2026-05-17T23:48:34Z","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":"66ff21771925f66a4ac5414a08baadd5164700adda8df0ef9e294eecdd14765b","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-24T23:23:49Z","title_canon_sha256":"d9d87755860c073b1f9fd66f0f6b20b4cafa534ef9d32f85d9bb9c04e96d3de6"},"schema_version":"1.0","source":{"id":"1807.09386","kind":"arxiv","version":7}},"canonical_sha256":"db695f747206fd9fb920b8719fec24b975adc8b30b5c3a8c55d6ee5ac41e12de","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db695f747206fd9fb920b8719fec24b975adc8b30b5c3a8c55d6ee5ac41e12de","first_computed_at":"2026-05-17T23:48:34.010893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:34.010893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rx5+NNqm9uYW5GS88Wes6hqpYlvmObqSffLnxXNxz/Pa+jP/CqYHiH2p3/1XeOWdNaNOKtfvhzPeh+aK2wiIAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:34.011395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09386","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da6c06aa4287f2c5bf6415f0d8a01ae41c174151e5e87f8b053f1fac0a5d604","sha256:4e380f0c73f48ecc30ef0968002239024a84cc4eaee6e530e54a6b49cb6add35"],"state_sha256":"04bce3938b59d7f6b3a31072c1b9d8f579a6e3bf862510fbf9a0150b5e833da9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OyPxvnCs47tUo50xaKdORlSfkyDaQ+4i14CA3MrVABkwOC7dwBlFfPnyvu7aBn/G36+ig64cDlbfxKoy1QYiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:19:38.383603Z","bundle_sha256":"bae13a9cde22638fd8df50a855e9364edc638fd953075a600f4f225edc6eaafe"}}