{"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/ran/1","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,48],"of":48,"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/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/helm-hyperbolic-large-language-models-via","slug":"helm-hyperbolic-large-language-models-via","title":"HELM: Hyperbolic Large Language Models via Mixture-of-Curvature Experts","date":"2025-05-30","arxiv_id":"2505.24722","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/helm-hyperbolic-large-language-models-via#ran","syntology_url":"https://syntology.ai/paper/2505.24722","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.24722"}},"official":{"repos":["graph-and-geometric-learning/helm"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"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":"/paper/datadecide-how-to-predict-best-pretraining","slug":"datadecide-how-to-predict-best-pretraining","title":"DataDecide: How to Predict Best Pretraining Data with Small Experiments","date":"2025-04-15","arxiv_id":"2504.11393","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/datadecide-how-to-predict-best-pretraining#ran","syntology_url":"https://syntology.ai/paper/2504.11393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11393"}},"official":null}},{"url":"/paper/arc-anchored-representation-clouds-for-high","slug":"arc-anchored-representation-clouds-for-high","title":"ARC: Anchored Representation Clouds for High-Resolution INR Classification","date":"2025-03-19","arxiv_id":"2503.15156","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/arc-anchored-representation-clouds-for-high#ran","syntology_url":"https://syntology.ai/paper/2503.15156","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.15156"}},"official":{"repos":["jluij/anchored_representation_clouds"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/arc-prize-2024-technical-report","slug":"arc-prize-2024-technical-report","title":"ARC Prize 2024: Technical Report","date":"2024-12-05","arxiv_id":"2412.04604","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/arc-prize-2024-technical-report#ran","syntology_url":"https://syntology.ai/paper/2412.04604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.04604"}},"official":{"repos":["michaelhodel/re-arc"],"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/searching-latent-program-spaces","slug":"searching-latent-program-spaces","title":"Searching Latent Program Spaces","date":"2024-11-13","arxiv_id":"2411.08706","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":3,"n_ran_checked":3,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/searching-latent-program-spaces#ran","syntology_url":"https://syntology.ai/paper/2411.08706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.08706"}},"official":{"repos":["clement-bonnet/lpn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/the-surprising-effectiveness-of-test-time","slug":"the-surprising-effectiveness-of-test-time","title":"The Surprising Effectiveness of Test-Time Training for Few-Shot Learning","date":"2024-11-11","arxiv_id":"2411.07279","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/the-surprising-effectiveness-of-test-time#ran","syntology_url":"https://syntology.ai/paper/2411.07279","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.07279"}},"official":{"repos":["ekinakyurek/marc"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/language-models-are-hidden-reasoners","slug":"language-models-are-hidden-reasoners","title":"Language Models are Hidden Reasoners: Unlocking Latent Reasoning Capabilities via Self-Rewarding","date":"2024-11-06","arxiv_id":"2411.04282","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/language-models-are-hidden-reasoners#ran","syntology_url":"https://syntology.ai/paper/2411.04282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.04282"}},"official":{"repos":["salesforceairesearch/latro"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/combining-induction-and-transduction-for","slug":"combining-induction-and-transduction-for","title":"Combining Induction and Transduction for Abstract Reasoning","date":"2024-11-04","arxiv_id":"2411.02272","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":19,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/combining-induction-and-transduction-for#ran","syntology_url":"https://syntology.ai/paper/2411.02272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02272"}},"official":{"repos":["xu3kev/barc"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/digitizing-touch-with-an-artificial","slug":"digitizing-touch-with-an-artificial","title":"Digitizing Touch with an Artificial Multimodal Fingertip","date":"2024-11-04","arxiv_id":"2411.02479","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":1,"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/digitizing-touch-with-an-artificial#ran","syntology_url":"https://syntology.ai/paper/2411.02479","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02479"}},"official":{"repos":["facebookresearch/digit360"],"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/todo-enhancing-llm-alignment-with-ternary","slug":"todo-enhancing-llm-alignment-with-ternary","title":"TODO: Enhancing LLM Alignment with Ternary Preferences","date":"2024-11-02","arxiv_id":"2411.02442","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/todo-enhancing-llm-alignment-with-ternary#ran","syntology_url":"https://syntology.ai/paper/2411.02442","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.02442"}},"official":{"repos":["xxares/todo"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/itergen-iterative-structured-llm-generation","slug":"itergen-iterative-structured-llm-generation","title":"IterGen: Iterative Semantic-aware Structured LLM Generation with Backtracking","date":"2024-10-09","arxiv_id":"2410.07295","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":0,"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/itergen-iterative-structured-llm-generation#ran","syntology_url":"https://syntology.ai/paper/2410.07295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.07295"}},"official":{"repos":["uiuc-arc/itergen"],"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/mexa-multilingual-evaluation-of-english","slug":"mexa-multilingual-evaluation-of-english","title":"MEXA: Multilingual Evaluation of English-Centric LLMs via Cross-Lingual Alignment","date":"2024-10-08","arxiv_id":"2410.05873","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 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; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mexa-multilingual-evaluation-of-english#ran","syntology_url":"https://syntology.ai/paper/2410.05873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.05873"}},"official":{"repos":["cisnlp/mexa"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tackling-the-abstraction-and-reasoning-corpus-1","slug":"tackling-the-abstraction-and-reasoning-corpus-1","title":"Tackling the Abstraction and Reasoning Corpus with Vision Transformers: the Importance of 2D Representation, Positions, and Objects","date":"2024-10-08","arxiv_id":"2410.06405","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/tackling-the-abstraction-and-reasoning-corpus-1#ran","syntology_url":"https://syntology.ai/paper/2410.06405","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06405"}},"official":{"repos":["khalil-research/ViTARC"],"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/rationale-aware-answer-verification-by","slug":"rationale-aware-answer-verification-by","title":"Rationale-Aware Answer Verification by Pairwise Self-Evaluation","date":"2024-10-07","arxiv_id":"2410.04838","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/rationale-aware-answer-verification-by#ran","syntology_url":"https://syntology.ai/paper/2410.04838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.04838"}},"official":{"repos":["akirakawabata/reps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/matern-kernels-for-tunable-implicit-surface","slug":"matern-kernels-for-tunable-implicit-surface","title":"Matérn Kernels for Tunable Implicit Surface Reconstruction","date":"2024-09-23","arxiv_id":"2409.15466","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":0,"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/matern-kernels-for-tunable-implicit-surface#ran","syntology_url":"https://syntology.ai/paper/2409.15466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.15466"}},"official":{"repos":["mweiherer/matern-surface-reconstruction"],"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/neural-symbolic-collaborative-distillation","slug":"neural-symbolic-collaborative-distillation","title":"Neural-Symbolic Collaborative Distillation: Advancing Small Language Models for Complex Reasoning Tasks","date":"2024-09-20","arxiv_id":"2409.13203","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-symbolic-collaborative-distillation#ran","syntology_url":"https://syntology.ai/paper/2409.13203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13203"}},"official":{"repos":["xnhyacinth/nesycd"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/arcle-the-abstraction-and-reasoning-corpus","slug":"arcle-the-abstraction-and-reasoning-corpus","title":"ARCLE: The Abstraction and Reasoning Corpus Learning Environment for Reinforcement Learning","date":"2024-07-30","arxiv_id":"2407.20806","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/arcle-the-abstraction-and-reasoning-corpus#ran","syntology_url":"https://syntology.ai/paper/2407.20806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20806"}},"official":{"repos":["confeitohs/arcle"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-laws-with-vocabulary-larger-models","slug":"scaling-laws-with-vocabulary-larger-models","title":"Scaling Laws with Vocabulary: Larger Models Deserve Larger Vocabularies","date":"2024-07-18","arxiv_id":"2407.13623","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scaling-laws-with-vocabulary-larger-models#ran","syntology_url":"https://syntology.ai/paper/2407.13623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.13623"}},"official":{"repos":["sail-sg/scaling-with-vocab"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/texttt-metabench-a-sparse-benchmark-to","slug":"texttt-metabench-a-sparse-benchmark-to","title":"$\\texttt{metabench}$ -- A Sparse Benchmark to Measure General Ability in Large Language Models","date":"2024-07-04","arxiv_id":"2407.12844","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":9,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/texttt-metabench-a-sparse-benchmark-to#ran","syntology_url":"https://syntology.ai/paper/2407.12844","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.12844"}},"official":{"repos":["adkipnis/metabench"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/varbench-robust-language-model-benchmarking","slug":"varbench-robust-language-model-benchmarking","title":"VarBench: Robust Language Model Benchmarking Through Dynamic Variable Perturbation","date":"2024-06-25","arxiv_id":"2406.17681","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":6,"phrase":"6 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/varbench-robust-language-model-benchmarking#ran","syntology_url":"https://syntology.ai/paper/2406.17681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17681"}},"official":{"repos":["qbetterk/VarBench"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adamoe-token-adaptive-routing-with-null","slug":"adamoe-token-adaptive-routing-with-null","title":"AdaMoE: Token-Adaptive Routing with Null Experts for Mixture-of-Experts Language Models","date":"2024-06-19","arxiv_id":"2406.13233","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/adamoe-token-adaptive-routing-with-null#ran","syntology_url":"https://syntology.ai/paper/2406.13233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.13233"}},"official":{"repos":["cengzihao/adamoe"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-modal-learning-for-anomaly-detection-in","slug":"cross-modal-learning-for-anomaly-detection-in","title":"Cross-Modal Learning for Anomaly Detection in Complex Industrial Process: Methodology and Benchmark","date":"2024-06-13","arxiv_id":"2406.09016","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":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cross-modal-learning-for-anomaly-detection-in#ran","syntology_url":"https://syntology.ai/paper/2406.09016","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09016"}},"official":{"repos":["gaochangwu/fmf-benchmark"],"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/flow-of-reasoning-efficient-training-of-llm","slug":"flow-of-reasoning-efficient-training-of-llm","title":"Flow of Reasoning:Training LLMs for Divergent Problem Solving with Minimal Examples","date":"2024-06-09","arxiv_id":"2406.05673","repositories_listed":1,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/flow-of-reasoning-efficient-training-of-llm#ran","syntology_url":"https://syntology.ai/paper/2406.05673","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05673"}},"official":{"repos":["yu-fangxu/for"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/yuan-2-0-m32-mixture-of-experts-with","slug":"yuan-2-0-m32-mixture-of-experts-with","title":"Yuan 2.0-M32: Mixture of Experts with Attention Router","date":"2024-05-28","arxiv_id":"2405.17976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/yuan-2-0-m32-mixture-of-experts-with#ran","syntology_url":"https://syntology.ai/paper/2405.17976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17976"}},"official":{"repos":["ieit-yuan/yuan2.0-m32"],"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/arc-a-generalist-graph-anomaly-detector-with","slug":"arc-a-generalist-graph-anomaly-detector-with","title":"ARC: A Generalist Graph Anomaly Detector with In-Context Learning","date":"2024-05-27","arxiv_id":"2405.16771","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/arc-a-generalist-graph-anomaly-detector-with#ran","syntology_url":"https://syntology.ai/paper/2405.16771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16771"}},"official":{"repos":["yixinliu233/arc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/localized-adaptive-risk-control","slug":"localized-adaptive-risk-control","title":"Localized Adaptive Risk Control","date":"2024-05-13","arxiv_id":"2405.07976","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 0 unverified","sample_list":"/paper/localized-adaptive-risk-control#ran","syntology_url":"https://syntology.ai/paper/2405.07976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.07976"}},"official":{"repos":["kclip/localized-adaptive-risk-control"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/monte-carlo-tree-search-boosts-reasoning-via","slug":"monte-carlo-tree-search-boosts-reasoning-via","title":"Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning","date":"2024-05-01","arxiv_id":"2405.00451","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/monte-carlo-tree-search-boosts-reasoning-via#ran","syntology_url":"https://syntology.ai/paper/2405.00451","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.00451"}},"official":{"repos":["YuxiXie/MCTS-DPO"],"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/is-watermarking-llm-generated-code-robust","slug":"is-watermarking-llm-generated-code-robust","title":"Is The Watermarking Of LLM-Generated Code Robust?","date":"2024-03-24","arxiv_id":"2403.17983","repositories_listed":1,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/is-watermarking-llm-generated-code-robust#ran","syntology_url":"https://syntology.ai/paper/2403.17983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.17983"}},"official":{"repos":["uiuc-arc/llm-code-watermark"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/reasoning-abilities-of-large-language-models","slug":"reasoning-abilities-of-large-language-models","title":"Reasoning Abilities of Large Language Models: In-Depth Analysis on the Abstraction and Reasoning Corpus","date":"2024-03-18","arxiv_id":"2403.11793","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reasoning-abilities-of-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2403.11793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11793"}},"official":{"repos":["GIST-DSLab/ARC_Prompt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codeit-self-improving-language-models-with","slug":"codeit-self-improving-language-models-with","title":"CodeIt: Self-Improving Language Models with Prioritized Hindsight Replay","date":"2024-02-07","arxiv_id":"2402.04858","repositories_listed":1,"syntology":{"n":41,"n_ran":32,"n_constructed":4,"n_ran_checked":10,"n_instrument":22,"n_unverified":9,"n_honours":4,"n_violates":2,"n_no_contract":4,"n_pointer_only":41,"phrase":"32 ran (of which 4 constructed an object rather than computing a result; 10 with no instrument failure: 4 honoured, 2 violated, 4 with no contract checked; 22 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/codeit-self-improving-language-models-with#ran","syntology_url":"https://syntology.ai/paper/2402.04858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04858"}},"official":{"repos":["Qualcomm-AI-research/codeit"],"state":"official (archive's flag): 32 ran","n_ran":32,"n_constructed":4,"n_ran_no_instrument_failure":10,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/rotated-multi-scale-interaction-network-for","slug":"rotated-multi-scale-interaction-network-for","title":"Rotated Multi-Scale Interaction Network for Referring Remote Sensing Image Segmentation","date":"2023-12-19","arxiv_id":"2312.12470","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rotated-multi-scale-interaction-network-for#ran","syntology_url":"https://syntology.ai/paper/2312.12470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.12470"}},"official":{"repos":["lsan2401/rmsin"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-adaptation-of-large-vision-1","slug":"efficient-adaptation-of-large-vision-1","title":"Efficient Adaptation of Large Vision Transformer via Adapter Re-Composing","date":"2023-10-10","arxiv_id":"2310.06234","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"6 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-adaptation-of-large-vision-1#ran","syntology_url":"https://syntology.ai/paper/2310.06234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.06234"}},"official":{"repos":["davidyanande/arc"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/hypothesis-search-inductive-reasoning-with","slug":"hypothesis-search-inductive-reasoning-with","title":"Hypothesis Search: Inductive Reasoning with Language Models","date":"2023-09-11","arxiv_id":"2309.05660","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/hypothesis-search-inductive-reasoning-with#ran","syntology_url":"https://syntology.ai/paper/2309.05660","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05660"}},"official":{"repos":["relento/hypothesis_search"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/generating-high-quality-emotion-arcs-for-low","slug":"generating-high-quality-emotion-arcs-for-low","title":"Evaluating Emotion Arcs Across Languages: Bridging the Global Divide in Sentiment Analysis","date":"2023-06-03","arxiv_id":"2306.02213","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generating-high-quality-emotion-arcs-for-low#ran","syntology_url":"https://syntology.ai/paper/2306.02213","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02213"}},"official":{"repos":["dteodore/emotionarcs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/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/self-consistency-improves-chain-of-thought","slug":"self-consistency-improves-chain-of-thought","title":"Self-Consistency Improves Chain of Thought Reasoning in Language Models","date":"2022-03-21","arxiv_id":"2203.11171","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"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 1 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; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/self-consistency-improves-chain-of-thought#ran","syntology_url":"https://syntology.ai/paper/2203.11171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.11171"}},"official":null}},{"url":"/paper/designing-effective-sparse-expert-models","slug":"designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","arxiv_id":"2202.08906","repositories_listed":3,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/designing-effective-sparse-expert-models#ran","syntology_url":"https://syntology.ai/paper/2202.08906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08906"}},"official":{"repos":["tensorflow/mesh"],"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/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/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/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/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/efficient-second-order-treecrf-for-neural","slug":"efficient-second-order-treecrf-for-neural","title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","date":"2020-05-03","arxiv_id":"2005.00975","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-second-order-treecrf-for-neural#ran","syntology_url":"https://syntology.ai/paper/2005.00975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00975"}},"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-measure-of-intelligence","slug":"the-measure-of-intelligence","title":"On the Measure of Intelligence","date":"2019-11-05","arxiv_id":"1911.01547","repositories_listed":6,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/the-measure-of-intelligence#ran","syntology_url":"https://syntology.ai/paper/1911.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.01547"}},"official":{"repos":["fchollet/ARC"],"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/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"]}}}],"record_sha256":"6f6b7d4ff63d9606ad2f88109cb9c73267bb99f46a87f4c4001c02712dd9c6f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}