{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DWD367BRXDUDV4DEKVCPAWT5BM","short_pith_number":"pith:DWD367BR","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"},"canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","source":{"kind":"arxiv","id":"1404.7203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7203","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7203v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7203","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"DWD367BRXDUD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DWD367BRXDUDV4DE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DWD367BR","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DWD367BRXDUDV4DEKVCPAWT5BM","target":"record","payload":{"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"},"canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","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"},"source_kind":"arxiv","source_id":"1404.7203","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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fnuj14LRAdABCOIaTKN29JAGmmKTg7Xviw/dwgl/YggBGkR3BrgCC328WUN8h8FzOwtP9q1MgpSlKy64vYA3DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:08.979510Z"},"content_sha256":"7b1cd89fb9c579a5fc00c67383e2367502151ce8773d5b00c19060ba5a18ca25","schema_version":"1.0","event_id":"sha256:7b1cd89fb9c579a5fc00c67383e2367502151ce8773d5b00c19060ba5a18ca25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DWD367BRXDUDV4DEKVCPAWT5BM","target":"graph","payload":{"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"},"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-18T02:52:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yzaRGPe4Hz+qBMppQeV/1DDdMLCgpXwnblEED6EPFPdPM9csm4y3lcDb1YAVqe4gAW2pEksLjUVDVRut/G3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:04:08.979857Z"},"content_sha256":"a0752d05ab4bc260750dc1a627c2c9a384f62b950ca9b15e2cbf8bd8b349c77e","schema_version":"1.0","event_id":"sha256:a0752d05ab4bc260750dc1a627c2c9a384f62b950ca9b15e2cbf8bd8b349c77e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/bundle.json","state_url":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWD367BRXDUDV4DEKVCPAWT5BM/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-02T02:04:08Z","links":{"resolver":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM","bundle":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/bundle.json","state":"https://pith.science/pith/DWD367BRXDUDV4DEKVCPAWT5BM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWD367BRXDUDV4DEKVCPAWT5BM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DWD367BRXDUDV4DEKVCPAWT5BM","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":"d77f0132afe81a235c66c3a858a428af941f07fa893804d9f42bb9a721c3b57f","cross_cats_sorted":["cs.DS","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-29T00:57:59Z","title_canon_sha256":"4b0db8270b2707f9be1f01151e4a9086fb142b6aecf6b3458b4fe4803539c28c"},"schema_version":"1.0","source":{"id":"1404.7203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7203","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7203v1","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7203","created_at":"2026-05-18T02:52:57Z"},{"alias_kind":"pith_short_12","alias_value":"DWD367BRXDUD","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DWD367BRXDUDV4DE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DWD367BR","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:a0752d05ab4bc260750dc1a627c2c9a384f62b950ca9b15e2cbf8bd8b349c77e","target":"graph","created_at":"2026-05-18T02:52:57Z","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":"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","authors_text":"Martin J. Wainwright, Mert Pilanci","cross_cats":["cs.DS","math.IT","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-29T00:57:59Z","title":"Randomized Sketches of Convex Programs with Sharp Guarantees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7203","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:7b1cd89fb9c579a5fc00c67383e2367502151ce8773d5b00c19060ba5a18ca25","target":"record","created_at":"2026-05-18T02:52:57Z","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":"d77f0132afe81a235c66c3a858a428af941f07fa893804d9f42bb9a721c3b57f","cross_cats_sorted":["cs.DS","math.IT","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-29T00:57:59Z","title_canon_sha256":"4b0db8270b2707f9be1f01151e4a9086fb142b6aecf6b3458b4fe4803539c28c"},"schema_version":"1.0","source":{"id":"1404.7203","kind":"arxiv","version":1}},"canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d87bf7c31b8e83af0645544f05a7d0b34be5618f28f198b8916c917f60f1da3","first_computed_at":"2026-05-18T02:52:57.247191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:57.247191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gl/rC1DuGpK7Xm5VB3/Da2bfM4au72XtNj0ltrlgxfRcFhzuWctyq+VH4pfEXPlcfKXxkQSaeVJQot5XPWrwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:57.247734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b1cd89fb9c579a5fc00c67383e2367502151ce8773d5b00c19060ba5a18ca25","sha256:a0752d05ab4bc260750dc1a627c2c9a384f62b950ca9b15e2cbf8bd8b349c77e"],"state_sha256":"c11fc05d5a772d10364d35c4e80a30f32e27ab566a26b8c4132002931338599d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2MrXgDIETA2pWW4BhGn6sC59ByIPbcb04Q3zEOVS/m5/U9g70w5Jzu0QeicqVTscljSsyNs4lfR2tcZaELBVDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:04:08.982292Z","bundle_sha256":"23993c13401c34b07aaa0ad71bcf0cece11e8ece2f784ec33de112adc7ddc912"}}