{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5IDS3QANUH4UXWKDCATWBDUKG3","short_pith_number":"pith:5IDS3QAN","canonical_record":{"source":{"id":"2505.23273","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"8435f446aea881f66b335eaaff8dd47705a7a6549e14c8e4c03b4128088f4b76","abstract_canon_sha256":"547dc1ed9b9b757375c2ab8dcef8dc4cf979bbdcde2a31c7bd5ae460e80e30e5"},"schema_version":"1.0"},"canonical_sha256":"ea072dc00da1f94bd9431027608e8a36dd1f8d04780a4c9068404dd63d534aa1","source":{"kind":"arxiv","id":"2505.23273","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23273","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23273v1","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23273","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"5IDS3QANUH4U","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_16","alias_value":"5IDS3QANUH4UXWKD","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_8","alias_value":"5IDS3QAN","created_at":"2026-07-05T11:11:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5IDS3QANUH4UXWKDCATWBDUKG3","target":"record","payload":{"canonical_record":{"source":{"id":"2505.23273","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"8435f446aea881f66b335eaaff8dd47705a7a6549e14c8e4c03b4128088f4b76","abstract_canon_sha256":"547dc1ed9b9b757375c2ab8dcef8dc4cf979bbdcde2a31c7bd5ae460e80e30e5"},"schema_version":"1.0"},"canonical_sha256":"ea072dc00da1f94bd9431027608e8a36dd1f8d04780a4c9068404dd63d534aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:58.695624Z","signature_b64":"5lrnE2HECWBqUvMuEHWa2koY55n8pxg9YMjd3MClvHOiqAvSfrSXjzZmtxMC+AMS8LMzvWqPEel/Go7wipdjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea072dc00da1f94bd9431027608e8a36dd1f8d04780a4c9068404dd63d534aa1","last_reissued_at":"2026-07-05T11:11:58.695104Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:58.695104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.23273","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-05T11:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqMDJy/0Ci7bVdz+BhGUC2S+S/jUIz/tFQnPpnLnfUDXWtQVDP6CwOnZ6M/F8Xv/rIAwSlC6pW1HUtysLkstCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:02:16.082522Z"},"content_sha256":"3f3be5a00f7f160c0399761589d8e3f8301ccfa592d15c5a671a94ce388c3777","schema_version":"1.0","event_id":"sha256:3f3be5a00f7f160c0399761589d8e3f8301ccfa592d15c5a671a94ce388c3777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5IDS3QANUH4UXWKDCATWBDUKG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Sparse Phase Retrieval: Statistical Guarantee, Optimality Theory and Convergent Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ailing Yan, Jun Fan, Wanquan Liu, Xianchao Xiu","submitted_at":"2025-05-29T09:21:01Z","abstract_excerpt":"Phase retrieval (PR) is a popular research topic in signal processing and machine learning. However, its performance degrades significantly when the measurements are corrupted by noise or outliers. To address this limitation, we propose a novel robust sparse PR method that covers both real- and complex-valued cases. The core is to leverage the Huber function to measure the loss and adopt the $\\ell_{1/2}$-norm regularization to realize feature selection, thereby improving the robustness of PR. In theory, we establish statistical guarantees for such robustness and derive necessary optimality con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23273","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/2505.23273/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-05T11:11:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a6SDqpLX0DAW8uapR8z6qEggZJxnKsidfY6XjjTLTZtXa/jRtcaJpFJh0+9UceoVHC066T8mHHhtp0eVpgAvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:02:16.083439Z"},"content_sha256":"d14bd65099bb6ffcf48f365644b118cf6f805c85351c48cf3bd2796b0f9d10dc","schema_version":"1.0","event_id":"sha256:d14bd65099bb6ffcf48f365644b118cf6f805c85351c48cf3bd2796b0f9d10dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IDS3QANUH4UXWKDCATWBDUKG3/bundle.json","state_url":"https://pith.science/pith/5IDS3QANUH4UXWKDCATWBDUKG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IDS3QANUH4UXWKDCATWBDUKG3/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-08T15:02:16Z","links":{"resolver":"https://pith.science/pith/5IDS3QANUH4UXWKDCATWBDUKG3","bundle":"https://pith.science/pith/5IDS3QANUH4UXWKDCATWBDUKG3/bundle.json","state":"https://pith.science/pith/5IDS3QANUH4UXWKDCATWBDUKG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IDS3QANUH4UXWKDCATWBDUKG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5IDS3QANUH4UXWKDCATWBDUKG3","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":"547dc1ed9b9b757375c2ab8dcef8dc4cf979bbdcde2a31c7bd5ae460e80e30e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:21:01Z","title_canon_sha256":"8435f446aea881f66b335eaaff8dd47705a7a6549e14c8e4c03b4128088f4b76"},"schema_version":"1.0","source":{"id":"2505.23273","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.23273","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"arxiv_version","alias_value":"2505.23273v1","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23273","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_12","alias_value":"5IDS3QANUH4U","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_16","alias_value":"5IDS3QANUH4UXWKD","created_at":"2026-07-05T11:11:58Z"},{"alias_kind":"pith_short_8","alias_value":"5IDS3QAN","created_at":"2026-07-05T11:11:58Z"}],"graph_snapshots":[{"event_id":"sha256:d14bd65099bb6ffcf48f365644b118cf6f805c85351c48cf3bd2796b0f9d10dc","target":"graph","created_at":"2026-07-05T11:11:58Z","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/2505.23273/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Phase retrieval (PR) is a popular research topic in signal processing and machine learning. However, its performance degrades significantly when the measurements are corrupted by noise or outliers. To address this limitation, we propose a novel robust sparse PR method that covers both real- and complex-valued cases. The core is to leverage the Huber function to measure the loss and adopt the $\\ell_{1/2}$-norm regularization to realize feature selection, thereby improving the robustness of PR. In theory, we establish statistical guarantees for such robustness and derive necessary optimality con","authors_text":"Ailing Yan, Jun Fan, Wanquan Liu, Xianchao Xiu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:21:01Z","title":"Robust Sparse Phase Retrieval: Statistical Guarantee, Optimality Theory and Convergent Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23273","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:3f3be5a00f7f160c0399761589d8e3f8301ccfa592d15c5a671a94ce388c3777","target":"record","created_at":"2026-07-05T11:11:58Z","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":"547dc1ed9b9b757375c2ab8dcef8dc4cf979bbdcde2a31c7bd5ae460e80e30e5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-05-29T09:21:01Z","title_canon_sha256":"8435f446aea881f66b335eaaff8dd47705a7a6549e14c8e4c03b4128088f4b76"},"schema_version":"1.0","source":{"id":"2505.23273","kind":"arxiv","version":1}},"canonical_sha256":"ea072dc00da1f94bd9431027608e8a36dd1f8d04780a4c9068404dd63d534aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea072dc00da1f94bd9431027608e8a36dd1f8d04780a4c9068404dd63d534aa1","first_computed_at":"2026-07-05T11:11:58.695104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:58.695104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5lrnE2HECWBqUvMuEHWa2koY55n8pxg9YMjd3MClvHOiqAvSfrSXjzZmtxMC+AMS8LMzvWqPEel/Go7wipdjBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:58.695624Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.23273","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f3be5a00f7f160c0399761589d8e3f8301ccfa592d15c5a671a94ce388c3777","sha256:d14bd65099bb6ffcf48f365644b118cf6f805c85351c48cf3bd2796b0f9d10dc"],"state_sha256":"b4130b4d1914a645655adf88d857445e4a06af223be84d776ad441bd986d741b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXkzQ14GHE/pXLnMN+uZu1m1onMJ9836s5GIQZuNCt/7QKxEhxqBU1v8QflFFYGdXv8NSLh/x8YYdFbK7bn2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:02:16.089124Z","bundle_sha256":"c2a76ea428c5615247ac6ac8d2cdc3461f539e4f8cd05043b0c411d95dc5cdba"}}