{"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/remove-mean","entry":"remove_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":8,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":8,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":0,"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":"2606.27361","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27361","title":"Autoregressive Boltzmann Generators","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"danyalrehman/autobg","path":"src/models/utils.py","file_url":"https://github.com/danyalrehman/autobg/blob/HEAD/src/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, danyalrehman/autobg when it was checked","code_sha256":"cfb922542fc1b6d0","code_sha256_prefix":"cfb922542fc1b6d0","mcp_get_code":{"code_sha256":"cfb922542fc1b6d0"}},{"arxiv_id":"2509.01486","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-01486","title":"Prior-Guided Flow Matching for Target-Aware Molecule Design with Learnable Atom Number","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"CMACH508/PAFlow","path":"models/utils.py","file_url":"https://github.com/CMACH508/PAFlow/blob/HEAD/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CMACH508/PAFlow when it was checked","code_sha256":"cfb922542fc1b6d0","code_sha256_prefix":"cfb922542fc1b6d0","mcp_get_code":{"code_sha256":"cfb922542fc1b6d0"}},{"arxiv_id":"2410.12456","arxiv_id_is_arxiv":true,"paper":"/paper/training-neural-samplers-with-reverse","title":"Training Neural Samplers with Reverse Diffusive KL Divergence","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiajunhe98/DiKL","path":"DiKL/models/dm_utils.py","file_url":"https://github.com/jiajunhe98/DiKL/blob/HEAD/DiKL/models/dm_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63616b709d7b674","code_sha256_prefix":"e63616b709d7b674","mcp_get_code":{"code_sha256":"e63616b709d7b674"}},{"arxiv_id":"2406.10581","arxiv_id_is_arxiv":true,"paper":"/paper/crossfuse-a-novel-cross-attention-mechanism","title":"CrossFuse: A Novel Cross Attention Mechanism based Infrared and Visible Image Fusion Approach","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hli1221/crossfuse","path":"network/net_conv_trans.py","file_url":"https://github.com/hli1221/crossfuse/blob/HEAD/network/net_conv_trans.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hli1221/crossfuse when it was checked","code_sha256":"8a9611e04d25c156","code_sha256_prefix":"8a9611e04d25c156","mcp_get_code":{"code_sha256":"8a9611e04d25c156"}},{"arxiv_id":"2405.15252","arxiv_id_is_arxiv":true,"paper":"/paper/fast-3d-molecule-generation-via-unified","title":"Fast 3D Molecule Generation via Unified Geometric Optimal Transport","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokaiHong/GOAT","path":"models/goat.py","file_url":"https://github.com/HaokaiHong/GOAT/blob/HEAD/models/goat.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, HaokaiHong/GOAT when it was checked","code_sha256":"cfb922542fc1b6d0","code_sha256_prefix":"cfb922542fc1b6d0","mcp_get_code":{"code_sha256":"cfb922542fc1b6d0"}},{"arxiv_id":"2402.06121","arxiv_id_is_arxiv":true,"paper":"/paper/iterated-denoising-energy-matching-for","title":"Iterated Denoising Energy Matching for Sampling from Boltzmann Densities","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jarridrb/dem","path":"dem/models/components/sde_integration.py","file_url":"https://github.com/jarridrb/dem/blob/HEAD/dem/models/components/sde_integration.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63616b709d7b674","code_sha256_prefix":"e63616b709d7b674","mcp_get_code":{"code_sha256":"e63616b709d7b674"}},{"arxiv_id":"2203.17003","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-diffusion-for-molecule-generation","title":"Equivariant Diffusion for Molecule Generation in 3D","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ehoogeboom/e3_diffusion_for_molecules","path":"equivariant_diffusion/utils.py","file_url":"https://github.com/ehoogeboom/e3_diffusion_for_molecules/blob/HEAD/equivariant_diffusion/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from HaokaiHong/GOAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"cfb922542fc1b6d0","code_sha256_prefix":"cfb922542fc1b6d0","mcp_get_code":{"code_sha256":"cfb922542fc1b6d0"}},{"arxiv_id":"2105.09016","arxiv_id_is_arxiv":true,"paper":"/paper/e-n-equivariant-normalizing-flows-for","title":"E(n) Equivariant Normalizing Flows","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vgsatorras/en_flows","path":"flows/utils.py","file_url":"https://github.com/vgsatorras/en_flows/blob/HEAD/flows/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from HaokaiHong/GOAT, and GitHub detected no licence in that repository when it was checked","code_sha256":"cfb922542fc1b6d0","code_sha256_prefix":"cfb922542fc1b6d0","mcp_get_code":{"code_sha256":"cfb922542fc1b6d0"}}],"record_sha256":"813ebff4caf2f3f831628ca7b25c5d88d3bec17e2b569f029eeaa6ff130acf58","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}