{"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/infonce-loss","entry":"infonce_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":5,"n_papers_ran":2,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":0,"unverified":2},"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":"2602.00350","paper":"/paper/arxiv-2602-00350","title":"ReLAPSe: Reinforcement-Learning-trained Adversarial Prompt Search for Erased concepts in unlearned diffusion models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"gmum/ReLaPSe","path":"ms_swift/swift/plugin/loss.py","file_url":"https://github.com/gmum/ReLaPSe/blob/HEAD/ms_swift/swift/plugin/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"79ded042e4ee077a","mcp_get_code":{"code_sha256":"79ded042e4ee077a"}},{"arxiv_id":"2405.13888","paper":"/paper/marrying-causal-representation-learning-with","title":"Marrying Causal Representation Learning with Dynamical Systems for Science","date":"2024-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CausalLearningAI/crl-dynamical-systems","path":"marrying/src/utils/losses.py","file_url":"https://github.com/CausalLearningAI/crl-dynamical-systems/blob/HEAD/marrying/src/utils/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d41b2149e408698","mcp_get_code":{"code_sha256":"9d41b2149e408698"}},{"arxiv_id":"2311.04056","paper":"/paper/multi-view-causal-representation-learning","title":"Multi-View Causal Representation Learning with Partial Observability","date":"2023-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causallearningai/multiview-crl","path":"losses.py","file_url":"https://github.com/causallearningai/multiview-crl/blob/HEAD/losses.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d41b2149e408698","mcp_get_code":{"code_sha256":"9d41b2149e408698"}},{"arxiv_id":"1911.05722","paper":"/paper/momentum-contrast-for-unsupervised-visual","title":"Momentum Contrast for Unsupervised Visual Representation Learning","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giakou4/pyssl","path":"builders/moco.py","file_url":"https://github.com/giakou4/pyssl/blob/HEAD/builders/moco.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5cd3d9e4fc246bdf","mcp_get_code":{"code_sha256":"5cd3d9e4fc246bdf"}},{"arxiv_id":"1808.06670","paper":"/paper/learning-deep-representations-by-mutual","title":"Learning deep representations by mutual information estimation and maximization","date":"2018-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schzhu/learning-adversarially-robust-representations","path":"robust_representations/functions/dim_losses.py","file_url":"https://github.com/schzhu/learning-adversarially-robust-representations/blob/HEAD/robust_representations/functions/dim_losses.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2ca8bbd852e6a9f2","mcp_get_code":{"code_sha256":"2ca8bbd852e6a9f2"}}]}