{"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/numerical-integration","name":"Numerical Integration","slug":"numerical-integration","description_markdown":"Numerical integration is the task to calculate the numerical value of a definite integral or the numerical solution of differential equations.","categories":[{"name":"Miscellaneous","url":"/area/miscellaneous"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":242,"papers_with_code":70,"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":0},"benchmarks":[],"datasets":[],"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":3,"rows_per_page":100,"shown":100,"of":242,"of_with_code":70,"tagged_in_all":242,"counts":{"archive_papers_tagged":242,"with_a_code_link":70,"where_syntology_ran_a_sample":18,"not_listed_spam_title":0,"listed":242,"listed_where_code_ran":18,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":12,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":12,"listed_every_run_a_failure_of_syntologys_instrument":6,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/learning-mesh-based-simulation-with-graph-1","slug":"learning-mesh-based-simulation-with-graph-1","title":"Learning Mesh-Based Simulation with Graph Networks","date":"2020-10-07","arxiv_id":"2010.03409","repositories_listed":11,"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":1,"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/learning-mesh-based-simulation-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/2010.03409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03409"}},"official":{"repos":["deepmind/deepmind-research"],"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/continuous-in-depth-neural-networks","slug":"continuous-in-depth-neural-networks","title":"Continuous-in-Depth Neural Networks","date":"2020-08-05","arxiv_id":"2008.02389","repositories_listed":4,"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":6,"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/continuous-in-depth-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2008.02389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.02389"}},"official":{"repos":["afqueiruga/ContinuousNet"],"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-stochastic-optimization-approach-to-train","slug":"a-stochastic-optimization-approach-to-train","title":"Outlier-robust neural network training: variation regularization meets trimmed loss to prevent functional breakdown","date":"2023-08-04","arxiv_id":"2308.02293","repositories_listed":2,"syntology":null},{"url":"/paper/a-stochastic-optimization-approach-to","slug":"a-stochastic-optimization-approach-to","title":"Minimizing robust density power-based divergences for general parametric density models","date":"2023-07-11","arxiv_id":"2307.05251","repositories_listed":2,"syntology":null},{"url":"/paper/scientific-computing-algorithms-to-learn","slug":"scientific-computing-algorithms-to-learn","title":"Scientific Computing Algorithms to Learn Enhanced Scalable Surrogates for Mesh Physics","date":"2023-04-01","arxiv_id":"2304.00338","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/scientific-computing-algorithms-to-learn#ran","syntology_url":"https://syntology.ai/paper/2304.00338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.00338"}},"official":null}},{"url":"/paper/fast-bayesian-inference-with-batch-bayesian","slug":"fast-bayesian-inference-with-batch-bayesian","title":"Fast Bayesian Inference with Batch Bayesian Quadrature via Kernel Recombination","date":"2022-06-09","arxiv_id":"2206.04734","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/fast-bayesian-inference-with-batch-bayesian#ran","syntology_url":"https://syntology.ai/paper/2206.04734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04734"}},"official":{"repos":["ma921/basq"],"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-ode-and-dae-modules-for-power-system","slug":"neural-ode-and-dae-modules-for-power-system","title":"Feasibility Study of Neural ODE and DAE Modules for Power System Dynamic Component Modeling","date":"2021-10-25","arxiv_id":"2110.12981","repositories_listed":2,"syntology":null},{"url":"/paper/learning-effective-stochastic-differential","slug":"learning-effective-stochastic-differential","title":"Learning effective stochastic differential equations from microscopic simulations: linking stochastic numerics to deep learning","date":"2021-06-10","arxiv_id":"2106.09004","repositories_listed":2,"syntology":null},{"url":"/paper/discovery-of-nonlinear-dynamical-systems","slug":"discovery-of-nonlinear-dynamical-systems","title":"Discovery of Nonlinear Dynamical Systems using a Runge-Kutta Inspired Dictionary-based Sparse Regression Approach","date":"2021-05-11","arxiv_id":"2105.04869","repositories_listed":2,"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/discovery-of-nonlinear-dynamical-systems#ran","syntology_url":"https://syntology.ai/paper/2105.04869","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04869"}},"official":{"repos":["goyalpike/RK4_SinDy"],"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/a-note-on-the-option-price-and-mass-at-zero","slug":"a-note-on-the-option-price-and-mass-at-zero","title":"A note on the option price and 'Mass at zero in the uncorrelated SABR model and implied volatility asymptotics'","date":"2020-11-01","arxiv_id":"2011.00557","repositories_listed":2,"syntology":null},{"url":"/paper/connecting-the-dots-towards-continuous-time","slug":"connecting-the-dots-towards-continuous-time","title":"Connecting the Dots: Numerical Randomized Hamiltonian Monte Carlo with State-Dependent Event Rates","date":"2020-05-04","arxiv_id":"2005.01285","repositories_listed":2,"syntology":null},{"url":"/paper/calibrating-levy-process-from-observations","slug":"calibrating-levy-process-from-observations","title":"Calibrating Multivariate Lévy Processes with Neural Networks","date":"2018-12-20","arxiv_id":"1812.08883","repositories_listed":2,"syntology":null},{"url":"/paper/quadrature-based-features-for-kernel","slug":"quadrature-based-features-for-kernel","title":"Quadrature-based features for kernel approximation","date":"2018-02-11","arxiv_id":"1802.03832","repositories_listed":2,"syntology":null},{"url":"/paper/bayesian-inference-for-logistic-models-using","slug":"bayesian-inference-for-logistic-models-using","title":"Bayesian inference for logistic models using Polya-Gamma latent variables","date":"2012-05-02","arxiv_id":"1205.0310","repositories_listed":2,"syntology":null},{"url":"/paper/how-far-are-we-from-optimal-reasoning","slug":"how-far-are-we-from-optimal-reasoning","title":"How Far Are We from Optimal Reasoning Efficiency?","date":"2025-06-08","arxiv_id":"2506.07104","repositories_listed":1,"syntology":null},{"url":"/paper/a-dictionary-of-closed-form-kernel-mean","slug":"a-dictionary-of-closed-form-kernel-mean","title":"A Dictionary of Closed-Form Kernel Mean Embeddings","date":"2025-04-26","arxiv_id":"2504.18830","repositories_listed":1,"syntology":null},{"url":"/paper/force-free-molecular-dynamics-through","slug":"force-free-molecular-dynamics-through","title":"Force-Free Molecular Dynamics Through Autoregressive Equivariant Networks","date":"2025-03-31","arxiv_id":"2503.23794","repositories_listed":1,"syntology":null},{"url":"/paper/underdamped-diffusion-bridges-with","slug":"underdamped-diffusion-bridges-with","title":"Underdamped Diffusion Bridges with Applications to Sampling","date":"2025-03-02","arxiv_id":"2503.01006","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/underdamped-diffusion-bridges-with#ran","syntology_url":"https://syntology.ai/paper/2503.01006","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01006"}},"official":{"repos":["DenisBless/UnderdampedDiffusionBridges"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/provable-quantum-algorithm-advantage-for","slug":"provable-quantum-algorithm-advantage-for","title":"Provable Quantum Algorithm Advantage for Gaussian Process Quadrature","date":"2025-02-20","arxiv_id":"2502.14467","repositories_listed":1,"syntology":null},{"url":"/paper/fnin-a-fourier-neural-operator-based","slug":"fnin-a-fourier-neural-operator-based","title":"FNIN: A Fourier Neural Operator-based Numerical Integration Network for Surface-form-gradients","date":"2025-01-21","arxiv_id":"2501.11876","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-change-not-states-an-alternate","slug":"predicting-change-not-states-an-alternate","title":"Predicting Change, Not States: An Alternate Framework for Neural PDE Surrogates","date":"2024-12-17","arxiv_id":"2412.13074","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"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) · 0 unverified","sample_list":"/paper/predicting-change-not-states-an-alternate#ran","syntology_url":"https://syntology.ai/paper/2412.13074","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.13074"}},"official":{"repos":["anthonyzhou-1/temporal_pdes"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-process-guided-learning-an","slug":"adaptive-process-guided-learning-an","title":"Adaptive Process-Guided Learning: An Application in Predicting Lake DO Concentrations","date":"2024-11-20","arxiv_id":"2411.12973","repositories_listed":1,"syntology":null},{"url":"/paper/greenlight-gym-a-reinforcement-learning","slug":"greenlight-gym-a-reinforcement-learning","title":"GreenLight-Gym: Reinforcement learning benchmark environment for control of greenhouse production systems","date":"2024-10-06","arxiv_id":"2410.05336","repositories_listed":1,"syntology":null},{"url":"/paper/average-causal-effect-estimation-in-dags-with","slug":"average-causal-effect-estimation-in-dags-with","title":"Average Causal Effect Estimation in DAGs with Hidden Variables: Extensions of Back-Door and Front-Door Criteria","date":"2024-09-06","arxiv_id":"2409.03962","repositories_listed":1,"syntology":null},{"url":"/paper/physics-informed-nonlinear-vector","slug":"physics-informed-nonlinear-vector","title":"Physics-informed nonlinear vector autoregressive models for the prediction of dynamical systems","date":"2024-07-25","arxiv_id":"2407.18057","repositories_listed":1,"syntology":null},{"url":"/paper/improving-the-training-of-rectified-flows","slug":"improving-the-training-of-rectified-flows","title":"Improving the Training of Rectified Flows","date":"2024-05-30","arxiv_id":"2405.20320","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-training-of-rectified-flows#ran","syntology_url":"https://syntology.ai/paper/2405.20320","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20320"}},"official":{"repos":["sangyun884/rfpp"],"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/message-passing-monte-carlo-generating-low","slug":"message-passing-monte-carlo-generating-low","title":"Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks","date":"2024-05-23","arxiv_id":"2405.15059","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/message-passing-monte-carlo-generating-low#ran","syntology_url":"https://syntology.ai/paper/2405.15059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15059"}},"official":{"repos":["tk-rusch/mpmc"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/identifiability-of-differential-algebraic","slug":"identifiability-of-differential-algebraic","title":"Identifiability of Differential-Algebraic Systems","date":"2024-05-22","arxiv_id":"2405.13818","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-ai-generated-code-for-c-fortran-go","slug":"evaluating-ai-generated-code-for-c-fortran-go","title":"Evaluating AI-generated code for C++, Fortran, Go, Java, Julia, Matlab, Python, R, and Rust","date":"2024-05-21","arxiv_id":"2405.13101","repositories_listed":1,"syntology":null},{"url":"/paper/combining-normalizing-flows-and-quasi-monte","slug":"combining-normalizing-flows-and-quasi-monte","title":"Combining Normalizing Flows and Quasi-Monte Carlo","date":"2024-01-11","arxiv_id":"2401.05934","repositories_listed":1,"syntology":null},{"url":"/paper/learning-flexible-body-collision-dynamics","slug":"learning-flexible-body-collision-dynamics","title":"Learning Flexible Body Collision Dynamics with Hierarchical Contact Mesh Transformer","date":"2023-12-19","arxiv_id":"2312.12467","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":6,"n_pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-flexible-body-collision-dynamics#ran","syntology_url":"https://syntology.ai/paper/2312.12467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.12467"}},"official":{"repos":["yuyudeep/hcmt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/stability-informed-initialization-of-neural","slug":"stability-informed-initialization-of-neural","title":"Stability-Informed Initialization of Neural Ordinary Differential Equations","date":"2023-11-27","arxiv_id":"2311.15890","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-numerical-integration-in","slug":"efficient-numerical-integration-in","title":"Efficient Numerical Integration in Reproducing Kernel Hilbert Spaces via Leverage Scores Sampling","date":"2023-11-22","arxiv_id":"2311.13548","repositories_listed":1,"syntology":null},{"url":"/paper/a-hybrid-approach-for-solving-the","slug":"a-hybrid-approach-for-solving-the","title":"A hybrid approach for solving the gravitational N-body problem with Artificial Neural Networks","date":"2023-10-31","arxiv_id":"2310.20398","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-for-the-identification-of","slug":"machine-learning-for-the-identification-of","title":"Machine Learning for the identification of phase-transitions in interacting agent-based systems: a Desai-Zwanzig example","date":"2023-10-29","arxiv_id":"2310.19039","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-latent-transformer-efficient","slug":"stochastic-latent-transformer-efficient","title":"Stochastic Latent Transformer: Efficient Modelling of Stochastically Forced Zonal Jets","date":"2023-10-25","arxiv_id":"2310.16741","repositories_listed":1,"syntology":null},{"url":"/paper/designing-stable-neural-networks-using-convex","slug":"designing-stable-neural-networks-using-convex","title":"Designing Stable Neural Networks using Convex Analysis and ODEs","date":"2023-06-29","arxiv_id":"2306.17332","repositories_listed":1,"syntology":null},{"url":"/paper/2305-14655","slug":"2305-14655","title":"Learning Survival Distribution with Implicit Survival Function","date":"2023-05-24","arxiv_id":"2305.14655","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-numerical-integration-with-neural","slug":"bayesian-numerical-integration-with-neural","title":"Bayesian Numerical Integration with Neural Networks","date":"2023-05-22","arxiv_id":"2305.13248","repositories_listed":1,"syntology":null},{"url":"/paper/automatically-bounding-the-taylor-remainder","slug":"automatically-bounding-the-taylor-remainder","title":"Automatically Bounding the Taylor Remainder Series: Tighter Bounds and New Applications","date":"2022-12-22","arxiv_id":"2212.11429","repositories_listed":1,"syntology":null},{"url":"/paper/learning-integrable-dynamics-with-action","slug":"learning-integrable-dynamics-with-action","title":"Learning Integrable Dynamics with Action-Angle Networks","date":"2022-11-24","arxiv_id":"2211.15338","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-integrable-dynamics-with-action#ran","syntology_url":"https://syntology.ai/paper/2211.15338","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15338"}},"official":{"repos":["ameya98/actionanglenetworks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/statistical-robustness-and-computational","slug":"statistical-robustness-and-computational","title":"Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distances","date":"2022-10-17","arxiv_id":"2210.09160","repositories_listed":1,"syntology":null},{"url":"/paper/continuous-mixtures-of-tractable","slug":"continuous-mixtures-of-tractable","title":"Continuous Mixtures of Tractable Probabilistic Models","date":"2022-09-21","arxiv_id":"2209.10584","repositories_listed":1,"syntology":null},{"url":"/paper/on-numerical-integration-in-neural-ordinary","slug":"on-numerical-integration-in-neural-ordinary","title":"On Numerical Integration in Neural Ordinary Differential Equations","date":"2022-06-15","arxiv_id":"2206.07335","repositories_listed":1,"syntology":null},{"url":"/paper/deep-learning-on-implicit-neural-datasets","slug":"deep-learning-on-implicit-neural-datasets","title":"Discretization Invariant Networks for Learning Maps between Neural Fields","date":"2022-06-02","arxiv_id":"2206.01178","repositories_listed":1,"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/deep-learning-on-implicit-neural-datasets#ran","syntology_url":"https://syntology.ai/paper/2206.01178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01178"}},"official":{"repos":["clintonjwang/di-net"],"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/sampling-free-inference-for-ab-initio","slug":"sampling-free-inference-for-ab-initio","title":"Sampling-free Inference for Ab-Initio Potential Energy Surface Networks","date":"2022-05-30","arxiv_id":"2205.14962","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-aware-graph-representation","slug":"distribution-aware-graph-representation","title":"Distribution-Aware Graph Representation Learning for Transient Stability Assessment of Power System","date":"2022-05-12","arxiv_id":"2205.06576","repositories_listed":1,"syntology":null},{"url":"/paper/feedback-gradient-descent-efficient-and","slug":"feedback-gradient-descent-efficient-and","title":"Feedback Gradient Descent: Efficient and Stable Optimization with Orthogonality for DNNs","date":"2022-05-12","arxiv_id":"2205.08385","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":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/feedback-gradient-descent-efficient-and#ran","syntology_url":"https://syntology.ai/paper/2205.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08385"}},"official":{"repos":["bokveizen/Feedback-Gradient-Descent"],"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/fenrir-physics-enhanced-regression-for","slug":"fenrir-physics-enhanced-regression-for","title":"Fenrir: Physics-Enhanced Regression for Initial Value Problems","date":"2022-02-02","arxiv_id":"2202.01287","repositories_listed":1,"syntology":null},{"url":"/paper/inertial-navigation-using-an-inertial-sensor","slug":"inertial-navigation-using-an-inertial-sensor","title":"Inertial Navigation Using an Inertial Sensor Array","date":"2022-01-28","arxiv_id":"2201.11983","repositories_listed":1,"syntology":null},{"url":"/paper/taylor-lagrange-neural-ordinary-differential","slug":"taylor-lagrange-neural-ordinary-differential","title":"Taylor-Lagrange Neural Ordinary Differential Equations: Toward Fast Training and Evaluation of Neural ODEs","date":"2022-01-14","arxiv_id":"2201.05715","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":4,"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/taylor-lagrange-neural-ordinary-differential#ran","syntology_url":"https://syntology.ai/paper/2201.05715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.05715"}},"official":{"repos":["wuwushrek/taylanets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/predicting-power-system-dynamics-and","slug":"predicting-power-system-dynamics-and","title":"A Frequency Domain Approach to Predict Power System Transients","date":"2021-11-01","arxiv_id":"2111.01103","repositories_listed":1,"syntology":null},{"url":"/paper/data-based-stochastic-modeling-reveals","slug":"data-based-stochastic-modeling-reveals","title":"Data-based stochastic modeling reveals sources of activity bursts in single-cell TGF-$β$ signaling","date":"2021-07-25","arxiv_id":"2107.11770","repositories_listed":1,"syntology":null},{"url":"/paper/distributional-gradient-matching-for-learning","slug":"distributional-gradient-matching-for-learning","title":"Distributional Gradient Matching for Learning Uncertain Neural Dynamics Models","date":"2021-06-22","arxiv_id":"2106.11609","repositories_listed":1,"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":0,"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/distributional-gradient-matching-for-learning#ran","syntology_url":"https://syntology.ai/paper/2106.11609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.11609"}},"official":{"repos":["lenarttreven/dgm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-nonparametric-volterra-kernels-with","slug":"learning-nonparametric-volterra-kernels-with","title":"Learning Nonparametric Volterra Kernels with Gaussian Processes","date":"2021-06-10","arxiv_id":"2106.05582","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-time-stepping-for-numerical","slug":"efficient-time-stepping-for-numerical","title":"Efficient time stepping for numerical integration using reinforcement learning","date":"2021-04-08","arxiv_id":"2104.03562","repositories_listed":1,"syntology":null},{"url":"/paper/boxhed-2-0-scalable-boosting-of-functional","slug":"boxhed-2-0-scalable-boosting-of-functional","title":"BoXHED2.0: Scalable boosting of dynamic survival analysis","date":"2021-03-23","arxiv_id":"2103.12591","repositories_listed":1,"syntology":null},{"url":"/paper/symplectic-adjoint-method-for-exact-gradient","slug":"symplectic-adjoint-method-for-exact-gradient","title":"Symplectic Adjoint Method for Exact Gradient of Neural ODE with Minimal Memory","date":"2021-02-19","arxiv_id":"2102.09750","repositories_listed":1,"syntology":null},{"url":"/paper/autoint-automatic-integration-for-fast-neural","slug":"autoint-automatic-integration-for-fast-neural","title":"AutoInt: Automatic Integration for Fast Neural Volume Rendering","date":"2020-12-03","arxiv_id":"2012.01714","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/autoint-automatic-integration-for-fast-neural#ran","syntology_url":"https://syntology.ai/paper/2012.01714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.01714"}},"official":{"repos":["computational-imaging/automatic-integration"],"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/hierarchical-deep-learning-of-multiscale","slug":"hierarchical-deep-learning-of-multiscale","title":"Hierarchical Deep Learning of Multiscale Differential Equation Time-Steppers","date":"2020-08-22","arxiv_id":"2008.09768","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-deep-learning-of-multiscale#ran","syntology_url":"https://syntology.ai/paper/2008.09768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.09768"}},"official":{"repos":["luckystarufo/multiscale_HiTS"],"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/unifying-supervised-learning-and-vaes","slug":"unifying-supervised-learning-and-vaes","title":"Unifying supervised learning and VAEs -- coverage, systematics and goodness-of-fit in normalizing-flow based neural network models for astro-particle reconstructions","date":"2020-08-13","arxiv_id":"2008.05825","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-probabilistic-numerical-integration","slug":"bayesian-probabilistic-numerical-integration","title":"Bayesian Probabilistic Numerical Integration with Tree-Based Models","date":"2020-06-09","arxiv_id":"2006.05371","repositories_listed":1,"syntology":null},{"url":"/paper/hamiltonian-neural-networks-for-solving","slug":"hamiltonian-neural-networks-for-solving","title":"Hamiltonian neural networks for solving equations of motion","date":"2020-01-29","arxiv_id":"2001.11107","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hamiltonian-neural-networks-for-solving#ran","syntology_url":"https://syntology.ai/paper/2001.11107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.11107"}},"official":{"repos":["mariosmat/hamiltoniannnetodes"],"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/i-flow-high-dimensional-integration-and","slug":"i-flow-high-dimensional-integration-and","title":"i-flow: High-dimensional Integration and Sampling with Normalizing Flows","date":"2020-01-15","arxiv_id":"2001.05486","repositories_listed":1,"syntology":null},{"url":"/paper/transformation-of-relu-based-recurrent-neural","slug":"transformation-of-relu-based-recurrent-neural","title":"Transformation of ReLU-based recurrent neural networks from discrete-time to continuous-time","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-two-ways-to-use-determinantal-point","slug":"on-two-ways-to-use-determinantal-point","title":"On two ways to use determinantal point processes for Monte Carlo integration","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/structured-variational-inference-in","slug":"structured-variational-inference-in","title":"Structured Variational Inference in Continuous Cox Process Models","date":"2019-06-07","arxiv_id":"1906.03161","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/structured-variational-inference-in#ran","syntology_url":"https://syntology.ai/paper/1906.03161","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03161"}},"official":null}},{"url":"/paper/ares-and-mars-adversarial-and-mmd-minimizing","slug":"ares-and-mars-adversarial-and-mmd-minimizing","title":"AReS and MaRS - Adversarial and MMD-Minimizing Regression for SDEs","date":"2019-02-22","arxiv_id":"1902.08480","repositories_listed":1,"syntology":null},{"url":"/paper/batch-selection-for-parallelisation-of","slug":"batch-selection-for-parallelisation-of","title":"Batch Selection for Parallelisation of Bayesian Quadrature","date":"2018-12-04","arxiv_id":"1812.01553","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-variational-inference-for-dynamical","slug":"scalable-variational-inference-for-dynamical","title":"Scalable Variational Inference for Dynamical Systems","date":"2017-05-19","arxiv_id":"1705.07079","repositories_listed":1,"syntology":null},{"url":null,"slug":"gaussian-processes-and-reproducing-kernels","title":"Gaussian Processes and Reproducing Kernels: Connections and Equivalences","date":"2025-06-20","arxiv_id":"2506.17366","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-convergence-for-high-order-ode-solvers","title":"Fast Convergence for High-Order ODE Solvers in Diffusion Probabilistic Models","date":"2025-06-16","arxiv_id":"2506.13061","repositories_listed":0,"syntology":null},{"url":null,"slug":"ode-gs-latent-odes-for-dynamic-scene","title":"ODE-GS: Latent ODEs for Dynamic Scene Extrapolation with 3D Gaussian Splatting","date":"2025-06-05","arxiv_id":"2506.05480","repositories_listed":0,"syntology":null},{"url":null,"slug":"operator-splitting-methods-for-neuromorphic","title":"Operator-Splitting Methods for Neuromorphic Circuit Simulation","date":"2025-05-28","arxiv_id":"2505.22363","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-intelligence-for-direct-prediction","title":"Artificial Intelligence for Direct Prediction of Molecular Dynamics Across Chemical Space","date":"2025-05-22","arxiv_id":"2505.16301","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-time-iterative-linear-quadratic","title":"Continuous-time iterative linear-quadratic regulator","date":"2025-05-21","arxiv_id":"2505.15525","repositories_listed":0,"syntology":null},{"url":null,"slug":"discretization-of-linear-systems-using-the","title":"Discretization of Linear Systems using the Matrix Exponential","date":"2025-05-18","arxiv_id":"2505.18187","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-eigenvalue-tracking-of-large-scale","title":"On the Eigenvalue Tracking of Large-Scale Systems","date":"2025-04-24","arxiv_id":"2504.17571","repositories_listed":0,"syntology":null},{"url":null,"slug":"asian-basket-spread-options-a-new","title":"Asian Basket Spread Options: A New Approximation Based on Stochastic Taylor Expansions","date":"2025-04-22","arxiv_id":"2504.16011","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-patch-assignment-gradient-flows","title":"Riemannian Patch Assignment Gradient Flows","date":"2025-04-17","arxiv_id":"2504.13024","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-network-enhanced-integrators-for","title":"Neural network-enhanced integrators for simulating ordinary differential equations","date":"2025-04-07","arxiv_id":"2504.05493","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-modes-of-instability-of","title":"Computing Modes of Instability of Parameterized Nonlinear Systems for Vulnerability Assessment","date":"2025-03-16","arxiv_id":"2503.12298","repositories_listed":0,"syntology":null},{"url":null,"slug":"pi-controlled-variable-time-step-power-system","title":"PI-Controlled Variable Time-Step Power System Simulation Using an Adaptive Order Differential Transformation Method","date":"2025-03-12","arxiv_id":"2503.09898","repositories_listed":0,"syntology":null},{"url":null,"slug":"denoising-hamiltonian-network-for-physical","title":"Denoising Hamiltonian Network for Physical Reasoning","date":"2025-03-10","arxiv_id":"2503.07596","repositories_listed":0,"syntology":null},{"url":null,"slug":"efigp-eigen-fourier-physics-informed-gaussian","title":"EFiGP: Eigen-Fourier Physics-Informed Gaussian Process for Inference of Dynamic Systems","date":"2025-01-23","arxiv_id":"2501.14107","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-constant-velocity-latent-dynamics-approach","title":"Lilan: A linear latent network approach for real-time solutions of stiff, nonlinear, ordinary differential equations","date":"2025-01-14","arxiv_id":"2501.08423","repositories_listed":0,"syntology":null},{"url":null,"slug":"median-of-means-sampling-for-the-keister","title":"Median of Means Sampling for the Keister Function","date":"2025-01-13","arxiv_id":"2501.10440","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-reversible-bridges-of-data-with-machine","title":"Time-Reversible Bridges of Data with Machine Learning","date":"2024-12-18","arxiv_id":"2412.13665","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-spring-neural-odes-for-link-sign","title":"Graph Spring Neural ODEs for Link Sign Prediction","date":"2024-12-17","arxiv_id":"2412.12916","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-sampling-with-stochastic-particle","title":"Importance Sampling With Stochastic Particle Flow and Diffusion Optimization","date":"2024-12-13","arxiv_id":"2412.09778","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmented-numerical-integration-in-state","title":"Data-Augmented Numerical Integration in State Prediction: Rule Selection","date":"2024-12-09","arxiv_id":"2412.06376","repositories_listed":0,"syntology":null},{"url":null,"slug":"modular-addition-without-black-boxes","title":"Modular addition without black-boxes: Compressing explanations of MLPs that compute numerical integration","date":"2024-12-04","arxiv_id":"2412.03773","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-monte-carlo-harnessing-diffusion","title":"Beyond Monte Carlo: Harnessing Diffusion Models to Simulate Financial Market Dynamics","date":"2024-11-21","arxiv_id":"2412.00036","repositories_listed":0,"syntology":null},{"url":null,"slug":"coupled-integral-pinn-for-conservation-law","title":"Coupled Integral PINN for conservation law","date":"2024-11-18","arxiv_id":"2411.11276","repositories_listed":0,"syntology":null},{"url":null,"slug":"stationary-velocity-fields-on-matrix-groups","title":"Stationary Velocity Fields on Matrix Groups for Deformable Image Registration","date":"2024-10-14","arxiv_id":"2410.10997","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurally-integrated-finite-elements-for","title":"Neurally Integrated Finite Elements for Differentiable Elasticity on Evolving Domains","date":"2024-10-12","arxiv_id":"2410.09417","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-densities-structured-noise-and","title":"Spectral Densities, Structured Noise and Ensemble Averaging within Open Quantum Dynamics","date":"2024-10-05","arxiv_id":"2410.04294","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-the-age-distribution-of-longevity","title":"Modelling the age distribution of longevity leaders","date":"2024-09-05","arxiv_id":"2409.03353","repositories_listed":0,"syntology":null},{"url":null,"slug":"correlation-properties-in-channels-with-von","title":"Correlation Properties in Channels with von Mises-Fisher Distribution of Scatterers","date":"2024-09-03","arxiv_id":"2409.01647","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-decoupled-physics-informed-neural","title":"Domain-decoupled Physics-informed Neural Networks with Closed-form Gradients for Fast Model Learning of Dynamical Systems","date":"2024-08-27","arxiv_id":"2408.14951","repositories_listed":0,"syntology":null}],"syntology_records":19,"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":18,"papers_where_code_ran_first_page":"/task/numerical-integration/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":3,"url":"/task/numerical-integration/papers/2","json":"/task/numerical-integration/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/task/numerical-integration/papers/3","json":"/task/numerical-integration/papers/3.json","rows":42},{"order":"ran","page":1,"of":1,"url":"/task/numerical-integration/papers/ran/1","json":"/task/numerical-integration/papers/ran/1.json","rows":18}],"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":"721ef68364f295490ee8520767d3e119e36f9231f7ffe6eb01ffa0ff95581764","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}