{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/info-nce-loss","entry":"info_nce_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":10,"n_papers_ran":5,"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":10,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"unverified":5},"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":"2608.18610","paper":"/paper/arxiv-2608-18610","title":"Denoising-Aware Inversion: Revealing Privacy Risks in Noise-Protected Text Embeddings","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ChrisWang233/DAEI","path":"DAEI/losses/contrastive.py","file_url":"https://github.com/ChrisWang233/DAEI/blob/HEAD/DAEI/losses/contrastive.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f834afa092a0807a","mcp_get_code":{"code_sha256":"f834afa092a0807a"}},{"arxiv_id":"2602.06409","paper":"/paper/arxiv-2602-06409","title":"VENOMREC: Cross-Modal Interactive Poisoning for Targeted Promotion in Multimodal LLM Recommender Systems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"GuoweiGuan666/VenomRec","path":"attack/ours/dcip_ieos/interactive.py","file_url":"https://github.com/GuoweiGuan666/VenomRec/blob/HEAD/attack/ours/dcip_ieos/interactive.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b84770e3b3129208","mcp_get_code":{"code_sha256":"b84770e3b3129208"}},{"arxiv_id":"2601.18106","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b7be2139fef54777","mcp_get_code":{"code_sha256":"b7be2139fef54777"}},{"arxiv_id":"2601.03401","paper":"/paper/arxiv-2601-03401","title":"Rendering Data Unlearnable by Exploiting LLM Alignment Mechanisms","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"cat-claws/unlearnable","path":"learn-info.py","file_url":"https://github.com/cat-claws/unlearnable/blob/HEAD/learn-info.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2874718fd7af4eb8","mcp_get_code":{"code_sha256":"2874718fd7af4eb8"}},{"arxiv_id":"2512.14395","paper":"/paper/arxiv-2512-14395","title":"Massive Editing for Large Language Models Based on Dynamic Weight Generation","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"RodeWayne/MeG-for-Knowledge-Editing","path":"train_bert.py","file_url":"https://github.com/RodeWayne/MeG-for-Knowledge-Editing/blob/HEAD/train_bert.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"288bee548024f0bc","mcp_get_code":{"code_sha256":"288bee548024f0bc"}},{"arxiv_id":"2404.10575","paper":"/paper/emc-2-efficient-mcmc-negative-sampling-for","title":"EMC$^2$: Efficient MCMC Negative Sampling for Contrastive Learning with Global Convergence","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/contrastive_emc2","path":"main_simclr.py","file_url":"https://github.com/amazon-science/contrastive_emc2/blob/HEAD/main_simclr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"044dd7c8dd4adba5","mcp_get_code":{"code_sha256":"044dd7c8dd4adba5"}},{"arxiv_id":"2402.14430","paper":"/paper/robust-training-of-federated-models-with","title":"Robust Training of Federated Models with Extremely Label Deficiency","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/Twin-sight","path":"ssl_model/ssl_utils.py","file_url":"https://github.com/tmlr-group/Twin-sight/blob/HEAD/ssl_model/ssl_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"973aed3b1cfc39d1","mcp_get_code":{"code_sha256":"973aed3b1cfc39d1"}},{"arxiv_id":"2210.16870","paper":"/paper/a-simple-efficient-and-scalable-contrastive","title":"A simple, efficient and scalable contrastive masked autoencoder for learning visual representations","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bwconrad/can","path":"src/loss.py","file_url":"https://github.com/bwconrad/can/blob/HEAD/src/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bf724860a92f3c7f","mcp_get_code":{"code_sha256":"bf724860a92f3c7f"}},{"arxiv_id":"2110.15255","paper":"/paper/self-supervised-learning-disentangled-group","title":"Self-Supervised Learning Disentangled Group Representation as Feature","date":"2021-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wangt-CN/IP-IRM","path":"utils.py","file_url":"https://github.com/Wangt-CN/IP-IRM/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0c2f331c4e2e046a","mcp_get_code":{"code_sha256":"0c2f331c4e2e046a"}},{"arxiv_id":"2025.findings-acl.414","paper":null,"title":"arXiv:2025.findings-acl.414","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yoimiya-nlp/CLeVeR","path":"model.py","file_url":"https://github.com/yoimiya-nlp/CLeVeR/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3e31195ce2e72db0","mcp_get_code":{"code_sha256":"3e31195ce2e72db0"}}]}