{"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/set-loader","entry":"set_loader","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":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":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":9},"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":"2406.18676","paper":"/paper/understand-what-llm-needs-dual-preference","title":"Understand What LLM Needs: Dual Preference Alignment for Retrieval-Augmented Generation","date":"2024-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dongguanting/dpa-rag","path":"SupContrast/main_ce.py","file_url":"https://github.com/dongguanting/dpa-rag/blob/HEAD/SupContrast/main_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2297ed2ca4911b7c","mcp_get_code":{"code_sha256":"2297ed2ca4911b7c"}},{"arxiv_id":"2406.03143","paper":"/paper/zeropur-succinct-training-free-adversarial","title":"ZeroPur: Succinct Training-Free Adversarial Purification","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erhul/ZeroPur","path":"comparison.py","file_url":"https://github.com/erhul/ZeroPur/blob/HEAD/comparison.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"38e917a54ba28703","mcp_get_code":{"code_sha256":"38e917a54ba28703"}},{"arxiv_id":"2402.06104","paper":"/paper/function-aligned-regression-a-method","title":"Gradient Aligned Regression via Pairwise Losses","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dixianzhu/gar","path":"ageDB_scratch.py","file_url":"https://github.com/dixianzhu/gar/blob/HEAD/ageDB_scratch.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9d04930d71aac9fd","mcp_get_code":{"code_sha256":"9d04930d71aac9fd"}},{"arxiv_id":"2311.01196","paper":"/paper/combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HobbitLong/SupContrast","path":"main_ce.py","file_url":"https://github.com/HobbitLong/SupContrast/blob/HEAD/main_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"2297ed2ca4911b7c","mcp_get_code":{"code_sha256":"2297ed2ca4911b7c"}},{"arxiv_id":"2308.10239","paper":"/paper/from-global-to-local-multi-scale-out-of","title":"From Global to Local: Multi-scale Out-of-distribution Detection","date":"2023-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimzai/mode-ood","path":"ALPA/main_ce.py","file_url":"https://github.com/jimzai/mode-ood/blob/HEAD/ALPA/main_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2297ed2ca4911b7c","mcp_get_code":{"code_sha256":"2297ed2ca4911b7c"}},{"arxiv_id":"2210.01189","paper":"/paper/supervised-contrastive-regression","title":"Rank-N-Contrast: Learning Continuous Representations for Regression","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwenzha/Rank-N-Contrast","path":"main_rnc.py","file_url":"https://github.com/kaiwenzha/Rank-N-Contrast/blob/HEAD/main_rnc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1fc2bd7231c4c286","mcp_get_code":{"code_sha256":"1fc2bd7231c4c286"}},{"arxiv_id":"2111.01124","paper":"/paper/when-does-contrastive-learning-preserve","title":"When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LijieFan/AdvCL","path":"finetuning_advCL_SLF.py","file_url":"https://github.com/LijieFan/AdvCL/blob/HEAD/finetuning_advCL_SLF.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"28543a18e1279a31","mcp_get_code":{"code_sha256":"28543a18e1279a31"}},{"arxiv_id":"2004.11362","paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XG293/SupConLoss","path":"main_ce.py","file_url":"https://github.com/XG293/SupConLoss/blob/HEAD/main_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"2297ed2ca4911b7c","mcp_get_code":{"code_sha256":"2297ed2ca4911b7c"}},{"arxiv_id":"2004.11362","paper":"/paper/supervised-contrastive-learning","title":"Supervised Contrastive Learning","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"davidczy/supcon_gamma","path":"main_supcon_thick.py","file_url":"https://github.com/davidczy/supcon_gamma/blob/HEAD/main_supcon_thick.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"code_sha256_prefix":"750f33f8190dba7b","mcp_get_code":{"code_sha256":"750f33f8190dba7b"}},{"arxiv_id":"1906.05849","paper":"/paper/contrastive-multiview-coding","title":"Contrastive Multiview Coding","date":"2019-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielchyeh/imagenet-100-pytorch","path":"main_IN100.py","file_url":"https://github.com/danielchyeh/imagenet-100-pytorch/blob/HEAD/main_IN100.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"78be23f19fa36f1c","mcp_get_code":{"code_sha256":"78be23f19fa36f1c"}},{"arxiv_id":"1511.00561","paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"evaluate_models.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/evaluate_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"784e6075b2fd2666","mcp_get_code":{"code_sha256":"784e6075b2fd2666"}},{"arxiv_id":"1511.00561","paper":"/paper/segnet-a-deep-convolutional-encoder-decoder","title":"SegNet: A Deep Convolutional Encoder-Decoder Architecture for Image Segmentation","date":"2015-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control","path":"train_models.py","file_url":"https://github.com/zhuotongchen/self-healing-robust-neural-networks-via-closed-loop-control/blob/HEAD/train_models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e10f25445d9bac8f","mcp_get_code":{"code_sha256":"e10f25445d9bac8f"}}]}