{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CWD3MDOXZ5DKKDJ4SHB3FODP27","short_pith_number":"pith:CWD3MDOX","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"},"canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","source":{"kind":"arxiv","id":"1707.09726","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09726","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09726v1","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09726","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWD3MDOXZ5DK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWD3MDOXZ5DKKDJ4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWD3MDOX","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CWD3MDOXZ5DKKDJ4SHB3FODP27","target":"record","payload":{"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"},"canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","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"},"source_kind":"arxiv","source_id":"1707.09726","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-18T00:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"23Lpg5FhOkc/i979EKyxpPlfDM8wiAxwC7Go1WqPDNZO9C8hDSbuZsCLvF78lnJ8gzZlFh9I9u7RKIJHwCrFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:25.551677Z"},"content_sha256":"7985b3b72ae1ed540e7198d30f9e1ec959eddac0dae1847c57a73ba62d774835","schema_version":"1.0","event_id":"sha256:7985b3b72ae1ed540e7198d30f9e1ec959eddac0dae1847c57a73ba62d774835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CWD3MDOXZ5DKKDJ4SHB3FODP27","target":"graph","payload":{"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"},"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-18T00:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jo5xzcT2SwS1wy44Y9M2vAeeAR8QSAZv+uE39WE4HZzYUiVTxThIE3FGF+OEGw5/BtK3aN/lC8e6vlLyuGpkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:25.552357Z"},"content_sha256":"ad8200d8bc821e6f0d7e5c2844c5d115411f42ec2f6246da1f44bf1bd1e85de4","schema_version":"1.0","event_id":"sha256:ad8200d8bc821e6f0d7e5c2844c5d115411f42ec2f6246da1f44bf1bd1e85de4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/bundle.json","state_url":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/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-05-26T11:02:25Z","links":{"resolver":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27","bundle":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/bundle.json","state":"https://pith.science/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWD3MDOXZ5DKKDJ4SHB3FODP27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CWD3MDOXZ5DKKDJ4SHB3FODP27","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":"6115ce6e9ad05d095ec3480ed866f3d84237e90e4dd0285fb5236dd2e4a5172e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-31T05:39:23Z","title_canon_sha256":"4ad81b8ccaac51cff76510354cb632660c6bbbfee45cee5341e2053f41fae034"},"schema_version":"1.0","source":{"id":"1707.09726","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09726","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09726v1","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09726","created_at":"2026-05-18T00:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"CWD3MDOXZ5DK","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CWD3MDOXZ5DKKDJ4","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CWD3MDOX","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:ad8200d8bc821e6f0d7e5c2844c5d115411f42ec2f6246da1f44bf1bd1e85de4","target":"graph","created_at":"2026-05-18T00:39:08Z","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":"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","authors_text":"Jian-Feng Cai, Ke Wei, Tianming Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-31T05:39:23Z","title":"Spectral Compressed Sensing via Projected Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09726","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:7985b3b72ae1ed540e7198d30f9e1ec959eddac0dae1847c57a73ba62d774835","target":"record","created_at":"2026-05-18T00:39:08Z","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":"6115ce6e9ad05d095ec3480ed866f3d84237e90e4dd0285fb5236dd2e4a5172e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-07-31T05:39:23Z","title_canon_sha256":"4ad81b8ccaac51cff76510354cb632660c6bbbfee45cee5341e2053f41fae034"},"schema_version":"1.0","source":{"id":"1707.09726","kind":"arxiv","version":1}},"canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1587b60dd7cf46a50d3c91c3b2b86fd7f6e4912935e46e0f63d1b21dfb07cc02","first_computed_at":"2026-05-18T00:39:08.456524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:08.456524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q7P9xHUrXbS4z6xbb4UreiOPYGFkGhhr8PbU+qHC8ubbb21lbgIUJBPX/zMZVAP0eqCLPJ4YZhIeWe+QzZvGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:08.457222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09726","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7985b3b72ae1ed540e7198d30f9e1ec959eddac0dae1847c57a73ba62d774835","sha256:ad8200d8bc821e6f0d7e5c2844c5d115411f42ec2f6246da1f44bf1bd1e85de4"],"state_sha256":"2c031d7e33ecfa5aae7b1f0a3c486abb2ae6ed01a32bce5a0d4c883dda51c6da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tRTa34Um52jeoHRbkVQsHbqJIHGkYFVackzvdKO+XuUg9gTURMvtsOJXxYS3sWbvk5wb7Uf5Fl50eP9iZanBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:02:25.555642Z","bundle_sha256":"01ad77fa7c364e8398a746df3f196bba5bd97bf2a08da499f3662b84deaa484c"}}