{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:YOUGQULQMYBA7BAXFWGQZQJ33M","short_pith_number":"pith:YOUGQULQ","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"},"canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","source":{"kind":"arxiv","id":"1209.4785","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4785","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4785v1","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4785","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"YOUGQULQMYBA","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YOUGQULQMYBA7BAX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YOUGQULQ","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:YOUGQULQMYBA7BAXFWGQZQJ33M","target":"record","payload":{"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"},"canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","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"},"source_kind":"arxiv","source_id":"1209.4785","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-18T03:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjMJQFoxQSfKmnwWESWntLasPI6xuwMuTGCxJca/YAa/dxLyg3SmH7XWLf286mlPtphR6GcIoNiravTBhhvjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:44:27.830775Z"},"content_sha256":"4f552741eb904bde748de88c48da31aa5060f34fda8bd6e974437c0663d313c9","schema_version":"1.0","event_id":"sha256:4f552741eb904bde748de88c48da31aa5060f34fda8bd6e974437c0663d313c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:YOUGQULQMYBA7BAXFWGQZQJ33M","target":"graph","payload":{"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"},"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-18T03:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uDE6IX8WvuBSw3+zGRznvQr0dVj9/ZG8S3z0ThTDr/oPN2L/GDgIa7Jg1DpEIW+orX++R+71S9kecm9PSzzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:44:27.831513Z"},"content_sha256":"5d66fbaaa1a3fdc201dc10e138974e162ceac5f900148ac6d671ea439aef8565","schema_version":"1.0","event_id":"sha256:5d66fbaaa1a3fdc201dc10e138974e162ceac5f900148ac6d671ea439aef8565"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/bundle.json","state_url":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/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-27T12:44:27Z","links":{"resolver":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M","bundle":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/bundle.json","state":"https://pith.science/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOUGQULQMYBA7BAXFWGQZQJ33M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YOUGQULQMYBA7BAXFWGQZQJ33M","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":"a19d276d188203bf7fe68e894dd1e8352ab47feaaaec8727b0510a5a7bbdab09","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T11:20:27Z","title_canon_sha256":"e62592f5b88e06d6854ad4dc79e2baa83fe22b766028aa5241a99b3fe19c295f"},"schema_version":"1.0","source":{"id":"1209.4785","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4785","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4785v1","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4785","created_at":"2026-05-18T03:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"YOUGQULQMYBA","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YOUGQULQMYBA7BAX","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YOUGQULQ","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:5d66fbaaa1a3fdc201dc10e138974e162ceac5f900148ac6d671ea439aef8565","target":"graph","created_at":"2026-05-18T03:45:09Z","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 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","authors_text":"Vladislav Voroninski, Xiaodong Li","cross_cats":["math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T11:20:27Z","title":"Sparse Signal Recovery from Quadratic Measurements via Convex Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4785","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:4f552741eb904bde748de88c48da31aa5060f34fda8bd6e974437c0663d313c9","target":"record","created_at":"2026-05-18T03:45:09Z","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":"a19d276d188203bf7fe68e894dd1e8352ab47feaaaec8727b0510a5a7bbdab09","cross_cats_sorted":["math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-21T11:20:27Z","title_canon_sha256":"e62592f5b88e06d6854ad4dc79e2baa83fe22b766028aa5241a99b3fe19c295f"},"schema_version":"1.0","source":{"id":"1209.4785","kind":"arxiv","version":1}},"canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3a868517066020f84172d8d0cc13bdb0e51ae9d2db5e1ebbd2dc1e394940ecf","first_computed_at":"2026-05-18T03:45:09.929385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:09.929385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aOuJw+61R1PJZyjZzHX2e0mOxsPWupayMhUuMLusGVSyZ+Dy+wlePApCNI2mOIlonv2vDBJ4bPlCbXyYQuf5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:09.929974Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4785","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f552741eb904bde748de88c48da31aa5060f34fda8bd6e974437c0663d313c9","sha256:5d66fbaaa1a3fdc201dc10e138974e162ceac5f900148ac6d671ea439aef8565"],"state_sha256":"c41875d34ed02e2a958a264f9341e1cafe51d986f9a80b090759ea28ecf6f985"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DDFHjZgCWeqml1ZJOO0NeCrMc+X62gqDP+pCbH1bzdxMmHxmeAEIE2O3Y/2hN62XVEFTb8t1W+LmSdZ/g0LpBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:44:27.835403Z","bundle_sha256":"847c0b41966ae39976d4c00c373b0c1a5bf50d314a32384b31a4c0bad04a2c83"}}