{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/collaborative-filtering/papers/14","list_of":"/task/collaborative-filtering","task":"Collaborative Filtering","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":14,"pages_in_order":14,"rows_per_page":100,"rows":[1301,1309],"of":1309,"counts":{"archive_papers_tagged":1309,"with_a_code_link":461,"where_syntology_ran_a_sample":63,"not_listed_spam_title":0,"listed":1309,"listed_where_code_ran":63,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":59,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":59,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/collaborative-filtering","prev":"/task/collaborative-filtering/papers/13","next":null,"papers":[{"url":null,"slug":"exploring-social-influence-for-recommendation","title":"Exploring Social Influence for Recommendation - A Probabilistic Generative Model Approach","date":"2011-09-04","arxiv_id":"1109.0758","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-matrix-completion-and-robust","title":"Distributed Matrix Completion and Robust Factorization","date":"2011-07-05","arxiv_id":"1107.0789","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-transductive-online-learning-via","title":"Efficient Transductive Online Learning via Randomized Rounding","date":"2011-06-13","arxiv_id":"1106.2429","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-column-manipulation","title":"Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs","date":"2011-02-10","arxiv_id":"1102.2254","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-in-a-non-uniform","title":"Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-large-scale-optimization-for-max","title":"Practical Large-Scale Optimization for Max-norm Regularization","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-relational-models-for-large-scale","title":"Stochastic Relational Models for Large-scale Dyadic Data using MCMC","date":"2008-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-quantum-statistics-in-data-analysis","title":"On quantum statistics in data analysis","date":"2008-02-10","arxiv_id":"0802.1296","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommender-system-for-online-dating-service","title":"Recommender System for Online Dating Service","date":"2007-03-09","arxiv_id":"cs/0703042","repositories_listed":0,"syntology":null}],"record_sha256":"f8b78a7f9557173cda0ad555a5520405b73668a9b535a4e6824b6a2a5b97d07b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}