{"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":"/task/transition-based-dependency-parsing","name":"Transition-Based Dependency Parsing","slug":"transition-based-dependency-parsing","description_markdown":null,"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":"derived"},"counts":{"papers_tagged":66,"papers_with_code":12,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":2},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/dependency-parsing","name":"Dependency Parsing"},{"url":"/task/persian-sentiment-anlysis","name":"Persian Sentiment Analysis"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":66,"of":66,"of_with_code":12,"tagged_in_all":66,"counts":{"archive_papers_tagged":66,"with_a_code_link":12,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":66,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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 the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/transition-based-dependency-parsing-with-2","slug":"transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","arxiv_id":"1505.08075","repositories_listed":7,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transition-based-dependency-parsing-with-2#ran","syntology_url":"https://syntology.ai/paper/1505.08075","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1505.08075"}},"official":{"repos":["clab/lstm-parser"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/algorithms-for-weighted-pushdown-automata","slug":"algorithms-for-weighted-pushdown-automata","title":"Algorithms for Weighted Pushdown Automata","date":"2022-10-13","arxiv_id":"2210.06884","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/algorithms-for-weighted-pushdown-automata#ran","syntology_url":"https://syntology.ai/paper/2210.06884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06884"}},"official":{"repos":["rycolab/wpda"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-to-graph-transformer-for-transition","slug":"graph-to-graph-transformer-for-transition","title":"Graph-to-Graph Transformer for Transition-based Dependency Parsing","date":"2019-11-08","arxiv_id":"1911.03561","repositories_listed":1,"syntology":null},{"url":"/paper/bidirectional-transition-based-dependency","slug":"bidirectional-transition-based-dependency","title":"Bidirectional Transition-Based Dependency Parsing","date":"2019-07-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/joint-learning-of-pos-and-dependencies-for","slug":"joint-learning-of-pos-and-dependencies-for","title":"Joint Learning of POS and Dependencies for Multilingual Universal Dependency Parsing","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tree-stack-lstm-in-transition-based","slug":"tree-stack-lstm-in-transition-based","title":"Tree-Stack LSTM in Transition Based Dependency Parsing","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/distilling-knowledge-for-search-based","slug":"distilling-knowledge-for-search-based","title":"Distilling Knowledge for Search-based Structured Prediction","date":"2018-05-29","arxiv_id":"1805.11224","repositories_listed":1,"syntology":null},{"url":"/paper/faster-exact-decoding-and-global-training-for","slug":"faster-exact-decoding-and-global-training-for","title":"Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set","date":"2017-08-30","arxiv_id":"1708.09403","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-neural-network-model-for-joint-pos","slug":"a-novel-neural-network-model-for-joint-pos","title":"A Novel Neural Network Model for Joint POS Tagging and Graph-based Dependency Parsing","date":"2017-05-16","arxiv_id":"1705.05952","repositories_listed":1,"syntology":null},{"url":"/paper/probabilistic-graph-based-dependency-parsing","slug":"probabilistic-graph-based-dependency-parsing","title":"Probabilistic Graph-based Dependency Parsing with Convolutional Neural Network","date":"2016-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-structured-inference-for-transition","slug":"efficient-structured-inference-for-transition","title":"Efficient Structured Inference for Transition-Based Parsing with Neural Networks and Error States","date":"2016-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/template-kernels-for-dependency-parsing","slug":"template-kernels-for-dependency-parsing","title":"Template Kernels for Dependency Parsing","date":"2015-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"structured-sentiment-analysis-as-transition","title":"Structured Sentiment Analysis as Transition-based Dependency Parsing","date":"2023-05-09","arxiv_id":"2305.05311","repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-transition-based-dependency-parsing-1","title":"Greedy Transition-Based Dependency Parsing with Discrete and Continuous Supertag Features","date":"2020-07-09","arxiv_id":"2007.04686","repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-using","title":"Transition-Based Dependency Parsing using Perceptron Learner","date":"2020-01-22","arxiv_id":"2001.08279","repositories_listed":0,"syntology":null},{"url":null,"slug":"vietnamese-transition-based-dependency","title":"Vietnamese transition-based dependency parsing with supertag features","date":"2019-11-09","arxiv_id":"1911.03726","repositories_listed":0,"syntology":null},{"url":null,"slug":"association-metrics-in-neural-transition","title":"Association Metrics in Neural Transition-Based Dependency Parsing","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recursive-lstm-tree-representation-for-arc","title":"Recursive LSTM Tree Representation for Arc-Standard Transition-Based Dependency Parsing","date":"2019-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-syntactic-generative-models-with-exact","title":"Neural Syntactic Generative Models with Exact Marginalization","date":"2018-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cache-transition-systems-for-graph-parsing","title":"Cache Transition Systems for Graph Parsing","date":"2018-03-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-online-reordering-with-arc-eager","title":"Effective Online Reordering with Arc-Eager Transitions","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-graph-based-neural-dependency","title":"Incremental Graph-based Neural Dependency Parsing","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stack-based-multi-layer-attention-for","title":"Stack-based Multi-layer Attention for Transition-based Dependency Parsing","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-lstm-model-for-transition-based","title":"A Simple LSTM model for Transition-based Dependency Parsing","date":"2017-08-29","arxiv_id":"1708.08959","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-transition-based-system-for-universal","title":"A Transition-based System for Universal Dependency Parsing","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"greedy-transition-based-dependency-parsing","title":"Greedy Transition-Based Dependency Parsing with Stack LSTMs","date":"2017-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"real-valued-syntactic-word-vectors-rsv-for","title":"Real-valued Syntactic Word Vectors (RSV) for Greedy Neural Dependency Parsing","date":"2017-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-transition-based-dependency-parsing-and","title":"Joint Transition-based Dependency Parsing and Disfluency Detection for Automatic Speech Recognition Texts","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-with-3","title":"Transition-Based Dependency Parsing with Heuristic Backtracking","date":"2016-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-search-based-dynamic-reranking-model-for","title":"A Search-Based Dynamic Reranking Model for Dependency Parsing","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-transition-based-dependency","title":"Generalized Transition-based Dependency Parsing via Control Parameters","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-to-train-dependency-parsers-with-inexact","title":"How to Train Dependency Parsers with Inexact Search for Joint Sentence Boundary Detection and Parsing of Entire Documents","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-as-latent","title":"Transition-based dependency parsing as latent-variable constituent parsing","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-with","title":"Transition-based dependency parsing with topological fields","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dependency-language-models-for-transition","title":"Dependency Language Models for Transition-based Dependency Parsing","date":"2016-07-18","arxiv_id":"1607.04982","repositories_listed":0,"syntology":null},{"url":null,"slug":"frustratingly-easy-cross-lingual-transfer-for","title":"Frustratingly Easy Cross-Lingual Transfer for Transition-Based Dependency Parsing","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"m2l-at-semeval-2016-task-8-amr-parsing-with","title":"M2L at SemEval-2016 Task 8: AMR Parsing with Neural Networks","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dependency-parsing-for-chinese-long-sentence","title":"Dependency parsing for Chinese long sentence: A second-stage main structure parsing method","date":"2015-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-discrete-and-continuous-features","title":"Combining Discrete and Continuous Features for Deterministic Transition-based Dependency Parsing","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-transition-based-parsing-and-tagging","title":"Improved Transition-Based Parsing and Tagging with Neural Networks","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-using-two","title":"Transition-based Dependency Parsing Using Two Heterogeneous Gated Recursive Neural Networks","date":"2015-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-neural-probabilistic-structured-prediction","title":"A Neural Probabilistic Structured-Prediction Model for Transition-Based Dependency Parsing","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-incremental-dependency-parsing","title":"Generative Incremental Dependency Parsing with Neural Networks","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-deterministic-oracles-for-unrestricted","title":"Non-Deterministic Oracles for Unrestricted Non-Projective Transition-Based Dependency Parsing","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/structured-training-for-neural-network","slug":"structured-training-for-neural-network","title":"Structured Training for Neural Network Transition-Based Parsing","date":"2015-06-19","arxiv_id":"1506.06158","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-model-for-generative-transition","title":"A Bayesian Model for Generative Transition-based Dependency Parsing","date":"2015-06-13","arxiv_id":"1506.04334","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-dynamic-feature-selection-for-fast","title":"Learning Dynamic Feature Selection for Fast Sequential Prediction","date":"2015-05-22","arxiv_id":"1505.06169","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-effect-of-dependency-representation","title":"The Effect of Dependency Representation Scheme on Syntactic Language Modelling","date":"2014-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"left-corner-transitions-on-dependency-parsing","title":"Left-corner Transitions on Dependency Parsing","date":"2014-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"squibs-arc-eager-parsing-with-the-tree","title":"Squibs: Arc-Eager Parsing with the Tree Constraint","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-parsing-using-pcfgs","title":"Deterministic Parsing using PCFGs","date":"2014-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-dependency-parsers-with-supertags","title":"Improving Dependency Parsers with Supertags","date":"2014-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"non-monotonic-parsing-of-fluent-umm-i-mean","title":"Non-Monotonic Parsing of Fluent Umm I mean Disfluent Sentences","date":"2014-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-incremental-disfluency-detection-and-1","title":"Joint Incremental Disfluency Detection and Dependency Parsing","date":"2014-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-cross-task-flexible-transition-model-for","title":"A Cross-Task Flexible Transition Model for Arabic Tokenization, Affix Detection, Affix Labeling, POS Tagging, and Dependency Parsing","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"with-blinkers-on-robust-prediction-of-eye","title":"With Blinkers on: Robust Prediction of Eye Movements across Readers","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"working-with-a-small-dataset-semi-supervised","title":"Working with a small dataset - semi-supervised dependency parsing for Irish","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-transition-based-dependency-parser-using-a","title":"A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-accurate-shift-reduce-constituent","title":"Fast and Accurate Shift-Reduce Constituent Parsing","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"punctuation-prediction-with-transition-based","title":"Punctuation Prediction with Transition-based Parsing","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transition-based-dependency-parsing-with-1","title":"Transition-based Dependency Parsing with Selectional Branching","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-a-beam-search-to-transition-based","title":"APPLYING A BEAM SEARCH TO TRANSITION-BASED DEPENDENCY PARSING: A CASE STUDY FOR FRENCH WITH THE TALISMANE SUITE (L'apport du faisceau dans l'analyse syntaxique en d\\'ependances par transitions : \\'etudes de cas avec l'analyseur Talismane) [in French]","date":"2013-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-etudy-of-non-lexical-extensions","title":"An Empirical Etudy of Non-Lexical Extensions to Delexicalized Transfer","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"analyzing-the-effect-of-global-learning-and","title":"Analyzing the Effect of Global Learning and Beam-Search on Transition-Based Dependency Parsing","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-transition-based-dependency-parsing","title":"Improving Transition-Based Dependency Parsing with Buffer Transitions","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"zhijun-wu-chinese-semantic-dependency-parsing","title":"Zhijun Wu: Chinese Semantic Dependency Parsing with Third-Order Features","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":2,"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"},"key_notes":{"n_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_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":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"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":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/transition-based-dependency-parsing/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/transition-based-dependency-parsing/papers/ran/1","json":"/task/transition-based-dependency-parsing/papers/ran/1.json","rows":2}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper 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"},"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"},"record_sha256":"b6c9d89e324e2919b510d1665007f3ee745ecdc3c323f19d6eece331b6d3b1a4","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}