{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D57WZJFXOXJB6AMECB5NLJTG6B","short_pith_number":"pith:D57WZJFX","canonical_record":{"source":{"id":"1507.04793","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T23:03:00Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"3ff6dadfc819e91ed08f26d4b8d516b2b78deb7150dcffadfe7cf8a9ea7b524a","abstract_canon_sha256":"ffec445451a597011726d108bc880a412b76781c5baf07f90aa5e1013a7c603f"},"schema_version":"1.0"},"canonical_sha256":"1f7f6ca4b775d21f0184107ad5a666f07def253f668743ab65478261cb7e71f5","source":{"kind":"arxiv","id":"1507.04793","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04793","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04793v2","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04793","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"D57WZJFXOXJB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D57WZJFXOXJB6AME","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D57WZJFX","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D57WZJFXOXJB6AMECB5NLJTG6B","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04793","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T23:03:00Z","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"3ff6dadfc819e91ed08f26d4b8d516b2b78deb7150dcffadfe7cf8a9ea7b524a","abstract_canon_sha256":"ffec445451a597011726d108bc880a412b76781c5baf07f90aa5e1013a7c603f"},"schema_version":"1.0"},"canonical_sha256":"1f7f6ca4b775d21f0184107ad5a666f07def253f668743ab65478261cb7e71f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:23.834726Z","signature_b64":"Pcu2m0+fnNYxyQR3go/bp97pIgAigN32S8FBogoUv5TK9ZRxBljjh/jM02MGUO+s6JirjLcTRjlqbtNVaVy5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f7f6ca4b775d21f0184107ad5a666f07def253f668743ab65478261cb7e71f5","last_reissued_at":"2026-05-18T01:23:23.834051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:23.834051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04793","source_version":2,"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-18T01:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gR0s58kmG8wx4YtBP8GdrKFWLoD44x2bSwkGxXfWDkXSE7omZPVZ/O05AuCEGGNlnzcakkRxD4TRjarRUmjnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:58.605569Z"},"content_sha256":"fbbffc43186e4cdf07ac8440e6b631afcb0dcea97c47b33ad0eb679a16a5ee74","schema_version":"1.0","event_id":"sha256:fbbffc43186e4cdf07ac8440e6b631afcb0dcea97c47b33ad0eb679a16a5ee74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D57WZJFXOXJB6AMECB5NLJTG6B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp Time--Data Tradeoffs for Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Benjamin Recht, Mahdi Soltanolkotabi, Samet Oymak","submitted_at":"2015-07-16T23:03:00Z","abstract_excerpt":"In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the convergence rate associated with a wide variety of random measurement ensembles in terms of the number of measurements and structural complexity of the signal with respect to the chosen penalty function. The r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04793","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":""},"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-18T01:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Rvx9Sp22+av2Gq1EXCNmUH42SVVzTJ/vgKAQygByrKY0XFsVqdOnEwtnwFtog0VlaD21oxiApjXdhdh1iEHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:37:58.606237Z"},"content_sha256":"ebaa6592722a0ca7ae6f778cf9bd0557446aef687a53c36817bf2bac8f9315e1","schema_version":"1.0","event_id":"sha256:ebaa6592722a0ca7ae6f778cf9bd0557446aef687a53c36817bf2bac8f9315e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D57WZJFXOXJB6AMECB5NLJTG6B/bundle.json","state_url":"https://pith.science/pith/D57WZJFXOXJB6AMECB5NLJTG6B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D57WZJFXOXJB6AMECB5NLJTG6B/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-26T16:37:58Z","links":{"resolver":"https://pith.science/pith/D57WZJFXOXJB6AMECB5NLJTG6B","bundle":"https://pith.science/pith/D57WZJFXOXJB6AMECB5NLJTG6B/bundle.json","state":"https://pith.science/pith/D57WZJFXOXJB6AMECB5NLJTG6B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D57WZJFXOXJB6AMECB5NLJTG6B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D57WZJFXOXJB6AMECB5NLJTG6B","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":"ffec445451a597011726d108bc880a412b76781c5baf07f90aa5e1013a7c603f","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T23:03:00Z","title_canon_sha256":"3ff6dadfc819e91ed08f26d4b8d516b2b78deb7150dcffadfe7cf8a9ea7b524a"},"schema_version":"1.0","source":{"id":"1507.04793","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04793","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04793v2","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04793","created_at":"2026-05-18T01:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"D57WZJFXOXJB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D57WZJFXOXJB6AME","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D57WZJFX","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:ebaa6592722a0ca7ae6f778cf9bd0557446aef687a53c36817bf2bac8f9315e1","target":"graph","created_at":"2026-05-18T01:23:23Z","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":"In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the convergence rate associated with a wide variety of random measurement ensembles in terms of the number of measurements and structural complexity of the signal with respect to the chosen penalty function. The r","authors_text":"Benjamin Recht, Mahdi Soltanolkotabi, Samet Oymak","cross_cats":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T23:03:00Z","title":"Sharp Time--Data Tradeoffs for Linear Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04793","kind":"arxiv","version":2},"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:fbbffc43186e4cdf07ac8440e6b631afcb0dcea97c47b33ad0eb679a16a5ee74","target":"record","created_at":"2026-05-18T01:23:23Z","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":"ffec445451a597011726d108bc880a412b76781c5baf07f90aa5e1013a7c603f","cross_cats_sorted":["cs.LG","math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-16T23:03:00Z","title_canon_sha256":"3ff6dadfc819e91ed08f26d4b8d516b2b78deb7150dcffadfe7cf8a9ea7b524a"},"schema_version":"1.0","source":{"id":"1507.04793","kind":"arxiv","version":2}},"canonical_sha256":"1f7f6ca4b775d21f0184107ad5a666f07def253f668743ab65478261cb7e71f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f7f6ca4b775d21f0184107ad5a666f07def253f668743ab65478261cb7e71f5","first_computed_at":"2026-05-18T01:23:23.834051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:23.834051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pcu2m0+fnNYxyQR3go/bp97pIgAigN32S8FBogoUv5TK9ZRxBljjh/jM02MGUO+s6JirjLcTRjlqbtNVaVy5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:23.834726Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04793","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbbffc43186e4cdf07ac8440e6b631afcb0dcea97c47b33ad0eb679a16a5ee74","sha256:ebaa6592722a0ca7ae6f778cf9bd0557446aef687a53c36817bf2bac8f9315e1"],"state_sha256":"574dec04bd8727dc11c8452da1014d02b446042792f2c8c4df8f706d647d4d5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHhKNeOB1wzh/DwOJswQFMh9dlUhp6iTgr0AGyMpbgGYt3LDAHy8MkDrvAD4BGV6om3I8wS8sSXzOQfZgdLCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:37:58.609620Z","bundle_sha256":"577c535b994934b8d43d37d7ea3bd2693ba26012b9307d2f7245d81928526381"}}