{"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/contrastiveloss","entry":"ContrastiveLoss","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":16,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":1,"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":16,"n_samples_ran":15,"n_samples_constructed":6,"n_samples_ran_checked":14,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":16,"n_places_pointer_only":11,"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":1,"ran_fixture":0,"ran":14,"unverified":1},"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.03314","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03314","title":"Towards Self-Robust LLMs: Intrinsic Prompt Noise Resistance via CoIPO","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"vegetable-yx/CoIPO","path":"ContrastiveLlama.py","file_url":"https://github.com/vegetable-yx/CoIPO/blob/HEAD/ContrastiveLlama.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, vegetable-yx/CoIPO when it was checked","code_sha256":"d9cf256672b2d843","code_sha256_prefix":"d9cf256672b2d843","mcp_get_code":{"code_sha256":"d9cf256672b2d843"}},{"arxiv_id":"2602.01920","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01920","title":"PIMPC-GNN: Physics-Informed Multi-Phase Consensus Learning for Enhancing Imbalanced Node Classification in Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"afofanah/PIMPC-GNN","path":"models/model.py","file_url":"https://github.com/afofanah/PIMPC-GNN/blob/HEAD/models/model.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":"a6c95628ced93c31","code_sha256_prefix":"a6c95628ced93c31","mcp_get_code":{"code_sha256":"a6c95628ced93c31"}},{"arxiv_id":"2601.04587","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-04587","title":"FedKDX: Federated Learning with Negative Knowledge Distillation for Enhanced Healthcare AI Systems","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"phamdinhdat-ai/Fed_2024","path":"system/flcore/servers/serverkdx.py","file_url":"https://github.com/phamdinhdat-ai/Fed_2024/blob/HEAD/system/flcore/servers/serverkdx.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, phamdinhdat-ai/Fed_2024 when it was checked","code_sha256":"3d4ab06e7e5d6d95","code_sha256_prefix":"3d4ab06e7e5d6d95","mcp_get_code":{"code_sha256":"3d4ab06e7e5d6d95"}},{"arxiv_id":"2510.04910","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-04910","title":"Glocal Information Bottleneck for Time Series Imputation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"Muyiiiii/NeurIPS-25-Glocal-IB","path":"Glocal_IB/Glocal_IB.py","file_url":"https://github.com/Muyiiiii/NeurIPS-25-Glocal-IB/blob/HEAD/Glocal_IB/Glocal_IB.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Muyiiiii/NeurIPS-25-Glocal-IB when it was checked","code_sha256":"a877bbca8b4196f6","code_sha256_prefix":"a877bbca8b4196f6","mcp_get_code":{"code_sha256":"a877bbca8b4196f6"}},{"arxiv_id":"2507.03434","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.03434","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"hhc1997/NCU","path":"src/ul_clip.py","file_url":"https://github.com/hhc1997/NCU/blob/HEAD/src/ul_clip.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9f3a1ba8b40511d","code_sha256_prefix":"e9f3a1ba8b40511d","mcp_get_code":{"code_sha256":"e9f3a1ba8b40511d"}},{"arxiv_id":"2504.07962","arxiv_id_is_arxiv":true,"paper":"/paper/glus-global-local-reasoning-unified-into-a","title":"GLUS: Global-Local Reasoning Unified into A Single Large Language Model for Video Segmentation","date":"2025-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GLUS-video/GLUS","path":"model/GLUS.py","file_url":"https://github.com/GLUS-video/GLUS/blob/HEAD/model/GLUS.py","status":"ran","verification_level":1,"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, GLUS-video/GLUS when it was checked","code_sha256":"fafc49e646cbb27e","code_sha256_prefix":"fafc49e646cbb27e","mcp_get_code":{"code_sha256":"fafc49e646cbb27e"}},{"arxiv_id":"2502.19962","arxiv_id_is_arxiv":true,"paper":"/paper/recon-enhancing-true-correspondence-1","title":"ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning","date":"2025-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qxzha/ReCon","path":"models/SGRAF.py","file_url":"https://github.com/qxzha/ReCon/blob/HEAD/models/SGRAF.py","status":"ran","verification_level":1,"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":"f6a9075db2f6b770","code_sha256_prefix":"f6a9075db2f6b770","mcp_get_code":{"code_sha256":"f6a9075db2f6b770"}},{"arxiv_id":"2403.05105","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rematch-mismatched-pairs-for","title":"Learning to Rematch Mismatched Pairs for Robust Cross-Modal Retrieval","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhc1997/l2rm","path":"models.py","file_url":"https://github.com/hhc1997/l2rm/blob/HEAD/models.py","status":"ran","verification_level":1,"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, hhc1997/l2rm when it was checked","code_sha256":"432d59115f341570","code_sha256_prefix":"432d59115f341570","mcp_get_code":{"code_sha256":"432d59115f341570"}},{"arxiv_id":"2312.03781","arxiv_id_is_arxiv":true,"paper":"/paper/lite-mind-towards-efficient-and-versatile","title":"Lite-Mind: Towards Efficient and Robust Brain Representation Network","date":"2023-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gongzix/lite-mind","path":"src/engine.py","file_url":"https://github.com/gongzix/lite-mind/blob/HEAD/src/engine.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, gongzix/lite-mind when it was checked","code_sha256":"fd13056f9c0d2756","code_sha256_prefix":"fd13056f9c0d2756","mcp_get_code":{"code_sha256":"fd13056f9c0d2756"}},{"arxiv_id":"2310.17468","arxiv_id_is_arxiv":true,"paper":"/paper/cross-modal-active-complementary-learning-1","title":"Cross-modal Active Complementary Learning with Self-refining Correspondence","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinyang79/crcl","path":"CRCL_NeurIPS23/model/CRCL.py","file_url":"https://github.com/qinyang79/crcl/blob/HEAD/CRCL_NeurIPS23/model/CRCL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, qinyang79/crcl when it was checked","code_sha256":"0822e67441847823","code_sha256_prefix":"0822e67441847823","mcp_get_code":{"code_sha256":"0822e67441847823"}},{"arxiv_id":"2304.12824","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-energy-prediction-for-exact","title":"Contrastive Energy Prediction for Exact Energy-Guided Diffusion Sampling in Offline Reinforcement Learning","date":"2023-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendilab/DI-engine","path":"ding/torch_utils/loss/contrastive_loss.py","file_url":"https://github.com/opendilab/DI-engine/blob/HEAD/ding/torch_utils/loss/contrastive_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a58c4f9c165debe0","code_sha256_prefix":"a58c4f9c165debe0","mcp_get_code":{"code_sha256":"a58c4f9c165debe0"}},{"arxiv_id":"2303.12419","arxiv_id_is_arxiv":true,"paper":"/paper/bicro-noisy-correspondence-rectification-for","title":"BiCro: Noisy Correspondence Rectification for Multi-modality Data via Bi-directional Cross-modal Similarity Consistency","date":"2023-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xu5zhao/BiCro","path":"model.py","file_url":"https://github.com/xu5zhao/BiCro/blob/HEAD/model.py","status":"ran","verification_level":1,"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, xu5zhao/BiCro when it was checked","code_sha256":"8195ef599b6ffb8c","code_sha256_prefix":"8195ef599b6ffb8c","mcp_get_code":{"code_sha256":"8195ef599b6ffb8c"}},{"arxiv_id":"2203.03871","arxiv_id_is_arxiv":true,"paper":"/paper/discriminability-transferability-trade-off-an","title":"Discriminability-Transferability Trade-Off: An Information-Theoretic Perspective","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dtennant/dt-tradeoff","path":"ctc/criterion.py","file_url":"https://github.com/dtennant/dt-tradeoff/blob/HEAD/ctc/criterion.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, dtennant/dt-tradeoff when it was checked","code_sha256":"47efee388b17abe8","code_sha256_prefix":"47efee388b17abe8","mcp_get_code":{"code_sha256":"47efee388b17abe8"}},{"arxiv_id":"2104.00820","arxiv_id_is_arxiv":true,"paper":"/paper/latentclr-a-contrastive-learning-approach-for","title":"LatentCLR: A Contrastive Learning Approach for Unsupervised Discovery of Interpretable Directions","date":"2021-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"catlab-team/latentclr","path":"colat/loss.py","file_url":"https://github.com/catlab-team/latentclr/blob/HEAD/colat/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, catlab-team/latentclr when it was checked","code_sha256":"e696f1d781289c72","code_sha256_prefix":"e696f1d781289c72","mcp_get_code":{"code_sha256":"e696f1d781289c72"}},{"arxiv_id":"2101.01368","arxiv_id_is_arxiv":true,"paper":"/paper/similarity-reasoning-and-filtration-for-image","title":"Similarity Reasoning and Filtration for Image-Text Matching","date":"2021-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Paranioar/SGRAF","path":"model.py","file_url":"https://github.com/Paranioar/SGRAF/blob/HEAD/model.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, Paranioar/SGRAF when it was checked","code_sha256":"94a076af96564b32","code_sha256_prefix":"94a076af96564b32","mcp_get_code":{"code_sha256":"94a076af96564b32"}},{"arxiv_id":"2010.11929","arxiv_id_is_arxiv":true,"paper":"/paper/an-image-is-worth-16x16-words-transformers-1","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ludics/ViT-Retri","path":"vit_retri/models/modeling.py","file_url":"https://github.com/ludics/ViT-Retri/blob/HEAD/vit_retri/models/modeling.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33a1d26b73f77059","code_sha256_prefix":"33a1d26b73f77059","mcp_get_code":{"code_sha256":"33a1d26b73f77059"}}],"record_sha256":"443468df83ae0aa54f0459a97112f9d9e713bb8698502e6d2e9b997b816b97de","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}