{"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":"/dataset/places205/papers/ran/1","list_of":"/dataset/places205","dataset":"Places205","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"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'","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,8],"of":8,"counts":{"papers_with_a_benchmark_row":12,"with_a_code_link":12,"where_syntology_ran_a_sample":8,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":8,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":7,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":7,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/places205/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/internimage-exploring-large-scale-vision","slug":"internimage-exploring-large-scale-vision","title":"InternImage: Exploring Large-Scale Vision Foundation Models with Deformable Convolutions","date":"2022-11-10","arxiv_id":"2211.05778","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["opengvlab/internimage"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/internimage-exploring-large-scale-vision#ran","syntology_url":"https://syntology.ai/paper/2211.05778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.05778"}}}},{"paper":"/paper/masked-autoencoders-are-scalable-vision","slug":"masked-autoencoders-are-scalable-vision","title":"Masked Autoencoders Are Scalable Vision Learners","date":"2021-11-11","arxiv_id":"2111.06377","rows_on_this_dataset":1,"code_links":58,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":137,"samples_ran":86,"samples_constructed":40,"samples_ran_checked":69,"samples_ran_instrument_failed":17,"samples_unverified":51,"pointer_only_for_licence":78,"official":{"repos":["facebookresearch/mae"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/masked-autoencoders-are-scalable-vision#ran","syntology_url":"https://syntology.ai/paper/2111.06377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.06377"}}}},{"paper":"/paper/automix-unveiling-the-power-of-mixup","slug":"automix-unveiling-the-power-of-mixup","title":"AutoMix: Unveiling the Power of Mixup for Stronger Classifiers","date":"2021-03-24","arxiv_id":"2103.13027","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["Westlake-AI/openmixup"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/automix-unveiling-the-power-of-mixup#ran","syntology_url":"https://syntology.ai/paper/2103.13027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13027"}}}},{"paper":"/paper/barlow-twins-self-supervised-learning-via","slug":"barlow-twins-self-supervised-learning-via","title":"Barlow Twins: Self-Supervised Learning via Redundancy Reduction","date":"2021-03-04","arxiv_id":"2103.03230","rows_on_this_dataset":1,"code_links":24,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":26,"samples_ran":21,"samples_constructed":6,"samples_ran_checked":15,"samples_ran_instrument_failed":6,"samples_unverified":5,"pointer_only_for_licence":10,"official":{"repos":["facebookresearch/barlowtwins"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/barlow-twins-self-supervised-learning-via#ran","syntology_url":"https://syntology.ai/paper/2103.03230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.03230"}}}},{"paper":"/paper/unsupervised-learning-of-visual-features-by","slug":"unsupervised-learning-of-visual-features-by","title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","date":"2020-06-17","arxiv_id":"2006.09882","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":17,"samples_ran":13,"samples_constructed":4,"samples_ran_checked":6,"samples_ran_instrument_failed":7,"samples_unverified":4,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/swav"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unsupervised-learning-of-visual-features-by#ran","syntology_url":"https://syntology.ai/paper/2006.09882","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09882"}}}},{"paper":"/paper/bootstrap-your-own-latent-a-new-approach-to","slug":"bootstrap-your-own-latent-a-new-approach-to","title":"Bootstrap your own latent: A new approach to self-supervised Learning","date":"2020-06-13","arxiv_id":"2006.07733","rows_on_this_dataset":1,"code_links":31,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":79,"samples_ran":62,"samples_constructed":19,"samples_ran_checked":42,"samples_ran_instrument_failed":20,"samples_unverified":17,"pointer_only_for_licence":46,"official":{"repos":["deepmind/deepmind-research"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bootstrap-your-own-latent-a-new-approach-to#ran","syntology_url":"https://syntology.ai/paper/2006.07733","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07733"}}}},{"paper":"/paper/improved-baselines-with-momentum-contrastive","slug":"improved-baselines-with-momentum-contrastive","title":"Improved Baselines with Momentum Contrastive Learning","date":"2020-03-09","arxiv_id":"2003.04297","rows_on_this_dataset":1,"code_links":36,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":43,"samples_ran":28,"samples_constructed":0,"samples_ran_checked":21,"samples_ran_instrument_failed":7,"samples_unverified":15,"pointer_only_for_licence":15,"official":{"repos":["facebookresearch/moco"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improved-baselines-with-momentum-contrastive#ran","syntology_url":"https://syntology.ai/paper/2003.04297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.04297"}}}},{"paper":"/paper/a-simple-framework-for-contrastive-learning","slug":"a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","arxiv_id":"2002.05709","rows_on_this_dataset":1,"code_links":96,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":137,"samples_ran":115,"samples_constructed":33,"samples_ran_checked":90,"samples_ran_instrument_failed":25,"samples_unverified":22,"pointer_only_for_licence":52,"official":{"repos":["google-research/simclr"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-simple-framework-for-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2002.05709","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05709"}}}}],"record_sha256":"a7d507d78eed57efe08b5e55bbb8e36dfa4e3cf1bd6efcf4611c0b2449b6e3f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}