{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WLIBJKROFX43RBWF5HUNZXW5WO","short_pith_number":"pith:WLIBJKRO","schema_version":"1.0","canonical_sha256":"b2d014aa2e2df9b886c5e9e8dcdeddb389a65b6a00a89369684dacaa6a26499b","source":{"kind":"arxiv","id":"1304.8126","version":5},"attestation_state":"computed","paper":{"title":"Robust Spectral Compressed Sensing via Structured Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.NA","stat.ML"],"primary_cat":"cs.IT","authors_text":"Yuejie Chi, Yuxin Chen","submitted_at":"2013-04-30T19:24:22Z","abstract_excerpt":"The paper explores the problem of \\emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples. The signal of interest is assumed to be a superposition of $r$ multi-dimensional complex sinusoids, while the underlying frequencies can assume any \\emph{continuous} values in the normalized frequency domain. Conventional compressed sensing paradigms suffer from the basis mismatch issue when imposing a discrete dictionary on the Fourier representation. To address this issue, we develop a novel algorithm, called \\emph{E"},"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":"1304.8126","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T19:24:22Z","cross_cats_sorted":["cs.SY","math.IT","math.NA","stat.ML"],"title_canon_sha256":"53aa0c196ba0d1bfb726a05fd8fc43319c4fe561176faea13e24b2a2bf0c6a98","abstract_canon_sha256":"10dfe3c0fdf7cc40f0f10f89d47d4a1bf804f6becc50dfddf5a5b0eb46c618bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.940732Z","signature_b64":"1Dvwg+NJPhGTtUb48MlplLlM+gw2rzU6rgqW1+pbv1VmvjygMsxNy4Sr7+STmW8bdIscKNpfIj44BrVVN+fXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2d014aa2e2df9b886c5e9e8dcdeddb389a65b6a00a89369684dacaa6a26499b","last_reissued_at":"2026-05-18T02:30:15.940222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.940222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Spectral Compressed Sensing via Structured Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.NA","stat.ML"],"primary_cat":"cs.IT","authors_text":"Yuejie Chi, Yuxin Chen","submitted_at":"2013-04-30T19:24:22Z","abstract_excerpt":"The paper explores the problem of \\emph{spectral compressed sensing}, which aims to recover a spectrally sparse signal from a small random subset of its $n$ time domain samples. The signal of interest is assumed to be a superposition of $r$ multi-dimensional complex sinusoids, while the underlying frequencies can assume any \\emph{continuous} values in the normalized frequency domain. Conventional compressed sensing paradigms suffer from the basis mismatch issue when imposing a discrete dictionary on the Fourier representation. To address this issue, we develop a novel algorithm, called \\emph{E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.8126","kind":"arxiv","version":5},"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":"1304.8126","created_at":"2026-05-18T02:30:15.940287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.8126v5","created_at":"2026-05-18T02:30:15.940287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.8126","created_at":"2026-05-18T02:30:15.940287+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLIBJKROFX43","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLIBJKROFX43RBWF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLIBJKRO","created_at":"2026-05-18T12:28:04.890932+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/WLIBJKROFX43RBWF5HUNZXW5WO","json":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO.json","graph_json":"https://pith.science/api/pith-number/WLIBJKROFX43RBWF5HUNZXW5WO/graph.json","events_json":"https://pith.science/api/pith-number/WLIBJKROFX43RBWF5HUNZXW5WO/events.json","paper":"https://pith.science/paper/WLIBJKRO"},"agent_actions":{"view_html":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO","download_json":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO.json","view_paper":"https://pith.science/paper/WLIBJKRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.8126&json=true","fetch_graph":"https://pith.science/api/pith-number/WLIBJKROFX43RBWF5HUNZXW5WO/graph.json","fetch_events":"https://pith.science/api/pith-number/WLIBJKROFX43RBWF5HUNZXW5WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO/action/storage_attestation","attest_author":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO/action/author_attestation","sign_citation":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO/action/citation_signature","submit_replication":"https://pith.science/pith/WLIBJKROFX43RBWF5HUNZXW5WO/action/replication_record"}},"created_at":"2026-05-18T02:30:15.940287+00:00","updated_at":"2026-05-18T02:30:15.940287+00:00"}