{"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/leapfrog","entry":"leapfrog","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":3,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":3,"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":3,"ran_fixture":0,"ran":6,"unverified":1},"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":"2603.13501","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-13501","title":"Standard Acquisition Is Sufficient for Asynchronous Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"yucenli/bnn-bo","path":"models/hmc_utils.py","file_url":"https://github.com/yucenli/bnn-bo/blob/HEAD/models/hmc_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yucenli/bnn-bo when it was checked","code_sha256":"0b887bbcc246b6ca","code_sha256_prefix":"0b887bbcc246b6ca","mcp_get_code":{"code_sha256":"0b887bbcc246b6ca"}},{"arxiv_id":"2410.14488","arxiv_id_is_arxiv":true,"paper":"/paper/ant-adaptive-noise-schedule-for-time-series","title":"ANT: Adaptive Noise Schedule for Time Series Diffusion Models","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seunghan96/ANT","path":"src/ANT/sampler/_base.py","file_url":"https://github.com/seunghan96/ANT/blob/HEAD/src/ANT/sampler/_base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, seunghan96/ANT when it was checked","code_sha256":"10ca8329925e4364","code_sha256_prefix":"10ca8329925e4364","mcp_get_code":{"code_sha256":"10ca8329925e4364"}},{"arxiv_id":"2107.00745","arxiv_id_is_arxiv":true,"paper":"/paper/q-paths-generalizing-the-geometric-annealing","title":"q-Paths: Generalizing the Geometric Annealing Path using Power Means","date":"2021-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vmasrani/qpaths_uai_2021","path":"toy/src/hmc.py","file_url":"https://github.com/vmasrani/qpaths_uai_2021/blob/HEAD/toy/src/hmc.py","status":"ran","verification_level":1,"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":"7322057dc47258d9","code_sha256_prefix":"7322057dc47258d9","mcp_get_code":{"code_sha256":"7322057dc47258d9"}},{"arxiv_id":"2103.01133","arxiv_id_is_arxiv":true,"paper":"/paper/posterior-meta-replay-for-continual-learning","title":"Posterior Meta-Replay for Continual Learning","date":"2021-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chrhenning/hypnettorch","path":"hypnettorch/utils/hmc.py","file_url":"https://github.com/chrhenning/hypnettorch/blob/HEAD/hypnettorch/utils/hmc.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":"797f157d213d455a","code_sha256_prefix":"797f157d213d455a","mcp_get_code":{"code_sha256":"797f157d213d455a"}},{"arxiv_id":"2010.06948","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-graph-networks-for-particle","title":"Scalable Graph Networks for Particle Simulations","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarolisMart/scalable-gnns","path":"data.py","file_url":"https://github.com/KarolisMart/scalable-gnns/blob/HEAD/data.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":"d76fb96738dbf8eb","code_sha256_prefix":"d76fb96738dbf8eb","mcp_get_code":{"code_sha256":"d76fb96738dbf8eb"}},{"arxiv_id":"1909.13334","arxiv_id_is_arxiv":true,"paper":"/paper/symplectic-recurrent-neural-networks","title":"Symplectic Recurrent Neural Networks","date":"2019-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengdao-chen/SRNN","path":"src/model.py","file_url":"https://github.com/zhengdao-chen/SRNN/blob/HEAD/src/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, zhengdao-chen/SRNN (NOASSERTION)","code_sha256":"5c7729b5ee30fdbb","code_sha256_prefix":"5c7729b5ee30fdbb","mcp_get_code":{"code_sha256":"5c7729b5ee30fdbb"}},{"arxiv_id":"1810.04449","arxiv_id_is_arxiv":true,"paper":"/paper/faster-hamiltonian-monte-carlo-by-learning","title":"Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"ColCarroll/minimc","path":"minimc/integrators.py","file_url":"https://github.com/ColCarroll/minimc/blob/HEAD/minimc/integrators.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":"8c7daf41b019b35c","code_sha256_prefix":"8c7daf41b019b35c","mcp_get_code":{"code_sha256":"8c7daf41b019b35c"}},{"arxiv_id":"1810.04449","arxiv_id_is_arxiv":true,"paper":"/paper/faster-hamiltonian-monte-carlo-by-learning","title":"Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"ColCarroll/minimc","path":"minimc/integrators_slow.py","file_url":"https://github.com/ColCarroll/minimc/blob/HEAD/minimc/integrators_slow.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":"8b79297cb1169fd5","code_sha256_prefix":"8b79297cb1169fd5","mcp_get_code":{"code_sha256":"8b79297cb1169fd5"}},{"arxiv_id":"1711.05363","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-conditional-exponential-family","title":"Kernel Conditional Exponential Family","date":"2017-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/KCEF","path":"KCEF/sampler/hmc.py","file_url":"https://github.com/MichaelArbel/KCEF/blob/HEAD/KCEF/sampler/hmc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c764cff71d22a7d","code_sha256_prefix":"6c764cff71d22a7d","mcp_get_code":{"code_sha256":"6c764cff71d22a7d"}},{"arxiv_id":"1506.02564","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-free-hamiltonian-monte-carlo-with","title":"Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Families","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karlnapf/kernel_hmc","path":"kernel_hmc/hamiltonian/leapfrog.py","file_url":"https://github.com/karlnapf/kernel_hmc/blob/HEAD/kernel_hmc/hamiltonian/leapfrog.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6c764cff71d22a7d","code_sha256_prefix":"6c764cff71d22a7d","mcp_get_code":{"code_sha256":"6c764cff71d22a7d"}},{"arxiv_id":"1111.4246","arxiv_id_is_arxiv":true,"paper":"/paper/the-no-u-turn-sampler-adaptively-setting-path","title":"The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo","date":"2011-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mfouesneau/NUTS","path":"nuts/nuts.py","file_url":"https://github.com/mfouesneau/NUTS/blob/HEAD/nuts/nuts.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7475a1db9181c908","code_sha256_prefix":"7475a1db9181c908","mcp_get_code":{"code_sha256":"7475a1db9181c908"}}],"record_sha256":"8c27581e3cafefaa91a26f292b4c56e1f68a9e103932616f9515252073c3ae2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}