{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BVB36Z6GA435KRELT2UGQP33BY","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":"ba4f1eb72cbd6b205d49345d3a15cfd516ec1bb89c97641923379b83d2d8472f","cross_cats_sorted":["cs.LG","eess.SP","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-13T23:12:59Z","title_canon_sha256":"a830b3c464f684cc1f79a50e6596ab3e2eb7beb98396db8d3767a4a2d75cba25"},"schema_version":"1.0","source":{"id":"1910.05859","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.05859","created_at":"2026-07-05T02:12:39Z"},{"alias_kind":"arxiv_version","alias_value":"1910.05859v3","created_at":"2026-07-05T02:12:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05859","created_at":"2026-07-05T02:12:39Z"},{"alias_kind":"pith_short_12","alias_value":"BVB36Z6GA435","created_at":"2026-07-05T02:12:39Z"},{"alias_kind":"pith_short_16","alias_value":"BVB36Z6GA435KREL","created_at":"2026-07-05T02:12:39Z"},{"alias_kind":"pith_short_8","alias_value":"BVB36Z6G","created_at":"2026-07-05T02:12:39Z"}],"graph_snapshots":[{"event_id":"sha256:42392bba15bc1eac4a9c74ec61fe64af5d1c21bc637cbb894a8a0c6f3ba7e9bd","target":"graph","created_at":"2026-07-05T02:12:39Z","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/1910.05859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a spectrally sparse signal $\\boldsymbol{x}$ that consists of $r$ complex sinusoids with or without damping. We study the robust recovery problem for the spectrally sparse signal under the fully observed setting, which is about recovering $\\boldsymbol{x}$ and a sparse corruption vector $\\boldsymbol{s}$ from their sum $\\boldsymbol{z}=\\boldsymbol{x}+\\boldsymbol{s}$. In this paper, we exploit the low-rank property of the Hankel matrix formed by $\\boldsymbol{x}$, and formulate the problem as the robust recovery of a corrupted low-rank Hankel matrix. We develop a highly efficient non-convex","authors_text":"Guojian Yin, HanQin Cai, Jian-Feng Cai, Tianming Wang","cross_cats":["cs.LG","eess.SP","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-13T23:12:59Z","title":"Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05859","kind":"arxiv","version":3},"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:07c7c5f85bfe6e2517446744a0a0f9315c86ff50517cdeeec0bf362b94c64734","target":"record","created_at":"2026-07-05T02:12:39Z","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":"ba4f1eb72cbd6b205d49345d3a15cfd516ec1bb89c97641923379b83d2d8472f","cross_cats_sorted":["cs.LG","eess.SP","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-13T23:12:59Z","title_canon_sha256":"a830b3c464f684cc1f79a50e6596ab3e2eb7beb98396db8d3767a4a2d75cba25"},"schema_version":"1.0","source":{"id":"1910.05859","kind":"arxiv","version":3}},"canonical_sha256":"0d43bf67c60737d5448b9ea8683f7b0e270a087292928ccaaeb7ecc87666170b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d43bf67c60737d5448b9ea8683f7b0e270a087292928ccaaeb7ecc87666170b","first_computed_at":"2026-07-05T02:12:39.938106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:39.938106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uUbA+DHVYaiT5tMg0gGwR7vHyeV9QZush/Kk6gBaWoyxg3GBTbLb3ukhZNV3iD631bzElmV6p7Mm0lS2a3NIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:39.938498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.05859","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07c7c5f85bfe6e2517446744a0a0f9315c86ff50517cdeeec0bf362b94c64734","sha256:42392bba15bc1eac4a9c74ec61fe64af5d1c21bc637cbb894a8a0c6f3ba7e9bd"],"state_sha256":"1c392bb8bfb51f45219a86d6d63e12e4494579205474e07c077bbb3183864fc5"}