{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CWD3MDOXZ5DKKDJ4SHB3FODP27","short_pith_number":"pith:CWD3MDOX","schema_version":"1.0","canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","source":{"kind":"arxiv","id":"1707.09726","version":1},"attestation_state":"computed","paper":{"title":"Spectral Compressed Sensing via Projected Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian-Feng Cai, Ke Wei, Tianming Wang","submitted_at":"2017-07-31T05:39:23Z","abstract_excerpt":"Let $x\\in\\mathbb{C}^n$ be a spectrally sparse signal consisting of $r$ complex sinusoids with or without damping. We consider the spectral compressed sensing problem, which is about reconstructing $x$ from its partial revealed entries. By utilizing the low rank structure of the Hankel matrix corresponding to $x$, we develop a computationally efficient algorithm for this problem. The algorithm starts from an initial guess computed via one-step hard thresholding followed by projection, and then proceeds by applying projected gradient descent iterations to a non-convex functional. Based on the sa"},"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":"1707.09726","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-31T05:39:23Z","cross_cats_sorted":[],"title_canon_sha256":"4ad81b8ccaac51cff76510354cb632660c6bbbfee45cee5341e2053f41fae034","abstract_canon_sha256":"6115ce6e9ad05d095ec3480ed866f3d84237e90e4dd0285fb5236dd2e4a5172e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:08.457222Z","signature_b64":"Q7P9xHUrXbS4z6xbb4UreiOPYGFkGhhr8PbU+qHC8ubbb21lbgIUJBPX/zMZVAP0eqCLPJ4YZhIeWe+QzZvGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","last_reissued_at":"2026-05-18T00:39:08.456524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:08.456524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Compressed Sensing via Projected Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jian-Feng Cai, Ke Wei, Tianming Wang","submitted_at":"2017-07-31T05:39:23Z","abstract_excerpt":"Let $x\\in\\mathbb{C}^n$ be a spectrally sparse signal consisting of $r$ complex sinusoids with or without damping. We consider the spectral compressed sensing problem, which is about reconstructing $x$ from its partial revealed entries. By utilizing the low rank structure of the Hankel matrix corresponding to $x$, we develop a computationally efficient algorithm for this problem. The algorithm starts from an initial guess computed via one-step hard thresholding followed by projection, and then proceeds by applying projected gradient descent iterations to a non-convex functional. Based on the sa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09726","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":""},"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":"1707.09726","created_at":"2026-05-18T00:39:08.456643+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.09726v1","created_at":"2026-05-18T00:39:08.456643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09726","created_at":"2026-05-18T00:39:08.456643+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWD3MDOXZ5DK","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWD3MDOXZ5DKKDJ4","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWD3MDOX","created_at":"2026-05-18T12:31:10.602751+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/CWD3MDOXZ5DKKDJ4SHB3FODP27","json":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27.json","graph_json":"https://pith.science/api/pith-number/CWD3MDOXZ5DKKDJ4SHB3FODP27/graph.json","events_json":"https://pith.science/api/pith-number/CWD3MDOXZ5DKKDJ4SHB3FODP27/events.json","paper":"https://pith.science/paper/CWD3MDOX"},"agent_actions":{"view_html":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27","download_json":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27.json","view_paper":"https://pith.science/paper/CWD3MDOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.09726&json=true","fetch_graph":"https://pith.science/api/pith-number/CWD3MDOXZ5DKKDJ4SHB3FODP27/graph.json","fetch_events":"https://pith.science/api/pith-number/CWD3MDOXZ5DKKDJ4SHB3FODP27/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/action/storage_attestation","attest_author":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/action/author_attestation","sign_citation":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/action/citation_signature","submit_replication":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/action/replication_record"}},"created_at":"2026-05-18T00:39:08.456643+00:00","updated_at":"2026-05-18T00:39:08.456643+00:00"}