{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6NY2FYTOG5RSHBWEVYKCYRJIVH","short_pith_number":"pith:6NY2FYTO","canonical_record":{"source":{"id":"1507.03707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T02:48:09Z","cross_cats_sorted":["cs.LG","math.IT","math.OC"],"title_canon_sha256":"1a5b2ac6ee3b6a8a1a75d0143a26131a97dfce46a89b9c261e3c30258fbae22f","abstract_canon_sha256":"cdad5c1fbd0798483aaa479badc85781740cc9cb3cf42b4a73cd34d7db46bc14"},"schema_version":"1.0"},"canonical_sha256":"f371a2e26e37632386c4ae142c4528a9cfe232150b19bccecf5829e88af8e009","source":{"kind":"arxiv","id":"1507.03707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03707","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03707v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03707","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"6NY2FYTOG5RS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6NY2FYTOG5RSHBWE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6NY2FYTO","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6NY2FYTOG5RSHBWEVYKCYRJIVH","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T02:48:09Z","cross_cats_sorted":["cs.LG","math.IT","math.OC"],"title_canon_sha256":"1a5b2ac6ee3b6a8a1a75d0143a26131a97dfce46a89b9c261e3c30258fbae22f","abstract_canon_sha256":"cdad5c1fbd0798483aaa479badc85781740cc9cb3cf42b4a73cd34d7db46bc14"},"schema_version":"1.0"},"canonical_sha256":"f371a2e26e37632386c4ae142c4528a9cfe232150b19bccecf5829e88af8e009","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.524566Z","signature_b64":"8gqKYcVKglI00yWj7/IL1lGAN/vtf+0V2SmG0kqdzB+UPepfqrLTVvoHPU7oQMt4YOLbcdc0JwvNqWJ8oZ72Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f371a2e26e37632386c4ae142c4528a9cfe232150b19bccecf5829e88af8e009","last_reissued_at":"2026-05-18T01:36:57.524045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.524045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03707","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aid1cKXUd14UfBlfGjH7TmxTmnHtcC1yAJ5dfqu224apuVHOh7vANKkCBLxOYgrWPYkNLB0nmCEOji1xiWK7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:33:24.130089Z"},"content_sha256":"ea910c7c35fe85153f5419a0b947ae3ab57254bc7a7b22438391fa79ccc209b0","schema_version":"1.0","event_id":"sha256:ea910c7c35fe85153f5419a0b947ae3ab57254bc7a7b22438391fa79ccc209b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6NY2FYTOG5RSHBWEVYKCYRJIVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Jian-Feng Cai, Suhui Liu, Weiyu Xu","submitted_at":"2015-07-14T02:48:09Z","abstract_excerpt":"This paper considers reconstructing a spectrally sparse signal from a small number of randomly observed time-domain samples. The signal of interest is a linear combination of complex sinusoids at $R$ distinct frequencies. The frequencies can assume any continuous values in the normalized frequency domain $[0,1)$. After converting the spectrally sparse signal recovery into a low rank structured matrix completion problem, we propose an efficient feasible point approach, named projected Wirtinger gradient descent (PWGD) algorithm, to efficiently solve this structured matrix completion problem. We"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03707","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IK47nk/hBPCC4dFMKXceI2SvpgwzBLY3zvhhxj+VN817F90tl9QY2yH8N+gQKxEHMA3NRuCxRY6d2rmgOlE/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:33:24.130468Z"},"content_sha256":"e264f7f88aeae59f9f68b7b1e0d32577ac4ba74ea5fb4ea730a4f4f7c8682424","schema_version":"1.0","event_id":"sha256:e264f7f88aeae59f9f68b7b1e0d32577ac4ba74ea5fb4ea730a4f4f7c8682424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/bundle.json","state_url":"https://pith.science/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/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-26T05:33:24Z","links":{"resolver":"https://pith.science/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH","bundle":"https://pith.science/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/bundle.json","state":"https://pith.science/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6NY2FYTOG5RSHBWEVYKCYRJIVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6NY2FYTOG5RSHBWEVYKCYRJIVH","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":"cdad5c1fbd0798483aaa479badc85781740cc9cb3cf42b4a73cd34d7db46bc14","cross_cats_sorted":["cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T02:48:09Z","title_canon_sha256":"1a5b2ac6ee3b6a8a1a75d0143a26131a97dfce46a89b9c261e3c30258fbae22f"},"schema_version":"1.0","source":{"id":"1507.03707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03707","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03707v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03707","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"6NY2FYTOG5RS","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6NY2FYTOG5RSHBWE","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6NY2FYTO","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:e264f7f88aeae59f9f68b7b1e0d32577ac4ba74ea5fb4ea730a4f4f7c8682424","target":"graph","created_at":"2026-05-18T01:36:57Z","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":"This paper considers reconstructing a spectrally sparse signal from a small number of randomly observed time-domain samples. The signal of interest is a linear combination of complex sinusoids at $R$ distinct frequencies. The frequencies can assume any continuous values in the normalized frequency domain $[0,1)$. After converting the spectrally sparse signal recovery into a low rank structured matrix completion problem, we propose an efficient feasible point approach, named projected Wirtinger gradient descent (PWGD) algorithm, to efficiently solve this structured matrix completion problem. We","authors_text":"Jian-Feng Cai, Suhui Liu, Weiyu Xu","cross_cats":["cs.LG","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T02:48:09Z","title":"Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03707","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:ea910c7c35fe85153f5419a0b947ae3ab57254bc7a7b22438391fa79ccc209b0","target":"record","created_at":"2026-05-18T01:36:57Z","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":"cdad5c1fbd0798483aaa479badc85781740cc9cb3cf42b4a73cd34d7db46bc14","cross_cats_sorted":["cs.LG","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T02:48:09Z","title_canon_sha256":"1a5b2ac6ee3b6a8a1a75d0143a26131a97dfce46a89b9c261e3c30258fbae22f"},"schema_version":"1.0","source":{"id":"1507.03707","kind":"arxiv","version":1}},"canonical_sha256":"f371a2e26e37632386c4ae142c4528a9cfe232150b19bccecf5829e88af8e009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f371a2e26e37632386c4ae142c4528a9cfe232150b19bccecf5829e88af8e009","first_computed_at":"2026-05-18T01:36:57.524045Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:57.524045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8gqKYcVKglI00yWj7/IL1lGAN/vtf+0V2SmG0kqdzB+UPepfqrLTVvoHPU7oQMt4YOLbcdc0JwvNqWJ8oZ72Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:57.524566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea910c7c35fe85153f5419a0b947ae3ab57254bc7a7b22438391fa79ccc209b0","sha256:e264f7f88aeae59f9f68b7b1e0d32577ac4ba74ea5fb4ea730a4f4f7c8682424"],"state_sha256":"a0fce52f5c86f3af18f692614173b3ce6703e266d4366617da9850f6008daea4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogm2ObM6f0lpx8D5/WSXA9h67E+82+qmi6iQXGpKI6Zj6pb4Jqm5pQAb5o73XcxjBw2/Pj+JM9gXkEJeMzjHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:33:24.132777Z","bundle_sha256":"38a59c574452e48f0eab056bcd007eaba12c742d5d152a8dd328db564ba26385"}}