{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FWJSTKGFJKD3AYILLTNMCSNZFT","short_pith_number":"pith:FWJSTKGF","canonical_record":{"source":{"id":"2012.07433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-12-14T11:38:53Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"403bf7c05ddea4e5e94780f7dc0074e89f3af54a2594c8884c04aa7d51844f18","abstract_canon_sha256":"71c1bf0974469f4c944851c5a3254ebb23125ea984e3dfa9aaf2764328fecf81"},"schema_version":"1.0"},"canonical_sha256":"2d9329a8c54a87b0610b5cdac149b92cc1d6d1d72e9bb52760cd1d41eab95bf8","source":{"kind":"arxiv","id":"2012.07433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07433","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07433v1","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07433","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"FWJSTKGFJKD3","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_16","alias_value":"FWJSTKGFJKD3AYIL","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_8","alias_value":"FWJSTKGF","created_at":"2026-07-05T03:30:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FWJSTKGFJKD3AYILLTNMCSNZFT","target":"record","payload":{"canonical_record":{"source":{"id":"2012.07433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-12-14T11:38:53Z","cross_cats_sorted":["cs.SY","eess.SP"],"title_canon_sha256":"403bf7c05ddea4e5e94780f7dc0074e89f3af54a2594c8884c04aa7d51844f18","abstract_canon_sha256":"71c1bf0974469f4c944851c5a3254ebb23125ea984e3dfa9aaf2764328fecf81"},"schema_version":"1.0"},"canonical_sha256":"2d9329a8c54a87b0610b5cdac149b92cc1d6d1d72e9bb52760cd1d41eab95bf8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:08.044455Z","signature_b64":"AN4C0z68biQk8mjr4Q0AWbzHQZfqb9bdqSjd1fLejbumZ5Q2B4jtdtt10qqy3NULZl1YyBRIxlgM0GKvy9juAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d9329a8c54a87b0610b5cdac149b92cc1d6d1d72e9bb52760cd1d41eab95bf8","last_reissued_at":"2026-07-05T03:30:08.044047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:08.044047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2012.07433","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-07-05T03:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RlR27pPwYLx6lp/KXtZPEmzwpauC9VUBLZzXW2T6LlA2CftW6phKSqfLOzIRTnBd8ggKmczvIz0YbmW8kICAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T20:34:05.818099Z"},"content_sha256":"1f9be572690810f1dc5827b467f15fe0a9acb97c1e7f213488ac9104ccf2102b","schema_version":"1.0","event_id":"sha256:1f9be572690810f1dc5827b467f15fe0a9acb97c1e7f213488ac9104ccf2102b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FWJSTKGFJKD3AYILLTNMCSNZFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Low-Rank Hankel Matrix Denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SP"],"primary_cat":"eess.SY","authors_text":"Mingzhou Yin, Roy S. Smith","submitted_at":"2020-12-14T11:38:53Z","abstract_excerpt":"The low-complexity assumption in linear systems can often be expressed as rank deficiency in data matrices with generalized Hankel structure. This makes it possible to denoise the data by estimating the underlying structured low-rank matrix. However, standard low-rank approximation approaches are not guaranteed to perform well in estimating the noise-free matrix. In this paper, recent results in matrix denoising by singular value shrinkage are reviewed. A novel approach is proposed to solve the low-rank Hankel matrix denoising problem by using an iterative algorithm in structured low-rank appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07433","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2012.07433/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:30:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7/KErlX8cXf0X8Atd2knFxeJ0xHOP42hmBHfhImg2hsDfAjfmeS9yvgl2OR2kwyZfNslS5nuAAujSmXGyWMyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T20:34:05.818509Z"},"content_sha256":"ec6e5697e6e1ee54f329fc4b11dcbeba3b58ef6e3c0fa14b82a9b3a0b72d5d05","schema_version":"1.0","event_id":"sha256:ec6e5697e6e1ee54f329fc4b11dcbeba3b58ef6e3c0fa14b82a9b3a0b72d5d05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/bundle.json","state_url":"https://pith.science/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/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-07-14T20:34:05Z","links":{"resolver":"https://pith.science/pith/FWJSTKGFJKD3AYILLTNMCSNZFT","bundle":"https://pith.science/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/bundle.json","state":"https://pith.science/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWJSTKGFJKD3AYILLTNMCSNZFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FWJSTKGFJKD3AYILLTNMCSNZFT","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":"71c1bf0974469f4c944851c5a3254ebb23125ea984e3dfa9aaf2764328fecf81","cross_cats_sorted":["cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-12-14T11:38:53Z","title_canon_sha256":"403bf7c05ddea4e5e94780f7dc0074e89f3af54a2594c8884c04aa7d51844f18"},"schema_version":"1.0","source":{"id":"2012.07433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2012.07433","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"arxiv_version","alias_value":"2012.07433v1","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.07433","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_12","alias_value":"FWJSTKGFJKD3","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_16","alias_value":"FWJSTKGFJKD3AYIL","created_at":"2026-07-05T03:30:08Z"},{"alias_kind":"pith_short_8","alias_value":"FWJSTKGF","created_at":"2026-07-05T03:30:08Z"}],"graph_snapshots":[{"event_id":"sha256:ec6e5697e6e1ee54f329fc4b11dcbeba3b58ef6e3c0fa14b82a9b3a0b72d5d05","target":"graph","created_at":"2026-07-05T03:30: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2012.07433/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The low-complexity assumption in linear systems can often be expressed as rank deficiency in data matrices with generalized Hankel structure. This makes it possible to denoise the data by estimating the underlying structured low-rank matrix. However, standard low-rank approximation approaches are not guaranteed to perform well in estimating the noise-free matrix. In this paper, recent results in matrix denoising by singular value shrinkage are reviewed. A novel approach is proposed to solve the low-rank Hankel matrix denoising problem by using an iterative algorithm in structured low-rank appr","authors_text":"Mingzhou Yin, Roy S. Smith","cross_cats":["cs.SY","eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-12-14T11:38:53Z","title":"On Low-Rank Hankel Matrix Denoising"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.07433","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:1f9be572690810f1dc5827b467f15fe0a9acb97c1e7f213488ac9104ccf2102b","target":"record","created_at":"2026-07-05T03:30: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":"71c1bf0974469f4c944851c5a3254ebb23125ea984e3dfa9aaf2764328fecf81","cross_cats_sorted":["cs.SY","eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2020-12-14T11:38:53Z","title_canon_sha256":"403bf7c05ddea4e5e94780f7dc0074e89f3af54a2594c8884c04aa7d51844f18"},"schema_version":"1.0","source":{"id":"2012.07433","kind":"arxiv","version":1}},"canonical_sha256":"2d9329a8c54a87b0610b5cdac149b92cc1d6d1d72e9bb52760cd1d41eab95bf8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d9329a8c54a87b0610b5cdac149b92cc1d6d1d72e9bb52760cd1d41eab95bf8","first_computed_at":"2026-07-05T03:30:08.044047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:30:08.044047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AN4C0z68biQk8mjr4Q0AWbzHQZfqb9bdqSjd1fLejbumZ5Q2B4jtdtt10qqy3NULZl1YyBRIxlgM0GKvy9juAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:30:08.044455Z","signed_message":"canonical_sha256_bytes"},"source_id":"2012.07433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f9be572690810f1dc5827b467f15fe0a9acb97c1e7f213488ac9104ccf2102b","sha256:ec6e5697e6e1ee54f329fc4b11dcbeba3b58ef6e3c0fa14b82a9b3a0b72d5d05"],"state_sha256":"e0f4c0a77067c1dec9f02d0a8d5a4f243e03d1e14a1183de21004051f7476bae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7btE08qO5M5Akc3fS/DY5V0N8eW16/vtl2pDdDPUDEkuiatn4MN9/J7+8yed5RiU4WcXB55edVVqFxpAyX3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T20:34:05.821201Z","bundle_sha256":"61c76fd7e2e91e5bfcf9b0b97e43f0215c6b4ec3a935b5f7118d498b295f024a"}}