{"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/scatter-mean","entry":"scatter_mean","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_fixture":0,"ran":2,"unverified":4},"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":"2602.05352","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05352","title":"Smoothness Errors in Dynamics Models and How to Avoid Them","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"EdwardBerman/rayleigh_analysis","path":"model/complex_global_mean_pool.py","file_url":"https://github.com/EdwardBerman/rayleigh_analysis/blob/HEAD/model/complex_global_mean_pool.py","status":"unverified","verification_level":0,"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, EdwardBerman/rayleigh_analysis when it was checked","code_sha256":"de1db25f3065b24e","code_sha256_prefix":"de1db25f3065b24e","mcp_get_code":{"code_sha256":"de1db25f3065b24e"}},{"arxiv_id":"2502.17019","arxiv_id_is_arxiv":true,"paper":"/paper/erwin-a-tree-based-hierarchical-transformer","title":"Erwin: A Tree-based Hierarchical Transformer for Large-scale Physical Systems","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxxxzdn/erwin","path":"models/erwin.py","file_url":"https://github.com/maxxxzdn/erwin/blob/HEAD/models/erwin.py","status":"ran_draft_wrong","verification_level":2,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, maxxxzdn/erwin when it was checked","code_sha256":"46d44c32c9264fb4","code_sha256_prefix":"46d44c32c9264fb4","mcp_get_code":{"code_sha256":"46d44c32c9264fb4"}},{"arxiv_id":"2412.10966","arxiv_id_is_arxiv":true,"paper":"/paper/flowdock-geometric-flow-matching-for","title":"FlowDock: Geometric Flow Matching for Generative Protein-Ligand Docking and Affinity Prediction","date":"2024-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioinfomachinelearning/posebench","path":"posebench/models/vina_inference.py","file_url":"https://github.com/bioinfomachinelearning/posebench/blob/HEAD/posebench/models/vina_inference.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":"bfc293012f5e6787","code_sha256_prefix":"bfc293012f5e6787","mcp_get_code":{"code_sha256":"bfc293012f5e6787"}},{"arxiv_id":"2405.15429","arxiv_id_is_arxiv":true,"paper":"/paper/e-n-equivariant-topological-neural-networks","title":"E(n) Equivariant Topological Neural Networks","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NSAPH-Projects/topological-equivariant-networks","path":"etnn/utils.py","file_url":"https://github.com/NSAPH-Projects/topological-equivariant-networks/blob/HEAD/etnn/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":"0a286a7c0173d4d3","code_sha256_prefix":"0a286a7c0173d4d3","mcp_get_code":{"code_sha256":"0a286a7c0173d4d3"}},{"arxiv_id":"2405.07915","arxiv_id_is_arxiv":true,"paper":"/paper/discovery-of-highly-anisotropic-dielectric","title":"Discovery of highly anisotropic dielectric crystals with equivariant graph neural networks","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"virtualatoms/AnisoNet","path":"src/anisonet/model.py","file_url":"https://github.com/virtualatoms/AnisoNet/blob/HEAD/src/anisonet/model.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":"649c35cc1d7d3563","code_sha256_prefix":"649c35cc1d7d3563","mcp_get_code":{"code_sha256":"649c35cc1d7d3563"}},{"arxiv_id":"2404.10935","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-relaxation-by-reverse-diffusion","title":"Molecular relaxation by reverse diffusion with time step prediction","date":"2024-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khaledkah/morered","path":"src/morered/utils.py","file_url":"https://github.com/khaledkah/morered/blob/HEAD/src/morered/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":"937d9551863a6d78","code_sha256_prefix":"937d9551863a6d78","mcp_get_code":{"code_sha256":"937d9551863a6d78"}},{"arxiv_id":"2304.02008","arxiv_id_is_arxiv":true,"paper":"/paper/gluestick-robust-image-matching-by-sticking","title":"GlueStick: Robust Image Matching by Sticking Points and Lines Together","date":"2023-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Golbstein/GlueStick-tensorflow","path":"gluestick.py","file_url":"https://github.com/Golbstein/GlueStick-tensorflow/blob/HEAD/gluestick.py","status":"unverified","verification_level":0,"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, Golbstein/GlueStick-tensorflow when it was checked","code_sha256":"403889105a73bc9b","code_sha256_prefix":"403889105a73bc9b","mcp_get_code":{"code_sha256":"403889105a73bc9b"}},{"arxiv_id":"2108.12630","arxiv_id_is_arxiv":true,"paper":"/paper/groupformer-group-activity-recognition-with","title":"GroupFormer: Group Activity Recognition with Clustered Spatial-Temporal Transformer","date":"2021-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xueyee/GroupFormer","path":"group/models/cluster_transformer.py","file_url":"https://github.com/xueyee/GroupFormer/blob/HEAD/group/models/cluster_transformer.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":"e437fa79b7c02bfb","code_sha256_prefix":"e437fa79b7c02bfb","mcp_get_code":{"code_sha256":"e437fa79b7c02bfb"}}],"record_sha256":"b64e0e4383697a0dd8ce4eb7fcf23d660cb9f73d797985a45abe70e679c024ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}