{"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":"/method/node","slug":"node","name":"NODE","full_name":"Neural Oblivious Decision Ensembles","full_name_withheld":false,"description_markdown":"**Neural Oblivious Decision Ensembles (NODE)** is a tabular data architecture that consists of differentiable\r\noblivious decision trees (ODT) that are trained end-to-end by backpropagation. \r\n\r\nThe core building block is a Neural Oblivious Decision Ensemble (NODE) layer. The layer is composed of $m$ differentiable oblivious decision trees (ODTs) of equal depth $d$. As an input, all $m$ trees get a common vector $x \\in \\mathbb{R}^{n}$, containing $n$ numeric features. Below we describe a design of a single differentiable ODT.\r\n\r\nIn its essence, an ODT is a decision table that splits the data along $d$ splitting features and compares each feature to a learned threshold. Then, the tree returns one of the $2^{d}$ possible responses, corresponding to the comparisons result. Therefore, each ODT is completely determined by its splitting features $f \\in \\mathbb{R}^{d}$, splitting thresholds $b \\in \\mathbb{R}^{d}$ and a $d$-dimensional tensor of responses $R \\in \\mathbb{R} \\underbrace{2 \\times 2 \\times 2}_{d}$. In this notation, the tree output is defined as:\r\n\r\n$$\r\nh(x)=R\\left[\\mathbb{1}\\left(f\\_{1}(x)-b_{1}\\right), \\ldots, \\mathbb{1}\\left(f\\_{d}(x)-b\\_{d}\\right)\\right]\r\n$$\r\nwhere $\\mathbb{1}(\\cdot)$ denotes the Heaviside function.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","paper":"/paper/neural-oblivious-decision-ensembles-for-deep","first_author":"Sergei Popov","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/neural-oblivious-decision-ensembles-for-deep"},"source":{"url":"https://arxiv.org/abs/1909.06312v2","title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Deep Tabular Learning","url":"/methods/category/deep-tabular-learning","pwc_aliases":[]}],"n_papers_tagged":42,"archive_num_papers":42,"papers_newest_first":[{"paper":null,"slug":"2506-08146","title":"Fully data-driven inverse hyperelasticity with hyper-network neural ODE fields","date":"2025-06-09","arxiv_id":"2506.08146","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-network-based-control-of-unknown","title":"Neural network based control of unknown nonlinear systems via contraction analysis","date":"2025-05-22","arxiv_id":"2505.16511","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-novel-neural-ode-model-for-the-state-of","title":"A novel Neural-ODE model for the state of health estimation of lithium-ion battery using charging curve","date":"2025-05-09","arxiv_id":"2505.05803","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantitative-flow-approximation-properties-of","title":"Quantitative Flow Approximation Properties of Narrow Neural ODEs","date":"2025-03-06","arxiv_id":"2503.04068","n_code_links":0,"syntology":null},{"paper":null,"slug":"polyconvex-physics-augmented-neural-network","title":"Polyconvex Physics-Augmented Neural Network Constitutive Models in Principal Stretches","date":"2025-03-01","arxiv_id":"2503.00575","n_code_links":0,"syntology":null},{"paper":null,"slug":"understanding-and-mitigating-membership","title":"Modeling Neural Networks with Privacy Using Neural Stochastic Differential Equations","date":"2025-01-12","arxiv_id":"2501.06686","n_code_links":0,"syntology":null},{"paper":null,"slug":"trendy-temporal-regression-of-effective-non","title":"TRENDy: Temporal Regression of Effective Nonlinear Dynamics","date":"2024-12-04","arxiv_id":"2412.03496","n_code_links":0,"syntology":null},{"paper":"/paper/accelerating-quantum-emitter-characterization","slug":"accelerating-quantum-emitter-characterization","title":"Accelerating Quantum Emitter Characterization with Latent Neural Ordinary Differential Equations","date":"2024-11-17","arxiv_id":"2411.11191","n_code_links":1,"syntology":null},{"paper":null,"slug":"identification-of-power-systems-with-droop","title":"Identification of Power Systems with Droop-Controlled Units Using Neural Ordinary Differential Equations","date":"2024-11-13","arxiv_id":"2411.08678","n_code_links":0,"syntology":null},{"paper":"/paper/optimising-neural-fractional-differential","slug":"optimising-neural-fractional-differential","title":"Optimising Neural Fractional Differential Equations for Performance and Efficiency","date":"2024-10-20","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"lyapunov-neural-ode-feedback-control-policies","title":"Lyapunov Neural ODE State-Feedback Control Policies","date":"2024-08-31","arxiv_id":"2409.00393","n_code_links":0,"syntology":null},{"paper":null,"slug":"divide-and-conquer-learning-chaotic-dynamical","title":"Divide And Conquer: Learning Chaotic Dynamical Systems With Multistep Penalty Neural Ordinary Differential Equations","date":"2024-06-30","arxiv_id":"2407.00568","n_code_links":0,"syntology":null},{"paper":null,"slug":"forecasting-with-an-n-dimensional-langevin","title":"Forecasting with an N-dimensional Langevin Equation and a Neural-Ordinary Differential Equation","date":"2024-05-12","arxiv_id":"2405.07359","n_code_links":0,"syntology":null},{"paper":null,"slug":"latim-longitudinal-representation-learning-in","title":"LaTiM: Longitudinal representation learning in continuous-time models to predict disease progression","date":"2024-04-10","arxiv_id":"2404.07091","n_code_links":0,"syntology":null},{"paper":null,"slug":"semi-supervised-learning-of-dynamical-systems","title":"Semi-Supervised Learning of Dynamical Systems with Neural Ordinary Differential Equations: A Teacher-Student Model Approach","date":"2023-10-19","arxiv_id":"2310.13110","n_code_links":0,"syntology":null},{"paper":null,"slug":"lmt-longitudinal-mixing-training-a-framework","title":"LMT: Longitudinal Mixing Training, a Framework to Predict Disease Progression from a Single Image","date":"2023-10-16","arxiv_id":"2310.10420","n_code_links":0,"syntology":null},{"paper":null,"slug":"longitudinal-self-supervised-learning-using","title":"Longitudinal Self-supervised Learning Using Neural Ordinary Differential Equation","date":"2023-10-16","arxiv_id":"2310.10431","n_code_links":0,"syntology":null},{"paper":null,"slug":"asv-station-keeping-under-wind-disturbances","title":"ASV Station Keeping under Wind Disturbances using Neural Network Simulation Error Minimization Model Predictive Control","date":"2023-10-11","arxiv_id":"2310.07892","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-hyperelasticity-with-physics","title":"Generative Hyperelasticity with Physics-Informed Probabilistic Diffusion Fields","date":"2023-09-11","arxiv_id":"2310.03745","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-low-dimensional-dynamics-from-whole","title":"Learning low-dimensional dynamics from whole-brain data improves task capture","date":"2023-05-18","arxiv_id":"2305.14369","n_code_links":0,"syntology":null},{"paper":"/paper/node-imgnet-a-pde-informed-effective-and","slug":"node-imgnet-a-pde-informed-effective-and","title":"NODE-ImgNet: a PDE-informed effective and robust model for image denoising","date":"2023-05-18","arxiv_id":"2305.11049","n_code_links":1,"syntology":null},{"paper":null,"slug":"using-neural-ordinary-differential-equations","title":"Using neural ordinary differential equations to predict complex ecological dynamics from population density data","date":"2023-04-29","arxiv_id":"2305.00338","n_code_links":0,"syntology":null},{"paper":"/paper/ltc-se-expanding-the-potential-of-liquid-time","slug":"ltc-se-expanding-the-potential-of-liquid-time","title":"LTC-SE: Expanding the Potential of Liquid Time-Constant Neural Networks for Scalable AI and Embedded Systems","date":"2023-04-18","arxiv_id":"2304.08691","n_code_links":1,"syntology":null},{"paper":"/paper/modulated-neural-odes-1","slug":"modulated-neural-odes-1","title":"Modulated Neural ODEs","date":"2023-02-26","arxiv_id":"2302.13262","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-subgrid-scale-models-with-neural","title":"Learning Subgrid-scale Models with Neural Ordinary Differential Equations","date":"2022-12-20","arxiv_id":"2212.09967","n_code_links":0,"syntology":null},{"paper":"/paper/expressive-architectures-enhance","slug":"expressive-architectures-enhance","title":"Expressive architectures enhance interpretability of dynamics-based neural population models","date":"2022-12-07","arxiv_id":"2212.03771","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":7,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["snel-repo/expressive-latent-dynamics-paper"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/gread-graph-neural-reaction-diffusion","slug":"gread-graph-neural-reaction-diffusion","title":"GREAD: Graph Neural Reaction-Diffusion Networks","date":"2022-11-25","arxiv_id":"2211.14208","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":6,"n_instrument":3,"unverified":1,"pointer_only":4,"phrase":"9 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; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":null,"slug":"physically-consistent-neural-odes-for","title":"Physically Consistent Neural ODEs for Learning Multi-Physics Systems","date":"2022-11-11","arxiv_id":"2211.06130","n_code_links":0,"syntology":null},{"paper":"/paper/fi-ode-certified-and-robust-forward","slug":"fi-ode-certified-and-robust-forward","title":"FI-ODE: Certifiably Robust Forward Invariance in Neural ODEs","date":"2022-10-30","arxiv_id":"2210.16940","n_code_links":1,"syntology":null},{"paper":null,"slug":"enhancing-the-inductive-biases-of-graph","title":"Enhancing the Inductive Biases of Graph Neural ODE for Modeling Dynamical Systems","date":"2022-09-22","arxiv_id":"2209.10740","n_code_links":0,"syntology":null},{"paper":"/paper/fast-fitting-of-neural-ordinary-differential","slug":"fast-fitting-of-neural-ordinary-differential","title":"Fast fitting of neural ordinary differential equations by Bayesian neural gradient matching to infer ecological interactions from time series data","date":"2022-09-13","arxiv_id":"2209.06184","n_code_links":1,"syntology":null},{"paper":"/paper/prediction-based-one-shot-dynamic-parking","slug":"prediction-based-one-shot-dynamic-parking","title":"Prediction-based One-shot Dynamic Parking Pricing","date":"2022-08-30","arxiv_id":"2208.14231","n_code_links":2,"syntology":null},{"paper":null,"slug":"learning-via-nonlinear-conjugate-gradients","title":"Learning via nonlinear conjugate gradients and depth-varying neural ODEs","date":"2022-02-11","arxiv_id":"2202.05766","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":0,"n_instrument":4,"unverified":0,"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","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"]}}},{"paper":"/paper/generative-time-series-models-using-neural","slug":"generative-time-series-models-using-neural","title":"Generative time series models using Neural ODE in Variational Autoencoders","date":"2022-01-12","arxiv_id":"2201.04630","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-robustness-and-uncertainty","title":"Improving Robustness and Uncertainty Modelling in Neural Ordinary Differential Equations","date":"2021-12-23","arxiv_id":"2112.12707","n_code_links":0,"syntology":null},{"paper":null,"slug":"latent-time-neural-ordinary-differential","title":"Latent Time Neural Ordinary Differential Equations","date":"2021-12-23","arxiv_id":"2112.12728","n_code_links":0,"syntology":null},{"paper":"/paper/graph-neural-controlled-differential","slug":"graph-neural-controlled-differential","title":"Graph Neural Controlled Differential Equations for Traffic Forecasting","date":"2021-12-07","arxiv_id":"2112.03558","n_code_links":1,"syntology":null},{"paper":null,"slug":"characteristic-neural-ordinary-differential","title":"Characteristic Neural Ordinary Differential Equations","date":"2021-11-25","arxiv_id":"2111.13207","n_code_links":0,"syntology":null},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/pytorch-tabular-a-framework-for-deep-learning","slug":"pytorch-tabular-a-framework-for-deep-learning","title":"PyTorch Tabular: A Framework for Deep Learning with Tabular Data","date":"2021-04-28","arxiv_id":"2104.13638","n_code_links":1,"syntology":null},{"paper":"/paper/neural-oblivious-decision-ensembles-for-deep","slug":"neural-oblivious-decision-ensembles-for-deep","title":"Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data","date":"2019-09-13","arxiv_id":"1909.06312","n_code_links":5,"syntology":{"ran":2,"of":7,"n_ran_checked":1,"n_instrument":1,"unverified":5,"pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["Qwicen/node","anonICLR2020/node"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}}],"papers_shown":42,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":42,"with_a_code_link":16,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":42,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/node/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/node/papers/ran/1","json":"/method/node/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/time-series-1","name":"Time Series","papers":5},{"task":"/task/image-classification","name":"Image Classification","papers":4},{"task":"/task/image-classification","name":"image-classification","papers":4},{"task":"/task/adversarial-robustness","name":"Adversarial Robustness","papers":2},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":2},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":2},{"task":"/task/deep-learning","name":"Deep Learning","papers":2},{"task":"/task/density-estimation","name":"Density Estimation","papers":2},{"task":"/task/model-selection","name":"Model Selection","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":2},{"task":"/task/spatio-temporal-forecasting","name":"Spatio-Temporal Forecasting","papers":2},{"task":"/task/time-series","name":"Time Series Analysis","papers":2},{"task":"/task/variational-inference","name":"Variational Inference","papers":2},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/collaborative-filtering","name":"Collaborative Filtering","papers":1},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/decision-making","name":"Decision Making","papers":1},{"task":"/task/denoising","name":"Denoising","papers":1}],"tasks_shown":20,"n_tasks":43,"usage_by_year":[{"year":"2019","papers":1},{"year":"2021","papers":6},{"year":"2022","papers":11},{"year":"2023","papers":10},{"year":"2024","papers":8},{"year":"2025","papers":6}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/node"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=NODE","read_at":"2026-10-05T00:59:41+00:00","query":"NODE","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"NODE","origin_arxiv_id":"2102.02248"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"different_paper","archive_paper_arxiv_id":"1909.06312","repositories":{"listed":1,"in_graph":1,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"contested","may_be_wrong_sense":false,"bearers_found":2,"served":{"arxiv_id":"2102.02248","citations":20},"leading_other_bearer":{"arxiv_id":"1909.05249","title":"NODE: Extreme Low Light Raw Image Denoising using a Noise Decomposition Network","citations":10,"named_by":["title_prefix"],"bearer_name":"NODE: Extreme Low Light Raw Image Denoising using a Noise Decomposition Network","ask_with":"have('1909.05249')"},"n_other_bearers_listed":1,"note":"1 other thing(s) here are also called 'NODE', and none of them is cited more than the paper this answer is about. They are listed in `also_named` -- check `served.arxiv_id` is the paper you meant."},"name_competition_text":null,"near_matches":null,"code_nearby":[{"name":"NODE-GA 2 M","relation":"shares_name_tokens","relation_means":"shares name tokens with this name; a different method","level":3,"retrieve_with":"get_reference_implementation(name='NODE-GA 2 M')","origin_arxiv_id":"2106.01613"}],"code_nearby_caption":"Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.","origin_paper":{"arxiv_id":"2102.02248","page":"/paper/reduced-order-model-for-fluid-flows-via","syntology_url":"https://syntology.ai/paper/2102.02248","in_graph_layer":true,"samples":2,"ran":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"about another paper, arXiv:2102.02248: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: official). About another paper: this answer is about arXiv:2102.02248, while the archive credits arXiv:1909.06312.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"c586e822c1ec1c9bd84baa0e2de7038238bd73db909ee3a0e1045ed2856d8bf7","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}