{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X7OQYQ3CTCK36PVNZIQL4PUC62","short_pith_number":"pith:X7OQYQ3C","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"},"canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","source":{"kind":"arxiv","id":"1605.02138","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02138","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02138v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02138","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"X7OQYQ3CTCK3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X7OQYQ3CTCK36PVN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X7OQYQ3C","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X7OQYQ3CTCK36PVNZIQL4PUC62","target":"record","payload":{"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"},"canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","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"},"source_kind":"arxiv","source_id":"1605.02138","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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbFJFzARsj8I9Uq6QWxjbJyffIPmF0yHWaxjlJa+UQGi0gPQxLtBS68lFoCbWlUnZ+k+yWphwY5eOB17nMdRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:59:50.347491Z"},"content_sha256":"92801b73f1fb25f85bbb9ad0eb167550cf1d6876e077be2a75e55e37fa7f51ea","schema_version":"1.0","event_id":"sha256:92801b73f1fb25f85bbb9ad0eb167550cf1d6876e077be2a75e55e37fa7f51ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X7OQYQ3CTCK36PVNZIQL4PUC62","target":"graph","payload":{"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"},"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:15:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqWcgFmEa4nwRw//qI2JiS/B3MD8KbvS2ACaIOHuzrE6he8I5Dvhg2VLsPamj1GwE1U9tXLLntzb3kC5SGyGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:59:50.348153Z"},"content_sha256":"7cbf3f9469637d42c7f69cd70c932696cb38d03224967fa95ba4a24c04fb892c","schema_version":"1.0","event_id":"sha256:7cbf3f9469637d42c7f69cd70c932696cb38d03224967fa95ba4a24c04fb892c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/bundle.json","state_url":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/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-25T04:59:50Z","links":{"resolver":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62","bundle":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/bundle.json","state":"https://pith.science/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7OQYQ3CTCK36PVNZIQL4PUC62/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X7OQYQ3CTCK36PVNZIQL4PUC62","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":"62f8b6794fd25966de2eb738935b9b07c50718aef7f0c12778e3ab48a0bc995e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-07T03:15:01Z","title_canon_sha256":"e643782ed620c994bf2bdd449d25b2e18473542cec4a9872b03e616d690edfba"},"schema_version":"1.0","source":{"id":"1605.02138","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02138","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02138v1","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02138","created_at":"2026-05-18T01:15:21Z"},{"alias_kind":"pith_short_12","alias_value":"X7OQYQ3CTCK3","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X7OQYQ3CTCK36PVN","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X7OQYQ3C","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:7cbf3f9469637d42c7f69cd70c932696cb38d03224967fa95ba4a24c04fb892c","target":"graph","created_at":"2026-05-18T01:15:21Z","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":"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","authors_text":"Donggyu Kim, Juhee Cho, Karl Rohe","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-07T03:15:01Z","title":"Intelligent Initialization and Adaptive Thresholding for Iterative Matrix Completion; Some Statistical and Algorithmic Theory for Adaptive-Impute"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02138","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:92801b73f1fb25f85bbb9ad0eb167550cf1d6876e077be2a75e55e37fa7f51ea","target":"record","created_at":"2026-05-18T01:15:21Z","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":"62f8b6794fd25966de2eb738935b9b07c50718aef7f0c12778e3ab48a0bc995e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-05-07T03:15:01Z","title_canon_sha256":"e643782ed620c994bf2bdd449d25b2e18473542cec4a9872b03e616d690edfba"},"schema_version":"1.0","source":{"id":"1605.02138","kind":"arxiv","version":1}},"canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfdd0c43629895bf3eadca20be3e82f6ae3585c41530240625cea93557526aab","first_computed_at":"2026-05-18T01:15:21.980056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:21.980056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N7eLeHcH9zr09m4JaApXrZKlN3lRBfCI+CZUZjkNTf09JMLpfYBZ+pwP7B7bOWw99tmzf2Nozpt5yYDXBs15Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:21.980736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02138","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92801b73f1fb25f85bbb9ad0eb167550cf1d6876e077be2a75e55e37fa7f51ea","sha256:7cbf3f9469637d42c7f69cd70c932696cb38d03224967fa95ba4a24c04fb892c"],"state_sha256":"645e3bf2f745ca75e8087c2233f23c6881c51bafbd54cd9bfa2f5f1c0f7d5dd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArC3RlrVBoBx7LNq5y3A7Hm/xM+YAXSaP089H7N0JSLcgmE5FJFnF+7icYi+vVQdZsDC3MMvTkj21lGTgsnzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:59:50.351739Z","bundle_sha256":"f45cba3861ee48387fb1835894b108469c2e516171777d4132fde7f0ed4f46e6"}}