{"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/chunking/papers/ran/1","list_of":"/task/chunking","task":"Chunking","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,26],"of":26,"counts":{"archive_papers_tagged":447,"with_a_code_link":120,"where_syntology_ran_a_sample":26,"not_listed_spam_title":0,"listed":447,"listed_where_code_ran":26,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":21,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":21,"listed_every_run_a_failure_of_syntologys_instrument":5,"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/chunking/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/real-time-execution-of-action-chunking-flow","slug":"real-time-execution-of-action-chunking-flow","title":"Real-Time Execution of Action Chunking Flow Policies","date":"2025-06-09","arxiv_id":"2506.07339","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/real-time-execution-of-action-chunking-flow#ran","syntology_url":"https://syntology.ai/paper/2506.07339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.07339"}},"official":{"repos":["Physical-Intelligence/real-time-chunking-kinetix"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-chunking-and-selection-for-reading","slug":"dynamic-chunking-and-selection-for-reading","title":"Dynamic Chunking and Selection for Reading Comprehension of Ultra-Long Context in Large Language Models","date":"2025-06-01","arxiv_id":"2506.00773","repositories_listed":1,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":1,"n_instrument":8,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"9 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; 8 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/dynamic-chunking-and-selection-for-reading#ran","syntology_url":"https://syntology.ai/paper/2506.00773","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.00773"}},"official":{"repos":["ecnu-text-computing/dcs"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fine-tuning-vision-language-action-models","slug":"fine-tuning-vision-language-action-models","title":"Fine-Tuning Vision-Language-Action Models: Optimizing Speed and Success","date":"2025-02-27","arxiv_id":"2502.19645","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-vision-language-action-models#ran","syntology_url":"https://syntology.ai/paper/2502.19645","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.19645"}},"official":null}},{"url":"/paper/longrag-a-dual-perspective-retrieval","slug":"longrag-a-dual-perspective-retrieval","title":"LongRAG: A Dual-Perspective Retrieval-Augmented Generation Paradigm for Long-Context Question Answering","date":"2024-10-23","arxiv_id":"2410.18050","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/longrag-a-dual-perspective-retrieval#ran","syntology_url":"https://syntology.ai/paper/2410.18050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18050"}},"official":{"repos":["qingfei1/longrag"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-chunking-learning-efficient-text","slug":"meta-chunking-learning-efficient-text","title":"Meta-Chunking: Learning Text Segmentation and Semantic Completion via Logical Perception","date":"2024-10-16","arxiv_id":"2410.12788","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/meta-chunking-learning-efficient-text#ran","syntology_url":"https://syntology.ai/paper/2410.12788","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12788"}},"official":{"repos":["IAAR-Shanghai/Meta-Chunking"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/liger-kernel-efficient-triton-kernels-for-llm","slug":"liger-kernel-efficient-triton-kernels-for-llm","title":"Liger Kernel: Efficient Triton Kernels for LLM Training","date":"2024-10-14","arxiv_id":"2410.10989","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/liger-kernel-efficient-triton-kernels-for-llm#ran","syntology_url":"https://syntology.ai/paper/2410.10989","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10989"}},"official":{"repos":["linkedin/liger-kernel"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/autoregressive-action-sequence-learning-for","slug":"autoregressive-action-sequence-learning-for","title":"Autoregressive Action Sequence Learning for Robotic Manipulation","date":"2024-10-04","arxiv_id":"2410.03132","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/autoregressive-action-sequence-learning-for#ran","syntology_url":"https://syntology.ai/paper/2410.03132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.03132"}},"official":{"repos":["mlzxy/arp"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bidirectional-decoding-improving-action","slug":"bidirectional-decoding-improving-action","title":"Bidirectional Decoding: Improving Action Chunking via Guided Test-Time Sampling","date":"2024-08-30","arxiv_id":"2408.17355","repositories_listed":2,"syntology":{"n":14,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/bidirectional-decoding-improving-action#ran","syntology_url":"https://syntology.ai/paper/2408.17355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.17355"}},"official":{"repos":["YuejiangLIU/bid_diffusion","jubayer-hamid/bid_lerobot"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/medical-graph-rag-towards-safe-medical-large","slug":"medical-graph-rag-towards-safe-medical-large","title":"Medical Graph RAG: Towards Safe Medical Large Language Model via Graph Retrieval-Augmented Generation","date":"2024-08-08","arxiv_id":"2408.04187","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/medical-graph-rag-towards-safe-medical-large#ran","syntology_url":"https://syntology.ai/paper/2408.04187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.04187"}},"official":{"repos":["medicinetoken/medical-graph-rag"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lumberchunker-long-form-narrative-document","slug":"lumberchunker-long-form-narrative-document","title":"LumberChunker: Long-Form Narrative Document Segmentation","date":"2024-06-25","arxiv_id":"2406.17526","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lumberchunker-long-form-narrative-document#ran","syntology_url":"https://syntology.ai/paper/2406.17526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17526"}},"official":{"repos":["joaodsmarques/lumberchunker"],"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/sequence-compression-speeds-up-credit","slug":"sequence-compression-speeds-up-credit","title":"Sequence Compression Speeds Up Credit Assignment in Reinforcement Learning","date":"2024-05-06","arxiv_id":"2405.03878","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sequence-compression-speeds-up-credit#ran","syntology_url":"https://syntology.ai/paper/2405.03878","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.03878"}},"official":{"repos":["aditya-ramesh-10/chunktd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-accurate-factual-inconsistency","slug":"fast-and-accurate-factual-inconsistency","title":"Fast and Accurate Factual Inconsistency Detection Over Long Documents","date":"2023-10-19","arxiv_id":"2310.13189","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"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) · 7 unverified","sample_list":"/paper/fast-and-accurate-factual-inconsistency#ran","syntology_url":"https://syntology.ai/paper/2310.13189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13189"}},"official":{"repos":["asappresearch/scale-score"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/chunking-forgetting-matters-in-continual","slug":"chunking-forgetting-matters-in-continual","title":"Chunking: Continual Learning is not just about Distribution Shift","date":"2023-10-03","arxiv_id":"2310.02206","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"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) · 0 unverified","sample_list":"/paper/chunking-forgetting-matters-in-continual#ran","syntology_url":"https://syntology.ai/paper/2310.02206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02206"}},"official":{"repos":["tlee43/chunking-setting"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sparse-modular-activation-for-efficient-1","slug":"sparse-modular-activation-for-efficient-1","title":"Sparse Modular Activation for Efficient Sequence Modeling","date":"2023-06-19","arxiv_id":"2306.11197","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":2,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/sparse-modular-activation-for-efficient-1#ran","syntology_url":"https://syntology.ai/paper/2306.11197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11197"}},"official":{"repos":["renll/seqboat"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/recurrent-attention-networks-for-long-text","slug":"recurrent-attention-networks-for-long-text","title":"Recurrent Attention Networks for Long-text Modeling","date":"2023-06-12","arxiv_id":"2306.06843","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/recurrent-attention-networks-for-long-text#ran","syntology_url":"https://syntology.ai/paper/2306.06843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.06843"}},"official":{"repos":["4ai/ran"],"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/chordmixer-a-scalable-neural-attention-model","slug":"chordmixer-a-scalable-neural-attention-model","title":"ChordMixer: A Scalable Neural Attention Model for Sequences with Different Lengths","date":"2022-06-12","arxiv_id":"2206.05852","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":0,"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/chordmixer-a-scalable-neural-attention-model#ran","syntology_url":"https://syntology.ai/paper/2206.05852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05852"}},"official":{"repos":["ruslankhalitov/chordmixer"],"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/netket-3-machine-learning-toolbox-for-many","slug":"netket-3-machine-learning-toolbox-for-many","title":"NetKet 3: Machine Learning Toolbox for Many-Body Quantum Systems","date":"2021-12-20","arxiv_id":"2112.10526","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":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) · 2 unverified","sample_list":"/paper/netket-3-machine-learning-toolbox-for-many#ran","syntology_url":"https://syntology.ai/paper/2112.10526","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.10526"}},"official":{"repos":["netket/netket"],"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/evaluating-relaxations-of-logic-for-neural","slug":"evaluating-relaxations-of-logic-for-neural","title":"Evaluating Relaxations of Logic for Neural Networks: A Comprehensive Study","date":"2021-07-28","arxiv_id":"2107.13646","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-relaxations-of-logic-for-neural#ran","syntology_url":"https://syntology.ai/paper/2107.13646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13646"}},"official":{"repos":["utahnlp/neural-logic"],"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/weighted-training-for-cross-task-learning","slug":"weighted-training-for-cross-task-learning","title":"Weighted Training for Cross-Task Learning","date":"2021-05-28","arxiv_id":"2105.14095","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/weighted-training-for-cross-task-learning#ran","syntology_url":"https://syntology.ai/paper/2105.14095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14095"}},"official":{"repos":["HornHehhf/TAWT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-named-entity-recognition-by","slug":"improving-named-entity-recognition-by","title":"Improving Named Entity Recognition by External Context Retrieving and Cooperative Learning","date":"2021-05-08","arxiv_id":"2105.03654","repositories_listed":3,"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/improving-named-entity-recognition-by#ran","syntology_url":"https://syntology.ai/paper/2105.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03654"}},"official":{"repos":["modelscope/adaseq"],"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/neural-sequence-segmentation-as-determining","slug":"neural-sequence-segmentation-as-determining","title":"Neural Sequence Segmentation as Determining the Leftmost Segments","date":"2021-04-15","arxiv_id":"2104.07217","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-sequence-segmentation-as-determining#ran","syntology_url":"https://syntology.ai/paper/2104.07217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07217"}},"official":{"repos":["LeePleased/LeftmostSeg"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-and-accurate-sequence-labeling-with","slug":"fast-and-accurate-sequence-labeling-with","title":"AIN: Fast and Accurate Sequence Labeling with Approximate Inference Network","date":"2020-09-17","arxiv_id":"2009.08229","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":1,"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/fast-and-accurate-sequence-labeling-with#ran","syntology_url":"https://syntology.ai/paper/2009.08229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08229"}},"official":{"repos":["Alibaba-NLP/AIN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/augmenting-neural-networks-with-first-order","slug":"augmenting-neural-networks-with-first-order","title":"Augmenting Neural Networks with First-order Logic","date":"2019-06-14","arxiv_id":"1906.06298","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/augmenting-neural-networks-with-first-order#ran","syntology_url":"https://syntology.ai/paper/1906.06298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06298"}},"official":{"repos":["utahnlp/layer_augmentation"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/ncrf-an-open-source-neural-sequence-labeling","slug":"ncrf-an-open-source-neural-sequence-labeling","title":"NCRF++: An Open-source Neural Sequence Labeling Toolkit","date":"2018-06-14","arxiv_id":"1806.05626","repositories_listed":3,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ncrf-an-open-source-neural-sequence-labeling#ran","syntology_url":"https://syntology.ai/paper/1806.05626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05626"}},"official":{"repos":["jiesutd/NCRFpp"],"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/a-joint-many-task-model-growing-a-neural","slug":"a-joint-many-task-model-growing-a-neural","title":"A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks","date":"2016-11-05","arxiv_id":"1611.01587","repositories_listed":2,"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/a-joint-many-task-model-growing-a-neural#ran","syntology_url":"https://syntology.ai/paper/1611.01587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01587"}},"official":{"repos":["hassyGo/charNgram2vec"],"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/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","repositories_listed":25,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/bidirectional-lstm-crf-models-for-sequence#ran","syntology_url":"https://syntology.ai/paper/1508.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01991"}},"official":null}}],"record_sha256":"66bed0617b5806870275aedb3371936b45b2b7621d30e31af4c1ed03699f022d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}