{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4XVDF7ABCEHPEF6PA7BGL6WJBM","short_pith_number":"pith:4XVDF7AB","schema_version":"1.0","canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","source":{"kind":"arxiv","id":"1405.6544","version":1},"attestation_state":"computed","paper":{"title":"Continuous Compressed Sensing With a Single or Multiple Measurement Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lihua Xie, Zai Yang","submitted_at":"2014-05-26T11:20:50Z","abstract_excerpt":"We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in which the frequencies can take any values in the normalized domain [0,1). In this paper, a link between CCS and low rank matrix completion (LRMC) is established based on an $\\ell_0$-pseudo-norm-like formulation, and theoretical guarantees for exact recovery are analyzed. Practically efficient algorithms are proposed based on the link and convex and nonconvex"},"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":"1405.6544","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-26T11:20:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6569ed94097f0b67043f338d7e32aec0eee9b21a3b266e1418b1cf2fbfd6cae4","abstract_canon_sha256":"d3c6c599af63ba48e54a1f7a4505d722886c194a0678ec1601c2cf44ae958dd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.781708Z","signature_b64":"aEkfUpKETzrlrK+13BrrgIr6ZE3aWETGfTn+biG8tHly+3RJ09nFp+wJD0s+5QCUcy8iS3q2V3im1kkE6husBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","last_reissued_at":"2026-05-18T02:39:31.781194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.781194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Compressed Sensing With a Single or Multiple Measurement Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lihua Xie, Zai Yang","submitted_at":"2014-05-26T11:20:50Z","abstract_excerpt":"We consider the problem of recovering a single or multiple frequency-sparse signals, which share the same frequency components, from a subset of regularly spaced samples. The problem is referred to as continuous compressed sensing (CCS) in which the frequencies can take any values in the normalized domain [0,1). In this paper, a link between CCS and low rank matrix completion (LRMC) is established based on an $\\ell_0$-pseudo-norm-like formulation, and theoretical guarantees for exact recovery are analyzed. Practically efficient algorithms are proposed based on the link and convex and nonconvex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6544","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":"1405.6544","created_at":"2026-05-18T02:39:31.781257+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6544v1","created_at":"2026-05-18T02:39:31.781257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6544","created_at":"2026-05-18T02:39:31.781257+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XVDF7ABCEHP","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XVDF7ABCEHPEF6P","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XVDF7AB","created_at":"2026-05-18T12:28:14.216126+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/4XVDF7ABCEHPEF6PA7BGL6WJBM","json":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM.json","graph_json":"https://pith.science/api/pith-number/4XVDF7ABCEHPEF6PA7BGL6WJBM/graph.json","events_json":"https://pith.science/api/pith-number/4XVDF7ABCEHPEF6PA7BGL6WJBM/events.json","paper":"https://pith.science/paper/4XVDF7AB"},"agent_actions":{"view_html":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM","download_json":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM.json","view_paper":"https://pith.science/paper/4XVDF7AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6544&json=true","fetch_graph":"https://pith.science/api/pith-number/4XVDF7ABCEHPEF6PA7BGL6WJBM/graph.json","fetch_events":"https://pith.science/api/pith-number/4XVDF7ABCEHPEF6PA7BGL6WJBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/action/storage_attestation","attest_author":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/action/author_attestation","sign_citation":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/action/citation_signature","submit_replication":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/action/replication_record"}},"created_at":"2026-05-18T02:39:31.781257+00:00","updated_at":"2026-05-18T02:39:31.781257+00:00"}