{"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/autoencoder","entry":"AutoEncoder","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":11,"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":12,"n_samples_ran":7,"n_samples_constructed":7,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":4,"n_places":12,"n_places_pointer_only":6,"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":7,"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.11414","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11414","title":"Generative Diffusion Prior Distillation for Long-Context Knowledge Transfer","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"hewadehigaha/GDPD_ICLR26","path":"gdpd/gdpd.py","file_url":"https://github.com/hewadehigaha/GDPD_ICLR26/blob/HEAD/gdpd/gdpd.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hewadehigaha/GDPD_ICLR26 when it was checked","code_sha256":"447c77525fa0c846","code_sha256_prefix":"447c77525fa0c846","mcp_get_code":{"code_sha256":"447c77525fa0c846"}},{"arxiv_id":"2603.23647","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-23647","title":"λSPLIT: SELF-SUPERVISED CONTENT-AWARE SPECTRAL UNMIXING FOR FLUORESCENCE MICROSCOPY","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"preetam22n/DeepTrans-HSU","path":"Trans_mod.py","file_url":"https://github.com/preetam22n/DeepTrans-HSU/blob/HEAD/Trans_mod.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, preetam22n/DeepTrans-HSU when it was checked","code_sha256":"e5845b7081450c7c","code_sha256_prefix":"e5845b7081450c7c","mcp_get_code":{"code_sha256":"e5845b7081450c7c"}},{"arxiv_id":"2509.02101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-02101","title":"-Semantics-Aware Logical Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"MaticFuc/SALAD","path":"ae.py","file_url":"https://github.com/MaticFuc/SALAD/blob/HEAD/ae.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d2a4d53bcd5e498f","code_sha256_prefix":"d2a4d53bcd5e498f","mcp_get_code":{"code_sha256":"d2a4d53bcd5e498f"}},{"arxiv_id":"2504.02821","arxiv_id_is_arxiv":true,"paper":"/paper/sparse-autoencoders-learn-monosemantic","title":"Sparse Autoencoders Learn Monosemantic Features in Vision-Language Models","date":"2025-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"explainableml/sae-for-vlm","path":"dictionary_learning/trainers/standard.py","file_url":"https://github.com/explainableml/sae-for-vlm/blob/HEAD/dictionary_learning/trainers/standard.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, explainableml/sae-for-vlm when it was checked","code_sha256":"85c251f29a71252f","code_sha256_prefix":"85c251f29a71252f","mcp_get_code":{"code_sha256":"85c251f29a71252f"}},{"arxiv_id":"2504.02160","arxiv_id_is_arxiv":true,"paper":"/paper/less-to-more-generalization-unlocking-more","title":"Less-to-More Generalization: Unlocking More Controllability by In-Context Generation","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/UNO","path":"uno/flux/pipeline.py","file_url":"https://github.com/bytedance/UNO/blob/HEAD/uno/flux/pipeline.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":"fbae76808b84e0a7","code_sha256_prefix":"fbae76808b84e0a7","mcp_get_code":{"code_sha256":"fbae76808b84e0a7"}},{"arxiv_id":"2410.04383","arxiv_id_is_arxiv":true,"paper":"/paper/braincodec-neural-fmri-codec-for-the-decoding","title":"BrainCodec: Neural fMRI codec for the decoding of cognitive brain states","date":"2024-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"athms/learning-from-brains","path":"src/decoder/autoencoder.py","file_url":"https://github.com/athms/learning-from-brains/blob/HEAD/src/decoder/autoencoder.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, athms/learning-from-brains when it was checked","code_sha256":"2774fa5e9b700603","code_sha256_prefix":"2774fa5e9b700603","mcp_get_code":{"code_sha256":"2774fa5e9b700603"}},{"arxiv_id":"2407.08751","arxiv_id_is_arxiv":true,"paper":"/paper/latent-diffusion-for-neural-spiking-data","title":"Latent Diffusion for Neural Spiking Data","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mackelab/LDNS","path":"ldns/networks/blocks.py","file_url":"https://github.com/mackelab/LDNS/blob/HEAD/ldns/networks/blocks.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":"3d1d5f57adee63ba","code_sha256_prefix":"3d1d5f57adee63ba","mcp_get_code":{"code_sha256":"3d1d5f57adee63ba"}},{"arxiv_id":"2209.10677","arxiv_id_is_arxiv":true,"paper":"/paper/nashae-disentangling-representations-through","title":"NashAE: Disentangling Representations through Adversarial Covariance Minimization","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericyeats/nashae-beamsynthesis","path":"ae_utils_exp.py","file_url":"https://github.com/ericyeats/nashae-beamsynthesis/blob/HEAD/ae_utils_exp.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":"e14352d2ca1e1ac1","code_sha256_prefix":"e14352d2ca1e1ac1","mcp_get_code":{"code_sha256":"e14352d2ca1e1ac1"}},{"arxiv_id":"2106.09019","arxiv_id_is_arxiv":true,"paper":"/paper/amortized-synthesis-of-constrained","title":"Amortized Synthesis of Constrained Configurations Using a Differentiable Surrogate","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingyuansun/amorsyn","path":"amortized_synthesis/model.py","file_url":"https://github.com/xingyuansun/amorsyn/blob/HEAD/amortized_synthesis/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c178a4353f51a3e1","code_sha256_prefix":"c178a4353f51a3e1","mcp_get_code":{"code_sha256":"c178a4353f51a3e1"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVlabs/NVAE","path":"model.py","file_url":"https://github.com/NVlabs/NVAE/blob/HEAD/model.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, NVlabs/NVAE (NOASSERTION)","code_sha256":"ed8aab6b16f71a33","code_sha256_prefix":"ed8aab6b16f71a33","mcp_get_code":{"code_sha256":"ed8aab6b16f71a33"}},{"arxiv_id":"2007.03898","arxiv_id_is_arxiv":true,"paper":"/paper/nvae-a-deep-hierarchical-variational","title":"NVAE: A Deep Hierarchical Variational Autoencoder","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SerezD/NVAE-from-scratch","path":"src/model.py","file_url":"https://github.com/SerezD/NVAE-from-scratch/blob/HEAD/src/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":"2b09442d4473a79b","code_sha256_prefix":"2b09442d4473a79b","mcp_get_code":{"code_sha256":"2b09442d4473a79b"}},{"arxiv_id":"ijcai2024_0226","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0226","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Ashowman98/CSGRL","path":"methods/csgrl.py","file_url":"https://github.com/Ashowman98/CSGRL/blob/HEAD/methods/csgrl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Ashowman98/CSGRL when it was checked","code_sha256":"09e67e3b85191305","code_sha256_prefix":"09e67e3b85191305","mcp_get_code":{"code_sha256":"09e67e3b85191305"}}],"record_sha256":"e05ebf7f2e45a89ad73f5bdcf0e478b00357a3f576f6bfa2346e8753e902c931","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}