{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YOUGQULQMYBA7BAXFWGQZQJ33M","short_pith_number":"pith:YOUGQULQ","schema_version":"1.0","canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","source":{"kind":"arxiv","id":"1209.4785","version":1},"attestation_state":"computed","paper":{"title":"Sparse Signal Recovery from Quadratic Measurements via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Vladislav Voroninski, Xiaodong Li","submitted_at":"2012-09-21T11:20:27Z","abstract_excerpt":"In this paper we consider a system of quadratic equations |<z_j, x>|^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x, i.e., at most k components of x are non-zero, then by solving a convex optimization program, we can solve for x up to a multiplicative constant with high probability, provided that k <= O((m/log n)^(1/2)). On the other hand, we prove that k <= O(log n (m)^(1/2)) is necessary for a clas"},"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":"1209.4785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T11:20:27Z","cross_cats_sorted":["math.IT","math.NA"],"title_canon_sha256":"e62592f5b88e06d6854ad4dc79e2baa83fe22b766028aa5241a99b3fe19c295f","abstract_canon_sha256":"a19d276d188203bf7fe68e894dd1e8352ab47feaaaec8727b0510a5a7bbdab09"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:09.929974Z","signature_b64":"aOuJw+61R1PJZyjZzHX2e0mOxsPWupayMhUuMLusGVSyZ+Dy+wlePApCNI2mOIlonv2vDBJ4bPlCbXyYQuf5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","last_reissued_at":"2026-05-18T03:45:09.929385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:09.929385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Signal Recovery from Quadratic Measurements via Convex Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NA"],"primary_cat":"cs.IT","authors_text":"Vladislav Voroninski, Xiaodong Li","submitted_at":"2012-09-21T11:20:27Z","abstract_excerpt":"In this paper we consider a system of quadratic equations |<z_j, x>|^2 = b_j, j = 1, ..., m, where x in R^n is unknown while normal random vectors z_j in R_n and quadratic measurements b_j in R are known. The system is assumed to be underdetermined, i.e., m < n. We prove that if there exists a sparse solution x, i.e., at most k components of x are non-zero, then by solving a convex optimization program, we can solve for x up to a multiplicative constant with high probability, provided that k <= O((m/log n)^(1/2)). On the other hand, we prove that k <= O(log n (m)^(1/2)) is necessary for a clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4785","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":"1209.4785","created_at":"2026-05-18T03:45:09.929491+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.4785v1","created_at":"2026-05-18T03:45:09.929491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4785","created_at":"2026-05-18T03:45:09.929491+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOUGQULQMYBA","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOUGQULQMYBA7BAX","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOUGQULQ","created_at":"2026-05-18T12:27:27.928770+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/YOUGQULQMYBA7BAXFWGQZQJ33M","json":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M.json","graph_json":"https://pith.science/api/pith-number/YOUGQULQMYBA7BAXFWGQZQJ33M/graph.json","events_json":"https://pith.science/api/pith-number/YOUGQULQMYBA7BAXFWGQZQJ33M/events.json","paper":"https://pith.science/paper/YOUGQULQ"},"agent_actions":{"view_html":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M","download_json":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M.json","view_paper":"https://pith.science/paper/YOUGQULQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.4785&json=true","fetch_graph":"https://pith.science/api/pith-number/YOUGQULQMYBA7BAXFWGQZQJ33M/graph.json","fetch_events":"https://pith.science/api/pith-number/YOUGQULQMYBA7BAXFWGQZQJ33M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/action/storage_attestation","attest_author":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/action/author_attestation","sign_citation":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/action/citation_signature","submit_replication":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/action/replication_record"}},"created_at":"2026-05-18T03:45:09.929491+00:00","updated_at":"2026-05-18T03:45:09.929491+00:00"}