{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4EZM26TQ366APZTK76RCFOFHC6","short_pith_number":"pith:4EZM26TQ","schema_version":"1.0","canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","source":{"kind":"arxiv","id":"2410.04034","version":2},"attestation_state":"computed","paper":{"title":"GraHTP: A Provable Newton-like Algorithm for Sparse Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Juntao You, Licheng Dai, Xiliang Lu","submitted_at":"2024-10-05T05:06:36Z","abstract_excerpt":"This paper investigates the sparse phase retrieval problem, which aims to recover a sparse signal from a system of quadratic measurements. In this work, we propose a novel non-convex algorithm, termed Gradient Hard Thresholding Pursuit (GraHTP), for sparse phase retrieval with complex sensing vectors. GraHTP is theoretically provable and exhibits high efficiency, achieving a quadratic convergence rate after a finite number of iterations, while maintaining low computational complexity per iteration. Numerical experiments further demonstrate GraHTP's superior performance compared to state-of-the"},"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":"2410.04034","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-10-05T05:06:36Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"168163362a9c57e371955ed8b4186f4a3bf117f1464ae1ac7cea8243a2b99f27","abstract_canon_sha256":"9f8c369d6ff29c63ad89e2362282fadab71b1f2a333231e169897b6edcd02c95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:46.135719Z","signature_b64":"8LCJWt2Z1W+EnYqilHsi5rySHsG7Ar5cfmAVTA/mrhfITR+eJhxRWhBwUuRK5dhb5CwIGuOsptfX/j9K0Zm+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","last_reissued_at":"2026-07-05T10:14:46.135198Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:46.135198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GraHTP: A Provable Newton-like Algorithm for Sparse Phase Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Juntao You, Licheng Dai, Xiliang Lu","submitted_at":"2024-10-05T05:06:36Z","abstract_excerpt":"This paper investigates the sparse phase retrieval problem, which aims to recover a sparse signal from a system of quadratic measurements. In this work, we propose a novel non-convex algorithm, termed Gradient Hard Thresholding Pursuit (GraHTP), for sparse phase retrieval with complex sensing vectors. GraHTP is theoretically provable and exhibits high efficiency, achieving a quadratic convergence rate after a finite number of iterations, while maintaining low computational complexity per iteration. Numerical experiments further demonstrate GraHTP's superior performance compared to state-of-the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04034","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/2410.04034/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.04034","created_at":"2026-07-05T10:14:46.135263+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.04034v2","created_at":"2026-07-05T10:14:46.135263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04034","created_at":"2026-07-05T10:14:46.135263+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EZM26TQ366A","created_at":"2026-07-05T10:14:46.135263+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EZM26TQ366APZTK","created_at":"2026-07-05T10:14:46.135263+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EZM26TQ","created_at":"2026-07-05T10:14:46.135263+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07557","citing_title":"Sparse Signal Recovery From Quadratic Systems with Full-Rank Matrices","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6","json":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6.json","graph_json":"https://pith.science/api/pith-number/4EZM26TQ366APZTK76RCFOFHC6/graph.json","events_json":"https://pith.science/api/pith-number/4EZM26TQ366APZTK76RCFOFHC6/events.json","paper":"https://pith.science/paper/4EZM26TQ"},"agent_actions":{"view_html":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6","download_json":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6.json","view_paper":"https://pith.science/paper/4EZM26TQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.04034&json=true","fetch_graph":"https://pith.science/api/pith-number/4EZM26TQ366APZTK76RCFOFHC6/graph.json","fetch_events":"https://pith.science/api/pith-number/4EZM26TQ366APZTK76RCFOFHC6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/action/storage_attestation","attest_author":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/action/author_attestation","sign_citation":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/action/citation_signature","submit_replication":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/action/replication_record"}},"created_at":"2026-07-05T10:14:46.135263+00:00","updated_at":"2026-07-05T10:14:46.135263+00:00"}