{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4XVDF7ABCEHPEF6PA7BGL6WJBM","short_pith_number":"pith:4XVDF7AB","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"},"canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","source":{"kind":"arxiv","id":"1405.6544","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6544","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6544v1","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6544","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"4XVDF7ABCEHP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4XVDF7ABCEHPEF6P","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4XVDF7AB","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4XVDF7ABCEHPEF6PA7BGL6WJBM","target":"record","payload":{"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"},"canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","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"},"source_kind":"arxiv","source_id":"1405.6544","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6XtrvS6ownP34n7EqXkBiQ/coeCLQNNzlFFAoqpRiq4LGVq5lNfnFKRqiCtLVL90/QCcYLWttUoHUWSKM1nxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:30:41.889286Z"},"content_sha256":"a080f059f740e065e21447a07eb5218249025e9cc39b2aadbcb1e7c3cda42f39","schema_version":"1.0","event_id":"sha256:a080f059f740e065e21447a07eb5218249025e9cc39b2aadbcb1e7c3cda42f39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4XVDF7ABCEHPEF6PA7BGL6WJBM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KIGBrRV7d1V7Rs8S03d6Vm5pDd79A6a0bXS2tuAnIDCl20F3X6qHNGziNZg3KJBCbTiJ3t8TtgJw96Cjd/LAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T04:30:41.889856Z"},"content_sha256":"50ffd095c8adf0ebcdba5c4f8c8acb2c18ad98f2f06b1be918354b52f7743e8a","schema_version":"1.0","event_id":"sha256:50ffd095c8adf0ebcdba5c4f8c8acb2c18ad98f2f06b1be918354b52f7743e8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/bundle.json","state_url":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T04:30:41Z","links":{"resolver":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM","bundle":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/bundle.json","state":"https://pith.science/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XVDF7ABCEHPEF6PA7BGL6WJBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4XVDF7ABCEHPEF6PA7BGL6WJBM","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":"d3c6c599af63ba48e54a1f7a4505d722886c194a0678ec1601c2cf44ae958dd4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-26T11:20:50Z","title_canon_sha256":"6569ed94097f0b67043f338d7e32aec0eee9b21a3b266e1418b1cf2fbfd6cae4"},"schema_version":"1.0","source":{"id":"1405.6544","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6544","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6544v1","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6544","created_at":"2026-05-18T02:39:31Z"},{"alias_kind":"pith_short_12","alias_value":"4XVDF7ABCEHP","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4XVDF7ABCEHPEF6P","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4XVDF7AB","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:50ffd095c8adf0ebcdba5c4f8c8acb2c18ad98f2f06b1be918354b52f7743e8a","target":"graph","created_at":"2026-05-18T02:39:31Z","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"},"paper":{"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","authors_text":"Lihua Xie, Zai Yang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-26T11:20:50Z","title":"Continuous Compressed Sensing With a Single or Multiple Measurement Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6544","kind":"arxiv","version":1},"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:a080f059f740e065e21447a07eb5218249025e9cc39b2aadbcb1e7c3cda42f39","target":"record","created_at":"2026-05-18T02:39:31Z","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":"d3c6c599af63ba48e54a1f7a4505d722886c194a0678ec1601c2cf44ae958dd4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-05-26T11:20:50Z","title_canon_sha256":"6569ed94097f0b67043f338d7e32aec0eee9b21a3b266e1418b1cf2fbfd6cae4"},"schema_version":"1.0","source":{"id":"1405.6544","kind":"arxiv","version":1}},"canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5ea32fc01110ef217cf07c265fac90b23443c872322c190b7b4d9ac6f27e643","first_computed_at":"2026-05-18T02:39:31.781194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:31.781194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aEkfUpKETzrlrK+13BrrgIr6ZE3aWETGfTn+biG8tHly+3RJ09nFp+wJD0s+5QCUcy8iS3q2V3im1kkE6husBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:31.781708Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6544","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a080f059f740e065e21447a07eb5218249025e9cc39b2aadbcb1e7c3cda42f39","sha256:50ffd095c8adf0ebcdba5c4f8c8acb2c18ad98f2f06b1be918354b52f7743e8a"],"state_sha256":"14f24d9af7854002aa72fbf5b52f65b8e9b98fca2c151c459b55ffae8a57a736"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VSwlU+K9nfntfx1Z94rn4wHC2/nTqbiDT7I8XeOMVzTK/P5unbljJ/aPsRWXsiMQgrK+/EYPmK5daAUMROapDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T04:30:41.891928Z","bundle_sha256":"d91eb5d6b94405607bd1336344f207bba134ac1851d352f09dae56d255744793"}}