{"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/social-iqa","name":"SIQA","full_name":"Social Interaction QA","description_markdown":"**Social Interaction QA (SIQA)** is a question-answering benchmark for testing social commonsense intelligence. Contrary to many prior benchmarks that focus on physical or taxonomic knowledge, Social IQa focuses on reasoning about people’s actions and their social implications. For example, given an action like \"Jesse saw a concert\" and a question like \"Why did Jesse do this?\", humans can easily infer that Jesse wanted \"to see their favorite performer\" or \"to enjoy the music\", and not \"to see what's happening inside\" or \"to see if it works\". The actions in Social IQa span a wide variety of social situations, and answer candidates contain both human-curated answers and adversarially-filtered machine-generated candidates. Social IQa contains over 37,000 QA pairs for evaluating models’ abilities to reason about the social implications of everyday events and situations.\r\n\r\nSource: [Social IQA](https://leaderboard.allenai.org/socialiqa/submissions/get-started)\r\nImage Source: [https://arxiv.org/pdf/1904.09728.pdf](https://arxiv.org/pdf/1904.09728.pdf)","description_withheld":null,"homepage":"https://leaderboard.allenai.org/socialiqa/submissions/public","introduced_date":"2019-04-22","introduced_date_note":null,"introduced_by":{"paper":"/paper/socialiqa-commonsense-reasoning-about-social","title":"SocialIQA: Commonsense Reasoning about Social Interactions","first_author":"Maarten Sap","url":null},"license":{"name":"Unknown","url":null},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Language Modelling","url":"/task/language-modelling","datasets_with_task":"/datasets/task/language-modelling"}],"languages":[],"variants":["SIQA"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/allenai/social_i_qa","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/social_i_qa","frameworks":["tf","pytorch","jax"]}],"num_papers_in_archive":120,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-social-iqa","task":"Question Answering","dataset_variant":"SIQA","rows":24,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Unicorn 11B (fine-tuned)","paper":"/paper/unicorn-on-rainbow-a-universal-commonsense","metrics":{"Accuracy":"83.2"},"code_links":[{"title":"allenai/rainbow","url":"https://github.com/allenai/rainbow"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","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,"shown":12,"of":12,"counts":{"papers_with_a_benchmark_row":12,"with_a_code_link":12,"where_syntology_ran_a_sample":9,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":9,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[{"paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","slug":"mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.11909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+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":["wutaiqiang/moslora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixture-of-subspaces-in-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2406.11909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11909"}}}},{"paper":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}}}},{"paper":"/paper/textbooks-are-all-you-need-ii-phi-1-5","slug":"textbooks-are-all-you-need-ii-phi-1-5","title":"Textbooks Are All You Need II: phi-1.5 technical report","date":"2023-09-11","arxiv_id":"2309.05463","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"official":{"repos":["facebookresearch/llama"],"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/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"paper":"/paper/two-is-better-than-many-binary-classification","slug":"two-is-better-than-many-binary-classification","title":"Two is Better than Many? Binary Classification as an Effective Approach to Multi-Choice Question Answering","date":"2022-10-29","arxiv_id":"2210.16495","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["declare-lab/team"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-is-better-than-many-binary-classification#ran","syntology_url":"https://syntology.ai/paper/2210.16495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16495"}}}},{"paper":"/paper/task-compass-scaling-multi-task-pre-training","slug":"task-compass-scaling-multi-task-pre-training","title":"Task Compass: Scaling Multi-task Pre-training with Task Prefix","date":"2022-10-12","arxiv_id":"2210.06277","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}}}},{"paper":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/unicorn-on-rainbow-a-universal-commonsense","slug":"unicorn-on-rainbow-a-universal-commonsense","title":"UNICORN on RAINBOW: A Universal Commonsense Reasoning Model on a New Multitask Benchmark","date":"2021-03-24","arxiv_id":"2103.13009","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["allenai/rainbow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicorn-on-rainbow-a-universal-commonsense#ran","syntology_url":"https://syntology.ai/paper/2103.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13009"}}}},{"paper":"/paper/unifiedqa-crossing-format-boundaries-with-a","slug":"unifiedqa-crossing-format-boundaries-with-a","title":"UnifiedQA: Crossing Format Boundaries With a Single QA System","date":"2020-05-02","arxiv_id":"2005.00700","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["allenai/unifiedqa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unifiedqa-crossing-format-boundaries-with-a#ran","syntology_url":"https://syntology.ai/paper/2005.00700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00700"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"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/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/socialiqa-commonsense-reasoning-about-social","slug":"socialiqa-commonsense-reasoning-about-social","title":"SocialIQA: Commonsense Reasoning about Social Interactions","date":"2019-04-22","arxiv_id":"1904.09728","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/socialiqa-commonsense-reasoning-about-social#ran","syntology_url":"https://syntology.ai/paper/1904.09728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09728"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","slug":"mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.11909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+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":["wutaiqiang/moslora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixture-of-subspaces-in-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2406.11909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11909"}}}},{"paper":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}}}},{"paper":"/paper/textbooks-are-all-you-need-ii-phi-1-5","slug":"textbooks-are-all-you-need-ii-phi-1-5","title":"Textbooks Are All You Need II: phi-1.5 technical report","date":"2023-09-11","arxiv_id":"2309.05463","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"official":{"repos":["facebookresearch/llama"],"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/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"paper":"/paper/two-is-better-than-many-binary-classification","slug":"two-is-better-than-many-binary-classification","title":"Two is Better than Many? Binary Classification as an Effective Approach to Multi-Choice Question Answering","date":"2022-10-29","arxiv_id":"2210.16495","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["declare-lab/team"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/two-is-better-than-many-binary-classification#ran","syntology_url":"https://syntology.ai/paper/2210.16495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.16495"}}}},{"paper":"/paper/task-compass-scaling-multi-task-pre-training","slug":"task-compass-scaling-multi-task-pre-training","title":"Task Compass: Scaling Multi-task Pre-training with Task Prefix","date":"2022-10-12","arxiv_id":"2210.06277","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}}}},{"paper":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/unicorn-on-rainbow-a-universal-commonsense","slug":"unicorn-on-rainbow-a-universal-commonsense","title":"UNICORN on RAINBOW: A Universal Commonsense Reasoning Model on a New Multitask Benchmark","date":"2021-03-24","arxiv_id":"2103.13009","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["allenai/rainbow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unicorn-on-rainbow-a-universal-commonsense#ran","syntology_url":"https://syntology.ai/paper/2103.13009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13009"}}}},{"paper":"/paper/unifiedqa-crossing-format-boundaries-with-a","slug":"unifiedqa-crossing-format-boundaries-with-a","title":"UnifiedQA: Crossing Format Boundaries With a Single QA System","date":"2020-05-02","arxiv_id":"2005.00700","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["allenai/unifiedqa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unifiedqa-crossing-format-boundaries-with-a#ran","syntology_url":"https://syntology.ai/paper/2005.00700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00700"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"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/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/socialiqa-commonsense-reasoning-about-social","slug":"socialiqa-commonsense-reasoning-about-social","title":"SocialIQA: Commonsense Reasoning about Social Interactions","date":"2019-04-22","arxiv_id":"1904.09728","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":10,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":0,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/socialiqa-commonsense-reasoning-about-social#ran","syntology_url":"https://syntology.ai/paper/1904.09728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09728"}}}}],"papers_where_code_ran":9,"papers_where_code_ran_first_page":"/dataset/social-iqa/papers/ran/1","papers_where_code_ran_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.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/social-iqa/papers/ran/1","json":"/dataset/social-iqa/papers/ran/1.json","rows":9}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":9,"samples_harvested":163,"samples_ran":106,"samples_constructed":26,"samples_ran_checked":84,"samples_ran_instrument_failed":22,"samples_unverified":57,"pointer_only_for_licence":39,"papers_with_no_sample_that_ran":0,"papers_with_a_sample_that_ran":9,"papers_with_a_run_with_no_instrument_failure":9,"papers_where_every_run_was_an_instrument_failure":0,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"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)"},"since_archive_judged":{"papers":7,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/question-answering-on-social-iqa","since_archive":"/sota/question-answering-on-social-iqa#since-judged","papers_judged":7,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"cd1b473f92584874db5e93835b839c643df3ef5e059931097c8aed8775d080f9","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}