{"url":"/task/open-domain-question-answering","name":"Open-Domain Question Answering","slug":"open-domain-question-answering","description_markdown":"Open-domain question answering is the task of question answering on open-domain datasets such as Wikipedia.","categories":[{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":494,"papers_with_code":238,"benchmarks":15,"benchmark_tables_in_archive":15,"benchmark_tables_shown":15,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":26,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/open-domain-question-answering-on-kilt","slug":"open-domain-question-answering-on-kilt","dataset":"KILT: Natural Questions","dataset_url":"/dataset/kilt","rows_in_archive":16,"metrics":["KILT-EM","R-Prec","Recall@5","EM","F1","KILT-F1"],"first_row_in_archive_order":{"model":"Re2G","paper_title":"Re2G: Retrieve, Rerank, Generate","paper_url":"/paper/re2g-retrieve-rerank-generate-2","paper_date":"2022-07-13","arxiv_id":"2207.06300","code_links":[{"title":"ibm/kgi-slot-filling","url":"https://github.com/ibm/kgi-slot-filling"}],"syntology":{"n":8,"n_ran":1,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/open-domain-question-answering-on-kilt-eli5","slug":"open-domain-question-answering-on-kilt-eli5","dataset":"KILT: ELI5","dataset_url":"/dataset/kilt","rows_in_archive":16,"metrics":["KILT-RL","R-Prec","Recall@5","ROUGE-L","F1","KILT-F1"],"first_row_in_archive_order":{"model":"somebody","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-kilt-2","slug":"open-domain-question-answering-on-kilt-2","dataset":"KILT: TriviaQA","dataset_url":"/dataset/triviaqa","rows_in_archive":15,"metrics":["KILT-EM","R-Prec","Recall@5","EM","F1","KILT-F1"],"first_row_in_archive_order":{"model":"Re2G","paper_title":"Re2G: Retrieve, Rerank, Generate","paper_url":"/paper/re2g-retrieve-rerank-generate-2","paper_date":"2022-07-13","arxiv_id":"2207.06300","code_links":[{"title":"ibm/kgi-slot-filling","url":"https://github.com/ibm/kgi-slot-filling"}],"syntology":{"n":8,"n_ran":1,"n_unverified":7,"n_pointer_only":0}}},{"leaderboard":"/sota/open-domain-question-answering-on-kilt-1","slug":"open-domain-question-answering-on-kilt-1","dataset":"KILT: HotpotQA","dataset_url":"/dataset/kilt","rows_in_archive":14,"metrics":["KILT-EM","R-Prec","Recall@5","EM","F1","KILT-F1"],"first_row_in_archive_order":{"model":"intersect","paper_title":null,"paper_url":null,"paper_date":"","arxiv_id":null,"code_links":[],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-searchqa","slug":"open-domain-question-answering-on-searchqa","dataset":"SearchQA","dataset_url":"/dataset/searchqa","rows_in_archive":14,"metrics":["EM","N-gram F1","Unigram Acc","F1"],"first_row_in_archive_order":{"model":"Cluster-Former (#C=512)","paper_title":"Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encoding","paper_url":"/paper/cluster-former-clustering-based-sparse","paper_date":"2020-09-13","arxiv_id":"2009.06097","code_links":[],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-eli5","slug":"open-domain-question-answering-on-eli5","dataset":"ELI5","dataset_url":"/dataset/eli5","rows_in_archive":6,"metrics":["Rouge-L","Rouge-1","Rouge-2"],"first_row_in_archive_order":{"model":"Fourier Transformer","paper_title":"Fourier Transformer: Fast Long Range Modeling by Removing Sequence Redundancy with FFT Operator","paper_url":"/paper/fourier-transformer-fast-long-range-modeling","paper_date":"2023-05-24","arxiv_id":"2305.15099","code_links":[{"title":"lumia-group/fouriertransformer","url":"https://github.com/lumia-group/fouriertransformer"}],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-quasar","slug":"open-domain-question-answering-on-quasar","dataset":"Quasar","dataset_url":"/dataset/quasar-1","rows_in_archive":6,"metrics":["EM (Quasar-T)","F1 (Quasar-T)"],"first_row_in_archive_order":{"model":"Evidence Aggregation via R^3 Re-Ranking","paper_title":"Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering","paper_url":"/paper/evidence-aggregation-for-answer-re-ranking-in","paper_date":"2017-11-14","arxiv_id":"1711.05116","code_links":[{"title":"shuohangwang/mprc","url":"https://github.com/shuohangwang/mprc"}],"syntology":{"n":8,"n_ran":7,"n_unverified":1,"n_pointer_only":0}}},{"leaderboard":"/sota/open-domain-question-answering-on-natural","slug":"open-domain-question-answering-on-natural","dataset":"Natural Questions","dataset_url":"/dataset/natural-questions","rows_in_archive":5,"metrics":["Exact Match"],"first_row_in_archive_order":{"model":"FiE","paper_title":"0.8% Nyquist computational ghost imaging via non-experimental deep learning","paper_url":"/paper/0-8-nyquist-computational-ghost-imaging-via","paper_date":"2021-08-17","arxiv_id":"2108.07673","code_links":[],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on","slug":"open-domain-question-answering-on","dataset":"WebQuestions","dataset_url":"/dataset/webquestions","rows_in_archive":4,"metrics":["Exact Match"],"first_row_in_archive_order":{"model":"UniK-QA","paper_title":"UniK-QA: Unified Representations of Structured and Unstructured Knowledge for Open-Domain Question Answering","paper_url":"/paper/unified-open-domain-question-answering-with","paper_date":"2020-12-29","arxiv_id":"2012.14610","code_links":[{"title":"facebookresearch/UniK-QA","url":"https://github.com/facebookresearch/UniK-QA"}],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-squad1-1","slug":"open-domain-question-answering-on-squad1-1","dataset":"SQuAD1.1 dev","dataset_url":"/dataset/squad","rows_in_archive":4,"metrics":["EM"],"first_row_in_archive_order":{"model":"SPARTA","paper_title":"SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrieval","paper_url":"/paper/sparta-efficient-open-domain-question","paper_date":"2020-09-28","arxiv_id":"2009.13013","code_links":[{"title":"soco-ai/SF-QA","url":"https://github.com/soco-ai/SF-QA"}],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-squad11","slug":"open-domain-question-answering-on-squad11","dataset":"SQuAD1.1","dataset_url":"/dataset/squad","rows_in_archive":3,"metrics":["EM"],"first_row_in_archive_order":{"model":"DrQA","paper_title":"Reading Wikipedia to Answer Open-Domain Questions","paper_url":"/paper/reading-wikipedia-to-answer-open-domain","paper_date":"2017-03-31","arxiv_id":"1704.00051","code_links":[{"title":"facebookresearch/ParlAI","url":"https://github.com/facebookresearch/ParlAI"},{"title":"facebookresearch/DrQA","url":"https://github.com/facebookresearch/DrQA"},{"title":"hitvoice/DrQA","url":"https://github.com/hitvoice/DrQA"},{"title":"HKUST-KnowComp/MnemonicReader","url":"https://github.com/HKUST-KnowComp/MnemonicReader"},{"title":"xiangyue9607/CliniRC","url":"https://github.com/xiangyue9607/CliniRC"},{"title":"Raman-Raje/Machine-Reading-Comprehension-Neural-Question-Answer-","url":"https://github.com/Raman-Raje/Machine-Reading-Comprehension-Neural-Question-Answer-"},{"title":"iCompass-ai/TunBERT","url":"https://github.com/iCompass-ai/TunBERT"},{"title":"aaronbae/AnaQA","url":"https://github.com/aaronbae/AnaQA"},{"title":"BAJUKA/SQuAD-NLP","url":"https://github.com/BAJUKA/SQuAD-NLP"},{"title":"sachit-n/drqa_doc_reader","url":"https://github.com/sachit-n/drqa_doc_reader"}],"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}}},{"leaderboard":"/sota/open-domain-question-answering-on-dureader","slug":"open-domain-question-answering-on-dureader","dataset":"DuReader","dataset_url":"/dataset/dureader","rows_in_archive":2,"metrics":["EM"],"first_row_in_archive_order":{"model":"ERNIE 2.0 Large","paper_title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","paper_url":"/paper/ernie-20-a-continual-pre-training-framework","paper_date":"2019-07-29","arxiv_id":"1907.12412","code_links":[{"title":"PaddlePaddle/PaddleNLP","url":"https://github.com/PaddlePaddle/PaddleNLP/tree/develop/model_zoo/ernie-1.0"},{"title":"PaddlePaddle/ERNIE","url":"https://github.com/PaddlePaddle/ERNIE"},{"title":"DataScienceNigeria/ERNIE-2.0-from-Baidu-Inc.","url":"https://github.com/DataScienceNigeria/ERNIE-2.0-from-Baidu-Inc."}],"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}}},{"leaderboard":"/sota/open-domain-question-answering-on-tqa","slug":"open-domain-question-answering-on-tqa","dataset":"TQA","dataset_url":"/dataset/tqa","rows_in_archive":2,"metrics":["Exact Match"],"first_row_in_archive_order":{"model":"UniK-QA","paper_title":"UniK-QA: Unified Representations of Structured and Unstructured Knowledge for Open-Domain Question Answering","paper_url":"/paper/unified-open-domain-question-answering-with","paper_date":"2020-12-29","arxiv_id":"2012.14610","code_links":[{"title":"facebookresearch/UniK-QA","url":"https://github.com/facebookresearch/UniK-QA"}],"syntology":null}},{"leaderboard":"/sota/open-domain-question-answering-on-natural-1","slug":"open-domain-question-answering-on-natural-1","dataset":"Natural Questions (short)","dataset_url":"/dataset/natural-questions","rows_in_archive":1,"metrics":["Exact Match"],"first_row_in_archive_order":{"model":"EMDR2","paper_title":"End-to-End Training of Multi-Document Reader and Retriever for Open-Domain Question Answering","paper_url":"/paper/end-to-end-training-of-multi-document-reader","paper_date":"2021-06-09","arxiv_id":"2106.05346","code_links":[{"title":"DevSinghSachan/emdr2","url":"https://github.com/DevSinghSachan/emdr2"},{"title":"DevSinghSachan/art","url":"https://github.com/DevSinghSachan/art"}],"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":4}}},{"leaderboard":"/sota/open-domain-question-answering-on-triviaqa","slug":"open-domain-question-answering-on-triviaqa","dataset":"TriviaQA","dataset_url":"/dataset/triviaqa","rows_in_archive":1,"metrics":["Exact Match"],"first_row_in_archive_order":{"model":"UnitedQA (Hybrid)","paper_title":"UnitedQA: A Hybrid Approach for Open Domain Question Answering","paper_url":"/paper/unitedqa-a-hybrid-approach-for-open-domain","paper_date":"2021-01-01","arxiv_id":"2101.00178","code_links":[],"syntology":null}}],"datasets":[{"url":"/dataset/natural-questions","name":"Natural Questions","full_name":"","num_papers_in_archive":1404},{"url":"/dataset/triviaqa","name":"TriviaQA","full_name":"","num_papers_in_archive":953},{"url":"/dataset/scienceqa","name":"ScienceQA","full_name":"Science Question Answering","num_papers_in_archive":339},{"url":"/dataset/webquestions","name":"WebQuestions","full_name":"","num_papers_in_archive":241},{"url":"/dataset/lama","name":"LAMA","full_name":"LAnguage Model Analysis","num_papers_in_archive":214},{"url":"/dataset/eli5","name":"ELI5","full_name":"ELI5","num_papers_in_archive":158},{"url":"/dataset/squad","name":"SQuAD","full_name":"Stanford Question Answering Dataset","num_papers_in_archive":151},{"url":"/dataset/searchqa","name":"SearchQA","full_name":"","num_papers_in_archive":133},{"url":"/dataset/kilt","name":"KILT","full_name":"KILT Benchmark","num_papers_in_archive":117},{"url":"/dataset/dureader","name":"DuReader","full_name":"","num_papers_in_archive":65},{"url":"/dataset/quasar-t","name":"QUASAR-T","full_name":"QUestion Answering by Search And Reading – Trivia","num_papers_in_archive":55},{"url":"/dataset/qrecc","name":"QReCC","full_name":"","num_papers_in_archive":51},{"url":"/dataset/mkqa","name":"MKQA","full_name":"Multilingual Knowledge Questions and Answers","num_papers_in_archive":49},{"url":"/dataset/tqa","name":"TQA","full_name":"Textbook Question Answering","num_papers_in_archive":48},{"url":"/dataset/quasar-1","name":"QUASAR","full_name":"QUestion Answering by Search And Reading","num_papers_in_archive":47},{"url":"/dataset/break","name":"BREAK","full_name":"BREAK","num_papers_in_archive":39},{"url":"/dataset/wikimovies","name":"WikiMovies","full_name":"","num_papers_in_archive":39},{"url":"/dataset/infoseek","name":"InfoSeek","full_name":"Visual Information Seeking","num_papers_in_archive":36},{"url":"/dataset/arcd","name":"ARCD","full_name":"","num_papers_in_archive":24},{"url":"/dataset/oven","name":"OVEN","full_name":"Open-domain Visual Entity Recognition","num_papers_in_archive":19},{"url":"/dataset/qampari","name":"QAMPARI","full_name":"","num_papers_in_archive":19},{"url":"/dataset/xqa","name":"XQA","full_name":"XQA","num_papers_in_archive":6},{"url":"/dataset/simran-arora","name":"ConcurrentQA Benchmark","full_name":"","num_papers_in_archive":3},{"url":"/dataset/crepe","name":"CREPE","full_name":"","num_papers_in_archive":2},{"url":"/dataset/coresearch","name":"CoreSearch","full_name":"","num_papers_in_archive":1},{"url":"/dataset/wikiqaar","name":"WikiQAar","full_name":"English-Arabic Wikipedia Question-Answering","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/question-answering","name":"Question Answering"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":30,"of":238,"tagged_in_all":494,"items":[{"url":"/paper/bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","arxiv_id":"1910.13461","repositories_listed":47,"syntology":{"n":53,"n_ran":22,"n_unverified":31,"n_pointer_only":7}},{"url":"/paper/bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","repositories_listed":27,"syntology":{"n":11,"n_ran":8,"n_unverified":3,"n_pointer_only":7}},{"url":"/paper/dense-passage-retrieval-for-open-domain","title":"Dense Passage Retrieval for Open-Domain Question Answering","date":"2020-04-10","arxiv_id":"2004.04906","repositories_listed":19,"syntology":{"n":14,"n_ran":10,"n_unverified":4,"n_pointer_only":9}},{"url":"/paper/reformer-the-efficient-transformer-1","title":"Reformer: The Efficient Transformer","date":"2020-01-13","arxiv_id":"2001.04451","repositories_listed":10,"syntology":{"n":8,"n_ran":6,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/reading-wikipedia-to-answer-open-domain","title":"Reading Wikipedia to Answer Open-Domain Questions","date":"2017-03-31","arxiv_id":"1704.00051","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/leveraging-passage-retrieval-with-generative","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","date":"2020-07-02","arxiv_id":"2007.01282","repositories_listed":8,"syntology":null},{"url":"/paper/knowledge-guided-text-retrieval-and-reading","title":"Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering","date":"2019-11-10","arxiv_id":"1911.03868","repositories_listed":7,"syntology":{"n":6,"n_ran":4,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/190410509","title":"Generating Long Sequences with Sparse Transformers","date":"2019-04-23","arxiv_id":"1904.10509","repositories_listed":7,"syntology":{"n":6,"n_ran":5,"n_unverified":1,"n_pointer_only":0}},{"url":"/paper/realm-retrieval-augmented-language-model-pre","title":"REALM: Retrieval-Augmented Language Model Pre-Training","date":"2020-02-10","arxiv_id":"2002.08909","repositories_listed":6,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","repositories_listed":6,"syntology":{"n":15,"n_ran":3,"n_unverified":12,"n_pointer_only":4}},{"url":"/paper/relevance-guided-supervision-for-openqa-with","title":"Relevance-guided Supervision for OpenQA with ColBERT","date":"2020-07-01","arxiv_id":"2007.00814","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/reducing-transformer-depth-on-demand-with-1","title":"Reducing Transformer Depth on Demand with Structured Dropout","date":"2019-09-25","arxiv_id":"1909.11556","repositories_listed":5,"syntology":null},{"url":"/paper/learning-discrete-representations-via-1","title":"Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval","date":"2021-10-12","arxiv_id":"2110.05789","repositories_listed":4,"syntology":{"n":22,"n_ran":5,"n_unverified":17,"n_pointer_only":0}},{"url":"/paper/learning-dense-representations-of-phrases-at","title":"Learning Dense Representations of Phrases at Scale","date":"2020-12-23","arxiv_id":"2012.12624","repositories_listed":4,"syntology":null},{"url":"/paper/distilling-knowledge-from-reader-to-retriever-1","title":"Distilling Knowledge from Reader to Retriever for Question Answering","date":"2020-12-08","arxiv_id":"2012.04584","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/ktrain-a-low-code-library-for-augmented","title":"ktrain: A Low-Code Library for Augmented Machine Learning","date":"2020-04-19","arxiv_id":"2004.10703","repositories_listed":4,"syntology":{"n":16,"n_ran":0,"n_unverified":16,"n_pointer_only":0}},{"url":"/paper/break-it-down-a-question-understanding","title":"Break It Down: A Question Understanding Benchmark","date":"2020-01-31","arxiv_id":"2001.11770","repositories_listed":4,"syntology":null},{"url":"/paper/gated-attention-readers-for-text","title":"Gated-Attention Readers for Text Comprehension","date":"2016-06-05","arxiv_id":"1606.01549","repositories_listed":4,"syntology":{"n":3,"n_ran":1,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/colbertv2-effective-and-efficient-retrieval","title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction","date":"2021-12-02","arxiv_id":"2112.01488","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/answer-complex-questions-path-ranker-is-all","title":"Answer Complex Questions: Path Ranker Is All You Need","date":"2021-07-11","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/narrative-question-answering-with-cutting","title":"Narrative Question Answering with Cutting-Edge Open-Domain QA Techniques: A Comprehensive Study","date":"2021-06-07","arxiv_id":"2106.03826","repositories_listed":3,"syntology":null},{"url":"/paper/what-makes-good-in-context-examples-for-gpt-3","title":"What Makes Good In-Context Examples for GPT-$3$?","date":"2021-01-17","arxiv_id":"2101.06804","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/what-disease-does-this-patient-have-a-large","title":"What Disease does this Patient Have? A Large-scale Open Domain Question Answering Dataset from Medical Exams","date":"2020-09-28","arxiv_id":"2009.13081","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/kilt-a-benchmark-for-knowledge-intensive","title":"KILT: a Benchmark for Knowledge Intensive Language Tasks","date":"2020-09-04","arxiv_id":"2009.02252","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/contextualized-sparse-representation-with-1","title":"Contextualized Sparse Representations for Real-Time Open-Domain Question Answering","date":"2019-11-07","arxiv_id":"1911.02896","repositories_listed":3,"syntology":{"n":18,"n_ran":10,"n_unverified":8,"n_pointer_only":0}},{"url":"/paper/ernie-20-a-continual-pre-training-framework","title":"ERNIE 2.0: A Continual Pre-training Framework for Language Understanding","date":"2019-07-29","arxiv_id":"1907.12412","repositories_listed":3,"syntology":{"n":1,"n_ran":0,"n_unverified":1,"n_pointer_only":1}},{"url":"/paper/eli5-long-form-question-answering","title":"ELI5: Long Form Question Answering","date":"2019-07-22","arxiv_id":"1907.09190","repositories_listed":3,"syntology":{"n":11,"n_ran":4,"n_unverified":7,"n_pointer_only":4}},{"url":"/paper/190600300","title":"Latent Retrieval for Weakly Supervised Open Domain Question Answering","date":"2019-06-01","arxiv_id":"1906.00300","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-attend-on-essential-terms-an","title":"Learning to Attend On Essential Terms: An Enhanced Retriever-Reader Model for Open-domain Question Answering","date":"2018-08-28","arxiv_id":"1808.09492","repositories_listed":3,"syntology":null},{"url":"/paper/searchqa-a-new-qa-dataset-augmented-with","title":"SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine","date":"2017-04-18","arxiv_id":"1704.05179","repositories_listed":3,"syntology":null}],"syntology_records":21,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}