{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JGYYIKLPUS7MUUCDI7NKZFHT47","short_pith_number":"pith:JGYYIKLP","canonical_record":{"source":{"id":"1412.6678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-20T18:46:40Z","cross_cats_sorted":["math.CA","math.NA"],"title_canon_sha256":"0064d195de7f461b962a05ca67511c72d58f3f5942248026f290090032f399a1","abstract_canon_sha256":"f922080bbba23aa70e823ccf2c91f9e1d9c513eec91bf6b330f51d2806272db0"},"schema_version":"1.0"},"canonical_sha256":"49b184296fa4beca504347daac94f3e7cb60e815db284cfa9b144db5e0670cab","source":{"kind":"arxiv","id":"1412.6678","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6678","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6678v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6678","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"JGYYIKLPUS7M","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGYYIKLPUS7MUUCD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGYYIKLP","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JGYYIKLPUS7MUUCDI7NKZFHT47","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-20T18:46:40Z","cross_cats_sorted":["math.CA","math.NA"],"title_canon_sha256":"0064d195de7f461b962a05ca67511c72d58f3f5942248026f290090032f399a1","abstract_canon_sha256":"f922080bbba23aa70e823ccf2c91f9e1d9c513eec91bf6b330f51d2806272db0"},"schema_version":"1.0"},"canonical_sha256":"49b184296fa4beca504347daac94f3e7cb60e815db284cfa9b144db5e0670cab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:46.450945Z","signature_b64":"ih28Ngy7bXcJAPIzWAmruhN9P9PM9qy1skzXAU4X93QDspf31gkyADy72zVKsy11sT0EDK5aqYxb/EwN9b74Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49b184296fa4beca504347daac94f3e7cb60e815db284cfa9b144db5e0670cab","last_reissued_at":"2026-05-18T02:30:46.450542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:46.450542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6678","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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X55RFW/uojD1wFQqGYfFiqMZj0Ft/AgKfLO5sG8eYWlumI6oWPCrox3i8JuJP4sBkTzjNXSQALMuE0y1bFYaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:46:42.730827Z"},"content_sha256":"f216027bda3467fd21c9b3513fc927b3d86406180c86f6e5f64341763686f11a","schema_version":"1.0","event_id":"sha256:f216027bda3467fd21c9b3513fc927b3d86406180c86f6e5f64341763686f11a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JGYYIKLPUS7MUUCDI7NKZFHT47","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and error bounds for noisy phase retrieval with low-redundancy frames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA","math.NA"],"primary_cat":"math.FA","authors_text":"Bernhard G. Bodmann, Nathaniel Hammen","submitted_at":"2014-12-20T18:46:40Z","abstract_excerpt":"The main objective of this paper is to find algorithms accompanied by explicit error bounds for phase retrieval from noisy magnitudes of frame coefficients when the underlying frame has a low redundancy. We achieve these goals with frames consisting of $N=6d-3$ vectors spanning a $d$-dimensional complex Hilbert space. The two algorithms we use, phase propagation or the kernel method, are polynomial time in the dimension $d$. To ensure a successful approximate recovery, we assume that the noise is sufficiently small compared to the squared norm of the vector to be recovered. In this regime, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6678","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-18T02:30:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9lcwP6yK6rZiP55+aZEDGJ+bu3ISboWslgAQpLbbERM6BtzzOc1RFWNsiE0YbkC2KK5HzQS69ERvhqAFbhvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:46:42.731186Z"},"content_sha256":"b362948caaaf229390715d8c87c9261d16d1972d72000fa455d703c6b05836e0","schema_version":"1.0","event_id":"sha256:b362948caaaf229390715d8c87c9261d16d1972d72000fa455d703c6b05836e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/bundle.json","state_url":"https://pith.science/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/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-02T08:46:42Z","links":{"resolver":"https://pith.science/pith/JGYYIKLPUS7MUUCDI7NKZFHT47","bundle":"https://pith.science/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/bundle.json","state":"https://pith.science/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGYYIKLPUS7MUUCDI7NKZFHT47/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JGYYIKLPUS7MUUCDI7NKZFHT47","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":"f922080bbba23aa70e823ccf2c91f9e1d9c513eec91bf6b330f51d2806272db0","cross_cats_sorted":["math.CA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-20T18:46:40Z","title_canon_sha256":"0064d195de7f461b962a05ca67511c72d58f3f5942248026f290090032f399a1"},"schema_version":"1.0","source":{"id":"1412.6678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6678","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6678v1","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6678","created_at":"2026-05-18T02:30:46Z"},{"alias_kind":"pith_short_12","alias_value":"JGYYIKLPUS7M","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JGYYIKLPUS7MUUCD","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JGYYIKLP","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:b362948caaaf229390715d8c87c9261d16d1972d72000fa455d703c6b05836e0","target":"graph","created_at":"2026-05-18T02:30:46Z","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":"The main objective of this paper is to find algorithms accompanied by explicit error bounds for phase retrieval from noisy magnitudes of frame coefficients when the underlying frame has a low redundancy. We achieve these goals with frames consisting of $N=6d-3$ vectors spanning a $d$-dimensional complex Hilbert space. The two algorithms we use, phase propagation or the kernel method, are polynomial time in the dimension $d$. To ensure a successful approximate recovery, we assume that the noise is sufficiently small compared to the squared norm of the vector to be recovered. In this regime, the","authors_text":"Bernhard G. Bodmann, Nathaniel Hammen","cross_cats":["math.CA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-20T18:46:40Z","title":"Algorithms and error bounds for noisy phase retrieval with low-redundancy frames"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6678","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:f216027bda3467fd21c9b3513fc927b3d86406180c86f6e5f64341763686f11a","target":"record","created_at":"2026-05-18T02:30:46Z","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":"f922080bbba23aa70e823ccf2c91f9e1d9c513eec91bf6b330f51d2806272db0","cross_cats_sorted":["math.CA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2014-12-20T18:46:40Z","title_canon_sha256":"0064d195de7f461b962a05ca67511c72d58f3f5942248026f290090032f399a1"},"schema_version":"1.0","source":{"id":"1412.6678","kind":"arxiv","version":1}},"canonical_sha256":"49b184296fa4beca504347daac94f3e7cb60e815db284cfa9b144db5e0670cab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49b184296fa4beca504347daac94f3e7cb60e815db284cfa9b144db5e0670cab","first_computed_at":"2026-05-18T02:30:46.450542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:46.450542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ih28Ngy7bXcJAPIzWAmruhN9P9PM9qy1skzXAU4X93QDspf31gkyADy72zVKsy11sT0EDK5aqYxb/EwN9b74Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:46.450945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f216027bda3467fd21c9b3513fc927b3d86406180c86f6e5f64341763686f11a","sha256:b362948caaaf229390715d8c87c9261d16d1972d72000fa455d703c6b05836e0"],"state_sha256":"f37e1fe4b35a2e39c989343b259f6fc08c0f902e0164c26de8777b132c21fa3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"douuYNT/ICnGivOZfmLhLa1HPCZiefKvHvhRJppY7y8HnUMvs7ZpYw9OnRqcXOebGdyizXXe0aIfD3vESbjPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:46:42.733235Z","bundle_sha256":"1272af0823d295e8e5da945ba5966508562e30d9139ca6925faf6cdf7c64522f"}}