{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BVB36Z6GA435KRELT2UGQP33BY","short_pith_number":"pith:BVB36Z6G","schema_version":"1.0","canonical_sha256":"0d43bf67c60737d5448b9ea8683f7b0e270a087292928ccaaeb7ecc87666170b","source":{"kind":"arxiv","id":"1910.05859","version":3},"attestation_state":"computed","paper":{"title":"Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Guojian Yin, HanQin Cai, Jian-Feng Cai, Tianming Wang","submitted_at":"2019-10-13T23:12:59Z","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"},"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":"1910.05859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-10-13T23:12:59Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT","math.OC"],"title_canon_sha256":"a830b3c464f684cc1f79a50e6596ab3e2eb7beb98396db8d3767a4a2d75cba25","abstract_canon_sha256":"ba4f1eb72cbd6b205d49345d3a15cfd516ec1bb89c97641923379b83d2d8472f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:39.938498Z","signature_b64":"uUbA+DHVYaiT5tMg0gGwR7vHyeV9QZush/Kk6gBaWoyxg3GBTbLb3ukhZNV3iD631bzElmV6p7Mm0lS2a3NIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d43bf67c60737d5448b9ea8683f7b0e270a087292928ccaaeb7ecc87666170b","last_reissued_at":"2026-07-05T02:12:39.938106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:39.938106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Structured Alternating Projections for Robust Spectrally Sparse Signal Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Guojian Yin, HanQin Cai, Jian-Feng Cai, Tianming Wang","submitted_at":"2019-10-13T23:12:59Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.05859","kind":"arxiv","version":3},"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/1910.05859/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":"1910.05859","created_at":"2026-07-05T02:12:39.938164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.05859v3","created_at":"2026-07-05T02:12:39.938164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.05859","created_at":"2026-07-05T02:12:39.938164+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVB36Z6GA435","created_at":"2026-07-05T02:12:39.938164+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVB36Z6GA435KREL","created_at":"2026-07-05T02:12:39.938164+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVB36Z6G","created_at":"2026-07-05T02:12:39.938164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY","json":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY.json","graph_json":"https://pith.science/api/pith-number/BVB36Z6GA435KRELT2UGQP33BY/graph.json","events_json":"https://pith.science/api/pith-number/BVB36Z6GA435KRELT2UGQP33BY/events.json","paper":"https://pith.science/paper/BVB36Z6G"},"agent_actions":{"view_html":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY","download_json":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY.json","view_paper":"https://pith.science/paper/BVB36Z6G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.05859&json=true","fetch_graph":"https://pith.science/api/pith-number/BVB36Z6GA435KRELT2UGQP33BY/graph.json","fetch_events":"https://pith.science/api/pith-number/BVB36Z6GA435KRELT2UGQP33BY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY/action/storage_attestation","attest_author":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY/action/author_attestation","sign_citation":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY/action/citation_signature","submit_replication":"https://pith.science/pith/BVB36Z6GA435KRELT2UGQP33BY/action/replication_record"}},"created_at":"2026-07-05T02:12:39.938164+00:00","updated_at":"2026-07-05T02:12:39.938164+00:00"}