{"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/uniform-init","entry":"uniform_init","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":4,"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":3,"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":"2512.04341","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-04341","title":"Long-Horizon Model-Based Offline Reinforcement Learning Without Explicit Conservatism","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Howuhh/sac-n-jax","path":"sac_n_jax_flax.py","file_url":"https://github.com/Howuhh/sac-n-jax/blob/HEAD/sac_n_jax_flax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5491b8fa060cb74","code_sha256_prefix":"b5491b8fa060cb74","mcp_get_code":{"code_sha256":"b5491b8fa060cb74"}},{"arxiv_id":"2406.12378","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-mapping-of-phase-diagrams-with","title":"Efficient mapping of phase diagrams with conditional Boltzmann Generators","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxschebek/flow_diagrams","path":"flow_diagrams/utils/weights.py","file_url":"https://github.com/maxschebek/flow_diagrams/blob/HEAD/flow_diagrams/utils/weights.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, maxschebek/flow_diagrams when it was checked","code_sha256":"1c2062eccf50a63f","code_sha256_prefix":"1c2062eccf50a63f","mcp_get_code":{"code_sha256":"1c2062eccf50a63f"}},{"arxiv_id":"2405.20555","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-actor-critic-formulating","title":"Diffusion Actor-Critic: Formulating Constrained Policy Iteration as Diffusion Noise Regression for Offline Reinforcement Learning","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Fang-Lin93/DAC","path":"networks/initialization.py","file_url":"https://github.com/Fang-Lin93/DAC/blob/HEAD/networks/initialization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, Fang-Lin93/DAC, is not in the permissive set Syntology serves inline","code_sha256":"a1e4cfcce3126d87","code_sha256_prefix":"a1e4cfcce3126d87","mcp_get_code":{"code_sha256":"a1e4cfcce3126d87"}},{"arxiv_id":"2402.06275","arxiv_id_is_arxiv":true,"paper":"/paper/neural-sph-improved-neural-modeling-of","title":"Neural SPH: Improved Neural Modeling of Lagrangian Fluid Dynamics","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tumaer/lagrangebench","path":"lagrangebench/models/segnn.py","file_url":"https://github.com/tumaer/lagrangebench/blob/HEAD/lagrangebench/models/segnn.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":"0536cca2e9dee22b","code_sha256_prefix":"0536cca2e9dee22b","mcp_get_code":{"code_sha256":"0536cca2e9dee22b"}},{"arxiv_id":"2311.17245","arxiv_id_is_arxiv":true,"paper":"/paper/lightgaussian-unbounded-3d-gaussian","title":"LightGaussian: Unbounded 3D Gaussian Compression with 15x Reduction and 200+ FPS","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VITA-Group/LightGaussian","path":"vectree/vectree.py","file_url":"https://github.com/VITA-Group/LightGaussian/blob/HEAD/vectree/vectree.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, VITA-Group/LightGaussian (NOASSERTION)","code_sha256":"8bdc31c7c61111b3","code_sha256_prefix":"8bdc31c7c61111b3","mcp_get_code":{"code_sha256":"8bdc31c7c61111b3"}},{"arxiv_id":"2308.02117","arxiv_id_is_arxiv":true,"paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangling0818/vqgraph","path":"vq.py","file_url":"https://github.com/yangling0818/vqgraph/blob/HEAD/vq.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, yangling0818/vqgraph when it was checked","code_sha256":"f9a12a99a3e74bc8","code_sha256_prefix":"f9a12a99a3e74bc8","mcp_get_code":{"code_sha256":"f9a12a99a3e74bc8"}},{"arxiv_id":"2306.06546","arxiv_id_is_arxiv":true,"paper":"/paper/high-fidelity-audio-compression-with-improved","title":"High-Fidelity Audio Compression with Improved RVQGAN","date":"2023-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxinfd/speechtokenizer","path":"speechtokenizer/model.py","file_url":"https://github.com/zhangxinfd/speechtokenizer/blob/HEAD/speechtokenizer/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d30ebe7be75adcf6","code_sha256_prefix":"d30ebe7be75adcf6","mcp_get_code":{"code_sha256":"d30ebe7be75adcf6"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rayhane-mamah/Efficient-VDVAE","path":"efficient_vdvae_jax/model/conv2d.py","file_url":"https://github.com/Rayhane-mamah/Efficient-VDVAE/blob/HEAD/efficient_vdvae_jax/model/conv2d.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":"0f49a2b0642d1098","code_sha256_prefix":"0f49a2b0642d1098","mcp_get_code":{"code_sha256":"0f49a2b0642d1098"}},{"arxiv_id":"2110.01548","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-based-offline-reinforcement","title":"Uncertainty-Based Offline Reinforcement Learning with Diversified Q-Ensemble","date":"2021-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"howuhh/sac-n-jax","path":"sac_n_jax_flax.py","file_url":"https://github.com/howuhh/sac-n-jax/blob/HEAD/sac_n_jax_flax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b5491b8fa060cb74","code_sha256_prefix":"b5491b8fa060cb74","mcp_get_code":{"code_sha256":"b5491b8fa060cb74"}},{"arxiv_id":"1806.05413","arxiv_id_is_arxiv":true,"paper":"/paper/learning-dynamics-of-linear-denoising","title":"Learning Dynamics of Linear Denoising Autoencoders","date":"2018-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnupretorius/lindaedynamics_icml2018","path":"src/scalar_net/initialisers.py","file_url":"https://github.com/arnupretorius/lindaedynamics_icml2018/blob/HEAD/src/scalar_net/initialisers.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":"3b15ad22ad03850b","code_sha256_prefix":"3b15ad22ad03850b","mcp_get_code":{"code_sha256":"3b15ad22ad03850b"}}],"record_sha256":"98234c4f4c09a7c8c47bd8074b921ef881aa363c55da0e8e5910f0f8f5ec2cff","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}