{"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/reconstruction-loss","entry":"reconstruction_loss","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":14,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":4,"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":15,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":6,"n_places":15,"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":1,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":8,"unverified":2},"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":"2604.24894","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24894","title":"VISION-SLS: Safe Perception-Based Control from Learned Visual Representations via System Level Synthesis","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"trustworthyrobotics/VISION-SLS","path":"perception_utils/losses.py","file_url":"https://github.com/trustworthyrobotics/VISION-SLS/blob/HEAD/perception_utils/losses.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"571a87bbf8dc7033","code_sha256_prefix":"571a87bbf8dc7033","mcp_get_code":{"code_sha256":"571a87bbf8dc7033"}},{"arxiv_id":"2601.13331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-13331","title":"MultiST: A Cross-Attention-Based Multimodal Model for Spatial Transcriptomics","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"LabJunBMI/MultiST","path":"MultiST/MultiST/MultiST_model.py","file_url":"https://github.com/LabJunBMI/MultiST/blob/HEAD/MultiST/MultiST/MultiST_model.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, LabJunBMI/MultiST when it was checked","code_sha256":"366bb23fd9f8534d","code_sha256_prefix":"366bb23fd9f8534d","mcp_get_code":{"code_sha256":"366bb23fd9f8534d"}},{"arxiv_id":"2502.17462","arxiv_id_is_arxiv":true,"paper":"/paper/the-case-for-cleaner-biosignals-high-fidelity","title":"The Case for Cleaner Biosignals: High-fidelity Neural Compressor Enables Transfer from Cleaner iEEG to Noisier EEG","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/eeg-ieeg-brain-compressor","path":"utils/loss.py","file_url":"https://github.com/IBM/eeg-ieeg-brain-compressor/blob/HEAD/utils/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"75633d354dc99835","code_sha256_prefix":"75633d354dc99835","mcp_get_code":{"code_sha256":"75633d354dc99835"}},{"arxiv_id":"2406.19298","arxiv_id_is_arxiv":true,"paper":"/paper/compositional-image-decomposition-with","title":"Compositional Image Decomposition with Diffusion Models","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1Konny/Beta-VAE","path":"solver.py","file_url":"https://github.com/1Konny/Beta-VAE/blob/HEAD/solver.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":"4865b8d298fd30b3","code_sha256_prefix":"4865b8d298fd30b3","mcp_get_code":{"code_sha256":"4865b8d298fd30b3"}},{"arxiv_id":"2309.16515","arxiv_id_is_arxiv":true,"paper":"/paper/latent-noise-segmentation-how-neural-noise","title":"Latent Noise Segmentation: How Neural Noise Leads to the Emergence of Segmentation and Grouping","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhengqingUUU/LatentNoiseSegmentation","path":"solver.py","file_url":"https://github.com/ZhengqingUUU/LatentNoiseSegmentation/blob/HEAD/solver.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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, ZhengqingUUU/LatentNoiseSegmentation, is not in the permissive set Syntology serves inline","code_sha256":"849bb2b9f4368182","code_sha256_prefix":"849bb2b9f4368182","mcp_get_code":{"code_sha256":"849bb2b9f4368182"}},{"arxiv_id":"2309.04589","arxiv_id_is_arxiv":true,"paper":"/paper/motif-aware-attribute-masking-for-molecular","title":"Motif-aware Attribute Masking for Molecular Graph Pre-training","date":"2023-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"einae-nd/moama-dev","path":"pretrain.py","file_url":"https://github.com/einae-nd/moama-dev/blob/HEAD/pretrain.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, einae-nd/moama-dev when it was checked","code_sha256":"e4fc8364925146e1","code_sha256_prefix":"e4fc8364925146e1","mcp_get_code":{"code_sha256":"e4fc8364925146e1"}},{"arxiv_id":"2203.03833","arxiv_id_is_arxiv":true,"paper":"/paper/quasi-balanced-self-training-on-noise-aware","title":"Quasi-Balanced Self-Training on Noise-Aware Synthesis of Object Point Clouds for Closing Domain Gap","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Gorilla-Lab-SCUT/QS3","path":"DefRec.py","file_url":"https://github.com/Gorilla-Lab-SCUT/QS3/blob/HEAD/DefRec.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":"c79a55191d2c2289","code_sha256_prefix":"c79a55191d2c2289","mcp_get_code":{"code_sha256":"c79a55191d2c2289"}},{"arxiv_id":"2111.02338","arxiv_id_is_arxiv":true,"paper":"/paper/drop-swap-and-generate-a-self-supervised","title":"Drop, Swap, and Generate: A Self-Supervised Approach for Generating Neural Activity","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nerdslab/SwapVAE","path":"vae_kits/model.py","file_url":"https://github.com/nerdslab/SwapVAE/blob/HEAD/vae_kits/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"807a07d67f9086df","code_sha256_prefix":"807a07d67f9086df","mcp_get_code":{"code_sha256":"807a07d67f9086df"}},{"arxiv_id":"2110.05428","arxiv_id_is_arxiv":true,"paper":"/paper/learning-temporally-causal-latent-processes","title":"Learning Temporally Causal Latent Processes from General Temporal Data","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous-authors-iclr2022-481/leap","path":"ltcl/modules/cond_linear_vae.py","file_url":"https://github.com/anonymous-authors-iclr2022-481/leap/blob/HEAD/ltcl/modules/cond_linear_vae.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":"cebefb3be2a5a288","code_sha256_prefix":"cebefb3be2a5a288","mcp_get_code":{"code_sha256":"cebefb3be2a5a288"}},{"arxiv_id":"2110.05428","arxiv_id_is_arxiv":true,"paper":"/paper/learning-temporally-causal-latent-processes","title":"Learning Temporally Causal Latent Processes from General Temporal Data","date":"2021-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anonymous-authors-iclr2022-481/leap","path":"ltcl/modules/lvae_nonlinear.py","file_url":"https://github.com/anonymous-authors-iclr2022-481/leap/blob/HEAD/ltcl/modules/lvae_nonlinear.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":"21ac2bba534cbf6a","code_sha256_prefix":"21ac2bba534cbf6a","mcp_get_code":{"code_sha256":"21ac2bba534cbf6a"}},{"arxiv_id":"2007.02443","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-rehearsal-for-continual-learning-with","title":"Pseudo-Rehearsal for Continual Learning with Normalizing Flows","date":"2020-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/PRER","path":"continual_ai/cl_strategies/multi_task/prer/PRER.py","file_url":"https://github.com/ispamm/PRER/blob/HEAD/continual_ai/cl_strategies/multi_task/prer/PRER.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, ispamm/PRER when it was checked","code_sha256":"ad91a710aa97e44c","code_sha256_prefix":"ad91a710aa97e44c","mcp_get_code":{"code_sha256":"ad91a710aa97e44c"}},{"arxiv_id":"2003.12641","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-for-domain","title":"Self-Supervised Learning for Domain Adaptation on Point-Clouds","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IdanAchituve/DefRec_and_PCM","path":"DefRec_and_PCM/DefRec.py","file_url":"https://github.com/IdanAchituve/DefRec_and_PCM/blob/HEAD/DefRec_and_PCM/DefRec.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, IdanAchituve/DefRec_and_PCM when it was checked","code_sha256":"9bb234babd1e2e5e","code_sha256_prefix":"9bb234babd1e2e5e","mcp_get_code":{"code_sha256":"9bb234babd1e2e5e"}},{"arxiv_id":"2002.09089","arxiv_id_is_arxiv":true,"paper":"/paper/safe-imitation-learning-via-fast-bayesian","title":"Safe Imitation Learning via Fast Bayesian Reward Inference from Preferences","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsbrown1331/bayesianrex","path":"code/LearnAtariRewardLinear.py","file_url":"https://github.com/dsbrown1331/bayesianrex/blob/HEAD/code/LearnAtariRewardLinear.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cfe0f494b5c6542d","code_sha256_prefix":"cfe0f494b5c6542d","mcp_get_code":{"code_sha256":"cfe0f494b5c6542d"}},{"arxiv_id":"1909.13789","arxiv_id_is_arxiv":true,"paper":"/paper/hamiltonian-generative-networks","title":"Hamiltonian Generative Networks","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CampusAI/Hamiltonian-Generative-Networks","path":"utilities/losses.py","file_url":"https://github.com/CampusAI/Hamiltonian-Generative-Networks/blob/HEAD/utilities/losses.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":"d9c3d07bc45f1c13","code_sha256_prefix":"d9c3d07bc45f1c13","mcp_get_code":{"code_sha256":"d9c3d07bc45f1c13"}},{"arxiv_id":"1906.02691","arxiv_id_is_arxiv":true,"paper":"/paper/an-introduction-to-variational-autoencoders","title":"An Introduction to Variational Autoencoders","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pycroscopy/atomai","path":"atomai/losses_metrics/vi_losses.py","file_url":"https://github.com/pycroscopy/atomai/blob/HEAD/atomai/losses_metrics/vi_losses.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":"0460cf38488e57d7","code_sha256_prefix":"0460cf38488e57d7","mcp_get_code":{"code_sha256":"0460cf38488e57d7"}}],"record_sha256":"05d0955d2452bf7657731ccf67a527338f7ece4049ae1f6b30f104f588e5e5af","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}