{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X7OQYQ3CTCK36PVNZIQL4PUC62","short_pith_number":"pith:X7OQYQ3C","schema_version":"1.0","canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","source":{"kind":"arxiv","id":"1605.02138","version":1},"attestation_state":"computed","paper":{"title":"Intelligent Initialization and Adaptive Thresholding for Iterative Matrix Completion; Some Statistical and Algorithmic Theory for Adaptive-Impute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Donggyu Kim, Juhee Cho, Karl Rohe","submitted_at":"2016-05-07T03:15:01Z","abstract_excerpt":"Over the past decade, various matrix completion algorithms have been developed. Thresholded singular value decomposition (SVD) is a popular technique in implementing many of them. A sizable number of studies have shown its theoretical and empirical excellence, but choosing the right threshold level still remains as a key empirical difficulty. This paper proposes a novel matrix completion algorithm which iterates thresholded SVD with theoretically-justified and data-dependent values of thresholding parameters. The estimate of the proposed algorithm enjoys the minimax error rate and shows outsta"},"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":"1605.02138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-07T03:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"e643782ed620c994bf2bdd449d25b2e18473542cec4a9872b03e616d690edfba","abstract_canon_sha256":"62f8b6794fd25966de2eb738935b9b07c50718aef7f0c12778e3ab48a0bc995e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.980736Z","signature_b64":"N7eLeHcH9zr09m4JaApXrZKlN3lRBfCI+CZUZjkNTf09JMLpfYBZ+pwP7B7bOWw99tmzf2Nozpt5yYDXBs15Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","last_reissued_at":"2026-05-18T01:15:21.980056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.980056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intelligent Initialization and Adaptive Thresholding for Iterative Matrix Completion; Some Statistical and Algorithmic Theory for Adaptive-Impute","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Donggyu Kim, Juhee Cho, Karl Rohe","submitted_at":"2016-05-07T03:15:01Z","abstract_excerpt":"Over the past decade, various matrix completion algorithms have been developed. Thresholded singular value decomposition (SVD) is a popular technique in implementing many of them. A sizable number of studies have shown its theoretical and empirical excellence, but choosing the right threshold level still remains as a key empirical difficulty. This paper proposes a novel matrix completion algorithm which iterates thresholded SVD with theoretically-justified and data-dependent values of thresholding parameters. The estimate of the proposed algorithm enjoys the minimax error rate and shows outsta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02138","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":"1605.02138","created_at":"2026-05-18T01:15:21.980185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02138v1","created_at":"2026-05-18T01:15:21.980185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02138","created_at":"2026-05-18T01:15:21.980185+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7OQYQ3CTCK3","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7OQYQ3CTCK36PVN","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7OQYQ3C","created_at":"2026-05-18T12:30:51.357362+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/X7OQYQ3CTCK36PVNZIQL4PUC62","json":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62.json","graph_json":"https://pith.science/api/pith-number/X7OQYQ3CTCK36PVNZIQL4PUC62/graph.json","events_json":"https://pith.science/api/pith-number/X7OQYQ3CTCK36PVNZIQL4PUC62/events.json","paper":"https://pith.science/paper/X7OQYQ3C"},"agent_actions":{"view_html":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62","download_json":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62.json","view_paper":"https://pith.science/paper/X7OQYQ3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02138&json=true","fetch_graph":"https://pith.science/api/pith-number/X7OQYQ3CTCK36PVNZIQL4PUC62/graph.json","fetch_events":"https://pith.science/api/pith-number/X7OQYQ3CTCK36PVNZIQL4PUC62/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/action/storage_attestation","attest_author":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/action/author_attestation","sign_citation":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/action/citation_signature","submit_replication":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/action/replication_record"}},"created_at":"2026-05-18T01:15:21.980185+00:00","updated_at":"2026-05-18T01:15:21.980185+00:00"}