{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:WFQRKOOPDLCCWAZSZK3WRLMTMZ","short_pith_number":"pith:WFQRKOOP","schema_version":"1.0","canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","source":{"kind":"arxiv","id":"2112.07919","version":2},"attestation_state":"computed","paper":{"title":"Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Juntao You, Xiliang Lu, Yuling Jiao","submitted_at":"2021-12-15T06:47:51Z","abstract_excerpt":"In this work we propose a nonconvex two-stage \\underline{s}tochastic \\underline{a}lternating \\underline{m}inimizing (SAM) method for sparse phase retrieval. The proposed algorithm is guaranteed to have an exact recovery from $O(s\\log n)$ samples if provided the initial guess is in a local neighbour of the ground truth. Thus, the proposed algorithm is two-stage, first we estimate a desired initial guess (e.g. via a spectral method), and then we introduce a randomized alternating minimization strategy for local refinement. Also, the hard-thresholding pursuit algorithm is employed to solve the sp"},"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":"2112.07919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-12-15T06:47:51Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"db8b4336fd2045a277fbae1e64b73549da57b775c22cb780dae2d02e4a610152","abstract_canon_sha256":"47b21c61c7494e15d8da7e42580e6342dd7d1217cfbe19cb44223960e561f644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:24.793184Z","signature_b64":"TuieRedUN/AyVNWQ0Jgl5amkWUU6v5wke+Vm/x5R4vXh6ELFnma4XxWwDveazHcE4Qlb5A9fofwjYq2JqeVbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","last_reissued_at":"2026-07-05T05:18:24.792664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:24.792664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Jian-Feng Cai, Juntao You, Xiliang Lu, Yuling Jiao","submitted_at":"2021-12-15T06:47:51Z","abstract_excerpt":"In this work we propose a nonconvex two-stage \\underline{s}tochastic \\underline{a}lternating \\underline{m}inimizing (SAM) method for sparse phase retrieval. The proposed algorithm is guaranteed to have an exact recovery from $O(s\\log n)$ samples if provided the initial guess is in a local neighbour of the ground truth. Thus, the proposed algorithm is two-stage, first we estimate a desired initial guess (e.g. via a spectral method), and then we introduce a randomized alternating minimization strategy for local refinement. Also, the hard-thresholding pursuit algorithm is employed to solve the sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07919","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.07919/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.07919","created_at":"2026-07-05T05:18:24.792731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.07919v2","created_at":"2026-07-05T05:18:24.792731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07919","created_at":"2026-07-05T05:18:24.792731+00:00"},{"alias_kind":"pith_short_12","alias_value":"WFQRKOOPDLCC","created_at":"2026-07-05T05:18:24.792731+00:00"},{"alias_kind":"pith_short_16","alias_value":"WFQRKOOPDLCCWAZS","created_at":"2026-07-05T05:18:24.792731+00:00"},{"alias_kind":"pith_short_8","alias_value":"WFQRKOOP","created_at":"2026-07-05T05:18:24.792731+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/WFQRKOOPDLCCWAZSZK3WRLMTMZ","json":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ.json","graph_json":"https://pith.science/api/pith-number/WFQRKOOPDLCCWAZSZK3WRLMTMZ/graph.json","events_json":"https://pith.science/api/pith-number/WFQRKOOPDLCCWAZSZK3WRLMTMZ/events.json","paper":"https://pith.science/paper/WFQRKOOP"},"agent_actions":{"view_html":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ","download_json":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ.json","view_paper":"https://pith.science/paper/WFQRKOOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.07919&json=true","fetch_graph":"https://pith.science/api/pith-number/WFQRKOOPDLCCWAZSZK3WRLMTMZ/graph.json","fetch_events":"https://pith.science/api/pith-number/WFQRKOOPDLCCWAZSZK3WRLMTMZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/action/storage_attestation","attest_author":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/action/author_attestation","sign_citation":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/action/citation_signature","submit_replication":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/action/replication_record"}},"created_at":"2026-07-05T05:18:24.792731+00:00","updated_at":"2026-07-05T05:18:24.792731+00:00"}