{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QF73JYNWAJWKUBKDK5CGJM2J3G","short_pith_number":"pith:QF73JYNW","canonical_record":{"source":{"id":"2010.10168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-20T10:03:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8e048f2b7951477f0287b3d693395ecf04ef7a8560e6da5f2942a9090a7300e1","abstract_canon_sha256":"8615f945969e4f2ea8bf6e47b9167bd66fd57bcd4a56514c6716ad4d8859d7dd"},"schema_version":"1.0"},"canonical_sha256":"817fb4e1b6026caa0543574464b349d9abdc574db11f3f07645d6f9dc21deb57","source":{"kind":"arxiv","id":"2010.10168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10168","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10168v1","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10168","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"QF73JYNWAJWK","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"QF73JYNWAJWKUBKD","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"QF73JYNW","created_at":"2026-07-05T01:44:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QF73JYNWAJWKUBKDK5CGJM2J3G","target":"record","payload":{"canonical_record":{"source":{"id":"2010.10168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-20T10:03:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8e048f2b7951477f0287b3d693395ecf04ef7a8560e6da5f2942a9090a7300e1","abstract_canon_sha256":"8615f945969e4f2ea8bf6e47b9167bd66fd57bcd4a56514c6716ad4d8859d7dd"},"schema_version":"1.0"},"canonical_sha256":"817fb4e1b6026caa0543574464b349d9abdc574db11f3f07645d6f9dc21deb57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:27.908454Z","signature_b64":"mpSBl4iMbV8T4YCFDjPnTlUoxREp97mj0XZc4ViSj1BZWATLDJMS089owmUwYzhciWYdN+0WX9bLHY4AYih/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"817fb4e1b6026caa0543574464b349d9abdc574db11f3f07645d6f9dc21deb57","last_reissued_at":"2026-07-05T01:44:27.908103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:27.908103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.10168","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-07-05T01:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OEmX7qIFlDclmnDPqpYOoXVz6kj32Xh2kFXdAM6JaL2MG+T55xdHaKKQU2LszaCsbaDMHjn555hRMfyGOl2RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:34:53.550391Z"},"content_sha256":"3c14cc6bacffb068061f5dc36f0499191cf0d6679b468cf9c8690d214ab9e04a","schema_version":"1.0","event_id":"sha256:3c14cc6bacffb068061f5dc36f0499191cf0d6679b468cf9c8690d214ab9e04a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QF73JYNWAJWKUBKDK5CGJM2J3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Continuous-Time Mirror Descent Approach to Sparse Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Fan Wu, Patrick Rebeschini","submitted_at":"2020-10-20T10:03:44Z","abstract_excerpt":"We analyze continuous-time mirror descent applied to sparse phase retrieval, which is the problem of recovering sparse signals from a set of magnitude-only measurements. We apply mirror descent to the unconstrained empirical risk minimization problem (batch setting), using the square loss and square measurements. We provide a convergence analysis of the algorithm in this non-convex setting and prove that, with the hypentropy mirror map, mirror descent recovers any $k$-sparse vector $\\mathbf{x}^\\star\\in\\mathbb{R}^n$ with minimum (in modulus) non-zero entry on the order of $\\| \\mathbf{x}^\\star \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10168","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.10168/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-05T01:44:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akbK4hJQLXKJcyF9V+UFaY0QfhqjtR/QAryboMVdsrGI2NSqeQHZ88qYX1W+M52P8FrxRufHJgriEPZ4MhFiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T18:34:53.551143Z"},"content_sha256":"65eff9ed844fa8e8ab3d4401da7497079418d97569e95e41a2a4c159f5f1e3b1","schema_version":"1.0","event_id":"sha256:65eff9ed844fa8e8ab3d4401da7497079418d97569e95e41a2a4c159f5f1e3b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/bundle.json","state_url":"https://pith.science/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/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-05T18:34:53Z","links":{"resolver":"https://pith.science/pith/QF73JYNWAJWKUBKDK5CGJM2J3G","bundle":"https://pith.science/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/bundle.json","state":"https://pith.science/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QF73JYNWAJWKUBKDK5CGJM2J3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QF73JYNWAJWKUBKDK5CGJM2J3G","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":"8615f945969e4f2ea8bf6e47b9167bd66fd57bcd4a56514c6716ad4d8859d7dd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-20T10:03:44Z","title_canon_sha256":"8e048f2b7951477f0287b3d693395ecf04ef7a8560e6da5f2942a9090a7300e1"},"schema_version":"1.0","source":{"id":"2010.10168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.10168","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"arxiv_version","alias_value":"2010.10168v1","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.10168","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_12","alias_value":"QF73JYNWAJWK","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_16","alias_value":"QF73JYNWAJWKUBKD","created_at":"2026-07-05T01:44:27Z"},{"alias_kind":"pith_short_8","alias_value":"QF73JYNW","created_at":"2026-07-05T01:44:27Z"}],"graph_snapshots":[{"event_id":"sha256:65eff9ed844fa8e8ab3d4401da7497079418d97569e95e41a2a4c159f5f1e3b1","target":"graph","created_at":"2026-07-05T01:44:27Z","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/2010.10168/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We analyze continuous-time mirror descent applied to sparse phase retrieval, which is the problem of recovering sparse signals from a set of magnitude-only measurements. We apply mirror descent to the unconstrained empirical risk minimization problem (batch setting), using the square loss and square measurements. We provide a convergence analysis of the algorithm in this non-convex setting and prove that, with the hypentropy mirror map, mirror descent recovers any $k$-sparse vector $\\mathbf{x}^\\star\\in\\mathbb{R}^n$ with minimum (in modulus) non-zero entry on the order of $\\| \\mathbf{x}^\\star \\","authors_text":"Fan Wu, Patrick Rebeschini","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-20T10:03:44Z","title":"A Continuous-Time Mirror Descent Approach to Sparse Phase Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.10168","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:3c14cc6bacffb068061f5dc36f0499191cf0d6679b468cf9c8690d214ab9e04a","target":"record","created_at":"2026-07-05T01:44:27Z","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":"8615f945969e4f2ea8bf6e47b9167bd66fd57bcd4a56514c6716ad4d8859d7dd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-10-20T10:03:44Z","title_canon_sha256":"8e048f2b7951477f0287b3d693395ecf04ef7a8560e6da5f2942a9090a7300e1"},"schema_version":"1.0","source":{"id":"2010.10168","kind":"arxiv","version":1}},"canonical_sha256":"817fb4e1b6026caa0543574464b349d9abdc574db11f3f07645d6f9dc21deb57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"817fb4e1b6026caa0543574464b349d9abdc574db11f3f07645d6f9dc21deb57","first_computed_at":"2026-07-05T01:44:27.908103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:27.908103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mpSBl4iMbV8T4YCFDjPnTlUoxREp97mj0XZc4ViSj1BZWATLDJMS089owmUwYzhciWYdN+0WX9bLHY4AYih/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:27.908454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.10168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c14cc6bacffb068061f5dc36f0499191cf0d6679b468cf9c8690d214ab9e04a","sha256:65eff9ed844fa8e8ab3d4401da7497079418d97569e95e41a2a4c159f5f1e3b1"],"state_sha256":"39f94231cd8c15ba97640e5d63f23cae1eee8791a26bcd594379738231c5f1fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uc/y56a2/XDo9F2HSzVWIMx3qDYbGvituBQ1aRSYxDLBccJCDRP1DQ5jg/Tow6W18CryL/DVVOMP0IVozVmQDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T18:34:53.559588Z","bundle_sha256":"31ebd55f26c240a8413da42444ec4f099e199eb887c53505d16d5a492d2093fd"}}