{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H7IR4JQABRSPMAGXPIH3DLWAH5","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":"ffd5324145c28498c85b7a641bec3520c11c0b0114cebba177a9c064f1216f02","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-18T01:21:22Z","title_canon_sha256":"963e8a66e1e80138c59d2595ba7c0f9f67e3bcfacf26bd4b86389be257ac5d2f"},"schema_version":"1.0","source":{"id":"1412.5694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.5694","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.5694v2","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5694","created_at":"2026-05-18T02:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"H7IR4JQABRSP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H7IR4JQABRSPMAGX","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H7IR4JQA","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:7ceb51ce3b136b3be73566eeb1f2f2173d642acbcafc56f3d68e31a75189c076","target":"graph","created_at":"2026-05-18T02:26:58Z","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 tackle the general compressive phase retrieval problem. The problem is to recover a K-sparse complex vector of length n, $x\\in \\mathbb{C}^n$, from the magnitudes of m linear measurements, $y=|Ax|$, where $A \\in \\mathbb{C}^{m \\times n}$ can be designed, and the magnitudes are taken component-wise for vector $Ax\\in \\mathbb{C}^m$. We propose a variant of the PhaseCode algorithm, and show that, using an irregular left-degree sparse-graph code construction, the algorithm can recover almost all the K non-zero signal components using only slightly more than 4K measurements under som","authors_text":"Kangwook Lee, Kannan Ramchandran, Ramtin Pedarsani","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-18T01:21:22Z","title":"Capacity-Approaching PhaseCode for Low-Complexity Compressive Phase Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5694","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:cda7a9c0dccff5dfed7498f60abb3bbf34786febf6e7b26a733a7ce276d1f58e","target":"record","created_at":"2026-05-18T02:26:58Z","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":"ffd5324145c28498c85b7a641bec3520c11c0b0114cebba177a9c064f1216f02","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-18T01:21:22Z","title_canon_sha256":"963e8a66e1e80138c59d2595ba7c0f9f67e3bcfacf26bd4b86389be257ac5d2f"},"schema_version":"1.0","source":{"id":"1412.5694","kind":"arxiv","version":2}},"canonical_sha256":"3fd11e26000c64f600d77a0fb1aec03f468a405ffd5f00fb9319356c6b8ee9bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fd11e26000c64f600d77a0fb1aec03f468a405ffd5f00fb9319356c6b8ee9bb","first_computed_at":"2026-05-18T02:26:58.618161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:58.618161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaJcLcurSsD/Utj3phP64vbxjbQ0m3LomFTmNkisbqkoPfqKfBRgahZAzyGKm+aEleBCueJqBXjye5sM0DEjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:58.618633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.5694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cda7a9c0dccff5dfed7498f60abb3bbf34786febf6e7b26a733a7ce276d1f58e","sha256:7ceb51ce3b136b3be73566eeb1f2f2173d642acbcafc56f3d68e31a75189c076"],"state_sha256":"c89d05192e2ed42b4394dd5f2c162399fe222e70d61600af5bc772f066d01d8a"}