{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FCS6UIZ2LBU54RVQQOEXUT2NZB","short_pith_number":"pith:FCS6UIZ2","schema_version":"1.0","canonical_sha256":"28a5ea233a5869de46b083897a4f4dc8731116a5789d8708fbde13375df87407","source":{"kind":"arxiv","id":"2203.15260","version":2},"attestation_state":"computed","paper":{"title":"Efficient Convex Optimization Requires Superlinear Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Sidford, Annie Marsden, Gregory Valiant, Vatsal Sharan","submitted_at":"2022-03-29T06:15:54Z","abstract_excerpt":"We show that any memory-constrained, first-order algorithm which minimizes $d$-dimensional, $1$-Lipschitz convex functions over the unit ball to $1/\\mathrm{poly}(d)$ accuracy using at most $d^{1.25 - \\delta}$ bits of memory must make at least $\\tilde{\\Omega}(d^{1 + (4/3)\\delta})$ first-order queries (for any constant $\\delta \\in [0, 1/4]$). Consequently, the performance of such memory-constrained algorithms are a polynomial factor worse than the optimal $\\tilde{O}(d)$ query bound for this problem obtained by cutting plane methods that use $\\tilde{O}(d^2)$ memory. This resolves a COLT 2019 open"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.15260","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T06:15:54Z","cross_cats_sorted":["cs.CC","cs.DS","math.OC","stat.ML"],"title_canon_sha256":"3442c8540411f32bf68d2b08c8c5a255542af3e152134d6394d9ecadd307d6d0","abstract_canon_sha256":"f85ddc3b8d76d93d390f3b200df83e97689aac7fc415a979276410a0b1d1919e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:43.859344Z","signature_b64":"BCQRtsNfim9R2KS+beEy+6TAps6PbXUNpc3ztnJ5EEWEEiygZVDs2iKgAoyQrXO4XDAidIJ89ANj4syTx0+WCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a5ea233a5869de46b083897a4f4dc8731116a5789d8708fbde13375df87407","last_reissued_at":"2026-07-05T08:47:43.858824Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:43.858824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Convex Optimization Requires Superlinear Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Sidford, Annie Marsden, Gregory Valiant, Vatsal Sharan","submitted_at":"2022-03-29T06:15:54Z","abstract_excerpt":"We show that any memory-constrained, first-order algorithm which minimizes $d$-dimensional, $1$-Lipschitz convex functions over the unit ball to $1/\\mathrm{poly}(d)$ accuracy using at most $d^{1.25 - \\delta}$ bits of memory must make at least $\\tilde{\\Omega}(d^{1 + (4/3)\\delta})$ first-order queries (for any constant $\\delta \\in [0, 1/4]$). Consequently, the performance of such memory-constrained algorithms are a polynomial factor worse than the optimal $\\tilde{O}(d)$ query bound for this problem obtained by cutting plane methods that use $\\tilde{O}(d^2)$ memory. This resolves a COLT 2019 open"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15260","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.15260/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.15260","created_at":"2026-07-05T08:47:43.858882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.15260v2","created_at":"2026-07-05T08:47:43.858882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15260","created_at":"2026-07-05T08:47:43.858882+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCS6UIZ2LBU5","created_at":"2026-07-05T08:47:43.858882+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCS6UIZ2LBU54RVQ","created_at":"2026-07-05T08:47:43.858882+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCS6UIZ2","created_at":"2026-07-05T08:47:43.858882+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB","json":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB.json","graph_json":"https://pith.science/api/pith-number/FCS6UIZ2LBU54RVQQOEXUT2NZB/graph.json","events_json":"https://pith.science/api/pith-number/FCS6UIZ2LBU54RVQQOEXUT2NZB/events.json","paper":"https://pith.science/paper/FCS6UIZ2"},"agent_actions":{"view_html":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB","download_json":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB.json","view_paper":"https://pith.science/paper/FCS6UIZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.15260&json=true","fetch_graph":"https://pith.science/api/pith-number/FCS6UIZ2LBU54RVQQOEXUT2NZB/graph.json","fetch_events":"https://pith.science/api/pith-number/FCS6UIZ2LBU54RVQQOEXUT2NZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB/action/storage_attestation","attest_author":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB/action/author_attestation","sign_citation":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB/action/citation_signature","submit_replication":"https://pith.science/pith/FCS6UIZ2LBU54RVQQOEXUT2NZB/action/replication_record"}},"created_at":"2026-07-05T08:47:43.858882+00:00","updated_at":"2026-07-05T08:47:43.858882+00:00"}