{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NKYBGUOCUR674HDZRC2H5NJK2W","short_pith_number":"pith:NKYBGUOC","schema_version":"1.0","canonical_sha256":"6ab01351c2a47dfe1c7988b47eb52ad5a7451f8c401d7682538e95a8df9dbe01","source":{"kind":"arxiv","id":"1901.01711","version":1},"attestation_state":"computed","paper":{"title":"Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fan Liu, Shengke Xue, Wenyuan Qiu, Xinyu Jin","submitted_at":"2019-01-07T09:04:37Z","abstract_excerpt":"Matrix completion focuses on recovering a matrix from a small subset of its observed elements, and has already gained cumulative attention in computer vision. Many previous approaches formulate this issue as a low-rank matrix approximation problem. Recently, a truncated nuclear norm has been presented as a surrogate of traditional nuclear norm, for better estimation to the rank of a matrix. The truncated nuclear norm regularization (TNNR) method is applicable in real-world scenarios. However, it is sensitive to the selection of the number of truncated singular values and requires numerous iter"},"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":"1901.01711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-01-07T09:04:37Z","cross_cats_sorted":[],"title_canon_sha256":"63998a0e2fe820064dc7a106eae945f19f111d1ca4c0f1abfd89532d8448addf","abstract_canon_sha256":"43cfcfa2cb4492d17a5ce447ea6eb4622aafb5d740d6efeaec841b35e1b43168"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.396387Z","signature_b64":"W6wypJUkvR0puavl/qz/bNMgGQWvHUw/cfxHUhXFiJWsC/eRAnamd+OIpid37FgR1c5rrh3TJkfZXz8EyExbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ab01351c2a47dfe1c7988b47eb52ad5a7451f8c401d7682538e95a8df9dbe01","last_reissued_at":"2026-05-17T23:56:51.395819Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.395819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fan Liu, Shengke Xue, Wenyuan Qiu, Xinyu Jin","submitted_at":"2019-01-07T09:04:37Z","abstract_excerpt":"Matrix completion focuses on recovering a matrix from a small subset of its observed elements, and has already gained cumulative attention in computer vision. Many previous approaches formulate this issue as a low-rank matrix approximation problem. Recently, a truncated nuclear norm has been presented as a surrogate of traditional nuclear norm, for better estimation to the rank of a matrix. The truncated nuclear norm regularization (TNNR) method is applicable in real-world scenarios. However, it is sensitive to the selection of the number of truncated singular values and requires numerous iter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01711","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":"1901.01711","created_at":"2026-05-17T23:56:51.395928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01711v1","created_at":"2026-05-17T23:56:51.395928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01711","created_at":"2026-05-17T23:56:51.395928+00:00"},{"alias_kind":"pith_short_12","alias_value":"NKYBGUOCUR67","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NKYBGUOCUR674HDZ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NKYBGUOC","created_at":"2026-05-18T12:33:24.271573+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/NKYBGUOCUR674HDZRC2H5NJK2W","json":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W.json","graph_json":"https://pith.science/api/pith-number/NKYBGUOCUR674HDZRC2H5NJK2W/graph.json","events_json":"https://pith.science/api/pith-number/NKYBGUOCUR674HDZRC2H5NJK2W/events.json","paper":"https://pith.science/paper/NKYBGUOC"},"agent_actions":{"view_html":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W","download_json":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W.json","view_paper":"https://pith.science/paper/NKYBGUOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01711&json=true","fetch_graph":"https://pith.science/api/pith-number/NKYBGUOCUR674HDZRC2H5NJK2W/graph.json","fetch_events":"https://pith.science/api/pith-number/NKYBGUOCUR674HDZRC2H5NJK2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W/action/storage_attestation","attest_author":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W/action/author_attestation","sign_citation":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W/action/citation_signature","submit_replication":"https://pith.science/pith/NKYBGUOCUR674HDZRC2H5NJK2W/action/replication_record"}},"created_at":"2026-05-17T23:56:51.395928+00:00","updated_at":"2026-05-17T23:56:51.395928+00:00"}