{"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/euler-step","entry":"euler_step","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"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":2,"ran_fixture":0,"ran":3,"unverified":0},"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":"2608.13215","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-13215","title":"History-informed Lagrangian Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"yingtian22/History-informed-LNN","path":"src/models/hilnn.py","file_url":"https://github.com/yingtian22/History-informed-LNN/blob/HEAD/src/models/hilnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c4472cd0e3b92770","code_sha256_prefix":"c4472cd0e3b92770","mcp_get_code":{"code_sha256":"c4472cd0e3b92770"}},{"arxiv_id":"2608.08638","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08638","title":"CuteTTS: Efficient and High-Quality Speech Synthesis via Autoregressive Modeling of Continuous Latents","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"OPPO-Mente-Lab/CuteTTS","path":"src/cutetts/modeling/model.py","file_url":"https://github.com/OPPO-Mente-Lab/CuteTTS/blob/HEAD/src/cutetts/modeling/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"18f99b938b96e2b6","code_sha256_prefix":"18f99b938b96e2b6","mcp_get_code":{"code_sha256":"18f99b938b96e2b6"}},{"arxiv_id":"2307.05439","arxiv_id_is_arxiv":true,"paper":"/paper/metropolis-sampling-for-constrained-diffusion","title":"Metropolis Sampling for Constrained Diffusion Models","date":"2023-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oxcsml/geomstats","path":"geomstats/integrator.py","file_url":"https://github.com/oxcsml/geomstats/blob/HEAD/geomstats/integrator.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":"01c0388601d634d0","code_sha256_prefix":"01c0388601d634d0","mcp_get_code":{"code_sha256":"01c0388601d634d0"}},{"arxiv_id":"2211.06972","arxiv_id_is_arxiv":true,"paper":"/paper/experimental-study-of-neural-ode-training","title":"Experimental study of Neural ODE training with adaptive solver for dynamical systems modeling","date":"2022-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allauzen/adaptive-step-size-neural-ode","path":"ode_utils.py","file_url":"https://github.com/allauzen/adaptive-step-size-neural-ode/blob/HEAD/ode_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":"50d6dd11295c4d19","code_sha256_prefix":"50d6dd11295c4d19","mcp_get_code":{"code_sha256":"50d6dd11295c4d19"}},{"arxiv_id":"2206.09048","arxiv_id_is_arxiv":true,"paper":"/paper/iclr-2022-challenge-for-computational","title":"ICLR 2022 Challenge for Computational Geometry and Topology: Design and Results","date":null,"month_inferred_from_arxiv_id":"2022-06","title_source":"archive","repo":"geomstats/geomstats","path":"geomstats/integrator.py","file_url":"https://github.com/geomstats/geomstats/blob/HEAD/geomstats/integrator.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":"3c96f9098ade9983","code_sha256_prefix":"3c96f9098ade9983","mcp_get_code":{"code_sha256":"3c96f9098ade9983"}}],"record_sha256":"fc659ad53181408b4595328139a84a2c51eff1cc3b7acab6d2ed86102c4d58cd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}