{"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/scheduling","name":"Scheduling","slug":"scheduling","description_markdown":"Project or Job Scheduling","categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":3104,"papers_with_code":574,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/llmafia","name":"LLMafia","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":32,"rows_per_page":100,"shown":100,"of":3104,"of_with_code":574,"tagged_in_all":3104,"counts":{"archive_papers_tagged":3104,"with_a_code_link":574,"where_syntology_ran_a_sample":107,"not_listed_spam_title":0,"listed":3104,"listed_where_code_ran":107,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":93,"every_run_a_failure_of_syntologys_instrument":14,"listed_with_a_run_with_no_instrument_failure":93,"listed_every_run_a_failure_of_syntologys_instrument":14,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/endonet-a-deep-architecture-for-recognition","slug":"endonet-a-deep-architecture-for-recognition","title":"EndoNet: A Deep Architecture for Recognition Tasks on Laparoscopic Videos","date":"2016-02-09","arxiv_id":"1602.03012","repositories_listed":9,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/endonet-a-deep-architecture-for-recognition#ran","syntology_url":"https://syntology.ai/paper/1602.03012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.03012"}},"official":null}},{"url":"/paper/stochastic-gradient-descent-with-hyperbolic","slug":"stochastic-gradient-descent-with-hyperbolic","title":"Stochastic Gradient Descent with Hyperbolic-Tangent Decay on Classification","date":"2018-06-05","arxiv_id":"1806.01593","repositories_listed":5,"syntology":null},{"url":"/paper/openrlhf-an-easy-to-use-scalable-and-high","slug":"openrlhf-an-easy-to-use-scalable-and-high","title":"OpenRLHF: An Easy-to-use, Scalable and High-performance RLHF Framework","date":"2024-05-20","arxiv_id":"2405.11143","repositories_listed":4,"syntology":null},{"url":"/paper/a-reinforcement-learning-environment-for-job","slug":"a-reinforcement-learning-environment-for-job","title":"A Reinforcement Learning Environment For Job-Shop Scheduling","date":"2021-04-08","arxiv_id":"2104.03760","repositories_listed":4,"syntology":null},{"url":"/paper/learning-to-dispatch-for-job-shop-scheduling","slug":"learning-to-dispatch-for-job-shop-scheduling","title":"Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning","date":"2020-10-23","arxiv_id":"2010.12367","repositories_listed":4,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-to-dispatch-for-job-shop-scheduling#ran","syntology_url":"https://syntology.ai/paper/2010.12367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12367"}},"official":{"repos":["zcajiayin/L2D"],"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/das3h-modeling-student-learning-and","slug":"das3h-modeling-student-learning-and","title":"DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Skills","date":"2019-05-14","arxiv_id":"1905.06873","repositories_listed":4,"syntology":{"n":22,"n_ran":15,"n_constructed":0,"n_ran_checked":13,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":2,"n_no_contract":10,"n_pointer_only":10,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 2 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/das3h-modeling-student-learning-and#ran","syntology_url":"https://syntology.ai/paper/1905.06873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.06873"}},"official":{"repos":["BenoitChoffin/das3h"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"url":"/paper/eccos-efficient-capability-and-cost","slug":"eccos-efficient-capability-and-cost","title":"OmniRouter: Budget and Performance Controllable Multi-LLM Routing","date":"2025-02-27","arxiv_id":"2502.20576","repositories_listed":3,"syntology":null},{"url":"/paper/chat-ai-a-seamless-slurm-native-solution-for","slug":"chat-ai-a-seamless-slurm-native-solution-for","title":"Chat AI: A Seamless Slurm-Native Solution for HPC-Based Services","date":"2024-06-27","arxiv_id":"2407.00110","repositories_listed":3,"syntology":null},{"url":"/paper/mlink-linking-black-box-models-from-multiple","slug":"mlink-linking-black-box-models-from-multiple","title":"MLink: Linking Black-Box Models from Multiple Domains for Collaborative Inference","date":"2022-09-28","arxiv_id":"2209.13883","repositories_listed":3,"syntology":null},{"url":"/paper/bftrainer-low-cost-training-of-neural","slug":"bftrainer-low-cost-training-of-neural","title":"BFTrainer: Low-Cost Training of Neural Networks on Unfillable Supercomputer Nodes","date":"2021-06-22","arxiv_id":"2106.12091","repositories_listed":3,"syntology":null},{"url":"/paper/cpp-taskflow-a-general-purpose-parallel-and","slug":"cpp-taskflow-a-general-purpose-parallel-and","title":"Taskflow: A Lightweight Parallel and Heterogeneous Task Graph Computing System","date":"2020-04-23","arxiv_id":"2004.10908","repositories_listed":3,"syntology":null},{"url":"/paper/tiramisu-a-polyhedral-compiler-for-expressing","slug":"tiramisu-a-polyhedral-compiler-for-expressing","title":"Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code","date":"2018-04-27","arxiv_id":"1804.10694","repositories_listed":3,"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/tiramisu-a-polyhedral-compiler-for-expressing#ran","syntology_url":"https://syntology.ai/paper/1804.10694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.10694"}},"official":null}},{"url":"/paper/key-value-retrieval-networks-for-task","slug":"key-value-retrieval-networks-for-task","title":"Key-Value Retrieval Networks for Task-Oriented Dialogue","date":"2017-05-15","arxiv_id":"1705.05414","repositories_listed":3,"syntology":null},{"url":"/paper/reinforcement-learning-through-asynchronous","slug":"reinforcement-learning-through-asynchronous","title":"Reinforcement Learning through Asynchronous Advantage Actor-Critic on a GPU","date":"2016-11-18","arxiv_id":"1611.06256","repositories_listed":3,"syntology":null},{"url":"/paper/flashdmoe-fast-distributed-moe-in-a-single","slug":"flashdmoe-fast-distributed-moe-in-a-single","title":"FlashDMoE: Fast Distributed MoE in a Single Kernel","date":"2025-06-05","arxiv_id":"2506.04667","repositories_listed":2,"syntology":{"n":7,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 2 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) · 4 unverified","sample_list":"/paper/flashdmoe-fast-distributed-moe-in-a-single#ran","syntology_url":"https://syntology.ai/paper/2506.04667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.04667"}},"official":{"repos":["osayamenja/aristos","osayamenja/kleos"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-redundancy-in-diffusion","slug":"unveiling-redundancy-in-diffusion","title":"Unveiling Redundancy in Diffusion Transformers (DiTs): A Systematic Study","date":"2024-11-18","arxiv_id":"2411.13588","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-redundancy-in-diffusion#ran","syntology_url":"https://syntology.ai/paper/2411.13588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.13588"}},"official":{"repos":["xdit-project/ditcacheanalysis"],"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/one-step-diffusion-via-shortcut-models","slug":"one-step-diffusion-via-shortcut-models","title":"One Step Diffusion via Shortcut Models","date":"2024-10-16","arxiv_id":"2410.12557","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/one-step-diffusion-via-shortcut-models#ran","syntology_url":"https://syntology.ai/paper/2410.12557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.12557"}},"official":{"repos":["kvfrans/shortcut-models"],"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":["listed","official"]}}},{"url":"/paper/agent-oriented-planning-in-multi-agent","slug":"agent-oriented-planning-in-multi-agent","title":"Agent-Oriented Planning in Multi-Agent Systems","date":"2024-10-03","arxiv_id":"2410.02189","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":1,"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, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/agent-oriented-planning-in-multi-agent#ran","syntology_url":"https://syntology.ai/paper/2410.02189","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02189"}},"official":{"repos":["lalaliat/agent-oriented-planning"],"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/planning-in-strawberry-fields-evaluating-and","slug":"planning-in-strawberry-fields-evaluating-and","title":"Planning in Strawberry Fields: Evaluating and Improving the Planning and Scheduling Capabilities of LRM o1","date":"2024-10-03","arxiv_id":"2410.02162","repositories_listed":2,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/planning-in-strawberry-fields-evaluating-and#ran","syntology_url":"https://syntology.ai/paper/2410.02162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02162"}},"official":null}},{"url":"/paper/parco-learning-parallel-autoregressive","slug":"parco-learning-parallel-autoregressive","title":"Parallel AutoRegressive Models for Multi-Agent Combinatorial Optimization","date":"2024-09-05","arxiv_id":"2409.03811","repositories_listed":2,"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/parco-learning-parallel-autoregressive#ran","syntology_url":"https://syntology.ai/paper/2409.03811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.03811"}},"official":{"repos":["ai4co/parco"],"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/marlin-mixed-precision-auto-regressive","slug":"marlin-mixed-precision-auto-regressive","title":"MARLIN: Mixed-Precision Auto-Regressive Parallel Inference on Large Language Models","date":"2024-08-21","arxiv_id":"2408.11743","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/marlin-mixed-precision-auto-regressive#ran","syntology_url":"https://syntology.ai/paper/2408.11743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.11743"}},"official":{"repos":["ist-daslab/marlin","ist-daslab/sparse-marlin"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rationalising-data-collection-for-building","slug":"rationalising-data-collection-for-building","title":"Rationalising data collection for supporting decision making in building energy systems using Value of Information analysis","date":"2024-08-19","arxiv_id":"2409.00049","repositories_listed":2,"syntology":null},{"url":"/paper/the-road-less-scheduled","slug":"the-road-less-scheduled","title":"The Road Less Scheduled","date":"2024-05-24","arxiv_id":"2405.15682","repositories_listed":2,"syntology":null},{"url":"/paper/flagvne-a-flexible-and-generalizable","slug":"flagvne-a-flexible-and-generalizable","title":"FlagVNE: A Flexible and Generalizable Reinforcement Learning Framework for Network Resource Allocation","date":"2024-04-19","arxiv_id":"2404.12633","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/flagvne-a-flexible-and-generalizable#ran","syntology_url":"https://syntology.ai/paper/2404.12633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12633"}},"official":{"repos":["GeminiLight/flag-vne"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/llm-agent-operating-system","slug":"llm-agent-operating-system","title":"AIOS: LLM Agent Operating System","date":"2024-03-25","arxiv_id":"2403.16971","repositories_listed":2,"syntology":null},{"url":"/paper/fairness-in-serving-large-language-models","slug":"fairness-in-serving-large-language-models","title":"Fairness in Serving Large Language Models","date":"2023-12-31","arxiv_id":"2401.00588","repositories_listed":2,"syntology":{"n":13,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"9 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; 6 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fairness-in-serving-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2401.00588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.00588"}},"official":{"repos":["ying1123/vtc-artifact"],"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":["listed","official"]}}},{"url":"/paper/aspen-high-throughput-lora-fine-tuning-of","slug":"aspen-high-throughput-lora-fine-tuning-of","title":"mLoRA: Fine-Tuning LoRA Adapters via Highly-Efficient Pipeline Parallelism in Multiple GPUs","date":"2023-12-05","arxiv_id":"2312.02515","repositories_listed":2,"syntology":null},{"url":"/paper/opuscleaner-and-opustrainer-open-source","slug":"opuscleaner-and-opustrainer-open-source","title":"OpusCleaner and OpusTrainer, open source toolkits for training Machine Translation and Large language models","date":"2023-11-24","arxiv_id":"2311.14838","repositories_listed":2,"syntology":null},{"url":"/paper/dynapipe-optimizing-multi-task-training","slug":"dynapipe-optimizing-multi-task-training","title":"DynaPipe: Optimizing Multi-task Training through Dynamic Pipelines","date":"2023-11-17","arxiv_id":"2311.10418","repositories_listed":2,"syntology":null},{"url":"/paper/game-based-platforms-for-artificial","slug":"game-based-platforms-for-artificial","title":"Games for Artificial Intelligence Research: A Review and Perspectives","date":"2023-04-26","arxiv_id":"2304.13269","repositories_listed":2,"syntology":null},{"url":"/paper/harflow3d-a-latency-oriented-3d-cnn","slug":"harflow3d-a-latency-oriented-3d-cnn","title":"HARFLOW3D: A Latency-Oriented 3D-CNN Accelerator Toolflow for HAR on FPGA Devices","date":"2023-03-30","arxiv_id":"2303.17218","repositories_listed":2,"syntology":null},{"url":"/paper/rmmdet-road-side-multitype-and-multigroup","slug":"rmmdet-road-side-multitype-and-multigroup","title":"RMMDet: Road-Side Multitype and Multigroup Sensor Detection System for Autonomous Driving","date":"2023-03-09","arxiv_id":"2303.05203","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/rmmdet-road-side-multitype-and-multigroup#ran","syntology_url":"https://syntology.ai/paper/2303.05203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.05203"}},"official":{"repos":["OrangeSodahub/CRLFnet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-operators-for-bypassing-gain-and","slug":"neural-operators-for-bypassing-gain-and","title":"Neural Operators for Bypassing Gain and Control Computations in PDE Backstepping","date":"2023-02-28","arxiv_id":"2302.14265","repositories_listed":2,"syntology":null},{"url":"/paper/on-the-importance-of-noise-scheduling-for","slug":"on-the-importance-of-noise-scheduling-for","title":"On the Importance of Noise Scheduling for Diffusion Models","date":"2023-01-26","arxiv_id":"2301.10972","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-importance-of-noise-scheduling-for#ran","syntology_url":"https://syntology.ai/paper/2301.10972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.10972"}},"official":null}},{"url":"/paper/packing-privacy-budget-efficiently","slug":"packing-privacy-budget-efficiently","title":"DPack: Efficiency-Oriented Privacy Budget Scheduling","date":"2022-12-26","arxiv_id":"2212.13228","repositories_listed":2,"syntology":null},{"url":"/paper/routenet-fermi-network-modeling-with-graph","slug":"routenet-fermi-network-modeling-with-graph","title":"RouteNet-Fermi: Network Modeling with Graph Neural Networks","date":"2022-12-22","arxiv_id":"2212.12070","repositories_listed":2,"syntology":null},{"url":"/paper/evosax-jax-based-evolution-strategies","slug":"evosax-jax-based-evolution-strategies","title":"evosax: JAX-based Evolution Strategies","date":"2022-12-08","arxiv_id":"2212.04180","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":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/evosax-jax-based-evolution-strategies#ran","syntology_url":"https://syntology.ai/paper/2212.04180","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.04180"}},"official":{"repos":["roberttlange/evosax","adaptive-intelligent-robotics/qdax"],"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/hidet-task-mapping-programming-paradigm-for","slug":"hidet-task-mapping-programming-paradigm-for","title":"Hidet: Task-Mapping Programming Paradigm for Deep Learning Tensor Programs","date":"2022-10-18","arxiv_id":"2210.09603","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/hidet-task-mapping-programming-paradigm-for#ran","syntology_url":"https://syntology.ai/paper/2210.09603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09603"}},"official":{"repos":["hidet-org/hidet","yaoyaoding/hidet-artifacts"],"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/latency-aware-spatial-wise-dynamic-networks","slug":"latency-aware-spatial-wise-dynamic-networks","title":"Latency-aware Spatial-wise Dynamic Networks","date":"2022-10-12","arxiv_id":"2210.06223","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":2,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/latency-aware-spatial-wise-dynamic-networks#ran","syntology_url":"https://syntology.ai/paper/2210.06223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06223"}},"official":{"repos":["leaplabthu/lasnet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/human-in-the-loop-large-scale-predictive","slug":"human-in-the-loop-large-scale-predictive","title":"Human-in-the-Loop Large-Scale Predictive Maintenance of Workstations","date":"2022-06-23","arxiv_id":"2206.11574","repositories_listed":2,"syntology":null},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"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":["listed","official"]}}},{"url":"/paper/gradvit-gradient-inversion-of-vision","slug":"gradvit-gradient-inversion-of-vision","title":"GradViT: Gradient Inversion of Vision Transformers","date":"2022-03-22","arxiv_id":"2203.11894","repositories_listed":2,"syntology":null},{"url":"/paper/vmagent-scheduling-simulator-for","slug":"vmagent-scheduling-simulator-for","title":"VMAgent: Scheduling Simulator for Reinforcement Learning","date":"2021-12-09","arxiv_id":"2112.04785","repositories_listed":2,"syntology":null},{"url":"/paper/privacy-budget-scheduling","slug":"privacy-budget-scheduling","title":"Privacy Budget Scheduling","date":"2021-06-29","arxiv_id":"2106.15335","repositories_listed":2,"syntology":null},{"url":"/paper/deep-generative-modeling-for-probabilistic","slug":"deep-generative-modeling-for-probabilistic","title":"A deep generative model for probabilistic energy forecasting in power systems: normalizing flows","date":"2021-06-17","arxiv_id":"2106.09370","repositories_listed":2,"syntology":null},{"url":"/paper/exploring-search-space-trees-using-an-adapted","slug":"exploring-search-space-trees-using-an-adapted","title":"Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems","date":"2020-10-22","arxiv_id":"2010.11523","repositories_listed":2,"syntology":null},{"url":"/paper/difftune-optimizing-cpu-simulator-parameters","slug":"difftune-optimizing-cpu-simulator-parameters","title":"DiffTune: Optimizing CPU Simulator Parameters with Learned Differentiable Surrogates","date":"2020-10-08","arxiv_id":"2010.04017","repositories_listed":2,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/difftune-optimizing-cpu-simulator-parameters#ran","syntology_url":"https://syntology.ai/paper/2010.04017","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.04017"}},"official":{"repos":["ithemal/DiffTune"],"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/cross-entropy-method-variants-for","slug":"cross-entropy-method-variants-for","title":"Cross-Entropy Method Variants for Optimization","date":"2020-09-18","arxiv_id":"2009.09043","repositories_listed":2,"syntology":null},{"url":"/paper/pollux-co-adaptive-cluster-scheduling-for","slug":"pollux-co-adaptive-cluster-scheduling-for","title":"Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learning","date":"2020-08-27","arxiv_id":"2008.12260","repositories_listed":2,"syntology":null},{"url":"/paper/learn-to-use-future-information-in","slug":"learn-to-use-future-information-in","title":"Temporally Correlated Task Scheduling for Sequence Learning","date":"2020-07-10","arxiv_id":"2007.05290","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/learn-to-use-future-information-in#ran","syntology_url":"https://syntology.ai/paper/2007.05290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05290"}},"official":{"repos":["microsoft/qlib"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["named_in_paper"]}}},{"url":"/paper/adas-adaptive-scheduling-of-stochastic","slug":"adas-adaptive-scheduling-of-stochastic","title":"AdaS: Adaptive Scheduling of Stochastic Gradients","date":"2020-06-11","arxiv_id":"2006.06587","repositories_listed":2,"syntology":null},{"url":"/paper/coverage-probability-in-wireless-networks","slug":"coverage-probability-in-wireless-networks","title":"Coverage probability in wireless networks with determinantal scheduling","date":"2020-06-09","arxiv_id":"2006.05038","repositories_listed":2,"syntology":null},{"url":"/paper/fadnet-a-fast-and-accurate-network-for","slug":"fadnet-a-fast-and-accurate-network-for","title":"FADNet: A Fast and Accurate Network for Disparity Estimation","date":"2020-03-24","arxiv_id":"2003.10758","repositories_listed":2,"syntology":null},{"url":"/paper/suod-toward-scalable-unsupervised-outlier","slug":"suod-toward-scalable-unsupervised-outlier","title":"SUOD: Toward Scalable Unsupervised Outlier Detection","date":"2020-02-08","arxiv_id":"2002.03222","repositories_listed":2,"syntology":null},{"url":"/paper/neural-symbolic-descriptive-action-model-from","slug":"neural-symbolic-descriptive-action-model-from","title":"Neural-Symbolic Descriptive Action Model from Images: The Search for STRIPS","date":"2019-12-11","arxiv_id":"1912.05492","repositories_listed":2,"syntology":null},{"url":"/paper/dynamic-mini-batch-sgd-for-elastic","slug":"dynamic-mini-batch-sgd-for-elastic","title":"Dynamic Mini-batch SGD for Elastic Distributed Training: Learning in the Limbo of Resources","date":"2019-04-26","arxiv_id":"1904.12043","repositories_listed":2,"syntology":{"n":20,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":13,"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, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/dynamic-mini-batch-sgd-for-elastic#ran","syntology_url":"https://syntology.ai/paper/1904.12043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12043"}},"official":null}},{"url":"/paper/cyclical-annealing-schedule-a-simple-approach","slug":"cyclical-annealing-schedule-a-simple-approach","title":"Cyclical Annealing Schedule: A Simple Approach to Mitigating KL Vanishing","date":"2019-03-25","arxiv_id":"1903.10145","repositories_listed":2,"syntology":null},{"url":"/paper/online-planner-selection-with-graph-neural","slug":"online-planner-selection-with-graph-neural","title":"Online Planner Selection with Graph Neural Networks and Adaptive Scheduling","date":"2018-11-01","arxiv_id":"1811.00210","repositories_listed":2,"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":2,"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/online-planner-selection-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1811.00210","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.00210"}},"official":{"repos":["IBM/IPC-graph-data","matenure/GNN_planner"],"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/learning-scheduling-algorithms-for-data","slug":"learning-scheduling-algorithms-for-data","title":"Learning Scheduling Algorithms for Data Processing Clusters","date":"2018-10-03","arxiv_id":"1810.01963","repositories_listed":2,"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/learning-scheduling-algorithms-for-data#ran","syntology_url":"https://syntology.ai/paper/1810.01963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.01963"}},"official":{"repos":["hongzimao/decima-sim"],"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/boosting-binary-optimization-via-binary","slug":"boosting-binary-optimization-via-binary","title":"Boosting Binary Optimization via Binary Classification: A Case Study of Job Shop Scheduling","date":"2018-08-31","arxiv_id":"1808.10813","repositories_listed":2,"syntology":null},{"url":"/paper/learning-by-playing-solving-sparse-reward","slug":"learning-by-playing-solving-sparse-reward","title":"Learning by Playing - Solving Sparse Reward Tasks from Scratch","date":"2018-02-28","arxiv_id":"1802.10567","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-by-playing-solving-sparse-reward#ran","syntology_url":"https://syntology.ai/paper/1802.10567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.10567"}},"official":{"repos":["hu-po/pySACQ"],"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/pitfalls-and-best-practices-in-algorithm","slug":"pitfalls-and-best-practices-in-algorithm","title":"Pitfalls and Best Practices in Algorithm Configuration","date":"2017-05-17","arxiv_id":"1705.06058","repositories_listed":2,"syntology":null},{"url":"/paper/curriculum-dropout","slug":"curriculum-dropout","title":"Curriculum Dropout","date":"2017-03-18","arxiv_id":"1703.06229","repositories_listed":2,"syntology":null},{"url":"/paper/learning-gradient-descent-better","slug":"learning-gradient-descent-better","title":"Learning Gradient Descent: Better Generalization and Longer Horizons","date":"2017-03-10","arxiv_id":"1703.03633","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-gradient-descent-better#ran","syntology_url":"https://syntology.ai/paper/1703.03633","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.03633"}},"official":{"repos":["vfleaking/rnnprop"],"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/pvanet-deep-but-lightweight-neural-networks","slug":"pvanet-deep-but-lightweight-neural-networks","title":"PVANET: Deep but Lightweight Neural Networks for Real-time Object Detection","date":"2016-08-29","arxiv_id":"1608.08021","repositories_listed":2,"syntology":null},{"url":"/paper/optimal-sensor-scheduling-and-selection-for","slug":"optimal-sensor-scheduling-and-selection-for","title":"Optimal Sensor Scheduling and Selection for Continuous-Discrete Kalman Filtering with Auxiliary Dynamics","date":"2025-07-15","arxiv_id":"2507.11240","repositories_listed":1,"syntology":null},{"url":"/paper/systolicattention-fusing-flashattention","slug":"systolicattention-fusing-flashattention","title":"SystolicAttention: Fusing FlashAttention within a Single Systolic Array","date":"2025-07-15","arxiv_id":"2507.11331","repositories_listed":1,"syntology":null},{"url":"/paper/ann-based-grid-impedance-estimation-for","slug":"ann-based-grid-impedance-estimation-for","title":"ANN-Based Grid Impedance Estimation for Adaptive Gain Scheduling in VSG Under Dynamic Grid Conditions","date":"2025-06-29","arxiv_id":"2506.23304","repositories_listed":1,"syntology":null},{"url":"/paper/confucius3-math-a-lightweight-high","slug":"confucius3-math-a-lightweight-high","title":"Confucius3-Math: A Lightweight High-Performance Reasoning LLM for Chinese K-12 Mathematics Learning","date":"2025-06-23","arxiv_id":"2506.18330","repositories_listed":1,"syntology":null},{"url":"/paper/consumerbench-benchmarking-generative-ai","slug":"consumerbench-benchmarking-generative-ai","title":"ConsumerBench: Benchmarking Generative AI Applications on End-User Devices","date":"2025-06-21","arxiv_id":"2506.17538","repositories_listed":1,"syntology":null},{"url":"/paper/rapflow-tts-rapid-and-high-fidelity-text-to","slug":"rapflow-tts-rapid-and-high-fidelity-text-to","title":"RapFlow-TTS: Rapid and High-Fidelity Text-to-Speech with Improved Consistency Flow Matching","date":"2025-06-20","arxiv_id":"2506.16741","repositories_listed":1,"syntology":null},{"url":"/paper/all-is-not-lost-llm-recovery-without","slug":"all-is-not-lost-llm-recovery-without","title":"All is Not Lost: LLM Recovery without Checkpoints","date":"2025-06-18","arxiv_id":"2506.15461","repositories_listed":1,"syntology":null},{"url":"/paper/a-production-scheduling-framework-for","slug":"a-production-scheduling-framework-for","title":"A Production Scheduling Framework for Reinforcement Learning Under Real-World Constraints","date":"2025-06-16","arxiv_id":"2506.13566","repositories_listed":1,"syntology":null},{"url":"/paper/vine-copulas-as-differentiable-computational","slug":"vine-copulas-as-differentiable-computational","title":"Vine Copulas as Differentiable Computational Graphs","date":"2025-06-16","arxiv_id":"2506.13318","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-scheduling-for-llm-inference","slug":"semantic-scheduling-for-llm-inference","title":"Semantic Scheduling for LLM Inference","date":"2025-06-13","arxiv_id":"2506.12204","repositories_listed":1,"syntology":null},{"url":"/paper/agile-reinforcement-learning-for-real-time","slug":"agile-reinforcement-learning-for-real-time","title":"Agile Reinforcement Learning for Real-Time Task Scheduling in Edge Computing","date":"2025-06-10","arxiv_id":"2506.08850","repositories_listed":1,"syntology":null},{"url":"/paper/ale-bench-a-benchmark-for-long-horizon","slug":"ale-bench-a-benchmark-for-long-horizon","title":"ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering","date":"2025-06-10","arxiv_id":"2506.09050","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ale-bench-a-benchmark-for-long-horizon#ran","syntology_url":"https://syntology.ai/paper/2506.09050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.09050"}},"official":{"repos":["sakanaai/ale-bench"],"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/solving-the-job-shop-scheduling-problem-with-1","slug":"solving-the-job-shop-scheduling-problem-with-1","title":"Solving the Job Shop Scheduling Problem with Graph Neural Networks: A Customizable Reinforcement Learning Environment","date":"2025-06-10","arxiv_id":"2506.13781","repositories_listed":1,"syntology":null},{"url":"/paper/writing-rl-advancing-long-form-writing-via","slug":"writing-rl-advancing-long-form-writing-via","title":"Writing-RL: Advancing Long-form Writing via Adaptive Curriculum Reinforcement Learning","date":"2025-06-06","arxiv_id":"2506.05760","repositories_listed":1,"syntology":null},{"url":"/paper/diagonal-batching-unlocks-parallelism-in","slug":"diagonal-batching-unlocks-parallelism-in","title":"Diagonal Batching Unlocks Parallelism in Recurrent Memory Transformers for Long Contexts","date":"2025-06-05","arxiv_id":"2506.05229","repositories_listed":1,"syntology":null},{"url":"/paper/time-to-talk-llm-agents-for-asynchronous","slug":"time-to-talk-llm-agents-for-asynchronous","title":"Time to Talk: LLM Agents for Asynchronous Group Communication in Mafia Games","date":"2025-06-05","arxiv_id":"2506.05309","repositories_listed":1,"syntology":null},{"url":"/paper/assetopsbench-benchmarking-ai-agents-for-task","slug":"assetopsbench-benchmarking-ai-agents-for-task","title":"AssetOpsBench: Benchmarking AI Agents for Task Automation in Industrial Asset Operations and Maintenance","date":"2025-06-04","arxiv_id":"2506.03828","repositories_listed":1,"syntology":null},{"url":"/paper/adformer-aggregation-differential-transformer","slug":"adformer-aggregation-differential-transformer","title":"ADFormer: Aggregation Differential Transformer for Passenger Demand Forecasting","date":"2025-06-03","arxiv_id":"2506.02576","repositories_listed":1,"syntology":null},{"url":"/paper/2506-08026","slug":"2506-08026","title":"TIP-Search: Time-Predictable Inference Scheduling for Market Prediction under Uncertain Load","date":"2025-05-30","arxiv_id":"2506.08026","repositories_listed":1,"syntology":null},{"url":"/paper/empowering-vector-graphics-with-consistently","slug":"empowering-vector-graphics-with-consistently","title":"Empowering Vector Graphics with Consistently Arbitrary Viewing and View-dependent Visibility","date":"2025-05-27","arxiv_id":"2505.21377","repositories_listed":1,"syntology":null},{"url":"/paper/decoupling-spatio-temporal-prediction-when","slug":"decoupling-spatio-temporal-prediction-when","title":"Decoupling Spatio-Temporal Prediction: When Lightweight Large Models Meet Adaptive Hypergraphs","date":"2025-05-26","arxiv_id":"2505.19620","repositories_listed":1,"syntology":null},{"url":"/paper/task-memory-engine-spatial-memory-for-robust","slug":"task-memory-engine-spatial-memory-for-robust","title":"Task Memory Engine: Spatial Memory for Robust Multi-Step LLM Agents","date":"2025-05-26","arxiv_id":"2505.19436","repositories_listed":1,"syntology":null},{"url":"/paper/structured-reinforcement-learning-for-1","slug":"structured-reinforcement-learning-for-1","title":"Structured Reinforcement Learning for Combinatorial Decision-Making","date":"2025-05-25","arxiv_id":"2505.19053","repositories_listed":1,"syntology":null},{"url":"/paper/castillo-characterizing-response-length","slug":"castillo-characterizing-response-length","title":"CASTILLO: Characterizing Response Length Distributions of Large Language Models","date":"2025-05-22","arxiv_id":"2505.16881","repositories_listed":1,"syntology":null},{"url":"/paper/kerneloracle-predicting-the-linux-scheduler-s","slug":"kerneloracle-predicting-the-linux-scheduler-s","title":"KernelOracle: Predicting the Linux Scheduler's Next Move with Deep Learning","date":"2025-05-21","arxiv_id":"2505.15213","repositories_listed":1,"syntology":null},{"url":"/paper/internal-chain-of-thought-empirical-evidence","slug":"internal-chain-of-thought-empirical-evidence","title":"Internal Chain-of-Thought: Empirical Evidence for Layer-wise Subtask Scheduling in LLMs","date":"2025-05-20","arxiv_id":"2505.14530","repositories_listed":1,"syntology":null},{"url":"/paper/natural-language-planning-via-coding-and","slug":"natural-language-planning-via-coding-and","title":"Natural Language Planning via Coding and Inference Scaling","date":"2025-05-19","arxiv_id":"2505.13252","repositories_listed":1,"syntology":null},{"url":"/paper/gates-cost-aware-dynamic-workflow-scheduling","slug":"gates-cost-aware-dynamic-workflow-scheduling","title":"GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy","date":"2025-05-18","arxiv_id":"2505.12355","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/gates-cost-aware-dynamic-workflow-scheduling#ran","syntology_url":"https://syntology.ai/paper/2505.12355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12355"}},"official":{"repos":["yashen998/gates"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/demystifying-and-enhancing-the-efficiency-of","slug":"demystifying-and-enhancing-the-efficiency-of","title":"Demystifying and Enhancing the Efficiency of Large Language Model Based Search Agents","date":"2025-05-17","arxiv_id":"2505.12065","repositories_listed":1,"syntology":null},{"url":"/paper/fastcar-cache-attentive-replay-for-fast-auto","slug":"fastcar-cache-attentive-replay-for-fast-auto","title":"FastCar: Cache Attentive Replay for Fast Auto-Regressive Video Generation on the Edge","date":"2025-05-17","arxiv_id":"2505.14709","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-study-of-smt-and-milp-for-the","slug":"a-comparative-study-of-smt-and-milp-for-the","title":"A Comparative Study of SMT and MILP for the Nurse Rostering Problem","date":"2025-05-15","arxiv_id":"2505.10328","repositories_listed":1,"syntology":null},{"url":"/paper/piloting-structure-based-drug-design-via","slug":"piloting-structure-based-drug-design-via","title":"Piloting Structure-Based Drug Design via Modality-Specific Optimal Schedule","date":"2025-05-12","arxiv_id":"2505.07286","repositories_listed":1,"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":1,"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/piloting-structure-based-drug-design-via#ran","syntology_url":"https://syntology.ai/paper/2505.07286","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.07286"}},"official":{"repos":["algomole/molcraft"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/wireless-link-scheduling-with-state-augmented","slug":"wireless-link-scheduling-with-state-augmented","title":"Wireless Link Scheduling with State-Augmented Graph Neural Networks","date":"2025-05-12","arxiv_id":"2505.07598","repositories_listed":1,"syntology":null},{"url":"/paper/unraveling-the-rainbow-can-value-based","slug":"unraveling-the-rainbow-can-value-based","title":"Unraveling the Rainbow: can value-based methods schedule?","date":"2025-05-06","arxiv_id":"2505.03323","repositories_listed":1,"syntology":null},{"url":"/paper/taming-the-titans-a-survey-of-efficient-llm","slug":"taming-the-titans-a-survey-of-efficient-llm","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","date":"2025-04-28","arxiv_id":"2504.19720","repositories_listed":1,"syntology":null}],"syntology_records":29,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":107,"papers_where_code_ran_first_page":"/task/scheduling/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":32,"url":"/task/scheduling/papers/2","json":"/task/scheduling/papers/2.json","rows":100},{"order":"archive","page":3,"of":32,"url":"/task/scheduling/papers/3","json":"/task/scheduling/papers/3.json","rows":100},{"order":"archive","page":4,"of":32,"url":"/task/scheduling/papers/4","json":"/task/scheduling/papers/4.json","rows":100},{"order":"archive","page":5,"of":32,"url":"/task/scheduling/papers/5","json":"/task/scheduling/papers/5.json","rows":100},{"order":"archive","page":6,"of":32,"url":"/task/scheduling/papers/6","json":"/task/scheduling/papers/6.json","rows":100},{"order":"archive","page":7,"of":32,"url":"/task/scheduling/papers/7","json":"/task/scheduling/papers/7.json","rows":100},{"order":"archive","page":8,"of":32,"url":"/task/scheduling/papers/8","json":"/task/scheduling/papers/8.json","rows":100},{"order":"archive","page":9,"of":32,"url":"/task/scheduling/papers/9","json":"/task/scheduling/papers/9.json","rows":100},{"order":"archive","page":10,"of":32,"url":"/task/scheduling/papers/10","json":"/task/scheduling/papers/10.json","rows":100},{"order":"archive","page":11,"of":32,"url":"/task/scheduling/papers/11","json":"/task/scheduling/papers/11.json","rows":100},{"order":"archive","page":12,"of":32,"url":"/task/scheduling/papers/12","json":"/task/scheduling/papers/12.json","rows":100},{"order":"archive","page":13,"of":32,"url":"/task/scheduling/papers/13","json":"/task/scheduling/papers/13.json","rows":100},{"order":"archive","page":14,"of":32,"url":"/task/scheduling/papers/14","json":"/task/scheduling/papers/14.json","rows":100},{"order":"archive","page":15,"of":32,"url":"/task/scheduling/papers/15","json":"/task/scheduling/papers/15.json","rows":100},{"order":"archive","page":16,"of":32,"url":"/task/scheduling/papers/16","json":"/task/scheduling/papers/16.json","rows":100},{"order":"archive","page":17,"of":32,"url":"/task/scheduling/papers/17","json":"/task/scheduling/papers/17.json","rows":100},{"order":"archive","page":18,"of":32,"url":"/task/scheduling/papers/18","json":"/task/scheduling/papers/18.json","rows":100},{"order":"archive","page":19,"of":32,"url":"/task/scheduling/papers/19","json":"/task/scheduling/papers/19.json","rows":100},{"order":"archive","page":20,"of":32,"url":"/task/scheduling/papers/20","json":"/task/scheduling/papers/20.json","rows":100},{"order":"archive","page":21,"of":32,"url":"/task/scheduling/papers/21","json":"/task/scheduling/papers/21.json","rows":100},{"order":"archive","page":22,"of":32,"url":"/task/scheduling/papers/22","json":"/task/scheduling/papers/22.json","rows":100},{"order":"archive","page":23,"of":32,"url":"/task/scheduling/papers/23","json":"/task/scheduling/papers/23.json","rows":100},{"order":"archive","page":24,"of":32,"url":"/task/scheduling/papers/24","json":"/task/scheduling/papers/24.json","rows":100},{"order":"archive","page":25,"of":32,"url":"/task/scheduling/papers/25","json":"/task/scheduling/papers/25.json","rows":100},{"order":"archive","page":26,"of":32,"url":"/task/scheduling/papers/26","json":"/task/scheduling/papers/26.json","rows":100},{"order":"archive","page":27,"of":32,"url":"/task/scheduling/papers/27","json":"/task/scheduling/papers/27.json","rows":100},{"order":"archive","page":28,"of":32,"url":"/task/scheduling/papers/28","json":"/task/scheduling/papers/28.json","rows":100},{"order":"archive","page":29,"of":32,"url":"/task/scheduling/papers/29","json":"/task/scheduling/papers/29.json","rows":100},{"order":"archive","page":30,"of":32,"url":"/task/scheduling/papers/30","json":"/task/scheduling/papers/30.json","rows":100},{"order":"archive","page":31,"of":32,"url":"/task/scheduling/papers/31","json":"/task/scheduling/papers/31.json","rows":100},{"order":"archive","page":32,"of":32,"url":"/task/scheduling/papers/32","json":"/task/scheduling/papers/32.json","rows":4},{"order":"ran","page":1,"of":2,"url":"/task/scheduling/papers/ran/1","json":"/task/scheduling/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":2,"url":"/task/scheduling/papers/ran/2","json":"/task/scheduling/papers/ran/2.json","rows":7}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"aa54fbd61028baec3b5b19023ef20017e913b9946f5d9b173b774fabb7307675","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}