{"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/lemma","name":"LEMMA","slug":"lemma","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":628,"papers_with_code":102,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/universal-dependencies","name":"Universal Dependencies","full_name":"","num_papers_in_archive":520}],"subtasks":[],"parent_tasks":[],"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":7,"rows_per_page":100,"shown":100,"of":628,"of_with_code":102,"tagged_in_all":628,"counts":{"archive_papers_tagged":628,"with_a_code_link":102,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":628,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":3,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":3,"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/trust-region-policy-optimisation-in-multi","slug":"trust-region-policy-optimisation-in-multi","title":"Trust Region Policy Optimisation in Multi-Agent Reinforcement Learning","date":"2021-09-23","arxiv_id":"2109.11251","repositories_listed":11,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/trust-region-policy-optimisation-in-multi#ran","syntology_url":"https://syntology.ai/paper/2109.11251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.11251"}},"official":{"repos":["cyanrain7/trust-region-policy-optimisation-in-multi-agent-reinforcement-learning","anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning"],"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/hyperagent-a-simple-scalable-efficient-and","slug":"hyperagent-a-simple-scalable-efficient-and","title":"Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgent","date":"2024-02-05","arxiv_id":"2402.10228","repositories_listed":3,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/hyperagent-a-simple-scalable-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2402.10228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10228"}},"official":{"repos":["szrlee/hyperagent"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-generation-of-coq-lemma-names-using","slug":"deep-generation-of-coq-lemma-names-using","title":"Deep Generation of Coq Lemma Names Using Elaborated Terms","date":"2020-04-16","arxiv_id":"2004.07761","repositories_listed":3,"syntology":null},{"url":"/paper/unimorph-20-universal-morphology","slug":"unimorph-20-universal-morphology","title":"UniMorph 2.0: Universal Morphology","date":"2018-10-25","arxiv_id":"1810.11101","repositories_listed":3,"syntology":null},{"url":"/paper/jl-lemma-derived-optimal-projections-for","slug":"jl-lemma-derived-optimal-projections-for","title":"Optimal Projections for Discriminative Dictionary Learning using the JL-lemma","date":"2023-08-27","arxiv_id":"2308.13991","repositories_listed":2,"syntology":null},{"url":"/paper/adaptive-data-driven-predictive-control-as-a","slug":"adaptive-data-driven-predictive-control-as-a","title":"Adaptive Data-Driven Prediction in a Building Control Hierarchy: A Case Study of Demand Response in Switzerland","date":"2023-07-17","arxiv_id":"2307.08866","repositories_listed":2,"syntology":null},{"url":"/paper/post-selection-inference-with-hsic-lasso","slug":"post-selection-inference-with-hsic-lasso","title":"Post-selection inference with HSIC-Lasso","date":"2020-10-29","arxiv_id":"2010.15659","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-distance-between-two-neural-networks","slug":"on-the-distance-between-two-neural-networks","title":"On the distance between two neural networks and the stability of learning","date":"2020-02-09","arxiv_id":"2002.03432","repositories_listed":2,"syntology":null},{"url":"/paper/adversarial-target-invariant-representation","slug":"adversarial-target-invariant-representation","title":"Generalizing to unseen domains via distribution matching","date":"2019-11-03","arxiv_id":"1911.00804","repositories_listed":2,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/adversarial-target-invariant-representation#ran","syntology_url":"https://syntology.ai/paper/1911.00804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.00804"}},"official":null}},{"url":"/paper/deterministic-tensor-completion-with","slug":"deterministic-tensor-completion-with","title":"Deterministic tensor completion with hypergraph expanders","date":"2019-10-23","arxiv_id":"1910.10692","repositories_listed":2,"syntology":null},{"url":"/paper/improving-lemmatization-of-non-standard","slug":"improving-lemmatization-of-non-standard","title":"Improving Lemmatization of Non-Standard Languages with Joint Learning","date":"2019-03-16","arxiv_id":"1903.06939","repositories_listed":2,"syntology":null},{"url":"/paper/morphnet-a-sequence-to-sequence-model-that","slug":"morphnet-a-sequence-to-sequence-model-that","title":"Morphological analysis using a sequence decoder","date":"2018-05-21","arxiv_id":"1805.07946","repositories_listed":2,"syntology":null},{"url":"/paper/identifying-the-smallest-adversarial-load","slug":"identifying-the-smallest-adversarial-load","title":"Identifying the Smallest Adversarial Load Perturbations that Render DC-OPF Infeasible","date":"2025-07-10","arxiv_id":"2507.07850","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-lyapunov-functions-for-nonlinear","slug":"distributed-lyapunov-functions-for-nonlinear","title":"Distributed Lyapunov Functions for Nonlinear Networks","date":"2025-06-25","arxiv_id":"2506.20728","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08558","slug":"2506-08558","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","date":"2025-06-10","arxiv_id":"2506.08558","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/2506-08558#ran","syntology_url":"https://syntology.ai/paper/2506.08558","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08558"}},"official":{"repos":["wdevazelhes/2sp_icml2025"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/know-when-to-abstain-optimal-selective","slug":"know-when-to-abstain-optimal-selective","title":"Know When to Abstain: Optimal Selective Classification with Likelihood Ratios","date":"2025-05-21","arxiv_id":"2505.15008","repositories_listed":1,"syntology":null},{"url":"/paper/vulnerability-of-transfer-learned-neural","slug":"vulnerability-of-transfer-learned-neural","title":"Vulnerability of Transfer-Learned Neural Networks to Data Reconstruction Attacks in Small-Data Regime","date":"2025-05-20","arxiv_id":"2505.14323","repositories_listed":1,"syntology":null},{"url":"/paper/lean-formalization-of-generalization-error","slug":"lean-formalization-of-generalization-error","title":"Lean Formalization of Generalization Error Bound by Rademacher Complexity","date":"2025-03-25","arxiv_id":"2503.19605","repositories_listed":1,"syntology":null},{"url":"/paper/flexible-wmmse-beamforming-for-mu-mimo","slug":"flexible-wmmse-beamforming-for-mu-mimo","title":"Flexible WMMSE Beamforming for MU-MIMO Movable Antenna Communications","date":"2025-03-22","arxiv_id":"2503.17718","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-learning-from-errors-for-mathematical","slug":"lemma-learning-from-errors-for-mathematical","title":"LEMMA: Learning from Errors for MatheMatical Advancement in LLMs","date":"2025-03-21","arxiv_id":"2503.17439","repositories_listed":1,"syntology":null},{"url":"/paper/trust-stability-and-safety-controller","slug":"trust-stability-and-safety-controller","title":"TRUST: Stability and Safety Controller Synthesis for Unknown Dynamical Models Using a Single Trajectory","date":"2025-03-11","arxiv_id":"2503.08081","repositories_listed":1,"syntology":null},{"url":"/paper/quality-measures-for-dynamic-graph-generative","slug":"quality-measures-for-dynamic-graph-generative","title":"Quality Measures for Dynamic Graph Generative Models","date":"2025-03-03","arxiv_id":"2503.01720","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":1,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/quality-measures-for-dynamic-graph-generative#ran","syntology_url":"https://syntology.ai/paper/2503.01720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01720"}},"official":{"repos":["ryienh/jl-metric"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/informativity-conditions-for-multiple-signals","slug":"informativity-conditions-for-multiple-signals","title":"Informativity Conditions for Multiple Signals: Properties, Experimental Design, and Applications","date":"2025-01-17","arxiv_id":"2501.10030","repositories_listed":1,"syntology":null},{"url":"/paper/a-derivational-chainbank-for-modern-standard","slug":"a-derivational-chainbank-for-modern-standard","title":"A Derivational ChainBank for Modern Standard Arabic","date":"2024-10-27","arxiv_id":"2410.20463","repositories_listed":1,"syntology":null},{"url":"/paper/revisiting-multi-permutation-equivariance","slug":"revisiting-multi-permutation-equivariance","title":"Revisiting Multi-Permutation Equivariance through the Lens of Irreducible Representations","date":"2024-10-09","arxiv_id":"2410.06665","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":4,"n_instrument":6,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/revisiting-multi-permutation-equivariance#ran","syntology_url":"https://syntology.ai/paper/2410.06665","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06665"}},"official":{"repos":["yonatansverdlov/irreducible-representations-of-deep-weight-spaces"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-accelerated-algorithm-for-stochastic","slug":"an-accelerated-algorithm-for-stochastic","title":"An Accelerated Algorithm for Stochastic Bilevel Optimization under Unbounded Smoothness","date":"2024-09-28","arxiv_id":"2409.19212","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-accelerated-algorithm-for-stochastic#ran","syntology_url":"https://syntology.ai/paper/2409.19212","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.19212"}},"official":{"repos":["mingruiliu-ml-lab/accelerated-bilevel-optimization-unbounded-smoothness"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-deep-dissipative-dynamics","slug":"learning-deep-dissipative-dynamics","title":"Learning Deep Dissipative Dynamics","date":"2024-08-21","arxiv_id":"2408.11479","repositories_listed":1,"syntology":null},{"url":"/paper/differentially-private-stochastic-gradient-1","slug":"differentially-private-stochastic-gradient-1","title":"Differentially Private Stochastic Gradient Descent with Fixed-Size Minibatches: Tighter RDP Guarantees with or without Replacement","date":"2024-08-19","arxiv_id":"2408.10456","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-confidence-sequence-for-generalized","slug":"a-unified-confidence-sequence-for-generalized","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","date":"2024-07-19","arxiv_id":"2407.13977","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-unified-confidence-sequence-for-generalized#ran","syntology_url":"https://syntology.ai/paper/2407.13977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13977"}},"official":{"repos":["nick-jhlee/logistic_bandit"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-unifying-post-processing-framework-for","slug":"a-unifying-post-processing-framework-for","title":"A Unifying Post-Processing Framework for Multi-Objective Learn-to-Defer Problems","date":"2024-07-17","arxiv_id":"2407.12710","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-unifying-post-processing-framework-for#ran","syntology_url":"https://syntology.ai/paper/2407.12710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12710"}},"official":{"repos":["aminchrs/postprocess"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/peer-expertizing-domain-specific-tasks-with-a","slug":"peer-expertizing-domain-specific-tasks-with-a","title":"PEER: Expertizing Domain-Specific Tasks with a Multi-Agent Framework and Tuning Methods","date":"2024-07-09","arxiv_id":"2407.06985","repositories_listed":1,"syntology":null},{"url":"/paper/learning-on-large-graphs-using-intersecting","slug":"learning-on-large-graphs-using-intersecting","title":"Learning on Large Graphs using Intersecting Communities","date":"2024-05-31","arxiv_id":"2405.20724","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-tracking-mpc-for-nonlinear-systems","slug":"adaptive-tracking-mpc-for-nonlinear-systems","title":"Adaptive tracking MPC for nonlinear systems via online linear system identification","date":"2024-05-16","arxiv_id":"2405.09852","repositories_listed":1,"syntology":null},{"url":"/paper/deep-hankel-matrices-with-random-elements","slug":"deep-hankel-matrices-with-random-elements","title":"Deep Hankel matrices with random elements","date":"2024-04-23","arxiv_id":"2404.15512","repositories_listed":1,"syntology":null},{"url":"/paper/oovs-in-the-spotlight-how-to-inflect-them","slug":"oovs-in-the-spotlight-how-to-inflect-them","title":"OOVs in the Spotlight: How to Inflect them?","date":"2024-04-13","arxiv_id":"2404.08974","repositories_listed":1,"syntology":null},{"url":"/paper/cross-lingual-named-entity-corpus-for-slavic","slug":"cross-lingual-named-entity-corpus-for-slavic","title":"Cross-lingual Named Entity Corpus for Slavic Languages","date":"2024-03-30","arxiv_id":"2404.00482","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-shortest-edit-script-methods-for","slug":"evaluating-shortest-edit-script-methods-for","title":"Evaluating Shortest Edit Script Methods for Contextual Lemmatization","date":"2024-03-25","arxiv_id":"2403.16968","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-towards-lvlm-enhanced-multimodal","slug":"lemma-towards-lvlm-enhanced-multimodal","title":"LEMMA: Towards LVLM-Enhanced Multimodal Misinformation Detection with External Knowledge Augmentation","date":"2024-02-19","arxiv_id":"2402.11943","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lemma-towards-lvlm-enhanced-multimodal#ran","syntology_url":"https://syntology.ai/paper/2402.11943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11943"}},"official":{"repos":["fan19-hub/LEMMA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/treet-transfer-entropy-estimation-via","slug":"treet-transfer-entropy-estimation-via","title":"TREET: TRansfer Entropy Estimation via Transformers","date":"2024-02-10","arxiv_id":"2402.06919","repositories_listed":1,"syntology":null},{"url":"/paper/bayes-optimal-fair-classification-with-linear","slug":"bayes-optimal-fair-classification-with-linear","title":"Bayes-Optimal Fair Classification with Linear Disparity Constraints via Pre-, In-, and Post-processing","date":"2024-02-05","arxiv_id":"2402.02817","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/bayes-optimal-fair-classification-with-linear#ran","syntology_url":"https://syntology.ai/paper/2402.02817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02817"}},"official":{"repos":["xianlizeng/bayes-optimal-fair-classification"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-defensible-set-and-a-new-impossibility","slug":"the-defensible-set-and-a-new-impossibility","title":"An impossibility theorem concerning positive involvement in voting","date":"2024-01-11","arxiv_id":"2401.05657","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-the-urysohn-lemma-of-topology-for","slug":"leveraging-the-urysohn-lemma-of-topology-for","title":"Leveraging the Urysohn Lemma of Topology for an Enhanced Binary Classifier","date":"2023-12-19","arxiv_id":"2312.11948","repositories_listed":1,"syntology":null},{"url":"/paper/multi-resolution-active-learning-of-fourier","slug":"multi-resolution-active-learning-of-fourier","title":"Multi-Resolution Active Learning of Fourier Neural Operators","date":"2023-09-29","arxiv_id":"2309.16971","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-resolution-active-learning-of-fourier#ran","syntology_url":"https://syntology.ai/paper/2309.16971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16971"}},"official":{"repos":["shib0li/mra-fno"],"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":["official"]}}},{"url":"/paper/heterogeneous-multi-agent-reinforcement-1","slug":"heterogeneous-multi-agent-reinforcement-1","title":"Heterogeneous Multi-Agent Reinforcement Learning via Mirror Descent Policy Optimization","date":"2023-08-13","arxiv_id":"2308.06741","repositories_listed":1,"syntology":null},{"url":"/paper/towards-robust-scene-text-image-super","slug":"towards-robust-scene-text-image-super","title":"Towards Robust Scene Text Image Super-resolution via Explicit Location Enhancement","date":"2023-07-19","arxiv_id":"2307.09749","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":7,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/towards-robust-scene-text-image-super#ran","syntology_url":"https://syntology.ai/paper/2307.09749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09749"}},"official":{"repos":["csguoh/lemma"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/2-n-is-better-than-n-2-decomposing-event-1","slug":"2-n-is-better-than-n-2-decomposing-event-1","title":"2∗n is better than n^2: Decomposing Event Coreference Resolution into Two Tractable Problems","date":"2023-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/delegated-classification-1","slug":"delegated-classification-1","title":"Delegated Classification","date":"2023-06-20","arxiv_id":"2306.11475","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/delegated-classification-1#ran","syntology_url":"https://syntology.ai/paper/2306.11475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11475"}},"official":{"repos":["edensaig/delegated-classification"],"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":["official"]}}},{"url":"/paper/a-framework-for-bidirectional-decoding-case","slug":"a-framework-for-bidirectional-decoding-case","title":"A Framework for Bidirectional Decoding: Case Study in Morphological Inflection","date":"2023-05-21","arxiv_id":"2305.12580","repositories_listed":1,"syntology":null},{"url":"/paper/2-n-is-better-than-n-2-decomposing-event","slug":"2-n-is-better-than-n-2-decomposing-event","title":"$2 * n$ is better than $n^2$: Decomposing Event Coreference Resolution into Two Tractable Problems","date":"2023-05-09","arxiv_id":"2305.05672","repositories_listed":1,"syntology":null},{"url":"/paper/local-optimization-achieves-global-optimality","slug":"local-optimization-achieves-global-optimality","title":"Local Optimization Achieves Global Optimality in Multi-Agent Reinforcement Learning","date":"2023-05-08","arxiv_id":"2305.04819","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/local-optimization-achieves-global-optimality#ran","syntology_url":"https://syntology.ai/paper/2305.04819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04819"}},"official":{"repos":["zhaoyl18/ratio_game"],"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":["official"]}}},{"url":"/paper/heterogeneous-agent-reinforcement-learning","slug":"heterogeneous-agent-reinforcement-learning","title":"Heterogeneous-Agent Reinforcement Learning","date":"2023-04-19","arxiv_id":"2304.09870","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-optimality-of-time-series","slug":"benchmarking-optimality-of-time-series","title":"Benchmarking optimality of time series classification methods in distinguishing diffusions","date":"2023-01-30","arxiv_id":"2301.13112","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-via-random-projection","slug":"adversarial-robustness-via-random-projection","title":"Adversarial Robustness via Random Projection Filters","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/near-optimal-non-parametric-sequential-tests","slug":"near-optimal-non-parametric-sequential-tests","title":"Near-Optimal Non-Parametric Sequential Tests and Confidence Sequences with Possibly Dependent Observations","date":"2022-12-29","arxiv_id":"2212.14411","repositories_listed":1,"syntology":null},{"url":"/paper/learning-combinatorial-structures-via-markov","slug":"learning-combinatorial-structures-via-markov","title":"Learning Markov Random Fields for Combinatorial Structures via Sampling through Lovász Local Lemma","date":"2022-12-01","arxiv_id":"2212.00296","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-reinforcement-learning-through","slug":"efficient-reinforcement-learning-through","title":"Efficient Reinforcement Learning Through Trajectory Generation","date":"2022-11-30","arxiv_id":"2211.17249","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-bootstrapping-high-level-mathematical","slug":"lemma-bootstrapping-high-level-mathematical","title":"LEMMA: Bootstrapping High-Level Mathematical Reasoning with Learned Symbolic Abstractions","date":"2022-11-16","arxiv_id":"2211.08671","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lemma-bootstrapping-high-level-mathematical#ran","syntology_url":"https://syntology.ai/paper/2211.08671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.08671"}},"official":{"repos":["uranium11010/lemma"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/distributed-deep-lcc-for-cooperatively","slug":"distributed-deep-lcc-for-cooperatively","title":"Distributed data-driven predictive control for cooperatively smoothing mixed traffic flow","date":"2022-10-24","arxiv_id":"2210.13171","repositories_listed":1,"syntology":null},{"url":"/paper/a-non-asymptotic-moreau-envelope-theory-for","slug":"a-non-asymptotic-moreau-envelope-theory-for","title":"A Non-Asymptotic Moreau Envelope Theory for High-Dimensional Generalized Linear Models","date":"2022-10-21","arxiv_id":"2210.12082","repositories_listed":1,"syntology":null},{"url":"/paper/deep-lcc-data-enabled-predictive-leading","slug":"deep-lcc-data-enabled-predictive-leading","title":"DeeP-LCC: Data-EnablEd Predictive Leading Cruise Control in Mixed Traffic Flow","date":"2022-03-20","arxiv_id":"2203.10639","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-input-reconstruction-and","slug":"data-driven-input-reconstruction-and","title":"Data-driven input reconstruction and experimental validation","date":"2022-03-05","arxiv_id":"2203.02827","repositories_listed":1,"syntology":null},{"url":"/paper/overcoming-a-theoretical-limitation-of-self-1","slug":"overcoming-a-theoretical-limitation-of-self-1","title":"Overcoming a Theoretical Limitation of Self-Attention","date":"2022-02-24","arxiv_id":"2202.12172","repositories_listed":1,"syntology":null},{"url":"/paper/learning-modified-indicator-functions-for","slug":"learning-modified-indicator-functions-for","title":"Learning Modified Indicator Functions for Surface Reconstruction","date":"2021-11-18","arxiv_id":"2111.09526","repositories_listed":1,"syntology":null},{"url":"/paper/rule-based-morphological-inflection-improves","slug":"rule-based-morphological-inflection-improves","title":"Rule-based Morphological Inflection Improves Neural Terminology Translation","date":"2021-09-10","arxiv_id":"2109.04620","repositories_listed":1,"syntology":null},{"url":"/paper/recurrent-neural-network-controllers","slug":"recurrent-neural-network-controllers","title":"Recurrent Neural Network Controllers Synthesis with Stability Guarantees for Partially Observed Systems","date":"2021-09-08","arxiv_id":"2109.03861","repositories_listed":1,"syntology":null},{"url":"/paper/un-solving-morphological-inflection-lemma","slug":"un-solving-morphological-inflection-lemma","title":"(Un)solving Morphological Inflection: Lemma Overlap Artificially Inflates Models' Performance","date":"2021-08-12","arxiv_id":"2108.05682","repositories_listed":1,"syntology":null},{"url":"/paper/gx-at-semeval-2021-task-2-bert-with-lemma","slug":"gx-at-semeval-2021-task-2-bert-with-lemma","title":"GX at SemEval-2021 Task 2: BERT with Lemma Information for MCL-WiC Task","date":"2021-08-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modeling-target-side-inflection-in","slug":"modeling-target-side-inflection-in","title":"Modeling Target-side Inflection in Placeholder Translation","date":"2021-07-01","arxiv_id":"2107.00334","repositories_listed":1,"syntology":null},{"url":"/paper/roosterize-suggesting-lemma-names-for-coq","slug":"roosterize-suggesting-lemma-names-for-coq","title":"Roosterize: Suggesting Lemma Names for Coq Verification Projects Using Deep Learning","date":"2021-03-01","arxiv_id":"2103.01346","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-sequence-to-sequence-neural","slug":"enhancing-sequence-to-sequence-neural","title":"Enhancing Sequence-to-Sequence Neural Lemmatization with External Resources","date":"2021-01-28","arxiv_id":"2101.12056","repositories_listed":1,"syntology":null},{"url":"/paper/facilitating-terminology-translation-with","slug":"facilitating-terminology-translation-with","title":"Facilitating Terminology Translation with Target Lemma Annotations","date":"2021-01-25","arxiv_id":"2101.10035","repositories_listed":1,"syntology":null},{"url":"/paper/learning-graphons-via-structured-gromov","slug":"learning-graphons-via-structured-gromov","title":"Learning Graphons via Structured Gromov-Wasserstein Barycenters","date":"2020-12-10","arxiv_id":"2012.05644","repositories_listed":1,"syntology":null},{"url":"/paper/analogy-models-for-neural-word-inflection","slug":"analogy-models-for-neural-word-inflection","title":"Analogy Models for Neural Word Inflection","date":"2020-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/krighedge-gp-surrogates-for-delta-hedging","slug":"krighedge-gp-surrogates-for-delta-hedging","title":"KrigHedge: Gaussian Process Surrogates for Delta Hedging","date":"2020-10-16","arxiv_id":"2010.08407","repositories_listed":1,"syntology":null},{"url":"/paper/lemma-a-multi-view-dataset-for-learning-multi","slug":"lemma-a-multi-view-dataset-for-learning-multi","title":"LEMMA: A Multi-view Dataset for Learning Multi-agent Multi-task Activities","date":"2020-07-31","arxiv_id":"2007.15781","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lemma-a-multi-view-dataset-for-learning-multi#ran","syntology_url":"https://syntology.ai/paper/2007.15781","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15781"}},"official":{"repos":["Buzz-Beater/LEMMA"],"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":["official"]}}},{"url":"/paper/learning-compositional-functions-via","slug":"learning-compositional-functions-via","title":"Learning compositional functions via multiplicative weight updates","date":"2020-06-25","arxiv_id":"2006.14560","repositories_listed":1,"syntology":null},{"url":"/paper/a-theoretical-treatment-of-conditional","slug":"a-theoretical-treatment-of-conditional","title":"On the power of conditional independence testing under model-X","date":"2020-05-12","arxiv_id":"2005.05506","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-morphological-paradigm","slug":"unsupervised-morphological-paradigm","title":"Unsupervised Morphological Paradigm Completion","date":"2020-05-03","arxiv_id":"2005.00970","repositories_listed":1,"syntology":null},{"url":"/paper/novel-language-resources-for-hindi-an","slug":"novel-language-resources-for-hindi-an","title":"Novel Language Resources for Hindi: An Aesthetics Text Corpus and a Comprehensive Stop Lemma List","date":"2020-02-01","arxiv_id":"2002.00171","repositories_listed":1,"syntology":null},{"url":"/paper/191013398","slug":"191013398","title":"Stein's Lemma for the Reparameterization Trick with Exponential Family Mixtures","date":"2019-10-29","arxiv_id":"1910.13398","repositories_listed":1,"syntology":null},{"url":"/paper/read-highlight-and-summarize-a-hierarchical","slug":"read-highlight-and-summarize-a-hierarchical","title":"Read, Highlight and Summarize: A Hierarchical Neural Semantic Encoder-based Approach","date":"2019-10-08","arxiv_id":"1910.03177","repositories_listed":1,"syntology":null},{"url":"/paper/nonzero-sum-adversarial-hypothesis-testing","slug":"nonzero-sum-adversarial-hypothesis-testing","title":"Nonzero-sum Adversarial Hypothesis Testing Games","date":"2019-09-28","arxiv_id":"1909.13031","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-lemmatization-as-embeddings","slug":"unsupervised-lemmatization-as-embeddings","title":"Unsupervised Lemmatization as Embeddings-Based Word Clustering","date":"2019-08-22","arxiv_id":"1908.08528","repositories_listed":1,"syntology":null},{"url":"/paper/cmu-01-at-the-sigmorphon-2019-shared-task-on","slug":"cmu-01-at-the-sigmorphon-2019-shared-task-on","title":"CMU-01 at the SIGMORPHON 2019 Shared Task on Crosslinguality and Context in Morphology","date":"2019-07-23","arxiv_id":"1907.10129","repositories_listed":1,"syntology":null},{"url":"/paper/language-modelling-makes-sense-propagating","slug":"language-modelling-makes-sense-propagating","title":"Language Modelling Makes Sense: Propagating Representations through WordNet for Full-Coverage Word Sense Disambiguation","date":"2019-06-24","arxiv_id":"1906.10007","repositories_listed":1,"syntology":null},{"url":"/paper/training-data-augmentation-for-context","slug":"training-data-augmentation-for-context","title":"Training Data Augmentation for Context-Sensitive Neural Lemmatizer Using Inflection Tables and Raw Text","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/moralstrength-exploiting-a-moral-lexicon-and","slug":"moralstrength-exploiting-a-moral-lexicon-and","title":"MoralStrength: Exploiting a Moral Lexicon and Embedding Similarity for Moral Foundations Prediction","date":"2019-04-17","arxiv_id":"1904.08314","repositories_listed":1,"syntology":null},{"url":"/paper/a-crowdsourced-frame-disambiguation-corpus","slug":"a-crowdsourced-frame-disambiguation-corpus","title":"A Crowdsourced Frame Disambiguation Corpus with Ambiguity","date":"2019-04-12","arxiv_id":"1904.06101","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-for-context-sensitive","slug":"data-augmentation-for-context-sensitive","title":"Training Data Augmentation for Context-Sensitive Neural Lemmatization Using Inflection Tables and Raw Text","date":"2019-04-02","arxiv_id":"1904.01464","repositories_listed":1,"syntology":null},{"url":"/paper/multi-task-deep-morphological-analyzer","slug":"multi-task-deep-morphological-analyzer","title":"Multi Task Deep Morphological Analyzer: Context Aware Joint Morphological Tagging and Lemma Prediction","date":"2018-11-21","arxiv_id":"1811.08619","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-detection-of-anomalous-sound","slug":"unsupervised-detection-of-anomalous-sound","title":"Unsupervised Detection of Anomalous Sound based on Deep Learning and the Neyman-Pearson Lemma","date":"2018-10-22","arxiv_id":"1810.09133","repositories_listed":1,"syntology":null},{"url":"/paper/weeding-out-conventionalized-metaphors-a","slug":"weeding-out-conventionalized-metaphors-a","title":"Weeding out Conventionalized Metaphors: A Corpus of Novel Metaphor Annotations","date":"2018-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/degrees-of-freedom-and-model-selection-for","slug":"degrees-of-freedom-and-model-selection-for","title":"Degrees of Freedom and Model Selection for k-means Clustering","date":"2018-06-06","arxiv_id":"1806.02034","repositories_listed":1,"syntology":null},{"url":"/paper/approximate-inference-via-weighted-rademacher","slug":"approximate-inference-via-weighted-rademacher","title":"Approximate Inference via Weighted Rademacher Complexity","date":"2018-01-27","arxiv_id":"1801.09028","repositories_listed":1,"syntology":null},{"url":"/paper/fisher-rao-metric-geometry-and-complexity-of","slug":"fisher-rao-metric-geometry-and-complexity-of","title":"Fisher-Rao Metric, Geometry, and Complexity of Neural Networks","date":"2017-11-05","arxiv_id":"1711.01530","repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-machine-learning-power-and","slug":"orthogonal-machine-learning-power-and","title":"Orthogonal Machine Learning: Power and Limitations","date":"2017-11-01","arxiv_id":"1711.00342","repositories_listed":1,"syntology":null},{"url":"/paper/the-interplay-of-semantics-and-morphology-in","slug":"the-interplay-of-semantics-and-morphology-in","title":"The Interplay of Semantics and Morphology in Word Embeddings","date":"2017-04-06","arxiv_id":"1704.01938","repositories_listed":1,"syntology":null},{"url":"/paper/context-aware-prediction-of-derivational-word","slug":"context-aware-prediction-of-derivational-word","title":"Context-Aware Prediction of Derivational Word-forms","date":"2017-02-22","arxiv_id":"1702.06675","repositories_listed":1,"syntology":null},{"url":"/paper/a-random-matrix-approach-to-neural-networks","slug":"a-random-matrix-approach-to-neural-networks","title":"A Random Matrix Approach to Neural Networks","date":"2017-02-17","arxiv_id":"1702.05419","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-random-matrix-approach-to-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1702.05419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.05419"}},"official":{"repos":["Zhenyu-LIAO/RMT4ELM"],"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":["official"]}}},{"url":"/paper/integrated-sequence-tagging-for-medieval","slug":"integrated-sequence-tagging-for-medieval","title":"Integrated Sequence Tagging for Medieval Latin Using Deep Representation Learning","date":"2016-03-04","arxiv_id":"1603.01597","repositories_listed":1,"syntology":null}],"syntology_records":18,"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":18,"papers_where_code_ran_first_page":"/task/lemma/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":"archive","page":2,"of":7,"url":"/task/lemma/papers/2","json":"/task/lemma/papers/2.json","rows":100},{"order":"archive","page":3,"of":7,"url":"/task/lemma/papers/3","json":"/task/lemma/papers/3.json","rows":100},{"order":"archive","page":4,"of":7,"url":"/task/lemma/papers/4","json":"/task/lemma/papers/4.json","rows":100},{"order":"archive","page":5,"of":7,"url":"/task/lemma/papers/5","json":"/task/lemma/papers/5.json","rows":100},{"order":"archive","page":6,"of":7,"url":"/task/lemma/papers/6","json":"/task/lemma/papers/6.json","rows":100},{"order":"archive","page":7,"of":7,"url":"/task/lemma/papers/7","json":"/task/lemma/papers/7.json","rows":28},{"order":"ran","page":1,"of":1,"url":"/task/lemma/papers/ran/1","json":"/task/lemma/papers/ran/1.json","rows":18}],"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":"423fc99f95e9b58e8a34103cf0f45e2cb2a8959f536c80b9796935cb31e381d8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}