{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:WFQRKOOPDLCCWAZSZK3WRLMTMZ","short_pith_number":"pith:WFQRKOOP","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"},"canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","source":{"kind":"arxiv","id":"2112.07919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07919","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07919v2","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07919","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"WFQRKOOPDLCC","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"WFQRKOOPDLCCWAZS","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"WFQRKOOP","created_at":"2026-07-05T05:18:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:WFQRKOOPDLCCWAZSZK3WRLMTMZ","target":"record","payload":{"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"},"canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","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"},"source_kind":"arxiv","source_id":"2112.07919","source_version":2,"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-07-05T05:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS9rR+dQRrke0yuJ5u05JGMxyvnheY/OfNRPftCNZ/WlDfdSD08VdP+tOq7/v9Deh1gK28dQ4mM49EvhR55fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:05:29.498299Z"},"content_sha256":"845d756c632685b1c7317ba992f2a67c101afff10cfe0b5b3ff9f3d3bc52f6ea","schema_version":"1.0","event_id":"sha256:845d756c632685b1c7317ba992f2a67c101afff10cfe0b5b3ff9f3d3bc52f6ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:WFQRKOOPDLCCWAZSZK3WRLMTMZ","target":"graph","payload":{"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"},"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-07-05T05:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gc6hOyG5bXEwbzZ27vnmnwnyAfUdYyj4C6BkzWj2nHnJ1dNFdhkSqJUKSKzLC/tC15KViCEbFn5Wp5bLgctAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:05:29.498822Z"},"content_sha256":"6b20a07c85f37fe3780d5a055779be709f86046a34947b2a5cf003167bfd68a9","schema_version":"1.0","event_id":"sha256:6b20a07c85f37fe3780d5a055779be709f86046a34947b2a5cf003167bfd68a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/bundle.json","state_url":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/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-08-05T07:05:29Z","links":{"resolver":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ","bundle":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/bundle.json","state":"https://pith.science/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFQRKOOPDLCCWAZSZK3WRLMTMZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:WFQRKOOPDLCCWAZSZK3WRLMTMZ","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":"47b21c61c7494e15d8da7e42580e6342dd7d1217cfbe19cb44223960e561f644","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-12-15T06:47:51Z","title_canon_sha256":"db8b4336fd2045a277fbae1e64b73549da57b775c22cb780dae2d02e4a610152"},"schema_version":"1.0","source":{"id":"2112.07919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.07919","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2112.07919v2","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.07919","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"WFQRKOOPDLCC","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"WFQRKOOPDLCCWAZS","created_at":"2026-07-05T05:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"WFQRKOOP","created_at":"2026-07-05T05:18:24Z"}],"graph_snapshots":[{"event_id":"sha256:6b20a07c85f37fe3780d5a055779be709f86046a34947b2a5cf003167bfd68a9","target":"graph","created_at":"2026-07-05T05:18:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2112.07919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jian-Feng Cai, Juntao You, Xiliang Lu, Yuling Jiao","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-12-15T06:47:51Z","title":"Sample-Efficient Sparse Phase Retrieval via Stochastic Alternating Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.07919","kind":"arxiv","version":2},"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:845d756c632685b1c7317ba992f2a67c101afff10cfe0b5b3ff9f3d3bc52f6ea","target":"record","created_at":"2026-07-05T05:18:24Z","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":"47b21c61c7494e15d8da7e42580e6342dd7d1217cfbe19cb44223960e561f644","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2021-12-15T06:47:51Z","title_canon_sha256":"db8b4336fd2045a277fbae1e64b73549da57b775c22cb780dae2d02e4a610152"},"schema_version":"1.0","source":{"id":"2112.07919","kind":"arxiv","version":2}},"canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1611539cf1ac42b0332cab768ad9366786839eab9594e830ef3689354bc5b63","first_computed_at":"2026-07-05T05:18:24.792664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:24.792664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TuieRedUN/AyVNWQ0Jgl5amkWUU6v5wke+Vm/x5R4vXh6ELFnma4XxWwDveazHcE4Qlb5A9fofwjYq2JqeVbBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:24.793184Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.07919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:845d756c632685b1c7317ba992f2a67c101afff10cfe0b5b3ff9f3d3bc52f6ea","sha256:6b20a07c85f37fe3780d5a055779be709f86046a34947b2a5cf003167bfd68a9"],"state_sha256":"6dd1c70d2b64479249db62eca248f0594346db4682f23ad7a5995f2091caefa8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3S6k4qX7S6T8lPod36GAFir184f8firLZJO5wqcBzBsL7LcbMnUmPvMf00VP4WXKGR1ERMI7X+SurxTTnWhTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:05:29.502289Z","bundle_sha256":"24249f35c6bb89ec8964d65381269e21ac8b45bab6420fb2e7242efac27ad50c"}}