{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WUAHMIBFLIZHGN7HGLDMSDEJHT","short_pith_number":"pith:WUAHMIBF","schema_version":"1.0","canonical_sha256":"b5007620255a327337e732c6c90c893ceb9605a9ff2228f552ec22beafdad89d","source":{"kind":"arxiv","id":"1602.07783","version":2},"attestation_state":"computed","paper":{"title":"Top-N Recommendation with Novel Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.IR","authors_text":"Qiang Cheng, Zhao Kang","submitted_at":"2016-02-25T03:33:44Z","abstract_excerpt":"The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear norm as a convex relaxation for the rank function and has achieved better recommendation accuracy than the state-of-the-art methods. In the past several years, solving rank minimization problems by leveraging nonconvex relaxations has received increasing attention. Some empirical re"},"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":"1602.07783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-02-25T03:33:44Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0f2d4365ea448fd32049a2a5e413b0e0f21a1da7f16d50fbd2068fa7cae397c7","abstract_canon_sha256":"66a4e0d126cbc5b338106c92a4e257a9fc14c8c51a0aeaed9c1f5daae88b6938"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:56.863667Z","signature_b64":"mD/VvPqSQ3Ds8jcptrU26D/YquF0EkCY+dHOObVLpofFverxhbF4x2hr3LyLtOwEHOCWM8hfsaN0Zvb/FLuJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5007620255a327337e732c6c90c893ceb9605a9ff2228f552ec22beafdad89d","last_reissued_at":"2026-05-18T01:19:56.862982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:56.862982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-N Recommendation with Novel Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.IR","authors_text":"Qiang Cheng, Zhao Kang","submitted_at":"2016-02-25T03:33:44Z","abstract_excerpt":"The importance of accurate recommender systems has been widely recognized by academia and industry. However, the recommendation quality is still rather low. Recently, a linear sparse and low-rank representation of the user-item matrix has been applied to produce Top-N recommendations. This approach uses the nuclear norm as a convex relaxation for the rank function and has achieved better recommendation accuracy than the state-of-the-art methods. In the past several years, solving rank minimization problems by leveraging nonconvex relaxations has received increasing attention. Some empirical re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07783","kind":"arxiv","version":2},"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":"1602.07783","created_at":"2026-05-18T01:19:56.863086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07783v2","created_at":"2026-05-18T01:19:56.863086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07783","created_at":"2026-05-18T01:19:56.863086+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUAHMIBFLIZH","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUAHMIBFLIZHGN7H","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUAHMIBF","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/WUAHMIBFLIZHGN7HGLDMSDEJHT","json":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT.json","graph_json":"https://pith.science/api/pith-number/WUAHMIBFLIZHGN7HGLDMSDEJHT/graph.json","events_json":"https://pith.science/api/pith-number/WUAHMIBFLIZHGN7HGLDMSDEJHT/events.json","paper":"https://pith.science/paper/WUAHMIBF"},"agent_actions":{"view_html":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT","download_json":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT.json","view_paper":"https://pith.science/paper/WUAHMIBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07783&json=true","fetch_graph":"https://pith.science/api/pith-number/WUAHMIBFLIZHGN7HGLDMSDEJHT/graph.json","fetch_events":"https://pith.science/api/pith-number/WUAHMIBFLIZHGN7HGLDMSDEJHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT/action/storage_attestation","attest_author":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT/action/author_attestation","sign_citation":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT/action/citation_signature","submit_replication":"https://pith.science/pith/WUAHMIBFLIZHGN7HGLDMSDEJHT/action/replication_record"}},"created_at":"2026-05-18T01:19:56.863086+00:00","updated_at":"2026-05-18T01:19:56.863086+00:00"}