{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZSBYIARUYBKAXUMJORF2LXT6TT","short_pith_number":"pith:ZSBYIARU","schema_version":"1.0","canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","source":{"kind":"arxiv","id":"1906.05967","version":1},"attestation_state":"computed","paper":{"title":"A stochastic alternating minimizing method for sparse phase retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Jianfeng Cai, Juntao You, Xiliang Lu, Yuling Jiao","submitted_at":"2019-06-14T00:24:34Z","abstract_excerpt":"Sparse phase retrieval plays an important role in many fields of applied science and thus attracts lots of attention. In this paper, we propose a \\underline{sto}chastic alte\\underline{r}nating \\underline{m}inimizing method for \\underline{sp}arse ph\\underline{a}se \\underline{r}etrieval (\\textit{StormSpar}) algorithm which {emprically} is able to recover $n$-dimensional $s$-sparse signals from only $O(s\\,\\mathrm{log}\\, n)$ number of measurements without a desired initial value required by many existing methods. In \\textit{StormSpar}, the hard-thresholding pursuit (HTP) algorithm is employed to s"},"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":"1906.05967","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-14T00:24:34Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"b3de3b084181178d368c7739d7f5c3ca02d5f4dcb6100a76e940a05b9965d65a","abstract_canon_sha256":"bac05177ad247758f2d44500e16927f1857a772186600fa4b33b95be7f9541cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:20.169838Z","signature_b64":"uriEDNH5XlCjZqziZM6nCCR6y/r+c0SckbuyA2KMx+vfofdLN0o4f8R4PTs7bPPJupem1fb2Zzp8TRfpvZvNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","last_reissued_at":"2026-05-17T23:43:20.169167Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:20.169167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A stochastic alternating minimizing method for sparse phase retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Jianfeng Cai, Juntao You, Xiliang Lu, Yuling Jiao","submitted_at":"2019-06-14T00:24:34Z","abstract_excerpt":"Sparse phase retrieval plays an important role in many fields of applied science and thus attracts lots of attention. In this paper, we propose a \\underline{sto}chastic alte\\underline{r}nating \\underline{m}inimizing method for \\underline{sp}arse ph\\underline{a}se \\underline{r}etrieval (\\textit{StormSpar}) algorithm which {emprically} is able to recover $n$-dimensional $s$-sparse signals from only $O(s\\,\\mathrm{log}\\, n)$ number of measurements without a desired initial value required by many existing methods. In \\textit{StormSpar}, the hard-thresholding pursuit (HTP) algorithm is employed to s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05967","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1906.05967","created_at":"2026-05-17T23:43:20.169275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05967v1","created_at":"2026-05-17T23:43:20.169275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05967","created_at":"2026-05-17T23:43:20.169275+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSBYIARUYBKA","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSBYIARUYBKAXUMJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSBYIARU","created_at":"2026-05-18T12:33:33.725879+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/ZSBYIARUYBKAXUMJORF2LXT6TT","json":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT.json","graph_json":"https://pith.science/api/pith-number/ZSBYIARUYBKAXUMJORF2LXT6TT/graph.json","events_json":"https://pith.science/api/pith-number/ZSBYIARUYBKAXUMJORF2LXT6TT/events.json","paper":"https://pith.science/paper/ZSBYIARU"},"agent_actions":{"view_html":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT","download_json":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT.json","view_paper":"https://pith.science/paper/ZSBYIARU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05967&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSBYIARUYBKAXUMJORF2LXT6TT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSBYIARUYBKAXUMJORF2LXT6TT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/action/storage_attestation","attest_author":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/action/author_attestation","sign_citation":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/action/citation_signature","submit_replication":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/action/replication_record"}},"created_at":"2026-05-17T23:43:20.169275+00:00","updated_at":"2026-05-17T23:43:20.169275+00:00"}