{"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/inference-optimization","name":"Inference Optimization","slug":"inference-optimization","description_markdown":null,"categories":[{"name":"Audio","url":"/area/audio"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":56,"papers_with_code":21,"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":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/online-beat-tracking","name":"Online Beat Tracking"}],"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":1,"rows_per_page":100,"shown":56,"of":56,"of_with_code":21,"tagged_in_all":56,"counts":{"archive_papers_tagged":56,"with_a_code_link":21,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":56,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/enhanced-graph-learning-schemes-driven-by","slug":"enhanced-graph-learning-schemes-driven-by","title":"Enhanced graph-learning schemes driven by similar distributions of motifs","date":"2022-07-11","arxiv_id":"2207.04747","repositories_listed":3,"syntology":null},{"url":"/paper/input-convex-neural-networks","slug":"input-convex-neural-networks","title":"Input Convex Neural Networks","date":"2016-09-22","arxiv_id":"1609.07152","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/input-convex-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1609.07152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.07152"}},"official":{"repos":["locuslab/icnn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/cyclebnn-cyclic-precision-training-in-binary-1","slug":"cyclebnn-cyclic-precision-training-in-binary-1","title":"CycleBNN: Cyclic Precision Training in Binary Neural Networks","date":"2024-09-28","arxiv_id":"2410.00050","repositories_listed":2,"syntology":null},{"url":"/paper/patched-moa-optimizing-inference-for-diverse","slug":"patched-moa-optimizing-inference-for-diverse","title":"Patched MOA: optimizing inference for diverse software development tasks","date":"2024-07-26","arxiv_id":"2407.18521","repositories_listed":2,"syntology":null},{"url":"/paper/representing-edge-flows-on-graphs-via-sparse","slug":"representing-edge-flows-on-graphs-via-sparse","title":"Representing Edge Flows on Graphs via Sparse Cell Complexes","date":"2023-09-04","arxiv_id":"2309.01632","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/representing-edge-flows-on-graphs-via-sparse#ran","syntology_url":"https://syntology.ai/paper/2309.01632","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.01632"}},"official":{"repos":["josefhoppe/cell-flower","josefhoppe/edge-flow-cell-complexes"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/2506-08686","slug":"2506-08686","title":"Brevity is the soul of sustainability: Characterizing LLM response lengths","date":"2025-06-10","arxiv_id":"2506.08686","repositories_listed":1,"syntology":null},{"url":"/paper/optimizing-llm-inference-fluid-guided-online","slug":"optimizing-llm-inference-fluid-guided-online","title":"Optimizing LLM Inference: Fluid-Guided Online Scheduling with Memory Constraints","date":"2025-04-15","arxiv_id":"2504.11320","repositories_listed":1,"syntology":null},{"url":"/paper/simplear-pushing-the-frontier-of","slug":"simplear-pushing-the-frontier-of","title":"SimpleAR: Pushing the Frontier of Autoregressive Visual Generation through Pretraining, SFT, and RL","date":"2025-04-15","arxiv_id":"2504.11455","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"5 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; 2 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/simplear-pushing-the-frontier-of#ran","syntology_url":"https://syntology.ai/paper/2504.11455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.11455"}},"official":{"repos":["wdrink/simplear"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/the-1st-solution-for-4th-pvuw-mevis-challenge","slug":"the-1st-solution-for-4th-pvuw-mevis-challenge","title":"The 1st Solution for 4th PVUW MeViS Challenge: Unleashing the Potential of Large Multimodal Models for Referring Video Segmentation","date":"2025-04-07","arxiv_id":"2504.05178","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-inference-optimization-techniques","slug":"a-survey-on-inference-optimization-techniques","title":"A Survey on Inference Optimization Techniques for Mixture of Experts Models","date":"2024-12-18","arxiv_id":"2412.14219","repositories_listed":1,"syntology":null},{"url":"/paper/a-temporal-linear-network-for-time-series","slug":"a-temporal-linear-network-for-time-series","title":"A Temporal Linear Network for Time Series Forecasting","date":"2024-10-28","arxiv_id":"2410.21448","repositories_listed":1,"syntology":null},{"url":"/paper/llm-rank-a-graph-theoretical-approach-to","slug":"llm-rank-a-graph-theoretical-approach-to","title":"LLM-Rank: A Graph Theoretical Approach to Pruning Large Language Models","date":"2024-10-17","arxiv_id":"2410.13299","repositories_listed":1,"syntology":null},{"url":"/paper/2408-02006","slug":"2408-02006","title":"LLaSA: Large Language and E-Commerce Shopping Assistant","date":"2024-08-04","arxiv_id":"2408.02006","repositories_listed":1,"syntology":null},{"url":"/paper/inference-performance-optimization-for-large","slug":"inference-performance-optimization-for-large","title":"Inference Performance Optimization for Large Language Models on CPUs","date":"2024-07-10","arxiv_id":"2407.07304","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inference-performance-optimization-for-large#ran","syntology_url":"https://syntology.ai/paper/2407.07304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.07304"}},"official":{"repos":["intel/xfastertransformer"],"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/painterly-image-harmonization-using-diffusion","slug":"painterly-image-harmonization-using-diffusion","title":"Painterly Image Harmonization using Diffusion Model","date":"2023-08-04","arxiv_id":"2308.02228","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":6,"n_no_contract":3,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 6 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/painterly-image-harmonization-using-diffusion#ran","syntology_url":"https://syntology.ai/paper/2308.02228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02228"}},"official":{"repos":["bcmi/phdiffusion-painterly-image-harmonization"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/eenet-learning-to-early-exit-for-adaptive","slug":"eenet-learning-to-early-exit-for-adaptive","title":"Adaptive Deep Neural Network Inference Optimization with EENet","date":"2023-01-15","arxiv_id":"2301.07099","repositories_listed":1,"syntology":null},{"url":"/paper/adjust-a-dictionary-based-joint","slug":"adjust-a-dictionary-based-joint","title":"ADJUST: A Dictionary-Based Joint Reconstruction and Unmixing Method for Spectral Tomography","date":"2021-12-21","arxiv_id":"2112.11406","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-1d-state-space-for-efficient-music","slug":"a-novel-1d-state-space-for-efficient-music","title":"A Novel 1D State Space for Efficient Music Rhythmic Analysis","date":"2021-11-01","arxiv_id":"2111.00704","repositories_listed":1,"syntology":null},{"url":"/paper/easy-and-efficient-transformer-scalable","slug":"easy-and-efficient-transformer-scalable","title":"Easy and Efficient Transformer : Scalable Inference Solution For large NLP model","date":"2021-04-26","arxiv_id":"2104.12470","repositories_listed":1,"syntology":null},{"url":"/paper/a-general-method-for-amortizing-variational","slug":"a-general-method-for-amortizing-variational","title":"A General Method for Amortizing Variational Filtering","date":"2018-11-13","arxiv_id":"1811.05090","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/a-general-method-for-amortizing-variational#ran","syntology_url":"https://syntology.ai/paper/1811.05090","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.05090"}},"official":{"repos":["joelouismarino/amortized-variational-filtering"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/iterative-amortized-inference","slug":"iterative-amortized-inference","title":"Iterative Amortized Inference","date":"2018-07-24","arxiv_id":"1807.09356","repositories_listed":1,"syntology":null},{"url":null,"slug":"sub-moe-efficient-mixture-of-expert-llms","title":"Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging","date":"2025-06-29","arxiv_id":"2506.23266","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-foundation-cracks-a-comprehensive-study","title":"The Foundation Cracks: A Comprehensive Study on Bugs and Testing Practices in LLM Libraries","date":"2025-06-14","arxiv_id":"2506.12320","repositories_listed":0,"syntology":null},{"url":null,"slug":"dsmentor-enhancing-data-science-agents-with","title":"DSMentor: Enhancing Data Science Agents with Curriculum Learning and Online Knowledge Accumulation","date":"2025-05-20","arxiv_id":"2505.14163","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-moe-llm-inference-for-extremely-large","title":"Faster MoE LLM Inference for Extremely Large Models","date":"2025-05-06","arxiv_id":"2505.03531","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-efficient-transformer-inference","title":"Energy-Efficient Transformer Inference: Optimization Strategies for Time Series Classification","date":"2025-02-23","arxiv_id":"2502.16627","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-offline-online-scheduling-method-for","title":"Hybrid Offline-online Scheduling Method for Large Language Model Inference Optimization","date":"2025-02-14","arxiv_id":"2502.15763","repositories_listed":0,"syntology":null},{"url":null,"slug":"dvfs-aware-dnn-inference-on-gpus-latency","title":"DVFS-Aware DNN Inference on GPUs: Latency Modeling and Performance Analysis","date":"2025-02-10","arxiv_id":"2502.06295","repositories_listed":0,"syntology":null},{"url":null,"slug":"hellinger-kantorovich-gradient-flows-global","title":"Hellinger-Kantorovich Gradient Flows: Global Exponential Decay of Entropy Functionals","date":"2025-01-28","arxiv_id":"2501.17049","repositories_listed":0,"syntology":null},{"url":null,"slug":"fluidml-fast-and-memory-efficient-inference","title":"FluidML: Fast and Memory Efficient Inference Optimization","date":"2024-11-14","arxiv_id":"2411.09242","repositories_listed":0,"syntology":null},{"url":null,"slug":"edgerl-reinforcement-learning-driven-deep","title":"EdgeRL: Reinforcement Learning-driven Deep Learning Model Inference Optimization at Edge","date":"2024-10-16","arxiv_id":"2410.12221","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-smoe-language-models-by-evaluating","title":"Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning","date":"2024-09-02","arxiv_id":"2409.01483","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-ultimate-guide-to-fine-tuning-llms-from","title":"The Ultimate Guide to Fine-Tuning LLMs from Basics to Breakthroughs: An Exhaustive Review of Technologies, Research, Best Practices, Applied Research Challenges and Opportunities","date":"2024-08-23","arxiv_id":"2408.13296","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-02341","title":"An approach to optimize inference of the DIART speaker diarization pipeline","date":"2024-08-05","arxiv_id":"2408.02341","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-optimization-of-foundation-models","title":"Inference Optimization of Foundation Models on AI Accelerators","date":"2024-07-12","arxiv_id":"2407.09111","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-zero-shot-text-to-speech-synthesis","title":"Robust Zero-Shot Text-to-Speech Synthesis with Reverse Inference Optimization","date":"2024-07-02","arxiv_id":"2407.02243","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaling-the-vocabulary-of-non-autoregressive","title":"Scaling the Vocabulary of Non-autoregressive Models for Efficient Generative Retrieval","date":"2024-06-10","arxiv_id":"2406.06739","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiency-optimization-of-large-scale","title":"Efficiency optimization of large-scale language models based on deep learning in natural language processing tasks","date":"2024-05-20","arxiv_id":"2405.11704","repositories_listed":0,"syntology":null},{"url":null,"slug":"advances-and-open-challenges-in-federated","title":"Advances and Open Challenges in Federated Foundation Models","date":"2024-04-23","arxiv_id":"2404.15381","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-while-providing-model-as-a","title":"Federated Learning While Providing Model as a Service: Joint Training and Inference Optimization","date":"2023-12-20","arxiv_id":"2312.12863","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-integration-of-pre-trained-speech-and","title":"Integrating Pre-Trained Speech and Language Models for End-to-End Speech Recognition","date":"2023-12-06","arxiv_id":"2312.03668","repositories_listed":0,"syntology":null},{"url":null,"slug":"sysmol-a-hardware-software-co-design","title":"SySMOL: Co-designing Algorithms and Hardware for Neural Networks with Heterogeneous Precisions","date":"2023-11-23","arxiv_id":"2311.14114","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-fundamental-dilemma-of-bayesian-active","title":"Bayesian Active Learning in the Presence of Nuisance Parameters","date":"2023-10-23","arxiv_id":"2310.14968","repositories_listed":0,"syntology":null},{"url":null,"slug":"corrector-operator-to-enhance-accuracy-and","title":"Residual-Based Error Corrector Operator to Enhance Accuracy and Reliability of Neural Operator Surrogates of Nonlinear Variational Boundary-Value Problems","date":"2023-06-21","arxiv_id":"2306.12047","repositories_listed":0,"syntology":null},{"url":null,"slug":"networked-signal-and-information-processing","title":"Networked Signal and Information Processing","date":"2022-10-25","arxiv_id":"2210.13767","repositories_listed":0,"syntology":null},{"url":"/paper/self-constrained-inference-optimization-on","slug":"self-constrained-inference-optimization-on","title":"Self-Constrained Inference Optimization on Structural Groups for Human Pose Estimation","date":"2022-07-06","arxiv_id":"2207.02425","repositories_listed":0,"syntology":null},{"url":null,"slug":"easy-and-efficient-transformer-scalable-1","title":"Easy and Efficient Transformer: Scalable Inference Solution For Large NLP Model","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sbbadger-biochemical-reaction-networks-with","title":"SBbadger: Biochemical Reaction Networks with Definable Degree Distributions","date":"2022-02-25","arxiv_id":"2202.13004","repositories_listed":0,"syntology":null},{"url":null,"slug":"bifocal-neural-asr-exploiting-keyword","title":"Bifocal Neural ASR: Exploiting Keyword Spotting for Inference Optimization","date":"2021-08-03","arxiv_id":"2108.01704","repositories_listed":0,"syntology":null},{"url":null,"slug":"developing-efficient-transfer-learning","title":"Developing efficient transfer learning strategies for robust scene recognition in mobile robotics using pre-trained convolutional neural networks","date":"2021-07-23","arxiv_id":"2107.11187","repositories_listed":0,"syntology":null},{"url":null,"slug":"investigations-on-the-inference-optimization","title":"Investigations on the inference optimization techniques and their impact on multiple hardware platforms for Semantic Segmentation","date":"2019-11-29","arxiv_id":"1911.12993","repositories_listed":0,"syntology":null},{"url":null,"slug":"sndcnn-self-normalizing-deep-cnns-with-scaled","title":"SNDCNN: Self-normalizing deep CNNs with scaled exponential linear units for speech recognition","date":"2019-10-04","arxiv_id":"1910.01992","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-combined-entropy-and-utility-based","title":"A bi-partite generative model framework for analyzing and simulating large scale multiple discrete-continuous travel behaviour data","date":"2019-01-18","arxiv_id":"1901.06415","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-signal-recovery-with-one-bit","title":"Deep Signal Recovery with One-Bit Quantization","date":"2018-11-30","arxiv_id":"1812.00797","repositories_listed":0,"syntology":null},{"url":null,"slug":"crvi-convex-relaxation-for-variational","title":"CRVI: Convex Relaxation for Variational Inference","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-infer","title":"Learning to Infer","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":6,"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":5,"papers_where_code_ran_first_page":"/task/inference-optimization/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":"ran","page":1,"of":1,"url":"/task/inference-optimization/papers/ran/1","json":"/task/inference-optimization/papers/ran/1.json","rows":5}],"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":"b4c592cca0d39326fb01c980209a5f04f924e52989115ecc01c0234d0414a044","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}