{"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/train-val","entry":"train_val","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":10,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":3,"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":1,"unverified":5},"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":"2306.13924","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"55b8283c8e8503b3","code_sha256_prefix":"55b8283c8e8503b3","mcp_get_code":{"code_sha256":"55b8283c8e8503b3"}},{"arxiv_id":"2306.03288","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, shahanaibrahimosu/end-to-end-crowdsourcing when it was checked","code_sha256":"b817d22e3e319182","code_sha256_prefix":"b817d22e3e319182","mcp_get_code":{"code_sha256":"b817d22e3e319182"}},{"arxiv_id":"2209.00078","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, rjiang03/h-scl when it was checked","code_sha256":"8f49bc51cbbd9f64","code_sha256_prefix":"8f49bc51cbbd9f64","mcp_get_code":{"code_sha256":"8f49bc51cbbd9f64"}},{"arxiv_id":"2112.11450","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from rjiang03/h-scl, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f49bc51cbbd9f64","code_sha256_prefix":"8f49bc51cbbd9f64","mcp_get_code":{"code_sha256":"8f49bc51cbbd9f64"}},{"arxiv_id":"2110.06848","arxiv_id_is_arxiv":true,"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":"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":"f48b88b699fcd2fd","code_sha256_prefix":"f48b88b699fcd2fd","mcp_get_code":{"code_sha256":"f48b88b699fcd2fd"}},{"arxiv_id":"2104.13712","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"db91eda17a64ade2","code_sha256_prefix":"db91eda17a64ade2","mcp_get_code":{"code_sha256":"db91eda17a64ade2"}},{"arxiv_id":"2103.03230","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"db91eda17a64ade2","code_sha256_prefix":"db91eda17a64ade2","mcp_get_code":{"code_sha256":"db91eda17a64ade2"}},{"arxiv_id":"2007.00224","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from leftthomas/SimCLR, and GitHub detected no licence in that repository when it was checked","code_sha256":"667eaf3785a1c4a9","code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}},{"arxiv_id":"2006.05576","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from leftthomas/SimCLR, and GitHub detected no licence in that repository when it was checked","code_sha256":"667eaf3785a1c4a9","code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, leftthomas/SimCLR when it was checked","code_sha256":"667eaf3785a1c4a9","code_sha256_prefix":"667eaf3785a1c4a9","mcp_get_code":{"code_sha256":"667eaf3785a1c4a9"}}],"record_sha256":"a9af323399ec1574960729eea17ee23d66dc49c0f5c11e91b905c4c3dae01930","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}