{"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/gaussian-nll","entry":"gaussian_nll","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":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":9,"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":3,"ran_fixture":0,"ran":4,"unverified":1},"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.05133","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05133","title":"Transformed Latent Variable Multi-Output Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"XiaoyuJiang17/T-LVMOGP-official","path":"models/dkl_lvmogp_base.py","file_url":"https://github.com/XiaoyuJiang17/T-LVMOGP-official/blob/HEAD/models/dkl_lvmogp_base.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":"0e305ed959c99458","code_sha256_prefix":"0e305ed959c99458","mcp_get_code":{"code_sha256":"0e305ed959c99458"}},{"arxiv_id":"2310.18534","arxiv_id_is_arxiv":true,"paper":"/paper/multi-time-scale-world-models-1","title":"Multi Time Scale World Models","date":"2023-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ALRhub/MTS3","path":"utils/Losses.py","file_url":"https://github.com/ALRhub/MTS3/blob/HEAD/utils/Losses.py","status":"ran","verification_level":1,"contract_check":null,"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, ALRhub/MTS3 when it was checked","code_sha256":"67dea81cea22a2b4","code_sha256_prefix":"67dea81cea22a2b4","mcp_get_code":{"code_sha256":"67dea81cea22a2b4"}},{"arxiv_id":"2307.16651","arxiv_id_is_arxiv":true,"paper":"/paper/udama-unsupervised-domain-adaptation-through","title":"UDAMA: Unsupervised Domain Adaptation through Multi-discriminator Adversarial Training with Noisy Labels Improves Cardio-fitness Prediction","date":"2023-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yvonneywu/udama","path":"utils.py","file_url":"https://github.com/yvonneywu/udama/blob/HEAD/utils.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, yvonneywu/udama when it was checked","code_sha256":"5c4f3b3c8c96ff39","code_sha256_prefix":"5c4f3b3c8c96ff39","mcp_get_code":{"code_sha256":"5c4f3b3c8c96ff39"}},{"arxiv_id":"2010.02637","arxiv_id_is_arxiv":true,"paper":"/paper/disentangled-generative-causal-representation-1","title":"Weakly Supervised Disentangled Generative Causal Representation Learning","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwshen51/DEAR","path":"bgm.py","file_url":"https://github.com/xwshen51/DEAR/blob/HEAD/bgm.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":"5f841bea5a7712f0","code_sha256_prefix":"5f841bea5a7712f0","mcp_get_code":{"code_sha256":"5f841bea5a7712f0"}},{"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":"4eaf1511053dc8a7","code_sha256_prefix":"4eaf1511053dc8a7","mcp_get_code":{"code_sha256":"4eaf1511053dc8a7"}},{"arxiv_id":"2006.13202","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-effective-vae-training-with","title":"Simple and Effective VAE Training with Calibrated Decoders","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orybkin/sigma-vae-pytorch","path":"model.py","file_url":"https://github.com/orybkin/sigma-vae-pytorch/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, orybkin/sigma-vae-pytorch when it was checked","code_sha256":"85038890e349231c","code_sha256_prefix":"85038890e349231c","mcp_get_code":{"code_sha256":"85038890e349231c"}},{"arxiv_id":"2006.13202","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-effective-vae-training-with","title":"Simple and Effective VAE Training with Calibrated Decoders","date":"2020-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orybkin/sigma-vae-pytorch","path":"model.py","file_url":"https://github.com/orybkin/sigma-vae-pytorch/blob/HEAD/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, orybkin/sigma-vae-pytorch when it was checked","code_sha256":"b67c41c224081421","code_sha256_prefix":"b67c41c224081421","mcp_get_code":{"code_sha256":"b67c41c224081421"}},{"arxiv_id":"2001.00689","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-dirichlet-process-mixture-model-for","title":"A Neural Dirichlet Process Mixture Model for Task-Free Continual Learning","date":"2020-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"soochan-lee/CN-DPM","path":"loss.py","file_url":"https://github.com/soochan-lee/CN-DPM/blob/HEAD/loss.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":"2a49059cf0583654","code_sha256_prefix":"2a49059cf0583654","mcp_get_code":{"code_sha256":"2a49059cf0583654"}},{"arxiv_id":"1810.12241","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-3d-multi-modal-medical-image","title":"Few-shot 3D Multi-modal Medical Image Segmentation using Generative Adversarial Learning","date":"2018-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnab39/FewShot_GAN-Unet3D","path":"tensorflow/lib/operations.py","file_url":"https://github.com/arnab39/FewShot_GAN-Unet3D/blob/HEAD/tensorflow/lib/operations.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":"96330c807f450c14","code_sha256_prefix":"96330c807f450c14","mcp_get_code":{"code_sha256":"96330c807f450c14"}}],"record_sha256":"f77a922df3030ca7fbfb5c637e03282e20d836a5989667dbd96801ae930573cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}