{"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/train-val","entry":"train_val","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":6,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":6},"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":"2306.13924","paper":"/paper/structuring-representation-geometry-with","title":"Structuring Representation Geometry with Rotationally Equivariant Contrastive Learning","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sharut/care","path":"cifar10_cifar100_stl10/linear.py","file_url":"https://github.com/sharut/care/blob/HEAD/cifar10_cifar100_stl10/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"55b8283c8e8503b3","mcp_get_code":{"code_sha256":"55b8283c8e8503b3"}},{"arxiv_id":"2306.03288","paper":"/paper/deep-learning-from-crowdsourced-labels","title":"Deep Learning From Crowdsourced Labels: Coupled Cross-entropy Minimization, Identifiability, and Regularization","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahanaibrahimosu/end-to-end-crowdsourcing","path":"algorithms/trainer_proposed.py","file_url":"https://github.com/shahanaibrahimosu/end-to-end-crowdsourcing/blob/HEAD/algorithms/trainer_proposed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b817d22e3e319182","mcp_get_code":{"code_sha256":"b817d22e3e319182"}},{"arxiv_id":"2209.00078","paper":"/paper/supervised-contrastive-learning-with-hard","title":"Supervised Contrastive Learning with Hard Negative Samples","date":"2022-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rjiang03/h-scl","path":"main/linear.py","file_url":"https://github.com/rjiang03/h-scl/blob/HEAD/main/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"8f49bc51cbbd9f64","mcp_get_code":{"code_sha256":"8f49bc51cbbd9f64"}},{"arxiv_id":"2112.11450","paper":"/paper/max-margin-contrastive-learning","title":"Max-Margin Contrastive Learning","date":"2021-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anshulbshah/MMCL","path":"CIFAR100/linear.py","file_url":"https://github.com/anshulbshah/MMCL/blob/HEAD/CIFAR100/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8f49bc51cbbd9f64","mcp_get_code":{"code_sha256":"8f49bc51cbbd9f64"}},{"arxiv_id":"2110.06848","paper":"/paper/decoupled-contrastive-learning-1","title":"Decoupled Contrastive Learning","date":"2021-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raminnakhli/Decoupled-Contrastive-Learning","path":"experiment/simclr/linear.py","file_url":"https://github.com/raminnakhli/Decoupled-Contrastive-Learning/blob/HEAD/experiment/simclr/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f48b88b699fcd2fd","mcp_get_code":{"code_sha256":"f48b88b699fcd2fd"}},{"arxiv_id":"2104.13712","paper":"/paper/a-note-on-connecting-barlow-twins-with","title":"A Note on Connecting Barlow Twins with Negative-Sample-Free Contrastive Learning","date":"2021-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"db91eda17a64ade2","mcp_get_code":{"code_sha256":"db91eda17a64ade2"}},{"arxiv_id":"2103.03230","paper":"/paper/barlow-twins-self-supervised-learning-via","title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","date":"2021-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaohungt/Barlow-Twins-HSIC","path":"linear.py","file_url":"https://github.com/yaohungt/Barlow-Twins-HSIC/blob/HEAD/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"db91eda17a64ade2","mcp_get_code":{"code_sha256":"db91eda17a64ade2"}},{"arxiv_id":"2007.00224","paper":"/paper/debiased-contrastive-learning","title":"Debiased Contrastive Learning","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/DCL","path":"linear.py","file_url":"https://github.com/chingyaoc/DCL/blob/HEAD/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}},{"arxiv_id":"2006.05576","paper":"/paper/demystifying-self-supervised-learning-an","title":"Self-supervised Learning from a Multi-view Perspective","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaohungt/Demystifying_Self_Supervised_Learning","path":"Omniglot/linear.py","file_url":"https://github.com/yaohungt/Demystifying_Self_Supervised_Learning/blob/HEAD/Omniglot/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}},{"arxiv_id":"2002.05709","paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leftthomas/SimCLR","path":"linear.py","file_url":"https://github.com/leftthomas/SimCLR/blob/HEAD/linear.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}}]}