{"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/clevr/papers/ran/1","list_of":"/dataset/clevr","dataset":"CLEVR","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,12],"of":12,"counts":{"papers_with_a_benchmark_row":17,"with_a_code_link":15,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":17,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":2,"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/clevr/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/projected-gans-converge-faster","slug":"projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","arxiv_id":"2111.01007","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":49,"samples_ran":38,"samples_constructed":14,"samples_ran_checked":20,"samples_ran_instrument_failed":18,"samples_unverified":11,"pointer_only_for_licence":6,"official":{"repos":["autonomousvision/projected_gan"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/projected-gans-converge-faster#ran","syntology_url":"https://syntology.ai/paper/2111.01007","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.01007"}}}},{"paper":"/paper/mdetr-modulated-detection-for-end-to-end","slug":"mdetr-modulated-detection-for-end-to-end","title":"MDETR -- Modulated Detection for End-to-End Multi-Modal Understanding","date":"2021-04-26","arxiv_id":"2104.12763","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":7,"samples_constructed":4,"samples_ran_checked":6,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["ashkamath/mdetr"],"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/mdetr-modulated-detection-for-end-to-end#ran","syntology_url":"https://syntology.ai/paper/2104.12763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.12763"}}}},{"paper":"/paper/generative-adversarial-transformers","slug":"generative-adversarial-transformers","title":"Generative Adversarial Transformers","date":"2021-03-01","arxiv_id":"2103.01209","rows_on_this_dataset":5,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["dorarad/gansformer"],"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/generative-adversarial-transformers#ran","syntology_url":"https://syntology.ai/paper/2103.01209","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.01209"}}}},{"paper":"/paper/language-conditioned-graph-networks-for","slug":"language-conditioned-graph-networks-for","title":"Language-Conditioned Graph Networks for Relational Reasoning","date":"2019-05-10","arxiv_id":"1905.04405","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":7,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-conditioned-graph-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04405"}}}},{"paper":"/paper/the-neuro-symbolic-concept-learner-1","slug":"the-neuro-symbolic-concept-learner-1","title":"The Neuro-Symbolic Concept Learner: Interpreting Scenes, Words, and Sentences From Natural Supervision","date":"2019-04-26","arxiv_id":"1904.12584","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["vacancy/NSCL-PyTorch-Release"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/the-neuro-symbolic-concept-learner-1#ran","syntology_url":"https://syntology.ai/paper/1904.12584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12584"}}}},{"paper":"/paper/explainable-and-explicit-visual-reasoning","slug":"explainable-and-explicit-visual-reasoning","title":"Explainable and Explicit Visual Reasoning over Scene Graphs","date":"2018-12-05","arxiv_id":"1812.01855","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["shijx12/XNM-Net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/explainable-and-explicit-visual-reasoning#ran","syntology_url":"https://syntology.ai/paper/1812.01855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01855"}}}},{"paper":"/paper/neural-symbolic-vqa-disentangling-reasoning","slug":"neural-symbolic-vqa-disentangling-reasoning","title":"Neural-Symbolic VQA: Disentangling Reasoning from Vision and Language Understanding","date":"2018-10-04","arxiv_id":"1810.02338","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/neural-symbolic-vqa-disentangling-reasoning#ran","syntology_url":"https://syntology.ai/paper/1810.02338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.02338"}}}},{"paper":"/paper/transparency-by-design-closing-the-gap","slug":"transparency-by-design-closing-the-gap","title":"Transparency by Design: Closing the Gap Between Performance and Interpretability in Visual Reasoning","date":"2018-03-14","arxiv_id":"1803.05268","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["davidmascharka/tbd-nets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transparency-by-design-closing-the-gap#ran","syntology_url":"https://syntology.ai/paper/1803.05268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.05268"}}}},{"paper":"/paper/compositional-attention-networks-for-machine","slug":"compositional-attention-networks-for-machine","title":"Compositional Attention Networks for Machine Reasoning","date":"2018-03-08","arxiv_id":"1803.03067","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["stanfordnlp/mac-network"],"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/compositional-attention-networks-for-machine#ran","syntology_url":"https://syntology.ai/paper/1803.03067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.03067"}}}},{"paper":"/paper/film-visual-reasoning-with-a-general","slug":"film-visual-reasoning-with-a-general","title":"FiLM: Visual Reasoning with a General Conditioning Layer","date":"2017-09-22","arxiv_id":"1709.07871","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":4,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":7,"official":{"repos":["ethanjperez/film"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/film-visual-reasoning-with-a-general#ran","syntology_url":"https://syntology.ai/paper/1709.07871","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07871"}}}},{"paper":"/paper/a-simple-neural-network-module-for-relational","slug":"a-simple-neural-network-module-for-relational","title":"A simple neural network module for relational reasoning","date":"2017-06-05","arxiv_id":"1706.01427","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-simple-neural-network-module-for-relational#ran","syntology_url":"https://syntology.ai/paper/1706.01427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.01427"}}}},{"paper":"/paper/inferring-and-executing-programs-for-visual","slug":"inferring-and-executing-programs-for-visual","title":"Inferring and Executing Programs for Visual Reasoning","date":"2017-05-10","arxiv_id":"1705.03633","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/clevr-iep"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/inferring-and-executing-programs-for-visual#ran","syntology_url":"https://syntology.ai/paper/1705.03633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.03633"}}}}],"record_sha256":"5dbfaca090d590024df132a42743066f94430e2c96822dfde5734a380f83795d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}