{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4BH5EZJ2UL6WQJQK2YWR4ZKJZK","short_pith_number":"pith:4BH5EZJ2","schema_version":"1.0","canonical_sha256":"e04fd2653aa2fd68260ad62d1e6549ca9263c94b641dbe3711962d4faaf0d783","source":{"kind":"arxiv","id":"1802.08242","version":1},"attestation_state":"computed","paper":{"title":"Structured low-rank matrix completion for forecasting in time series analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.NA","stat.ML"],"primary_cat":"stat.ME","authors_text":"Jonathan Gillard, Konstantin Usevich","submitted_at":"2018-02-22T18:56:27Z","abstract_excerpt":"In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a rank constraint. We consider a matrix completion problem for Hankel matrices and a convex relaxation based on the nuclear norm. Based on new theoretical results and a number of numerical and real examples, we investigate the cases when the proposed approach can work. Our results highlight the importance of choosing a proper weighting scheme for the known ob"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.08242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-02-22T18:56:27Z","cross_cats_sorted":["cs.SY","math.NA","stat.ML"],"title_canon_sha256":"397d8091c68c5efb3be4ca56230bd0298a9222261ced85718a01e45e4f6e5952","abstract_canon_sha256":"beee9d674f9bb14cc156aa035236c23d1f48e39d6c445a861272588d99e07246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:45.190464Z","signature_b64":"z+id6DOSen0VxBOe2yQmKu2xhCd7op2vo324Ilq80I6aARUCqLDX8FTsGknu5ZlV1BEztUHq5voQZt2gAQcbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e04fd2653aa2fd68260ad62d1e6549ca9263c94b641dbe3711962d4faaf0d783","last_reissued_at":"2026-05-18T00:22:45.189858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:45.189858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured low-rank matrix completion for forecasting in time series analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.NA","stat.ML"],"primary_cat":"stat.ME","authors_text":"Jonathan Gillard, Konstantin Usevich","submitted_at":"2018-02-22T18:56:27Z","abstract_excerpt":"In this paper we consider the low-rank matrix completion problem with specific application to forecasting in time series analysis. Briefly, the low-rank matrix completion problem is the problem of imputing missing values of a matrix under a rank constraint. We consider a matrix completion problem for Hankel matrices and a convex relaxation based on the nuclear norm. Based on new theoretical results and a number of numerical and real examples, we investigate the cases when the proposed approach can work. Our results highlight the importance of choosing a proper weighting scheme for the known ob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08242","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.08242","created_at":"2026-05-18T00:22:45.189939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.08242v1","created_at":"2026-05-18T00:22:45.189939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08242","created_at":"2026-05-18T00:22:45.189939+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BH5EZJ2UL6W","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BH5EZJ2UL6WQJQK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BH5EZJ2","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK","json":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK.json","graph_json":"https://pith.science/api/pith-number/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/graph.json","events_json":"https://pith.science/api/pith-number/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/events.json","paper":"https://pith.science/paper/4BH5EZJ2"},"agent_actions":{"view_html":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK","download_json":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK.json","view_paper":"https://pith.science/paper/4BH5EZJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.08242&json=true","fetch_graph":"https://pith.science/api/pith-number/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/graph.json","fetch_events":"https://pith.science/api/pith-number/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/action/storage_attestation","attest_author":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/action/author_attestation","sign_citation":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/action/citation_signature","submit_replication":"https://pith.science/pith/4BH5EZJ2UL6WQJQK2YWR4ZKJZK/action/replication_record"}},"created_at":"2026-05-18T00:22:45.189939+00:00","updated_at":"2026-05-18T00:22:45.189939+00:00"}