{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:642NUMSNW7C5CSAO5L6RSNKR2M","short_pith_number":"pith:642NUMSN","canonical_record":{"source":{"id":"1905.10358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T17:46:03Z","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"3e927e5267e7c3eb628c33fa058a8886625c792a6d9b2d26857de11a12b564fc","abstract_canon_sha256":"484a7e76c3ba08a6239abfbfd64bcda904838b141968cc63455acd8f16a4df9a"},"schema_version":"1.0"},"canonical_sha256":"f734da324db7c5d1480eeafd193551d32c6a02f1c4cbad3be528df6c23242bda","source":{"kind":"arxiv","id":"1905.10358","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10358","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10358v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10358","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"642NUMSNW7C5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"642NUMSNW7C5CSAO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"642NUMSN","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:642NUMSNW7C5CSAO5L6RSNKR2M","target":"record","payload":{"canonical_record":{"source":{"id":"1905.10358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T17:46:03Z","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"title_canon_sha256":"3e927e5267e7c3eb628c33fa058a8886625c792a6d9b2d26857de11a12b564fc","abstract_canon_sha256":"484a7e76c3ba08a6239abfbfd64bcda904838b141968cc63455acd8f16a4df9a"},"schema_version":"1.0"},"canonical_sha256":"f734da324db7c5d1480eeafd193551d32c6a02f1c4cbad3be528df6c23242bda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.487422Z","signature_b64":"0IkGf152HG0vhCs77tg3QHnAv7ihFCCxg9vsk1xp9Ayfm90GAYXTZVIsoe9Ybt/4HHrWyCDBHrOSizSmhjwbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f734da324db7c5d1480eeafd193551d32c6a02f1c4cbad3be528df6c23242bda","last_reissued_at":"2026-05-17T23:45:10.486681Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.486681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.10358","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4btSp8SvmxiDLQXnpAzWDN6HmTQtcdCAaTI92JX89RQ4DYpxkRwXcsW1DLzdURdNbk6DGRsO7GyXrtnQJusBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:17.615201Z"},"content_sha256":"7978571d85df4db8f5a58769e2e3e0ad39dfcb1098d4f9e67625c445385ef80a","schema_version":"1.0","event_id":"sha256:7978571d85df4db8f5a58769e2e3e0ad39dfcb1098d4f9e67625c445385ef80a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:642NUMSNW7C5CSAO5L6RSNKR2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Global Minimizers of Real Robust Phase Retrieval with Sparse Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Aleksandr Aravkin, Daiwei He, James Burke","submitted_at":"2019-05-24T17:46:03Z","abstract_excerpt":"We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input vector can be exactly recovered. The recovery problem is formulated as the minimization of the $\\ell_1$ norm of the residual.\n  The main contribution is a robust phase retrieval counterpart to the seminal paper by Candes and Tao on compressed sensing ($\\ell_1$ regression) [Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203-4215"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10358","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-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uF1x3c04QMdBQZHbDlxJqGrpRlLCz2o9Tb2b7v8JBx+Xu1bbm4mqS11ljYH4AQttqYYe8Hr+At4tCYQ5yr8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:10:17.615963Z"},"content_sha256":"61169e08c62959e007b7b5ce166d39ae75e42c1b6e47e8b1cd090ff76ba5af78","schema_version":"1.0","event_id":"sha256:61169e08c62959e007b7b5ce166d39ae75e42c1b6e47e8b1cd090ff76ba5af78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/642NUMSNW7C5CSAO5L6RSNKR2M/bundle.json","state_url":"https://pith.science/pith/642NUMSNW7C5CSAO5L6RSNKR2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/642NUMSNW7C5CSAO5L6RSNKR2M/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-06-08T19:10:17Z","links":{"resolver":"https://pith.science/pith/642NUMSNW7C5CSAO5L6RSNKR2M","bundle":"https://pith.science/pith/642NUMSNW7C5CSAO5L6RSNKR2M/bundle.json","state":"https://pith.science/pith/642NUMSNW7C5CSAO5L6RSNKR2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/642NUMSNW7C5CSAO5L6RSNKR2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:642NUMSNW7C5CSAO5L6RSNKR2M","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":"484a7e76c3ba08a6239abfbfd64bcda904838b141968cc63455acd8f16a4df9a","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T17:46:03Z","title_canon_sha256":"3e927e5267e7c3eb628c33fa058a8886625c792a6d9b2d26857de11a12b564fc"},"schema_version":"1.0","source":{"id":"1905.10358","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10358","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10358v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10358","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"642NUMSNW7C5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"642NUMSNW7C5CSAO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"642NUMSN","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:61169e08c62959e007b7b5ce166d39ae75e42c1b6e47e8b1cd090ff76ba5af78","target":"graph","created_at":"2026-05-17T23:45:10Z","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":"We study a class of real robust phase retrieval problems under a Gaussian assumption on the coding matrix when the received signal is sparsely corrupted by noise. The goal is to establish conditions on the sparsity under which the input vector can be exactly recovered. The recovery problem is formulated as the minimization of the $\\ell_1$ norm of the residual.\n  The main contribution is a robust phase retrieval counterpart to the seminal paper by Candes and Tao on compressed sensing ($\\ell_1$ regression) [Decoding by linear programming. IEEE Transactions on Information Theory, 51(12):4203-4215","authors_text":"Aleksandr Aravkin, Daiwei He, James Burke","cross_cats":["math.IT","math.OC","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T17:46:03Z","title":"On the Global Minimizers of Real Robust Phase Retrieval with Sparse Noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10358","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:7978571d85df4db8f5a58769e2e3e0ad39dfcb1098d4f9e67625c445385ef80a","target":"record","created_at":"2026-05-17T23:45:10Z","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":"484a7e76c3ba08a6239abfbfd64bcda904838b141968cc63455acd8f16a4df9a","cross_cats_sorted":["math.IT","math.OC","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-24T17:46:03Z","title_canon_sha256":"3e927e5267e7c3eb628c33fa058a8886625c792a6d9b2d26857de11a12b564fc"},"schema_version":"1.0","source":{"id":"1905.10358","kind":"arxiv","version":1}},"canonical_sha256":"f734da324db7c5d1480eeafd193551d32c6a02f1c4cbad3be528df6c23242bda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f734da324db7c5d1480eeafd193551d32c6a02f1c4cbad3be528df6c23242bda","first_computed_at":"2026-05-17T23:45:10.486681Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.486681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0IkGf152HG0vhCs77tg3QHnAv7ihFCCxg9vsk1xp9Ayfm90GAYXTZVIsoe9Ybt/4HHrWyCDBHrOSizSmhjwbBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.487422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10358","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7978571d85df4db8f5a58769e2e3e0ad39dfcb1098d4f9e67625c445385ef80a","sha256:61169e08c62959e007b7b5ce166d39ae75e42c1b6e47e8b1cd090ff76ba5af78"],"state_sha256":"25d3915578b5bb6fd0c303667f77ee5890303d3c511efff607e0c98212965b7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5eRyEqOQI1opkP/clppUj8aqfJEd3gZAhxPwBRlRkTyldSV4PmOlihAK6wnz9noVTV/V1o+71m/iOoI46fzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:10:17.619947Z","bundle_sha256":"b24849225d47ed00cb4207dcd4dbdc954a73fed24ce6dd71b4a4ab0ee21acf1c"}}