{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DWD367BRXDUDV4DEKVCPAWT5BM","short_pith_number":"pith:DWD367BR","schema_version":"1.0","canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","source":{"kind":"arxiv","id":"1404.7203","version":1},"attestation_state":"computed","paper":{"title":"Randomized Sketches of Convex Programs with Sharp Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Martin J. Wainwright, Mert Pilanci","submitted_at":"2014-04-29T00:57:59Z","abstract_excerpt":"Random projection (RP) is a classical technique for reducing storage and computational costs. We analyze RP-based approximations of convex programs, in which the original optimization problem is approximated by the solution of a lower-dimensional problem. Such dimensionality reduction is essential in computation-limited settings, since the complexity of general convex programming can be quite high (e.g., cubic for quadratic programs, and substantially higher for semidefinite programs). In addition to computational savings, random projection is also useful for reducing memory usage, and has use"},"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":"1404.7203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-29T00:57:59Z","cross_cats_sorted":["cs.DS","math.IT","math.OC","stat.ML"],"title_canon_sha256":"4b0db8270b2707f9be1f01151e4a9086fb142b6aecf6b3458b4fe4803539c28c","abstract_canon_sha256":"d77f0132afe81a235c66c3a858a428af941f07fa893804d9f42bb9a721c3b57f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:57.247734Z","signature_b64":"gl/rC1DuGpK7Xm5VB3/Da2bfM4au72XtNj0ltrlgxfRcFhzuWctyq+VH4pfEXPlcfKXxkQSaeVJQot5XPWrwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","last_reissued_at":"2026-05-18T02:52:57.247191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:57.247191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Sketches of Convex Programs with Sharp Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT","math.OC","stat.ML"],"primary_cat":"cs.IT","authors_text":"Martin J. Wainwright, Mert Pilanci","submitted_at":"2014-04-29T00:57:59Z","abstract_excerpt":"Random projection (RP) is a classical technique for reducing storage and computational costs. We analyze RP-based approximations of convex programs, in which the original optimization problem is approximated by the solution of a lower-dimensional problem. Such dimensionality reduction is essential in computation-limited settings, since the complexity of general convex programming can be quite high (e.g., cubic for quadratic programs, and substantially higher for semidefinite programs). In addition to computational savings, random projection is also useful for reducing memory usage, and has use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7203","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1404.7203","created_at":"2026-05-18T02:52:57.247263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7203v1","created_at":"2026-05-18T02:52:57.247263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7203","created_at":"2026-05-18T02:52:57.247263+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWD367BRXDUD","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWD367BRXDUDV4DE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWD367BR","created_at":"2026-05-18T12:28:25.294606+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/DWD367BRXDUDV4DEKVCPAWT5BM","json":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM.json","graph_json":"https://pith.science/api/pith-number/DWD367BRXDUDV4DEKVCPAWT5BM/graph.json","events_json":"https://pith.science/api/pith-number/DWD367BRXDUDV4DEKVCPAWT5BM/events.json","paper":"https://pith.science/paper/DWD367BR"},"agent_actions":{"view_html":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM","download_json":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM.json","view_paper":"https://pith.science/paper/DWD367BR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7203&json=true","fetch_graph":"https://pith.science/api/pith-number/DWD367BRXDUDV4DEKVCPAWT5BM/graph.json","fetch_events":"https://pith.science/api/pith-number/DWD367BRXDUDV4DEKVCPAWT5BM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/action/storage_attestation","attest_author":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/action/author_attestation","sign_citation":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/action/citation_signature","submit_replication":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/action/replication_record"}},"created_at":"2026-05-18T02:52:57.247263+00:00","updated_at":"2026-05-18T02:52:57.247263+00:00"}