{"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/root-mean-squared-error","entry":"root_mean_squared_error","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":6,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":2,"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":"2502.08470","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ad3b5265c0a28e5","code_sha256_prefix":"9ad3b5265c0a28e5","mcp_get_code":{"code_sha256":"9ad3b5265c0a28e5"}},{"arxiv_id":"2412.03949","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4f3638431507d425","code_sha256_prefix":"4f3638431507d425","mcp_get_code":{"code_sha256":"4f3638431507d425"}},{"arxiv_id":"2410.24222","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, andrade-stats/TrimmedMarginalLikelihoodGP (NOASSERTION)","code_sha256":"a13c53202405f060","code_sha256_prefix":"a13c53202405f060","mcp_get_code":{"code_sha256":"a13c53202405f060"}},{"arxiv_id":"2404.18209","arxiv_id_is_arxiv":true,"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_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":"567f06c8b9cd243a","code_sha256_prefix":"567f06c8b9cd243a","mcp_get_code":{"code_sha256":"567f06c8b9cd243a"}},{"arxiv_id":"2310.20082","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2ea0b67cf7e7952","code_sha256_prefix":"b2ea0b67cf7e7952","mcp_get_code":{"code_sha256":"b2ea0b67cf7e7952"}},{"arxiv_id":"2310.11527","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe40885c24416cd2","code_sha256_prefix":"fe40885c24416cd2","mcp_get_code":{"code_sha256":"fe40885c24416cd2"}}],"record_sha256":"b6ad42a09d10800b9dc1c3ac090d4f5cebc7b0046c945f00db090b274c7f9332","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}