{"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/papers/ran/1","list_of":"/task/numerical-integration","task":"Numerical Integration","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,18],"of":18,"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":13,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":13,"listed_every_run_a_failure_of_syntologys_instrument":5,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/numerical-integration/papers/ran/1","prev":null,"next":null,"papers":[{"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/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":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/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":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/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":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 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":5,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"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/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/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/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/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/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/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/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/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/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/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/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/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"]}}}],"record_sha256":"363114f85b9ce777a6dbf7c33ec9ed740356aa014eec21745d49a5f793c8b2b6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}