{"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/contrastloss","entry":"ContrastLoss","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":9,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":9,"n_samples_ran":7,"n_samples_constructed":4,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":9,"n_places_pointer_only":4,"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":0,"ran_fixture":0,"ran":7,"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":"2407.07171","arxiv_id_is_arxiv":true,"paper":"/paper/ittakestwo-leveraging-peer-representations","title":"ItTakesTwo: Leveraging Peer Representations for Semi-supervised LiDAR Semantic Segmentation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yyliu01/IT2","path":"kitti.code.ItTakesTwo.gmm/utils/losses/batch_prototype_info_nce_loss.py","file_url":"https://github.com/yyliu01/IT2/blob/HEAD/kitti.code.ItTakesTwo.gmm/utils/losses/batch_prototype_info_nce_loss.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":"e25ab4e36b2cd427","code_sha256_prefix":"e25ab4e36b2cd427","mcp_get_code":{"code_sha256":"e25ab4e36b2cd427"}},{"arxiv_id":"2406.17255","arxiv_id_is_arxiv":true,"paper":"/paper/mpcoder-multi-user-personalized-code","title":"MPCODER: Multi-user Personalized Code Generator with Explicit and Implicit Style Representation Learning","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"455849940/MPCoder","path":"StylePrompt/FeatureModel.py","file_url":"https://github.com/455849940/MPCoder/blob/HEAD/StylePrompt/FeatureModel.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, 455849940/MPCoder when it was checked","code_sha256":"1fda20b6bb18abdc","code_sha256_prefix":"1fda20b6bb18abdc","mcp_get_code":{"code_sha256":"1fda20b6bb18abdc"}},{"arxiv_id":"2404.03263","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-surprising-efficacy-of-distillation-as","title":"On the Surprising Efficacy of Distillation as an Alternative to Pre-Training Small Models","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sfarhat/dapt","path":"kd_losses/crd.py","file_url":"https://github.com/sfarhat/dapt/blob/HEAD/kd_losses/crd.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":"034dcd732f8923c8","code_sha256_prefix":"034dcd732f8923c8","mcp_get_code":{"code_sha256":"034dcd732f8923c8"}},{"arxiv_id":"2308.14061","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-contrastive-learning-for-pattern","title":"Hierarchical Contrastive Learning for Pattern-Generalizable Image Corruption Detection","date":"2023-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xyfJASON/HCL","path":"losses/contrast_loss.py","file_url":"https://github.com/xyfJASON/HCL/blob/HEAD/losses/contrast_loss.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":"65e00f77bc64095e","code_sha256_prefix":"65e00f77bc64095e","mcp_get_code":{"code_sha256":"65e00f77bc64095e"}},{"arxiv_id":"2207.02970","arxiv_id_is_arxiv":true,"paper":"/paper/network-binarization-via-contrastive-learning","title":"Network Binarization via Contrastive Learning","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"42Shawn/CMIM","path":"CMIM/cifar100/contrastive_alignment/criterion.py","file_url":"https://github.com/42Shawn/CMIM/blob/HEAD/CMIM/cifar100/contrastive_alignment/criterion.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":"f9f0276f9881c6ce","code_sha256_prefix":"f9f0276f9881c6ce","mcp_get_code":{"code_sha256":"f9f0276f9881c6ce"}},{"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":"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, dtennant/dt-tradeoff when it was checked","code_sha256":"ac6ff5b3409890d5","code_sha256_prefix":"ac6ff5b3409890d5","mcp_get_code":{"code_sha256":"ac6ff5b3409890d5"}},{"arxiv_id":"2105.11683","arxiv_id_is_arxiv":true,"paper":"/paper/towards-compact-single-image-super-resolution","title":"Towards Compact Single Image Super-Resolution via Contrastive Self-distillation","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Booooooooooo/CSD","path":"PyTorch version/loss/contrast_loss.py","file_url":"https://github.com/Booooooooooo/CSD/blob/HEAD/PyTorch%20version/loss/contrast_loss.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, Booooooooooo/CSD when it was checked","code_sha256":"a05314e9a88a5f25","code_sha256_prefix":"a05314e9a88a5f25","mcp_get_code":{"code_sha256":"a05314e9a88a5f25"}},{"arxiv_id":"2103.16367","arxiv_id_is_arxiv":true,"paper":"/paper/complementary-relation-contrastive","title":"Complementary Relation Contrastive Distillation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lechatelia/CRCD","path":"crcd/criterion.py","file_url":"https://github.com/Lechatelia/CRCD/blob/HEAD/crcd/criterion.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, Lechatelia/CRCD when it was checked","code_sha256":"d8247910d4a7aa35","code_sha256_prefix":"d8247910d4a7aa35","mcp_get_code":{"code_sha256":"d8247910d4a7aa35"}},{"arxiv_id":"2009.14167","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-distillation-on-intermediate","title":"Contrastive Distillation on Intermediate Representations for Language Model Compression","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intersun/CoDIR","path":"crd/criterion.py","file_url":"https://github.com/intersun/CoDIR/blob/HEAD/crd/criterion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"77b22cab2f797943","code_sha256_prefix":"77b22cab2f797943","mcp_get_code":{"code_sha256":"77b22cab2f797943"}}],"record_sha256":"e8d9f68579ca535677e39be3e25fdfc6adaf10eda4ab6fc69b5f5c31a7c46403","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}