{"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/rel-err","entry":"rel_err","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":7,"n_papers_ran_no_instrument_failure":7,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":8,"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":4,"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":"2311.07143","arxiv_id_is_arxiv":true,"paper":"/paper/learning-symmetrization-for-equivariance-with","title":"Learning Symmetrization for Equivariance with Orbit Distance Minimization","date":"2023-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tiendatnguyen-vision/orbit-symmetrize","path":"RotatedMNIST/LPS_orbit/emlp-pytorch/emlp_pytorch/groups.py","file_url":"https://github.com/tiendatnguyen-vision/orbit-symmetrize/blob/HEAD/RotatedMNIST/LPS_orbit/emlp-pytorch/emlp_pytorch/groups.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":"71640ef09311bdf6","code_sha256_prefix":"71640ef09311bdf6","mcp_get_code":{"code_sha256":"71640ef09311bdf6"}},{"arxiv_id":"2306.06327","arxiv_id_is_arxiv":true,"paper":"/paper/any-dimensional-equivariant-neural-networks","title":"Any-dimensional equivariant neural networks","date":"2023-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mateodd25/free-nets","path":"emlp/groups.py","file_url":"https://github.com/mateodd25/free-nets/blob/HEAD/emlp/groups.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":"b9e669d60e5fb206","code_sha256_prefix":"b9e669d60e5fb206","mcp_get_code":{"code_sha256":"b9e669d60e5fb206"}},{"arxiv_id":"2204.00887","arxiv_id_is_arxiv":true,"paper":"/paper/dimensionless-machine-learning-imposing-exact","title":"Dimensionless machine learning: Imposing exact units equivariance","date":"2022-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weichiyao/scalaremlp","path":"scalaremlp/groups.py","file_url":"https://github.com/weichiyao/scalaremlp/blob/HEAD/scalaremlp/groups.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":"b9e669d60e5fb206","code_sha256_prefix":"b9e669d60e5fb206","mcp_get_code":{"code_sha256":"b9e669d60e5fb206"}},{"arxiv_id":"2106.06695","arxiv_id_is_arxiv":true,"paper":"/paper/skiing-on-simplices-kernel-interpolation-on","title":"SKIing on Simplices: Kernel Interpolation on the Permutohedral Lattice for Scalable Gaussian Processes","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/simplex-gp","path":"experiments/mvm_err.py","file_url":"https://github.com/activatedgeek/simplex-gp/blob/HEAD/experiments/mvm_err.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":"01f8d06eb16ad4d5","code_sha256_prefix":"01f8d06eb16ad4d5","mcp_get_code":{"code_sha256":"01f8d06eb16ad4d5"}},{"arxiv_id":"2106.06610","arxiv_id_is_arxiv":true,"paper":"/paper/scalars-are-universal-gauge-equivariant","title":"Scalars are universal: Equivariant machine learning, structured like classical physics","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"researchworking/scalaremlp","path":"scalaremlp/groups.py","file_url":"https://github.com/researchworking/scalaremlp/blob/HEAD/scalaremlp/groups.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":"b9e669d60e5fb206","code_sha256_prefix":"b9e669d60e5fb206","mcp_get_code":{"code_sha256":"b9e669d60e5fb206"}},{"arxiv_id":"2104.09459","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-method-for-constructing","title":"A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mfinzi/equivariant-MLP","path":"emlp/groups.py","file_url":"https://github.com/mfinzi/equivariant-MLP/blob/HEAD/emlp/groups.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":"b9e669d60e5fb206","code_sha256_prefix":"b9e669d60e5fb206","mcp_get_code":{"code_sha256":"b9e669d60e5fb206"}},{"arxiv_id":"2104.09459","arxiv_id_is_arxiv":true,"paper":"/paper/a-practical-method-for-constructing","title":"A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mfinzi/equivariant-MLP","path":"experiments/trainer/model_trainer.py","file_url":"https://github.com/mfinzi/equivariant-MLP/blob/HEAD/experiments/trainer/model_trainer.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":"f1110180942acd6b","code_sha256_prefix":"f1110180942acd6b","mcp_get_code":{"code_sha256":"f1110180942acd6b"}},{"arxiv_id":"1910.01465","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-overestimation-bias-in-multi-agent","title":"Reducing Overestimation Bias in Multi-Agent Domains Using Double Centralized Critics","date":"2019-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fdcl-gwu/gym-rotor","path":"algos/emlp_torch/groups.py","file_url":"https://github.com/fdcl-gwu/gym-rotor/blob/HEAD/algos/emlp_torch/groups.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":"71640ef09311bdf6","code_sha256_prefix":"71640ef09311bdf6","mcp_get_code":{"code_sha256":"71640ef09311bdf6"}}],"record_sha256":"916a8cfad997b794d15fc90037bc591da0fb0d0c1928afa02bd2522d8f11f473","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}