{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UEJPO3NLL7HS2HU2Q3YSIMBOXU","short_pith_number":"pith:UEJPO3NL","canonical_record":{"source":{"id":"2309.02046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T08:47:14Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"e3699a9fc4db11f3419a24a147a2f50eb4fa26c0cbdcebd5248ea28a56ecad9d","abstract_canon_sha256":"3c47f13961060a9e868bee8319fa325d8f3a58a7eddc7e97968c1b65f5041779"},"schema_version":"1.0"},"canonical_sha256":"a112f76dab5fcf2d1e9a86f124302ebd33cac7f4c92b99a0668af8a4b5d8b0e3","source":{"kind":"arxiv","id":"2309.02046","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02046","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02046v2","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02046","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"UEJPO3NLL7HS","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_16","alias_value":"UEJPO3NLL7HS2HU2","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_8","alias_value":"UEJPO3NL","created_at":"2026-07-05T07:57:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UEJPO3NLL7HS2HU2Q3YSIMBOXU","target":"record","payload":{"canonical_record":{"source":{"id":"2309.02046","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T08:47:14Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"e3699a9fc4db11f3419a24a147a2f50eb4fa26c0cbdcebd5248ea28a56ecad9d","abstract_canon_sha256":"3c47f13961060a9e868bee8319fa325d8f3a58a7eddc7e97968c1b65f5041779"},"schema_version":"1.0"},"canonical_sha256":"a112f76dab5fcf2d1e9a86f124302ebd33cac7f4c92b99a0668af8a4b5d8b0e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:43.406629Z","signature_b64":"MGlLnBZGT61KbwhADJMaAdgBkFDWPnrAh8wJOhLB+mVEqFZ6evvmmz2wv7kT2EGtDonC5UHwPOMWBAbRNu3tCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a112f76dab5fcf2d1e9a86f124302ebd33cac7f4c92b99a0668af8a4b5d8b0e3","last_reissued_at":"2026-07-05T07:57:43.406102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:43.406102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.02046","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-05T07:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7YE4JCIx9+j0oTTvCMXR+DoAz1CohoMParwrkqmk2qhQSgGHAVHxzyzA7eFIUNjOQIxOdbhmosGO20U4hevxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:44:08.809975Z"},"content_sha256":"c4e1d16d3753a165a367aa5d5d7786469cdb336ae18920f6749c82ad54911488","schema_version":"1.0","event_id":"sha256:c4e1d16d3753a165a367aa5d5d7786469cdb336ae18920f6749c82ad54911488"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UEJPO3NLL7HS2HU2Q3YSIMBOXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast and Provable Algorithm for Sparse Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Jian-Feng Cai, Jiaxi Ying, Ruixue Wen, Yu Long","submitted_at":"2023-09-05T08:47:14Z","abstract_excerpt":"We study the sparse phase retrieval problem, which seeks to recover a sparse signal from a limited set of magnitude-only measurements. In contrast to prevalent sparse phase retrieval algorithms that primarily use first-order methods, we propose an innovative second-order algorithm that employs a Newton-type method with hard thresholding. This algorithm overcomes the linear convergence limitations of first-order methods while preserving their hallmark per-iteration computational efficiency. We provide theoretical guarantees that our algorithm converges to the $s$-sparse ground truth signal $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02046","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/2309.02046/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-05T07:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxmaJhd36XUX91s3viCzaVVYKpyyD844bWfbQqn+eDfyvrBch9Ox4PgIGUhZ2WJoksz8y57vr6B9pb8ET5w9Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:44:08.810389Z"},"content_sha256":"4dc5f871f6a600183a22531048556a22f4f41d935a4eb0757210ee78a41e0828","schema_version":"1.0","event_id":"sha256:4dc5f871f6a600183a22531048556a22f4f41d935a4eb0757210ee78a41e0828"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/bundle.json","state_url":"https://pith.science/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/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-05T11:44:08Z","links":{"resolver":"https://pith.science/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU","bundle":"https://pith.science/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/bundle.json","state":"https://pith.science/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEJPO3NLL7HS2HU2Q3YSIMBOXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UEJPO3NLL7HS2HU2Q3YSIMBOXU","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":"3c47f13961060a9e868bee8319fa325d8f3a58a7eddc7e97968c1b65f5041779","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T08:47:14Z","title_canon_sha256":"e3699a9fc4db11f3419a24a147a2f50eb4fa26c0cbdcebd5248ea28a56ecad9d"},"schema_version":"1.0","source":{"id":"2309.02046","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02046","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02046v2","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02046","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"UEJPO3NLL7HS","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_16","alias_value":"UEJPO3NLL7HS2HU2","created_at":"2026-07-05T07:57:43Z"},{"alias_kind":"pith_short_8","alias_value":"UEJPO3NL","created_at":"2026-07-05T07:57:43Z"}],"graph_snapshots":[{"event_id":"sha256:4dc5f871f6a600183a22531048556a22f4f41d935a4eb0757210ee78a41e0828","target":"graph","created_at":"2026-07-05T07:57:43Z","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/2309.02046/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the sparse phase retrieval problem, which seeks to recover a sparse signal from a limited set of magnitude-only measurements. In contrast to prevalent sparse phase retrieval algorithms that primarily use first-order methods, we propose an innovative second-order algorithm that employs a Newton-type method with hard thresholding. This algorithm overcomes the linear convergence limitations of first-order methods while preserving their hallmark per-iteration computational efficiency. We provide theoretical guarantees that our algorithm converges to the $s$-sparse ground truth signal $\\ma","authors_text":"Jian-Feng Cai, Jiaxi Ying, Ruixue Wen, Yu Long","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T08:47:14Z","title":"A Fast and Provable Algorithm for Sparse Phase Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02046","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:c4e1d16d3753a165a367aa5d5d7786469cdb336ae18920f6749c82ad54911488","target":"record","created_at":"2026-07-05T07:57:43Z","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":"3c47f13961060a9e868bee8319fa325d8f3a58a7eddc7e97968c1b65f5041779","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-09-05T08:47:14Z","title_canon_sha256":"e3699a9fc4db11f3419a24a147a2f50eb4fa26c0cbdcebd5248ea28a56ecad9d"},"schema_version":"1.0","source":{"id":"2309.02046","kind":"arxiv","version":2}},"canonical_sha256":"a112f76dab5fcf2d1e9a86f124302ebd33cac7f4c92b99a0668af8a4b5d8b0e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a112f76dab5fcf2d1e9a86f124302ebd33cac7f4c92b99a0668af8a4b5d8b0e3","first_computed_at":"2026-07-05T07:57:43.406102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:57:43.406102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGlLnBZGT61KbwhADJMaAdgBkFDWPnrAh8wJOhLB+mVEqFZ6evvmmz2wv7kT2EGtDonC5UHwPOMWBAbRNu3tCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:57:43.406629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.02046","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4e1d16d3753a165a367aa5d5d7786469cdb336ae18920f6749c82ad54911488","sha256:4dc5f871f6a600183a22531048556a22f4f41d935a4eb0757210ee78a41e0828"],"state_sha256":"cf3eb75ed963e736e60757bd150cc8999c07847afce1205c137bcb659cb56a88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fCdedwD/tsuOcoViyunm+PuSoffTpgHLGysfPQTw9m01QHJcrkyOdQMzF6GaT0xRTqddMksA5YFfTYErQepeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:44:08.813764Z","bundle_sha256":"60e02b025bb702d92aa08dfa67e6da666535e8444edc11b9ba22c9782231c871"}}