{"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":"/code/rk4","entry":"rk4","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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)"},"n_papers":7,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":0,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"key_notes":{"n_samples_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_samples_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":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2309.00983","arxiv_id_is_arxiv":true,"paper":"/paper/an-ensemble-score-filter-for-tracking-high","title":"An Ensemble Score Filter for Tracking High-Dimensional Nonlinear Dynamical Systems","date":"2023-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zezhongzhang/ensf","path":"ScoreFilter/utils.py","file_url":"https://github.com/zezhongzhang/ensf/blob/HEAD/ScoreFilter/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd5289b5991ad6a1","code_sha256_prefix":"dd5289b5991ad6a1","mcp_get_code":{"code_sha256":"dd5289b5991ad6a1"}},{"arxiv_id":"2305.16215","arxiv_id_is_arxiv":true,"paper":"/paper/koopman-kernel-regression-1","title":"Koopman Kernel Regression","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TUM-ITR/koopcore","path":"koopcore/auxilliary/dynamical_systems.py","file_url":"https://github.com/TUM-ITR/koopcore/blob/HEAD/koopcore/auxilliary/dynamical_systems.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f6b71302a6d554f3","code_sha256_prefix":"f6b71302a6d554f3","mcp_get_code":{"code_sha256":"f6b71302a6d554f3"}},{"arxiv_id":"2107.08024","arxiv_id_is_arxiv":true,"paper":"/paper/port-hamiltonian-neural-networks-for-learning","title":"Port-Hamiltonian Neural Networks for Learning Explicit Time-Dependent Dynamical Systems","date":"2021-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaandesai1/PortHNN","path":"utils.py","file_url":"https://github.com/shaandesai1/PortHNN/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1235761bb975f44c","code_sha256_prefix":"1235761bb975f44c","mcp_get_code":{"code_sha256":"1235761bb975f44c"}},{"arxiv_id":"2004.13688","arxiv_id_is_arxiv":true,"paper":"/paper/vign-variational-integrator-graph-networks","title":"Variational Integrator Graph Networks for Learning Energy Conserving Dynamical Systems","date":"2020-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaandesai1/VIGN","path":"utils.py","file_url":"https://github.com/shaandesai1/VIGN/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1235761bb975f44c","code_sha256_prefix":"1235761bb975f44c","mcp_get_code":{"code_sha256":"1235761bb975f44c"}},{"arxiv_id":"2002.06836","arxiv_id_is_arxiv":true,"paper":"/paper/control-frequency-adaptation-via-action","title":"Control Frequency Adaptation via Action Persistence in Batch Reinforcement Learning","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albertometelli/pfqi","path":"trlib/environments/acrobot_multitask.py","file_url":"https://github.com/albertometelli/pfqi/blob/HEAD/trlib/environments/acrobot_multitask.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f484ea31b437dd66","code_sha256_prefix":"f484ea31b437dd66","mcp_get_code":{"code_sha256":"f484ea31b437dd66"}},{"arxiv_id":"1906.01563","arxiv_id_is_arxiv":true,"paper":"/paper/hamiltonian-neural-networks","title":"Hamiltonian Neural Networks","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"greydanus/hamiltonian-nn","path":"hnn.py","file_url":"https://github.com/greydanus/hamiltonian-nn/blob/HEAD/hnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17a5fed7d8573e71","code_sha256_prefix":"17a5fed7d8573e71","mcp_get_code":{"code_sha256":"17a5fed7d8573e71"}},{"arxiv_id":"1810.09103","arxiv_id_is_arxiv":true,"paper":"/paper/actor-expert-a-framework-for-using-action","title":"Greedy Actor-Critic: A New Conditional Cross-Entropy Method for Policy Improvement","date":"2018-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelfneumann/greedyac","path":"env/Acrobot.py","file_url":"https://github.com/samuelfneumann/greedyac/blob/HEAD/env/Acrobot.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"849841b638e7d288","code_sha256_prefix":"849841b638e7d288","mcp_get_code":{"code_sha256":"849841b638e7d288"}}],"record_sha256":"e954e582dbab2de6868aa6468c6dcd596040c3d036e19a07333ea90028d18374","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}