{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4SKOQF3ZDBSW5DZWPYCUVMSREU","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":"9771074be735148ecc351248c140bf65133ad60250fc08f986f99fe65a012ae5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-05T21:39:44Z","title_canon_sha256":"9f9a6609ee1226aaf08d5cb39d165e0758cf3e08c08d7c47aa95aa07eb00d8d8"},"schema_version":"1.0","source":{"id":"1606.01567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.01567","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"arxiv_version","alias_value":"1606.01567v1","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01567","created_at":"2026-05-18T01:12:53Z"},{"alias_kind":"pith_short_12","alias_value":"4SKOQF3ZDBSW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SKOQF3ZDBSW5DZW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SKOQF3Z","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:74dc8e8189007e5a5399787587b073dcece1424523a27601e62335f0353a45f4","target":"graph","created_at":"2026-05-18T01:12:53Z","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":"A spectrally sparse signal of order $r$ is a mixture of $r$ damped or undamped complex sinusoids. This paper investigates the problem of reconstructing spectrally sparse signals from a random subset of $n$ regular time domain samples, which can be reformulated as a low rank Hankel matrix completion problem. We introduce an iterative hard thresholding (IHT) algorithm and a fast iterative hard thresholding (FIHT) algorithm for efficient reconstruction of spectrally sparse signals via low rank Hankel matrix completion. Theoretical recovery guarantees have been established for FIHT, showing that $","authors_text":"Jian-Feng Cai, Ke Wei, Tianming Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-05T21:39:44Z","title":"Fast and Provable Algorithms for Spectrally Sparse Signal Reconstruction via Low-Rank Hankel Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01567","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:acaefa3e40a6211b596f6c14e00f17fbc5a05ef142e84565e6dfd7a9148c9ae5","target":"record","created_at":"2026-05-18T01:12:53Z","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":"9771074be735148ecc351248c140bf65133ad60250fc08f986f99fe65a012ae5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-05T21:39:44Z","title_canon_sha256":"9f9a6609ee1226aaf08d5cb39d165e0758cf3e08c08d7c47aa95aa07eb00d8d8"},"schema_version":"1.0","source":{"id":"1606.01567","kind":"arxiv","version":1}},"canonical_sha256":"e494e8177918656e8f367e054ab251252ced0d6c52cba2474d9812eace1c6e1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e494e8177918656e8f367e054ab251252ced0d6c52cba2474d9812eace1c6e1a","first_computed_at":"2026-05-18T01:12:53.957270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:53.957270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B8efnmTEEwQuNtqEZdFg+Tfc9wdHiIhI3E04/NU3UiuOSbCFQkSSpeuuxLeduNDFcR7VgL48LAihGvRs82VcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:53.957627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.01567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acaefa3e40a6211b596f6c14e00f17fbc5a05ef142e84565e6dfd7a9148c9ae5","sha256:74dc8e8189007e5a5399787587b073dcece1424523a27601e62335f0353a45f4"],"state_sha256":"c28ef740625427151ec6c09ece6965ef4225b0513f54b682952518e16951c401"}