{"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":"/paper/from-lsat-the-progress-and-challenges-of","title":"From LSAT: The Progress and Challenges of Complex Reasoning","arxiv_id":"2108.00648","date":"2021-08-02","proceeding":null,"authors":["Siyuan Wang","Zhongkun Liu","Wanjun Zhong","Ming Zhou","Zhongyu Wei","Zhumin Chen","Nan Duan"],"abstract":"Complex reasoning aims to draw a correct inference based on complex rules. As a hallmark of human intelligence, it involves a degree of explicit reading comprehension, interpretation of logical knowledge and complex rule application. In this paper, we take a step forward in complex reasoning by systematically studying the three challenging and domain-general tasks of the Law School Admission Test (LSAT), including analytical reasoning, logical reasoning and reading comprehension. We propose a hybrid reasoning system to integrate these three tasks and achieve impressive overall performance on the LSAT tests. The experimental results demonstrate that our system endows itself a certain complex reasoning ability, especially the fundamental reading comprehension and challenging logical reasoning capacities. Further analysis also shows the effectiveness of combining the pre-trained models with the task-specific reasoning module, and integrating symbolic knowledge into discrete interpretable reasoning steps in complex reasoning. We further shed a light on the potential future directions, like unsupervised symbolic knowledge extraction, model interpretability, few-shot learning and comprehensive benchmark for complex reasoning.","url_abs":"https://arxiv.org/abs/2108.00648v1","url_pdf":"https://arxiv.org/pdf/2108.00648v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"from-lsat-the-progress-and-challenges-of","repo_url":"https://github.com/zhongwanjun/AR-LSAT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"logical-reasoning","task_name":"Logical Reasoning"},{"task_slug":"reading-comprehension","task_name":"Reading Comprehension"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2108.00648","atlas_url":"https://app.syntology.ai/?focus=2108.00648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.00648"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.00648"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.00648"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.00648\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2108.00648"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2108.00648\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2108.00648"},"call":"get_concepts_for_paper(arxiv_id=\"2108.00648\")"}],"by_repo":[{"repo":"zhongwanjun/AR-LSAT","kind":"listed","samples":11,"ran":7,"instrument":0,"unverified":4}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2108.00648.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2108.00648.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zhongwanjun/AR-LSAT","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":7,"unverified":4},"n_samples":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"listed":{"samples":11,"ran":7,"n_ran_checked":7,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":1,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":1,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":7,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-25","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"2771f46777734384","code_sha256_prefix":"2771f46777734384","entry":"clean_doc","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/data_analysis/extract_cp_ner_dp_results.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/data_analysis/extract_cp_ner_dp_results.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"doc:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2771f46777734384"},"code_page":"/code/clean-doc","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2771f46777734384"}},{"code_sha256":"2ee6204e8f1548f9","code_sha256_prefix":"2ee6204e8f1548f9","entry":"clean_string","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"LSTM/utils_multiple_choice.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/LSTM/utils_multiple_choice.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"string:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","retrieve_with":{"tool":"get_code","code_sha256":"2ee6204e8f1548f9"},"code_page":"/code/clean-string","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"2ee6204e8f1548f9"}},{"code_sha256":"92ca0309c5197304","code_sha256_prefix":"92ca0309c5197304","entry":"convert_examples_to_features","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"LSTM/utils_multiple_choice.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/LSTM/utils_multiple_choice.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"examples:list/1/InputExample, label_list:list/1/str, max_length:int/0/int, text_field:MockTextField/0/?","fixture_out_type":"list","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","code_page":"/code/convert-examples-to-features","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"92ca0309c5197304"}},{"code_sha256":"3d29d2111932953c","code_sha256_prefix":"3d29d2111932953c","entry":"extract_program","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/extract_program_argument.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/extract_program_argument.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"info:dict/0/?","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:24:49.973517+00:00","code_page":"/code/extract-program","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3d29d2111932953c"}},{"code_sha256":"9d60ecb44ac0bbd6","code_sha256_prefix":"9d60ecb44ac0bbd6","entry":"find_nearest_ent","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/answer_question_by_tree.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/answer_question_by_tree.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"kws:list/1/str, question:str/0/str, rows:list/1/str, columns:list/1/str","fixture_out_type":"str","level_recorded_at":"2026-09-26T01:55:17.694675+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9d60ecb44ac0bbd6"}},{"code_sha256":"0316409042f52cb7","code_sha256_prefix":"0316409042f52cb7","entry":"find_wspan","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/extract_program_argument.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/extract_program_argument.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"text:str/0/str, tokens:list/1/str, cspan:tuple/1/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-25T23:53:12.863503+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0316409042f52cb7"}},{"code_sha256":"e6cacdf17fcf2a13","code_sha256_prefix":"e6cacdf17fcf2a13","entry":"rewrite","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/modify_option.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/modify_option.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"parts:list/1/str, rewrite_list:list/1/str","fixture_out_type":"list","level_recorded_at":"2026-09-26T01:55:17.694675+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e6cacdf17fcf2a13"}},{"code_sha256":"305cce488c60e19d","code_sha256_prefix":"305cce488c60e19d","entry":"choose_question_type","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/answer_question_by_tree.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/answer_question_by_tree.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"305cce488c60e19d"}},{"code_sha256":"5532594d3fb0fa71","code_sha256_prefix":"5532594d3fb0fa71","entry":"same","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"ARM/pipeline/extract_program_argument.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/ARM/pipeline/extract_program_argument.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5532594d3fb0fa71"}},{"code_sha256":"0a546b305d274996","code_sha256_prefix":"0a546b305d274996","entry":"select_field","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"LSTM/main_large.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/LSTM/main_large.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/select-field","census":null,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from yuweihao/reclor, and GitHub detected no licence in that repository when it was checked","mcp_get_code":{"code_sha256":"0a546b305d274996"}},{"code_sha256":"3c241ecfe3749a6d","code_sha256_prefix":"3c241ecfe3749a6d","entry":"simple_accuracy","repo":"zhongwanjun/AR-LSAT","repo_kind":"listed","path":"LSTM/main_large.py","file_url":"https://github.com/zhongwanjun/AR-LSAT/blob/HEAD/LSTM/main_large.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/simple-accuracy","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3c241ecfe3749a6d"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"674134f03a952950718ad9e7d5742c52fad5348980edad0ecb01bf30d599d217","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}