{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UYBUEOTHYL6SXQCTIPZRAUC47L","short_pith_number":"pith:UYBUEOTH","schema_version":"1.0","canonical_sha256":"a603423a67c2fd2bc05343f310505cfaef981a0bc6abc75cf63da017e78ab68a","source":{"kind":"arxiv","id":"1312.0641","version":2},"attestation_state":"computed","paper":{"title":"Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Christos Thrampoulidis, Samet Oymak","submitted_at":"2013-12-02T22:07:05Z","abstract_excerpt":"This paper considers the linear inverse problem where we wish to estimate a structured signal $x$ from its corrupted observations. When the problem is ill-posed, it is natural to make use of a convex function $f(\\cdot)$ that exploits the structure of the signal. For example, $\\ell_1$ norm can be used for sparse signals. To carry out the estimation, we consider two well-known convex programs: 1) Second order cone program (SOCP), and, 2) Lasso. Assuming Gaussian measurements, we show that, if precise information about the value $f(x)$ or the $\\ell_2$-norm of the noise is available, one can do a "},"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":"1312.0641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-02T22:07:05Z","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"519e2b047bc5ef1bc7dd433bad7890f53573355c0f1b60df19cdd58311769071","abstract_canon_sha256":"794ca1889a0f7b0f794fbec77b3a6adfc6a1766835758a7d05752fc74d5e443f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.643667Z","signature_b64":"fR5lCc2AeesUujwRplcL9x/fjeYvwqH3FJZqxxS0LP3fSINiK9+Y9bF+Cuq5aaO2le7O2xGBIphGOkCklrUYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a603423a67c2fd2bc05343f310505cfaef981a0bc6abc75cf63da017e78ab68a","last_reissued_at":"2026-05-18T03:05:27.643084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.643084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Bounds for Noisy Linear Inverse Problems with Exact Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Babak Hassibi, Christos Thrampoulidis, Samet Oymak","submitted_at":"2013-12-02T22:07:05Z","abstract_excerpt":"This paper considers the linear inverse problem where we wish to estimate a structured signal $x$ from its corrupted observations. When the problem is ill-posed, it is natural to make use of a convex function $f(\\cdot)$ that exploits the structure of the signal. For example, $\\ell_1$ norm can be used for sparse signals. To carry out the estimation, we consider two well-known convex programs: 1) Second order cone program (SOCP), and, 2) Lasso. Assuming Gaussian measurements, we show that, if precise information about the value $f(x)$ or the $\\ell_2$-norm of the noise is available, one can do a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0641","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0641","created_at":"2026-05-18T03:05:27.643181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0641v2","created_at":"2026-05-18T03:05:27.643181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0641","created_at":"2026-05-18T03:05:27.643181+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYBUEOTHYL6S","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYBUEOTHYL6SXQCT","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYBUEOTH","created_at":"2026-05-18T12:28:02.375192+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/UYBUEOTHYL6SXQCTIPZRAUC47L","json":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L.json","graph_json":"https://pith.science/api/pith-number/UYBUEOTHYL6SXQCTIPZRAUC47L/graph.json","events_json":"https://pith.science/api/pith-number/UYBUEOTHYL6SXQCTIPZRAUC47L/events.json","paper":"https://pith.science/paper/UYBUEOTH"},"agent_actions":{"view_html":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L","download_json":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L.json","view_paper":"https://pith.science/paper/UYBUEOTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0641&json=true","fetch_graph":"https://pith.science/api/pith-number/UYBUEOTHYL6SXQCTIPZRAUC47L/graph.json","fetch_events":"https://pith.science/api/pith-number/UYBUEOTHYL6SXQCTIPZRAUC47L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L/action/storage_attestation","attest_author":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L/action/author_attestation","sign_citation":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L/action/citation_signature","submit_replication":"https://pith.science/pith/UYBUEOTHYL6SXQCTIPZRAUC47L/action/replication_record"}},"created_at":"2026-05-18T03:05:27.643181+00:00","updated_at":"2026-05-18T03:05:27.643181+00:00"}