{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","short_pith_number":"pith:RMM6LBGQ","schema_version":"1.0","canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","source":{"kind":"arxiv","id":"1606.00531","version":1},"attestation_state":"computed","paper":{"title":"Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Yin, Kangwook Lee, Kannan Ramchandran, Ramtin Pedarsani","submitted_at":"2016-06-02T03:52:06Z","abstract_excerpt":"In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a $K$-sparse complex signal $s \\in \\mathbb{C}^n$, from a set of $m$ noisy quadratic measurements: $ y_i=| a_i^H s |^2+w_i$, where $a_i^H\\in\\mathbb{C}^n$ is the $i$th row of the measurement matrix $A\\in\\mathbb{C}^{m\\times n}$, and $w_i$ is the additive noise to the $i$th measurement. We consider the regime where $K=\\beta n^\\delta$, with constants $\\beta>0$ and $\\delta\\in(0,1)$. We use the architecture of PhaseCode algorithm, and robustify it usin"},"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":"1606.00531","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-06-02T03:52:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"721fc9d255b3fccb90ce397c429a3b2dede521eab957e49c925c09b9a29d9750","abstract_canon_sha256":"aa287689b109e4ccf51c798c109f7cf72e24a1275e312e45b6c5299d68e58407"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.213780Z","signature_b64":"s7gQNn63ONQXyzuM3Do7jPFez2YoVnkMfeqqwMnewfARTO0lJPmvZYB5XcWi/hhYOrYzLo1WmyJXbA9RfcIoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","last_reissued_at":"2026-05-18T01:13:04.213406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.213406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong Yin, Kangwook Lee, Kannan Ramchandran, Ramtin Pedarsani","submitted_at":"2016-06-02T03:52:06Z","abstract_excerpt":"In this paper, we tackle the compressive phase retrieval problem in the presence of noise. The noisy compressive phase retrieval problem is to recover a $K$-sparse complex signal $s \\in \\mathbb{C}^n$, from a set of $m$ noisy quadratic measurements: $ y_i=| a_i^H s |^2+w_i$, where $a_i^H\\in\\mathbb{C}^n$ is the $i$th row of the measurement matrix $A\\in\\mathbb{C}^{m\\times n}$, and $w_i$ is the additive noise to the $i$th measurement. We consider the regime where $K=\\beta n^\\delta$, with constants $\\beta>0$ and $\\delta\\in(0,1)$. We use the architecture of PhaseCode algorithm, and robustify it usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00531","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":"1606.00531","created_at":"2026-05-18T01:13:04.213468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00531v1","created_at":"2026-05-18T01:13:04.213468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00531","created_at":"2026-05-18T01:13:04.213468+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMM6LBGQ646S","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMM6LBGQ646SQJMN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMM6LBGQ","created_at":"2026-05-18T12:30:41.710351+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/RMM6LBGQ646SQJMNZD7JUQWB57","json":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57.json","graph_json":"https://pith.science/api/pith-number/RMM6LBGQ646SQJMNZD7JUQWB57/graph.json","events_json":"https://pith.science/api/pith-number/RMM6LBGQ646SQJMNZD7JUQWB57/events.json","paper":"https://pith.science/paper/RMM6LBGQ"},"agent_actions":{"view_html":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57","download_json":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57.json","view_paper":"https://pith.science/paper/RMM6LBGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00531&json=true","fetch_graph":"https://pith.science/api/pith-number/RMM6LBGQ646SQJMNZD7JUQWB57/graph.json","fetch_events":"https://pith.science/api/pith-number/RMM6LBGQ646SQJMNZD7JUQWB57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/action/storage_attestation","attest_author":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/action/author_attestation","sign_citation":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/action/citation_signature","submit_replication":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/action/replication_record"}},"created_at":"2026-05-18T01:13:04.213468+00:00","updated_at":"2026-05-18T01:13:04.213468+00:00"}