{"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/energy","entry":"energy","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":1,"n_samples_unverified":5,"n_samples_fingerprinted":3,"n_places":14,"n_places_pointer_only":5,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":5},"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":"2605.15206","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-15206","title":"AgentStop: Terminating Local AI Agents Early to Save Energy in Consumer Devices","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"brave-experiments/AgentStop","path":"src/agentstop/profiler/analyze.py","file_url":"https://github.com/brave-experiments/AgentStop/blob/HEAD/src/agentstop/profiler/analyze.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":"b3c59e8451ab102a","code_sha256_prefix":"b3c59e8451ab102a","mcp_get_code":{"code_sha256":"b3c59e8451ab102a"}},{"arxiv_id":"2512.10401","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-10401","title":"Diffusion differentiable resampling","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"zgbkdlm/diffres","path":"demos/two_rings.py","file_url":"https://github.com/zgbkdlm/diffres/blob/HEAD/demos/two_rings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MPL-2.0, as GitHub detects it on this paper's repository, zgbkdlm/diffres, is not in the permissive set Syntology serves inline","code_sha256":"9e457c09d2d09e8e","code_sha256_prefix":"9e457c09d2d09e8e","mcp_get_code":{"code_sha256":"9e457c09d2d09e8e"}},{"arxiv_id":"2503.00325","arxiv_id_is_arxiv":true,"paper":"/paper/cadref-robust-out-of-distribution-detection","title":"CADRef: Robust Out-of-Distribution Detection via Class-Aware Decoupled Relative Feature Leveraging","date":"2025-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LingAndZero/CADRef","path":"ood_methods/CADRef.py","file_url":"https://github.com/LingAndZero/CADRef/blob/HEAD/ood_methods/CADRef.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf5c68239623ca3b","code_sha256_prefix":"cf5c68239623ca3b","mcp_get_code":{"code_sha256":"cf5c68239623ca3b"}},{"arxiv_id":"2410.06833","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-metastability-in-the-self-attention","title":"Dynamic metastability in the self-attention model","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugokoubbi/2024-transformers-dotm","path":"staircase.py","file_url":"https://github.com/hugokoubbi/2024-transformers-dotm/blob/HEAD/staircase.py","status":"ran","verification_level":1,"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, hugokoubbi/2024-transformers-dotm when it was checked","code_sha256":"2ef92153bd42f6f1","code_sha256_prefix":"2ef92153bd42f6f1","mcp_get_code":{"code_sha256":"2ef92153bd42f6f1"}},{"arxiv_id":"2310.01755","arxiv_id_is_arxiv":true,"paper":"/paper/imagenet-ood-deciphering-modern-out-of","title":"ImageNet-OOD: Deciphering Modern Out-of-Distribution Detection Algorithms","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princetonvisualai/imagenetood","path":"Detection/Baseline.py","file_url":"https://github.com/princetonvisualai/imagenetood/blob/HEAD/Detection/Baseline.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, princetonvisualai/imagenetood when it was checked","code_sha256":"2294112915d1cbd2","code_sha256_prefix":"2294112915d1cbd2","mcp_get_code":{"code_sha256":"2294112915d1cbd2"}},{"arxiv_id":"2304.11961","arxiv_id_is_arxiv":true,"paper":"/paper/towards-mode-balancing-of-generative-models","title":"Towards Mode Balancing of Generative Models via Diversity Weights","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sebastianberns/diversity-weights","path":"optimize.py","file_url":"https://github.com/sebastianberns/diversity-weights/blob/HEAD/optimize.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec78c66ded491d9e","code_sha256_prefix":"ec78c66ded491d9e","mcp_get_code":{"code_sha256":"ec78c66ded491d9e"}},{"arxiv_id":"2210.08122","arxiv_id_is_arxiv":true,"paper":"/paper/old-can-be-gold-better-gradient-flow-can-make","title":"Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gradientgcn","path":"models/GCN.py","file_url":"https://github.com/vita-group/gradientgcn/blob/HEAD/models/GCN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, vita-group/gradientgcn when it was checked","code_sha256":"5701520c223695f3","code_sha256_prefix":"5701520c223695f3","mcp_get_code":{"code_sha256":"5701520c223695f3"}},{"arxiv_id":"2210.08122","arxiv_id_is_arxiv":true,"paper":"/paper/old-can-be-gold-better-gradient-flow-can-make","title":"Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-group/gradientgcn","path":"rewire_model.py","file_url":"https://github.com/vita-group/gradientgcn/blob/HEAD/rewire_model.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, vita-group/gradientgcn when it was checked","code_sha256":"dc41ad7f75682a6d","code_sha256_prefix":"dc41ad7f75682a6d","mcp_get_code":{"code_sha256":"dc41ad7f75682a6d"}},{"arxiv_id":"2107.00848","arxiv_id_is_arxiv":true,"paper":"/paper/systematic-evaluation-of-causal-discovery-in-1","title":"Systematic Evaluation of Causal Discovery in Visual Model Based Reinforcement Learning","date":"2021-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dido1998/CausalMBRL","path":"cswm/models/losses.py","file_url":"https://github.com/dido1998/CausalMBRL/blob/HEAD/cswm/models/losses.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":"1dd9382c7e7b0741","code_sha256_prefix":"1dd9382c7e7b0741","mcp_get_code":{"code_sha256":"1dd9382c7e7b0741"}},{"arxiv_id":"2005.04857","arxiv_id_is_arxiv":true,"paper":"/paper/continuous-mixture-autoregressive-networks","title":"Continuous-mixture Autoregressive Networks for efficient variational calculation of many-body systems","date":null,"month_inferred_from_arxiv_id":"2020-05","title_source":"archive","repo":"Anguswlx/VAN2XY","path":"xy.py","file_url":"https://github.com/Anguswlx/VAN2XY/blob/HEAD/xy.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":"a9dcadeb4255a624","code_sha256_prefix":"a9dcadeb4255a624","mcp_get_code":{"code_sha256":"a9dcadeb4255a624"}},{"arxiv_id":"1812.09976","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-chemistry-in-the-age-of-quantum","title":"Quantum Chemistry in the Age of Quantum Computing","date":null,"month_inferred_from_arxiv_id":"2018-12","title_source":"archive","repo":"CDL-Quantum/CohortProject_2020","path":"Project_1_RBM_and_Tomography/Rydberg_energy_calculator.py","file_url":"https://github.com/CDL-Quantum/CohortProject_2020/blob/HEAD/Project_1_RBM_and_Tomography/Rydberg_energy_calculator.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":"3044b46a01b62f57","code_sha256_prefix":"3044b46a01b62f57","mcp_get_code":{"code_sha256":"3044b46a01b62f57"}},{"arxiv_id":"1809.10606","arxiv_id_is_arxiv":true,"paper":"/paper/solving-statistical-mechanics-using","title":"Solving Statistical Mechanics Using Variational Autoregressive Networks","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wdphy16/stat-mech-van","path":"src_ising/ising.py","file_url":"https://github.com/wdphy16/stat-mech-van/blob/HEAD/src_ising/ising.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":"77d5d3dc9aadf448","code_sha256_prefix":"77d5d3dc9aadf448","mcp_get_code":{"code_sha256":"77d5d3dc9aadf448"}},{"arxiv_id":"1008.3477","arxiv_id_is_arxiv":true,"paper":"/paper/the-density-matrix-renormalization-group-in","title":"The density-matrix renormalization group in the age of matrix product states","date":null,"month_inferred_from_arxiv_id":"2010-08","title_source":"archive","repo":"jhauschild/lecture_comp_methods","path":"1_monte_carlo/generate_data.py","file_url":"https://github.com/jhauschild/lecture_comp_methods/blob/HEAD/1_monte_carlo/generate_data.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":"72a436c67cae9821","code_sha256_prefix":"72a436c67cae9821","mcp_get_code":{"code_sha256":"72a436c67cae9821"}},{"arxiv_id":"1008.3477","arxiv_id_is_arxiv":true,"paper":"/paper/the-density-matrix-renormalization-group-in","title":"The density-matrix renormalization group in the age of matrix product states","date":null,"month_inferred_from_arxiv_id":"2010-08","title_source":"archive","repo":"jhauschild/lecture_comp_methods","path":"1_monte_carlo/metropolis.py","file_url":"https://github.com/jhauschild/lecture_comp_methods/blob/HEAD/1_monte_carlo/metropolis.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":"983f98c3a962d195","code_sha256_prefix":"983f98c3a962d195","mcp_get_code":{"code_sha256":"983f98c3a962d195"}}],"record_sha256":"0cc80ada71cddea34443ec9ae8d617650d24645354e0ede1bbe249097f91c141","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}