{"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":"/code/bpr-loss","entry":"bpr_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":8,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":12,"n_places_pointer_only":5,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"unverified":2},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2603.20283","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20283","title":"FastPFRec: A Fast Personalized Federated Recommendation with Secure Sharing ⋆","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yanzhenxing123/FastPFRec","path":"util/loss_torch.py","file_url":"https://github.com/yanzhenxing123/FastPFRec/blob/HEAD/util/loss_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cde07004ee483dbc","code_sha256_prefix":"cde07004ee483dbc","mcp_get_code":{"code_sha256":"cde07004ee483dbc"}},{"arxiv_id":"2603.20283","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-20283","title":"FastPFRec: A Fast Personalized Federated Recommendation with Secure Sharing ⋆","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yanzhenxing123/FastPFRec","path":"util/loss_tf.py","file_url":"https://github.com/yanzhenxing123/FastPFRec/blob/HEAD/util/loss_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9325c22d0eb06da3","code_sha256_prefix":"9325c22d0eb06da3","mcp_get_code":{"code_sha256":"9325c22d0eb06da3"}},{"arxiv_id":"2601.18106","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18106","title":"GLEN-Bench: A Graph-Language based Benchmark for Nutritional Health","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"J-Huang01/GLEN-Benchmark","path":"applications/food_recommendation/baseline.py","file_url":"https://github.com/J-Huang01/GLEN-Benchmark/blob/HEAD/applications/food_recommendation/baseline.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, J-Huang01/GLEN-Benchmark when it was checked","code_sha256":"f5c4c23d83e0f093","code_sha256_prefix":"f5c4c23d83e0f093","mcp_get_code":{"code_sha256":"f5c4c23d83e0f093"}},{"arxiv_id":"2410.07671","arxiv_id_is_arxiv":true,"paper":"/paper/disco-a-hierarchical-disentangled-cognitive","title":"DISCO: A Hierarchical Disentangled Cognitive Diagnosis Framework for Interpretable Job Recommendation","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LabyrinthineLeo/DISCO","path":"utils/utils.py","file_url":"https://github.com/LabyrinthineLeo/DISCO/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, LabyrinthineLeo/DISCO when it was checked","code_sha256":"9c25ba6a9a0e14ea","code_sha256_prefix":"9c25ba6a9a0e14ea","mcp_get_code":{"code_sha256":"9c25ba6a9a0e14ea"}},{"arxiv_id":"2405.00287","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/scone","path":"util/loss_torch.py","file_url":"https://github.com/jeongwhanchoi/scone/blob/HEAD/util/loss_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cde07004ee483dbc","code_sha256_prefix":"cde07004ee483dbc","mcp_get_code":{"code_sha256":"cde07004ee483dbc"}},{"arxiv_id":"2405.00287","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-sampling-for-contrastive-views-and","title":"SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/scone","path":"util/loss_tf.py","file_url":"https://github.com/jeongwhanchoi/scone/blob/HEAD/util/loss_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9325c22d0eb06da3","code_sha256_prefix":"9325c22d0eb06da3","mcp_get_code":{"code_sha256":"9325c22d0eb06da3"}},{"arxiv_id":"2403.04287","arxiv_id_is_arxiv":true,"paper":"/paper/dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"me-sonandme/DGR","path":"util/loss_torch.py","file_url":"https://github.com/me-sonandme/DGR/blob/HEAD/util/loss_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, me-sonandme/DGR when it was checked","code_sha256":"cde07004ee483dbc","code_sha256_prefix":"cde07004ee483dbc","mcp_get_code":{"code_sha256":"cde07004ee483dbc"}},{"arxiv_id":"2403.04287","arxiv_id_is_arxiv":true,"paper":"/paper/dgr-a-general-graph-desmoothing-framework-for","title":"DGR: A General Graph Desmoothing Framework for Recommendation via Global and Local Perspectives","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"me-sonandme/DGR","path":"util/loss_tf.py","file_url":"https://github.com/me-sonandme/DGR/blob/HEAD/util/loss_tf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, me-sonandme/DGR when it was checked","code_sha256":"9325c22d0eb06da3","code_sha256_prefix":"9325c22d0eb06da3","mcp_get_code":{"code_sha256":"9325c22d0eb06da3"}},{"arxiv_id":"2401.01527","arxiv_id_is_arxiv":true,"paper":"/paper/poisoning-attacks-against-recommender-systems","title":"Poisoning Attacks against Recommender Systems: A Survey","date":"2024-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderwzw/arlib","path":"util/loss.py","file_url":"https://github.com/coderwzw/arlib/blob/HEAD/util/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, coderwzw/arlib when it was checked","code_sha256":"80b7004abe5dc932","code_sha256_prefix":"80b7004abe5dc932","mcp_get_code":{"code_sha256":"80b7004abe5dc932"}},{"arxiv_id":"1511.06939","arxiv_id_is_arxiv":true,"paper":"/paper/session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maciejkula/spotlight","path":"spotlight/losses.py","file_url":"https://github.com/maciejkula/spotlight/blob/HEAD/spotlight/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1951fae7bf0d9f85","code_sha256_prefix":"1951fae7bf0d9f85","mcp_get_code":{"code_sha256":"1951fae7bf0d9f85"}},{"arxiv_id":"aaai_16593","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16593","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamHaoYuan/DSANForAAAI2021","path":"baselines/Bert4Rec.py","file_url":"https://github.com/SamHaoYuan/DSANForAAAI2021/blob/HEAD/baselines/Bert4Rec.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a20ea1f72a94658","code_sha256_prefix":"1a20ea1f72a94658","mcp_get_code":{"code_sha256":"1a20ea1f72a94658"}},{"arxiv_id":"aaai_16593","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_16593","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SamHaoYuan/DSANForAAAI2021","path":"baselines/pop.py","file_url":"https://github.com/SamHaoYuan/DSANForAAAI2021/blob/HEAD/baselines/pop.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2abc18fa0a079e3b","code_sha256_prefix":"2abc18fa0a079e3b","mcp_get_code":{"code_sha256":"2abc18fa0a079e3b"}}],"record_sha256":"606c4fe24cd247bc6af5b5537d885904bfb0c6c6153e2e54c32d985359979a31","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}