{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","short_pith_number":"pith:RMM6LBGQ","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"},"canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","source":{"kind":"arxiv","id":"1606.00531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00531","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00531v1","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00531","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"RMM6LBGQ646S","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMM6LBGQ646SQJMN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMM6LBGQ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","target":"record","payload":{"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"},"canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","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"},"source_kind":"arxiv","source_id":"1606.00531","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-18T01:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aaFmFrq97V3gKIQHpFm+5rvrnDAmRRffUPAxCsr/Rre5DyLhtH/akqGF9lX0SPlN/zImSvT882UEAm/SsDh0CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:38:52.221727Z"},"content_sha256":"dec3d0ed0a6060c62b0bd584a6ba583a2f6a1655bd4bbf69d918851e58021cfb","schema_version":"1.0","event_id":"sha256:dec3d0ed0a6060c62b0bd584a6ba583a2f6a1655bd4bbf69d918851e58021cfb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","target":"graph","payload":{"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"},"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-18T01:13:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZEFX1R/LTBJcGTxBxHADVIAw8eSoaNpRa2yz9LHa7mKAApdX9Z2+H3OHGjN0AeQUhpxDweVch3KdPoDcVdtLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:38:52.222121Z"},"content_sha256":"a4af6deca660bdecd6845f9814c95909901f9ec321fe29fbdc4317dbdb4edbcc","schema_version":"1.0","event_id":"sha256:a4af6deca660bdecd6845f9814c95909901f9ec321fe29fbdc4317dbdb4edbcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/bundle.json","state_url":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RMM6LBGQ646SQJMNZD7JUQWB57/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-21T15:38:52Z","links":{"resolver":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57","bundle":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/bundle.json","state":"https://pith.science/pith/RMM6LBGQ646SQJMNZD7JUQWB57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RMM6LBGQ646SQJMNZD7JUQWB57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RMM6LBGQ646SQJMNZD7JUQWB57","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":"aa287689b109e4ccf51c798c109f7cf72e24a1275e312e45b6c5299d68e58407","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-06-02T03:52:06Z","title_canon_sha256":"721fc9d255b3fccb90ce397c429a3b2dede521eab957e49c925c09b9a29d9750"},"schema_version":"1.0","source":{"id":"1606.00531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00531","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00531v1","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00531","created_at":"2026-05-18T01:13:04Z"},{"alias_kind":"pith_short_12","alias_value":"RMM6LBGQ646S","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RMM6LBGQ646SQJMN","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RMM6LBGQ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:a4af6deca660bdecd6845f9814c95909901f9ec321fe29fbdc4317dbdb4edbcc","target":"graph","created_at":"2026-05-18T01:13:04Z","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 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","authors_text":"Dong Yin, Kangwook Lee, Kannan Ramchandran, Ramtin Pedarsani","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-06-02T03:52:06Z","title":"Fast and Robust Compressive Phase Retrieval with Sparse-Graph Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00531","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:dec3d0ed0a6060c62b0bd584a6ba583a2f6a1655bd4bbf69d918851e58021cfb","target":"record","created_at":"2026-05-18T01:13:04Z","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":"aa287689b109e4ccf51c798c109f7cf72e24a1275e312e45b6c5299d68e58407","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-06-02T03:52:06Z","title_canon_sha256":"721fc9d255b3fccb90ce397c429a3b2dede521eab957e49c925c09b9a29d9750"},"schema_version":"1.0","source":{"id":"1606.00531","kind":"arxiv","version":1}},"canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b19e584d0f73d28258dc8fe9a42c1efff54f16dffe5c57b943c37ec01f863b8","first_computed_at":"2026-05-18T01:13:04.213406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:04.213406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s7gQNn63ONQXyzuM3Do7jPFez2YoVnkMfeqqwMnewfARTO0lJPmvZYB5XcWi/hhYOrYzLo1WmyJXbA9RfcIoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:04.213780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec3d0ed0a6060c62b0bd584a6ba583a2f6a1655bd4bbf69d918851e58021cfb","sha256:a4af6deca660bdecd6845f9814c95909901f9ec321fe29fbdc4317dbdb4edbcc"],"state_sha256":"66bdb57373fcd75023b07175e3ea3a74f1105ce3c16a7a98adb014099acf73dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHiu+6OZ56F2YtBOGN5eGQFVENUtvqEC4wz584reEXR8AZeOFD/2+PuZnigVzhDJ1I0bIMbb3Zx83Aftvjl3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:38:52.225374Z","bundle_sha256":"8317022f6d696f2c3f754ed3df983a3cced32de90606b881daefab9de1859347"}}