{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZSBYIARUYBKAXUMJORF2LXT6TT","short_pith_number":"pith:ZSBYIARU","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"},"canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","source":{"kind":"arxiv","id":"1906.05967","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05967","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05967v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05967","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBYIARUYBKA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBYIARUYBKAXUMJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBYIARU","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZSBYIARUYBKAXUMJORF2LXT6TT","target":"record","payload":{"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"},"canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","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"},"source_kind":"arxiv","source_id":"1906.05967","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucYEZBJXW5rXU2hFm32bfAIOe0hIr3PluDOqSqEaNJciqu73w35UL5WaTSK5Y7nlON3N3UU1ZdxKV/CJc8xbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:46:52.057761Z"},"content_sha256":"d2b60dddeb5e9141f939829c5a1fc1d6478281388d8e3fe146eed2275b87993f","schema_version":"1.0","event_id":"sha256:d2b60dddeb5e9141f939829c5a1fc1d6478281388d8e3fe146eed2275b87993f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZSBYIARUYBKAXUMJORF2LXT6TT","target":"graph","payload":{"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"},"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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7j0a9QuN4G10pI9p1N2m0HhgOQOhxE6AAXkNOtXg/XH1msA4d2F0h4PVepTYUW5aGLVQUExqFBO0AfNOITsZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:46:52.058110Z"},"content_sha256":"58fd0fdce374c7c01ffea5981dd8b6a2733878449142d5bc7757232173db408b","schema_version":"1.0","event_id":"sha256:58fd0fdce374c7c01ffea5981dd8b6a2733878449142d5bc7757232173db408b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/bundle.json","state_url":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/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-09T13:46:52Z","links":{"resolver":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT","bundle":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/bundle.json","state":"https://pith.science/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSBYIARUYBKAXUMJORF2LXT6TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZSBYIARUYBKAXUMJORF2LXT6TT","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":"bac05177ad247758f2d44500e16927f1857a772186600fa4b33b95be7f9541cc","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-14T00:24:34Z","title_canon_sha256":"b3de3b084181178d368c7739d7f5c3ca02d5f4dcb6100a76e940a05b9965d65a"},"schema_version":"1.0","source":{"id":"1906.05967","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05967","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05967v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05967","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZSBYIARUYBKA","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZSBYIARUYBKAXUMJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZSBYIARU","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:58fd0fdce374c7c01ffea5981dd8b6a2733878449142d5bc7757232173db408b","target":"graph","created_at":"2026-05-17T23:43:20Z","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":"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","authors_text":"Jianfeng Cai, Juntao You, Xiliang Lu, Yuling Jiao","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-14T00:24:34Z","title":"A stochastic alternating minimizing method for sparse phase retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05967","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:d2b60dddeb5e9141f939829c5a1fc1d6478281388d8e3fe146eed2275b87993f","target":"record","created_at":"2026-05-17T23:43:20Z","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":"bac05177ad247758f2d44500e16927f1857a772186600fa4b33b95be7f9541cc","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-14T00:24:34Z","title_canon_sha256":"b3de3b084181178d368c7739d7f5c3ca02d5f4dcb6100a76e940a05b9965d65a"},"schema_version":"1.0","source":{"id":"1906.05967","kind":"arxiv","version":1}},"canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc83840234c0540bd189744ba5de7e9cd7f0fb3636de78b0922d5249b778c1f2","first_computed_at":"2026-05-17T23:43:20.169167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:20.169167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uriEDNH5XlCjZqziZM6nCCR6y/r+c0SckbuyA2KMx+vfofdLN0o4f8R4PTs7bPPJupem1fb2Zzp8TRfpvZvNAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:20.169838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05967","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2b60dddeb5e9141f939829c5a1fc1d6478281388d8e3fe146eed2275b87993f","sha256:58fd0fdce374c7c01ffea5981dd8b6a2733878449142d5bc7757232173db408b"],"state_sha256":"98eaf7326485308e6cdebaa2257693616c37413fa5ca507ef787d2cd89f049f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UlYNutLAVBqkbHYXRjtb8xF7bgacU5ADNFUvIug31/a1ZQ7B5eFxE3R92nFf3ih4U3ciNFsHO9+qyksGn3W2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:46:52.060052Z","bundle_sha256":"806f0ce40b4eccd65bf4b8b1bddbc3482c6b799a6b8f1f0b48d60e0d8d1f1c84"}}