{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4EZM26TQ366APZTK76RCFOFHC6","short_pith_number":"pith:4EZM26TQ","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"},"canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","source":{"kind":"arxiv","id":"2410.04034","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04034","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04034v2","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04034","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"4EZM26TQ366A","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_16","alias_value":"4EZM26TQ366APZTK","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_8","alias_value":"4EZM26TQ","created_at":"2026-07-05T10:14:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4EZM26TQ366APZTK76RCFOFHC6","target":"record","payload":{"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"},"canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","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"},"source_kind":"arxiv","source_id":"2410.04034","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-05T10:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"He+m8sxvIZfQTa0nIKbvV4dIB4ESYyY9q5oP4c16b/Te6LJ34UISP7vBQ3/3PGgu7I9pmlsvaXJdZ+6V+PRzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:40:50.160061Z"},"content_sha256":"cd3e22f7a088c8173d463ccf86e06d82b1039ed3963002299f9dca767721c169","schema_version":"1.0","event_id":"sha256:cd3e22f7a088c8173d463ccf86e06d82b1039ed3963002299f9dca767721c169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4EZM26TQ366APZTK76RCFOFHC6","target":"graph","payload":{"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"},"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-05T10:14:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNzA39NVqxfQNqmIH5/U4TNTZNEceBp4ohs/XSlti/aqa4jO+GHTkwDwmGQ6hg7bWX5PIKKkDxExNmHqzRC1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:40:50.160577Z"},"content_sha256":"7127ed84a3acc19de37485cdf2b32b6144540e5927d4cba1a60b20e35ea80c3e","schema_version":"1.0","event_id":"sha256:7127ed84a3acc19de37485cdf2b32b6144540e5927d4cba1a60b20e35ea80c3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/bundle.json","state_url":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EZM26TQ366APZTK76RCFOFHC6/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-07T05:40:50Z","links":{"resolver":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6","bundle":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/bundle.json","state":"https://pith.science/pith/4EZM26TQ366APZTK76RCFOFHC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EZM26TQ366APZTK76RCFOFHC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4EZM26TQ366APZTK76RCFOFHC6","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":"9f8c369d6ff29c63ad89e2362282fadab71b1f2a333231e169897b6edcd02c95","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-10-05T05:06:36Z","title_canon_sha256":"168163362a9c57e371955ed8b4186f4a3bf117f1464ae1ac7cea8243a2b99f27"},"schema_version":"1.0","source":{"id":"2410.04034","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.04034","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"arxiv_version","alias_value":"2410.04034v2","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04034","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_12","alias_value":"4EZM26TQ366A","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_16","alias_value":"4EZM26TQ366APZTK","created_at":"2026-07-05T10:14:46Z"},{"alias_kind":"pith_short_8","alias_value":"4EZM26TQ","created_at":"2026-07-05T10:14:46Z"}],"graph_snapshots":[{"event_id":"sha256:7127ed84a3acc19de37485cdf2b32b6144540e5927d4cba1a60b20e35ea80c3e","target":"graph","created_at":"2026-07-05T10:14:46Z","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/2410.04034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Juntao You, Licheng Dai, Xiliang Lu","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-10-05T05:06:36Z","title":"GraHTP: A Provable Newton-like Algorithm for Sparse Phase Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04034","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:cd3e22f7a088c8173d463ccf86e06d82b1039ed3963002299f9dca767721c169","target":"record","created_at":"2026-07-05T10:14:46Z","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":"9f8c369d6ff29c63ad89e2362282fadab71b1f2a333231e169897b6edcd02c95","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2024-10-05T05:06:36Z","title_canon_sha256":"168163362a9c57e371955ed8b4186f4a3bf117f1464ae1ac7cea8243a2b99f27"},"schema_version":"1.0","source":{"id":"2410.04034","kind":"arxiv","version":2}},"canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e132cd7a70dfbc07e66affa222b8a7179e67d941f521638fd1c7fd343db0a1ae","first_computed_at":"2026-07-05T10:14:46.135198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:14:46.135198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8LCJWt2Z1W+EnYqilHsi5rySHsG7Ar5cfmAVTA/mrhfITR+eJhxRWhBwUuRK5dhb5CwIGuOsptfX/j9K0Zm+Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:14:46.135719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.04034","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3e22f7a088c8173d463ccf86e06d82b1039ed3963002299f9dca767721c169","sha256:7127ed84a3acc19de37485cdf2b32b6144540e5927d4cba1a60b20e35ea80c3e"],"state_sha256":"12f6f4532b5f1a7d0657c2a5f608d4e76543b23866adf469f9ec237804802369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKZhxn0yfQmG38ddUXplR7RJojgLpisGz1hM82LUfepDeH9FXZsLwstlr8+xAOtUqzAAjTvuwltrKe0yhNnHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:40:50.166423Z","bundle_sha256":"f7565e61874b76219508339326fba275494aad3c58ac3a1656c05409a6303a0d"}}