{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/root-mean-squared-error","entry":"root_mean_squared_error","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":5,"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":5,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"unverified":1},"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":"2502.08470","paper":"/paper/numerical-schemes-for-signature-kernels","title":"Numerical Schemes for Signature Kernels","date":"2025-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"francescopiatti/polysigkernel","path":"experiments/error_analysis.py","file_url":"https://github.com/francescopiatti/polysigkernel/blob/HEAD/experiments/error_analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9ad3b5265c0a28e5","mcp_get_code":{"code_sha256":"9ad3b5265c0a28e5"}},{"arxiv_id":"2412.03949","paper":"/paper/learning-speed-adaptive-walking-agent-using","title":"Learning Speed-Adaptive Walking Agent Using Imitation Learning with Physics-Informed Simulation","date":"2024-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MetaMobilityLabCMU/speed-adaptive-agent","path":"training/utils.py","file_url":"https://github.com/MetaMobilityLabCMU/speed-adaptive-agent/blob/HEAD/training/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4f3638431507d425","mcp_get_code":{"code_sha256":"4f3638431507d425"}},{"arxiv_id":"2410.24222","paper":"/paper/robust-gaussian-processes-via-relevance","title":"Robust Gaussian Processes via Relevance Pursuit","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrade-stats/TrimmedMarginalLikelihoodGP","path":"trimmedGP.py","file_url":"https://github.com/andrade-stats/TrimmedMarginalLikelihoodGP/blob/HEAD/trimmedGP.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"a13c53202405f060","mcp_get_code":{"code_sha256":"a13c53202405f060"}},{"arxiv_id":"2404.18209","paper":"/paper/4dbinfer-a-4d-benchmarking-toolbox-for-graph","title":"4DBInfer: A 4D Benchmarking Toolbox for Graph-Centric Predictive Modeling on Relational DBs","date":"2024-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"awslabs/multi-table-benchmark","path":"dbinfer/evaluator.py","file_url":"https://github.com/awslabs/multi-table-benchmark/blob/HEAD/dbinfer/evaluator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"567f06c8b9cd243a","mcp_get_code":{"code_sha256":"567f06c8b9cd243a"}},{"arxiv_id":"2310.20082","paper":"/paper/efficient-subgraph-gnns-by-learning-effective","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beabevi/policy-learn","path":"utils.py","file_url":"https://github.com/beabevi/policy-learn/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b2ea0b67cf7e7952","mcp_get_code":{"code_sha256":"b2ea0b67cf7e7952"}},{"arxiv_id":"2310.11527","paper":"/paper/thin-and-deep-gaussian-processes-1","title":"Thin and Deep Gaussian Processes","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spectraldani/thindeepgps","path":"tdgplib/metrics.py","file_url":"https://github.com/spectraldani/thindeepgps/blob/HEAD/tdgplib/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"fe40885c24416cd2","mcp_get_code":{"code_sha256":"fe40885c24416cd2"}}]}