{"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/arc/papers/2","list_of":"/task/arc","task":"ARC","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":6,"rows_per_page":100,"rows":[101,200],"of":554,"counts":{"archive_papers_tagged":554,"with_a_code_link":155,"where_syntology_ran_a_sample":48,"not_listed_spam_title":0,"listed":554,"listed_where_code_ran":48,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":42,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":42,"listed_every_run_a_failure_of_syntologys_instrument":6,"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"},"first_page":"/task/arc","prev":"/task/arc","next":"/task/arc/papers/3","papers":[{"url":"/paper/adaptive-rotated-convolution-for-rotated","slug":"adaptive-rotated-convolution-for-rotated","title":"Adaptive Rotated Convolution for Rotated Object Detection","date":"2023-03-14","arxiv_id":"2303.07820","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-rotated-convolution-for-rotated#ran","syntology_url":"https://syntology.ai/paper/2303.07820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.07820"}},"official":{"repos":["LeapLabTHU/ARC"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/conveying-the-predicted-future-to-users-a","slug":"conveying-the-predicted-future-to-users-a","title":"Conveying the Predicted Future to Users: A Case Study of Story Plot Prediction","date":"2023-02-17","arxiv_id":"2302.09122","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-rademacher-complexity-of-deep-1","slug":"adversarial-rademacher-complexity-of-deep-1","title":"Adversarial Rademacher Complexity of Deep Neural Networks","date":"2022-11-27","arxiv_id":"2211.14966","repositories_listed":1,"syntology":null},{"url":"/paper/graphs-constraints-and-search-for-the","slug":"graphs-constraints-and-search-for-the","title":"Graphs, Constraints, and Search for the Abstraction and Reasoning Corpus","date":"2022-10-18","arxiv_id":"2210.09880","repositories_listed":1,"syntology":null},{"url":"/paper/multi-layer-pseudo-siamese-biaffine-model-for","slug":"multi-layer-pseudo-siamese-biaffine-model-for","title":"Multi-Layer Pseudo-Siamese Biaffine Model for Dependency Parsing","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/monotonicity-in-undirected-networks","slug":"monotonicity-in-undirected-networks","title":"Monotonicity in Undirected Networks","date":"2022-07-13","arxiv_id":"2207.06218","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-vulnerability-of-randomized","slug":"adversarial-vulnerability-of-randomized","title":"Adversarial Vulnerability of Randomized Ensembles","date":"2022-06-14","arxiv_id":"2206.06737","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"1 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/adversarial-vulnerability-of-randomized#ran","syntology_url":"https://syntology.ai/paper/2206.06737","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.06737"}},"official":{"repos":["hsndbk4/arc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/chaos-is-a-ladder-a-new-theoretical","slug":"chaos-is-a-ladder-a-new-theoretical","title":"Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlap","date":"2022-03-25","arxiv_id":"2203.13457","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/chaos-is-a-ladder-a-new-theoretical#ran","syntology_url":"https://syntology.ai/paper/2203.13457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.13457"}},"official":{"repos":["zhangq327/arc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/first-steps-of-an-approach-to-the-arc","slug":"first-steps-of-an-approach-to-the-arc","title":"First Steps of an Approach to the ARC Challenge based on Descriptive Grid Models and the Minimum Description Length Principle","date":"2021-12-01","arxiv_id":"2112.00848","repositories_listed":1,"syntology":null},{"url":"/paper/an-effective-hybrid-search-algorithm-for-the","slug":"an-effective-hybrid-search-algorithm-for-the","title":"An effective hybrid search algorithm for the multiple traveling repairman problem with profits","date":"2021-11-09","arxiv_id":"2111.05017","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-embedding-of-stories-into","slug":"automatic-embedding-of-stories-into","title":"Automatic Embedding of Stories Into Collections of Independent Media","date":"2021-11-03","arxiv_id":"2111.02216","repositories_listed":1,"syntology":null},{"url":"/paper/exploiting-reasoning-chains-for-multi-hop","slug":"exploiting-reasoning-chains-for-multi-hop","title":"Exploiting Reasoning Chains for Multi-hop Science Question Answering","date":"2021-09-07","arxiv_id":"2109.02905","repositories_listed":1,"syntology":null},{"url":"/paper/combining-second-order-graph-based-and-headed","slug":"combining-second-order-graph-based-and-headed","title":"Combining (second-order) graph-based and headed-span-based projective dependency parsing","date":"2021-08-12","arxiv_id":"2108.05838","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-vrp-a-neural-network-model-to","slug":"data-driven-vrp-a-neural-network-model-to","title":"Data Driven VRP: A Neural Network Model to Learn Hidden Preferences for VRP","date":"2021-08-10","arxiv_id":"2108.04578","repositories_listed":1,"syntology":null},{"url":"/paper/synpick-a-dataset-for-dynamic-bin-picking","slug":"synpick-a-dataset-for-dynamic-bin-picking","title":"SynPick: A Dataset for Dynamic Bin Picking Scene Understanding","date":"2021-07-10","arxiv_id":"2107.04852","repositories_listed":1,"syntology":null},{"url":"/paper/arc-adversarially-robust-control-policies-for","slug":"arc-adversarially-robust-control-policies-for","title":"ARC: Adversarially Robust Control Policies for Autonomous Vehicles","date":"2021-07-09","arxiv_id":"2107.04487","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/arc-adversarially-robust-control-policies-for#ran","syntology_url":"https://syntology.ai/paper/2107.04487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.04487"}},"official":{"repos":["sampo-kuutti/adversarially-robust-control"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/levi-graph-amr-parser-using-heterogeneous","slug":"levi-graph-amr-parser-using-heterogeneous","title":"Levi Graph AMR Parser using Heterogeneous Attention","date":"2021-07-09","arxiv_id":"2107.04152","repositories_listed":1,"syntology":null},{"url":"/paper/to-raise-or-not-to-raise-the-autonomous","slug":"to-raise-or-not-to-raise-the-autonomous","title":"To Raise or Not To Raise: The Autonomous Learning Rate Question","date":"2021-06-16","arxiv_id":"2106.08767","repositories_listed":1,"syntology":null},{"url":"/paper/scaling-neural-tangent-kernels-via-sketching","slug":"scaling-neural-tangent-kernels-via-sketching","title":"Scaling Neural Tangent Kernels via Sketching and Random Features","date":"2021-06-15","arxiv_id":"2106.07880","repositories_listed":1,"syntology":null},{"url":"/paper/ukiyo-e-analysis-and-creativity-with","slug":"ukiyo-e-analysis-and-creativity-with","title":"Ukiyo-e Analysis and Creativity with Attribute and Geometry Annotation","date":"2021-06-04","arxiv_id":"2106.02267","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-semantic-graph-construction-and","slug":"dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","date":"2021-05-25","arxiv_id":"2105.11776","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/dynamic-semantic-graph-construction-and#ran","syntology_url":"https://syntology.ai/paper/2105.11776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11776"}},"official":{"repos":["wwxu21/AMR-SG"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-novel-generalised-meta-heuristic-framework","slug":"a-novel-generalised-meta-heuristic-framework","title":"A Novel Generalised Meta-Heuristic Framework for Dynamic Capacitated Arc Routing Problems","date":"2021-04-14","arxiv_id":"2104.06585","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-frame-forecast","slug":"semantic-frame-forecast","title":"Semantic Frame Forecast","date":"2021-04-12","arxiv_id":"2104.05604","repositories_listed":1,"syntology":null},{"url":"/paper/arc-a-vision-based-automatic-retail-checkout","slug":"arc-a-vision-based-automatic-retail-checkout","title":"ARC: A Vision-based Automatic Retail Checkout System","date":"2021-04-07","arxiv_id":"2104.02832","repositories_listed":1,"syntology":null},{"url":"/paper/lt-lm-a-novel-non-autoregressive-language","slug":"lt-lm-a-novel-non-autoregressive-language","title":"LT-LM: a novel non-autoregressive language model for single-shot lattice rescoring","date":"2021-04-06","arxiv_id":"2104.02526","repositories_listed":1,"syntology":null},{"url":"/paper/a-parallelizable-lattice-rescoring-strategy","slug":"a-parallelizable-lattice-rescoring-strategy","title":"A Parallelizable Lattice Rescoring Strategy with Neural Language Models","date":"2021-03-08","arxiv_id":"2103.05081","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-consistency-regularization-for-semi","slug":"adaptive-consistency-regularization-for-semi","title":"Adaptive Consistency Regularization for Semi-Supervised Transfer Learning","date":"2021-03-03","arxiv_id":"2103.02193","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adaptive-consistency-regularization-for-semi#ran","syntology_url":"https://syntology.ai/paper/2103.02193","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02193"}},"official":{"repos":["SHI-Labs/Semi-Supervised-Transfer-Learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ppt-parsimonious-parser-transfer-for","slug":"ppt-parsimonious-parser-transfer-for","title":"PPT: Parsimonious Parser Transfer for Unsupervised Cross-Lingual Adaptation","date":"2021-01-27","arxiv_id":"2101.11216","repositories_listed":1,"syntology":null},{"url":"/paper/dipn-deep-interaction-prediction-network-with","slug":"dipn-deep-interaction-prediction-network-with","title":"DIPN: Deep Interaction Prediction Network with Application to Clutter Removal","date":"2020-11-09","arxiv_id":"2011.04692","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-factuality-in-generation-with","slug":"evaluating-factuality-in-generation-with","title":"Evaluating Factuality in Generation with Dependency-level Entailment","date":"2020-10-12","arxiv_id":"2010.05478","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-probing-trading-off-accuracy-for","slug":"pareto-probing-trading-off-accuracy-for","title":"Pareto Probing: Trading Off Accuracy for Complexity","date":"2020-10-05","arxiv_id":"2010.02180","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/pareto-probing-trading-off-accuracy-for#ran","syntology_url":"https://syntology.ai/paper/2010.02180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02180"}},"official":{"repos":["rycolab/pareto-probing"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-off-policy-with-online-planning","slug":"learning-off-policy-with-online-planning","title":"Learning Off-Policy with Online Planning","date":"2020-08-23","arxiv_id":"2008.10066","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":0,"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/learning-off-policy-with-online-planning#ran","syntology_url":"https://syntology.ai/paper/2008.10066","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.10066"}},"official":null}},{"url":"/paper/a-comparison-of-supervised-learning-to-match","slug":"a-comparison-of-supervised-learning-to-match","title":"A Comparison of Supervised Learning to Match Methods for Product Search","date":"2020-07-20","arxiv_id":"2007.10296","repositories_listed":1,"syntology":null},{"url":"/paper/superpixel-segmentation-using-dynamic-and","slug":"superpixel-segmentation-using-dynamic-and","title":"Superpixel Segmentation using Dynamic and Iterative Spanning Forest","date":"2020-07-08","arxiv_id":"2007.04257","repositories_listed":1,"syntology":null},{"url":"/paper/semi-supervised-semantic-dependency-parsing","slug":"semi-supervised-semantic-dependency-parsing","title":"Semi-Supervised Semantic Dependency Parsing Using CRF Autoencoders","date":"2020-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/curvilinear-distance-metric-learning","slug":"curvilinear-distance-metric-learning","title":"Curvilinear Distance Metric Learning","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/global-greedy-dependency-parsing","slug":"global-greedy-dependency-parsing","title":"Global Greedy Dependency Parsing","date":"2019-11-20","arxiv_id":"1911.08673","repositories_listed":1,"syntology":null},{"url":"/paper/auptimizer-an-extensible-open-source","slug":"auptimizer-an-extensible-open-source","title":"Auptimizer -- an Extensible, Open-Source Framework for Hyperparameter Tuning","date":"2019-11-06","arxiv_id":"1911.02522","repositories_listed":1,"syntology":null},{"url":"/paper/outlining-where-humans-live-the-world","slug":"outlining-where-humans-live-the-world","title":"Outlining where humans live -- The World Settlement Footprint 2015","date":"2019-10-28","arxiv_id":"1910.12707","repositories_listed":1,"syntology":null},{"url":"/paper/alignment-over-heterogeneous-embeddings-for","slug":"alignment-over-heterogeneous-embeddings-for","title":"Alignment over Heterogeneous Embeddings for Question Answering","date":"2019-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structural-scaffolds-for-citation-intent","slug":"structural-scaffolds-for-citation-intent","title":"Structural Scaffolds for Citation Intent Classification in Scientific Publications","date":"2019-04-02","arxiv_id":"1904.01608","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/structural-scaffolds-for-citation-intent#ran","syntology_url":"https://syntology.ai/paper/1904.01608","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01608"}},"official":{"repos":["allenai/scicite"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/syntax-aware-semantic-role-labeling-without","slug":"syntax-aware-semantic-role-labeling-without","title":"Syntax-aware Semantic Role Labeling without Parsing","date":"2019-03-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/improving-question-answering-with-external","slug":"improving-question-answering-with-external","title":"Improving Question Answering with External Knowledge","date":"2019-02-03","arxiv_id":"1902.00993","repositories_listed":1,"syntology":null},{"url":"/paper/improving-machine-reading-comprehension-with","slug":"improving-machine-reading-comprehension-with","title":"Improving Machine Reading Comprehension with General Reading Strategies","date":"2018-10-31","arxiv_id":"1810.13441","repositories_listed":1,"syntology":null},{"url":"/paper/testing-global-constraints","slug":"testing-global-constraints","title":"Testing Global Constraints","date":"2018-07-11","arxiv_id":"1807.03975","repositories_listed":1,"syntology":null},{"url":"/paper/think-you-have-solved-question-answering-try","slug":"think-you-have-solved-question-answering-try","title":"Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge","date":"2018-03-14","arxiv_id":"1803.05457","repositories_listed":1,"syntology":null},{"url":"/paper/non-projective-dependency-parsing-with-non","slug":"non-projective-dependency-parsing-with-non","title":"Non-Projective Dependency Parsing with Non-Local Transitions","date":"2017-10-25","arxiv_id":"1710.09340","repositories_listed":1,"syntology":null},{"url":"/paper/arc-hybrid-non-projective-dependency-parsing","slug":"arc-hybrid-non-projective-dependency-parsing","title":"Arc-Hybrid Non-Projective Dependency Parsing with a Static-Dynamic Oracle","date":"2017-09-01","arxiv_id":null,"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/universal-scaling-and-nonlinearity-of","slug":"universal-scaling-and-nonlinearity-of","title":"Universal scaling and nonlinearity of aggregate price impact in financial markets","date":"2017-06-13","arxiv_id":"1706.04163","repositories_listed":1,"syntology":null},{"url":"/paper/arc-swift-a-novel-transition-system-for","slug":"arc-swift-a-novel-transition-system-for","title":"Arc-swift: A Novel Transition System for Dependency Parsing","date":"2017-05-12","arxiv_id":"1705.04434","repositories_listed":1,"syntology":null},{"url":"/paper/deep-multitask-learning-for-semantic","slug":"deep-multitask-learning-for-semantic","title":"Deep Multitask Learning for Semantic Dependency Parsing","date":"2017-04-22","arxiv_id":"1704.06855","repositories_listed":1,"syntology":null},{"url":"/paper/cell-identification-in-whole-brain-multiview","slug":"cell-identification-in-whole-brain-multiview","title":"Cell identification in whole-brain multiview images of neural activation","date":"2015-11-04","arxiv_id":"1511.01168","repositories_listed":1,"syntology":null},{"url":"/paper/convolutional-neural-network-for-paraphrase","slug":"convolutional-neural-network-for-paraphrase","title":"Convolutional Neural Network for Paraphrase Identification","date":"2015-05-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":"revisiting-z-transform-laplace-inversion-to","title":"Revisiting Z Transform Laplace Inversion: To Correct flaws in Signal and System Theory","date":"2025-06-29","arxiv_id":"2506.23242","repositories_listed":0,"syntology":null},{"url":null,"slug":"autonomous-cyber-resilience-via-a-co","title":"Autonomous Cyber Resilience via a Co-Evolutionary Arms Race within a Fortified Digital Twin Sandbox","date":"2025-06-25","arxiv_id":"2506.20102","repositories_listed":0,"syntology":null},{"url":null,"slug":"physics-guided-radiotherapy-treatment","title":"Physics-Guided Radiotherapy Treatment Planning with Deep Learning","date":"2025-06-23","arxiv_id":"2506.19880","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-deep-learning-model-for-fast","title":"Unsupervised deep learning model for fast energy layer pre-selection of delivery-efficient proton arc therapy plan optimization of nasopharyngeal carcinoma","date":"2025-06-18","arxiv_id":"2506.15803","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-insar-monitoring-of-building-damage-in","title":"Active InSAR monitoring of building damage in Gaza during the Israel-Hamas War","date":"2025-06-17","arxiv_id":"2506.14730","repositories_listed":0,"syntology":null},{"url":null,"slug":"don-t-throw-the-baby-out-with-the-bathwater","title":"Don't throw the baby out with the bathwater: How and why deep learning for ARC","date":"2025-06-17","arxiv_id":"2506.14276","repositories_listed":0,"syntology":null},{"url":null,"slug":"lora-mixer-coordinate-modular-lora-experts","title":"LoRA-Mixer: Coordinate Modular LoRA Experts Through Serial Attention Routing","date":"2025-06-17","arxiv_id":"2507.00029","repositories_listed":0,"syntology":null},{"url":null,"slug":"limited-angle-cbct-reconstruction-via","title":"Limited-Angle CBCT Reconstruction via Geometry-Integrated Cycle-domain Denoising Diffusion Probabilistic Models","date":"2025-06-16","arxiv_id":"2506.13545","repositories_listed":0,"syntology":null},{"url":null,"slug":"frequency-dynamic-convolutions-for-sound","title":"Frequency Dynamic Convolutions for Sound Event Detection","date":"2025-06-15","arxiv_id":"2506.12785","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-program-synthesis-using-llms","title":"Structured Program Synthesis using LLMs: Results and Insights from the IPARC Challenge","date":"2025-06-15","arxiv_id":"2506.13820","repositories_listed":0,"syntology":null},{"url":null,"slug":"feedforward-ordering-in-neural-connectomes","title":"Feedforward Ordering in Neural Connectomes via Feedback Arc Minimization","date":"2025-06-13","arxiv_id":"2506.13799","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-10968","title":"Eye, Robot: Learning to Look to Act with a BC-RL Perception-Action Loop","date":"2025-06-12","arxiv_id":"2506.10968","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-generation-to-generalization-emergent","title":"From Generation to Generalization: Emergent Few-Shot Learning in Video Diffusion Models","date":"2025-06-08","arxiv_id":"2506.07280","repositories_listed":0,"syntology":null},{"url":null,"slug":"2506-10020","title":"From Threat to Tool: Leveraging Refusal-Aware Injection Attacks for Safety Alignment","date":"2025-06-07","arxiv_id":"2506.10020","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-to-lora-instant-transformer-adaption","title":"Text-to-LoRA: Instant Transformer Adaption","date":"2025-06-06","arxiv_id":"2506.06105","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-much-backtracking-is-enough-exploring-the","title":"How Much Backtracking is Enough? Exploring the Interplay of SFT and RL in Enhancing LLM Reasoning","date":"2025-05-30","arxiv_id":"2505.24273","repositories_listed":0,"syntology":null},{"url":null,"slug":"arc-argument-representation-and-coverage","title":"ARC: Argument Representation and Coverage Analysis for Zero-Shot Long Document Summarization with Instruction Following LLMs","date":"2025-05-29","arxiv_id":"2505.23654","repositories_listed":0,"syntology":null},{"url":null,"slug":"enigmata-scaling-logical-reasoning-in-large","title":"Enigmata: Scaling Logical Reasoning in Large Language Models with Synthetic Verifiable Puzzles","date":"2025-05-26","arxiv_id":"2505.19914","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bio-mimetic-neuromorphic-model-for-heat","title":"A Bio-mimetic Neuromorphic Model for Heat-evoked Nociceptive Withdrawal Reflex in Upper Limb","date":"2025-05-23","arxiv_id":"2505.17724","repositories_listed":0,"syntology":null},{"url":"/paper/attributing-response-to-context-a-jensen","slug":"attributing-response-to-context-a-jensen","title":"Attributing Response to Context: A Jensen-Shannon Divergence Driven Mechanistic Study of Context Attribution in Retrieval-Augmented Generation","date":"2025-05-22","arxiv_id":"2505.16415","repositories_listed":0,"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/attributing-response-to-context-a-jensen#ran","syntology_url":"https://syntology.ai/paper/2505.16415","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16415"}},"official":null}},{"url":null,"slug":"self-reasoning-language-models-unfold-hidden","title":"Self-Reasoning Language Models: Unfold Hidden Reasoning Chains with Few Reasoning Catalyst","date":"2025-05-20","arxiv_id":"2505.14116","repositories_listed":0,"syntology":null},{"url":null,"slug":"development-of-a-non-wearable-support-robot","title":"Development of a non-wearable support robot capable of reproducing natural standing-up movements","date":"2025-05-18","arxiv_id":"2505.12525","repositories_listed":0,"syntology":null},{"url":null,"slug":"arc-agi-2-a-new-challenge-for-frontier-ai","title":"ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systems","date":"2025-05-17","arxiv_id":"2505.11831","repositories_listed":0,"syntology":null},{"url":null,"slug":"out-of-distribution-generalisation-is-hard","title":"Out-of-distribution generalisation is hard: evidence from ARC-like tasks","date":"2025-05-14","arxiv_id":"2505.09716","repositories_listed":0,"syntology":null},{"url":null,"slug":"arc-nca-towards-developmental-solutions-to","title":"ARC-NCA: Towards Developmental Solutions to the Abstraction and Reasoning Corpus","date":"2025-05-13","arxiv_id":"2505.08778","repositories_listed":0,"syntology":null},{"url":null,"slug":"elastic-weight-consolidation-for-full","title":"Elastic Weight Consolidation for Full-Parameter Continual Pre-Training of Gemma2","date":"2025-05-09","arxiv_id":"2505.05946","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-performance-on-arc-is-a-matter-of","title":"Boosting Performance on ARC is a Matter of Perspective","date":"2025-05-08","arxiv_id":"2505.07859","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-insertion-of-neomycin-cassette-impairs","title":"The insertion of Neomycin cassette impairs maternal and social behaviors in Arc/Arg3.1 knock-out mice","date":"2025-05-06","arxiv_id":"2505.03339","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensitivity-analysis-of-state-space-models","title":"Sensitivity Analysis of State Space Models for Scrap Composition Estimation in EAF and BOF","date":"2025-04-15","arxiv_id":"2504.11319","repositories_listed":0,"syntology":null},{"url":null,"slug":"transferable-text-data-distillation-by","title":"Transferable text data distillation by trajectory matching","date":"2025-04-14","arxiv_id":"2504.09818","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-scrap-composition-in-electric-arc","title":"Modeling Scrap Composition in Electric Arc and Basic Oxygen Furnaces","date":"2025-04-13","arxiv_id":"2504.09382","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-is-less-the-pitfalls-of-multi-model","title":"More is Less: The Pitfalls of Multi-Model Synthetic Preference Data in DPO Safety Alignment","date":"2025-04-03","arxiv_id":"2504.02193","repositories_listed":0,"syntology":null},{"url":null,"slug":"order-independence-with-finetuning","title":"Order Independence With Finetuning","date":"2025-03-30","arxiv_id":"2503.23483","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-library-cell-representations-in","title":"Learning Library Cell Representations in Vector Space","date":"2025-03-28","arxiv_id":"2503.22900","repositories_listed":0,"syntology":null},{"url":null,"slug":"arc-calib-autonomous-markerless-camera-to","title":"ARC-Calib: Autonomous Markerless Camera-to-Robot Calibration via Exploratory Robot Motions","date":"2025-03-18","arxiv_id":"2503.14701","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-approximation-of-binary-state","title":"Data-Driven Approximation of Binary-State Network Reliability Function: Algorithm Selection and Reliability Thresholds for Large-Scale Systems","date":"2025-03-16","arxiv_id":"2503.15545","repositories_listed":0,"syntology":null},{"url":null,"slug":"verimind-agentic-llm-for-automated-verilog","title":"VeriMind: Agentic LLM for Automated Verilog Generation with a Novel Evaluation Metric","date":"2025-03-15","arxiv_id":"2503.16514","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-alignment-regularity","title":"Evaluation of Alignment-Regularity Characteristics in Deformable Image Registration","date":"2025-03-10","arxiv_id":"2503.07185","repositories_listed":0,"syntology":null},{"url":null,"slug":"revitalizing-saturated-benchmarks-a-weighted","title":"Revitalizing Saturated Benchmarks: A Weighted Metric Approach for Differentiating Large Language Model Performance","date":"2025-03-07","arxiv_id":"2503.05551","repositories_listed":0,"syntology":null},{"url":null,"slug":"state-of-the-art-stroke-lesion-segmentation","title":"State-of-the-Art Stroke Lesion Segmentation at 1/1000th of Parameters","date":"2025-03-07","arxiv_id":"2503.05531","repositories_listed":0,"syntology":null},{"url":null,"slug":"arc-flow-articulated-resolution-agnostic","title":"ARC-Flow : Articulated, Resolution-Agnostic, Correspondence-Free Matching and Interpolation of 3D Shapes Under Flow Fields","date":"2025-03-04","arxiv_id":"2503.02606","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-pose-estimation-for-flight-platforms","title":"Accurate Pose Estimation for Flight Platforms based on Divergent Multi-Aperture Imaging System","date":"2025-02-27","arxiv_id":"2502.19708","repositories_listed":0,"syntology":null},{"url":null,"slug":"say-less-mean-more-leveraging-pragmatics-in","title":"Say Less, Mean More: Leveraging Pragmatics in Retrieval-Augmented Generation","date":"2025-02-25","arxiv_id":"2502.17839","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlating-and-predicting-human-evaluations","title":"Correlating and Predicting Human Evaluations of Language Models from Natural Language Processing Benchmarks","date":"2025-02-24","arxiv_id":"2502.18339","repositories_listed":0,"syntology":null},{"url":null,"slug":"detecting-benchmark-contamination-through","title":"Detecting Benchmark Contamination Through Watermarking","date":"2025-02-24","arxiv_id":"2502.17259","repositories_listed":0,"syntology":null}],"record_sha256":"3b062312bbe138e6ca1ef1ba58c1e9fa4d27e83d27326b71c949563821853a1e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}