{"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/log-gaussian","entry":"log_gaussian","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":9,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":9,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2301.04257","arxiv_id_is_arxiv":true,"paper":"/paper/odim-an-efficient-method-to-detect-outliers","title":"ODIM: Outlier Detection via Likelihood of Under-Fitted Generative Models","date":"2023-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Minqi824/ADBench","path":"adbench/baseline/DeepSAD/src/networks/dgm.py","file_url":"https://github.com/Minqi824/ADBench/blob/HEAD/adbench/baseline/DeepSAD/src/networks/dgm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f56073807e8da9c","code_sha256_prefix":"6f56073807e8da9c","mcp_get_code":{"code_sha256":"6f56073807e8da9c"}},{"arxiv_id":"2108.11556","arxiv_id_is_arxiv":true,"paper":"/paper/latent-space-energy-based-model-of-symbol","title":"Latent Space Energy-Based Model of Symbol-Vector Coupling for Text Generation and Classification","date":"2021-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bpucla/ibebm","path":"text_generation.py","file_url":"https://github.com/bpucla/ibebm/blob/HEAD/text_generation.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, bpucla/ibebm when it was checked","code_sha256":"e9ef3abed83af744","code_sha256_prefix":"e9ef3abed83af744","mcp_get_code":{"code_sha256":"e9ef3abed83af744"}},{"arxiv_id":"2105.14083","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-noisy-label-models-labeler","title":"Rethinking Noisy Label Models: Labeler-Dependent Noise with Adversarial Awareness","date":"2021-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wohlert/semi-supervised-pytorch","path":"semi-supervised/inference/distributions.py","file_url":"https://github.com/wohlert/semi-supervised-pytorch/blob/HEAD/semi-supervised/inference/distributions.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":"4ce844530f08fb8f","code_sha256_prefix":"4ce844530f08fb8f","mcp_get_code":{"code_sha256":"4ce844530f08fb8f"}},{"arxiv_id":"2104.10036","arxiv_id_is_arxiv":true,"paper":"/paper/vt-adl-a-vision-transformer-network-for-image","title":"VT-ADL: A Vision Transformer Network for Image Anomaly Detection and Localization","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pankajmishra000/VT-ADL","path":"mdn1.py","file_url":"https://github.com/pankajmishra000/VT-ADL/blob/HEAD/mdn1.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":"fbaeafa76f30d8d1","code_sha256_prefix":"fbaeafa76f30d8d1","mcp_get_code":{"code_sha256":"fbaeafa76f30d8d1"}},{"arxiv_id":"2011.07439","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-variational-inference-for-sparse-1","title":"Efficient Variational Inference for Sparse Deep Learning with Theoretical Guarantee","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinchengBai/sparse-variational-bnn","path":"models/sparsefunc.py","file_url":"https://github.com/JinchengBai/sparse-variational-bnn/blob/HEAD/models/sparsefunc.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, JinchengBai/sparse-variational-bnn when it was checked","code_sha256":"744b361b7cfdf271","code_sha256_prefix":"744b361b7cfdf271","mcp_get_code":{"code_sha256":"744b361b7cfdf271"}},{"arxiv_id":"1907.05545","arxiv_id_is_arxiv":true,"paper":"/paper/the-dynamic-embedded-topic-model","title":"The Dynamic Embedded Topic Model","date":"2019-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adjidieng/DETM","path":"utils.py","file_url":"https://github.com/adjidieng/DETM/blob/HEAD/utils.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":"9c2bb7c80d3605e9","code_sha256_prefix":"9c2bb7c80d3605e9","mcp_get_code":{"code_sha256":"9c2bb7c80d3605e9"}},{"arxiv_id":"1802.09419","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-hyperparameter-optimization","title":"Stochastic Hyperparameter Optimization through Hypernetworks","date":"2018-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lorraine2/hypernet-hypertraining","path":"code/learn_vs_true_loss_scatter.py","file_url":"https://github.com/lorraine2/hypernet-hypertraining/blob/HEAD/code/learn_vs_true_loss_scatter.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":"33654d7c183a991c","code_sha256_prefix":"33654d7c183a991c","mcp_get_code":{"code_sha256":"33654d7c183a991c"}},{"arxiv_id":"1505.05424","arxiv_id_is_arxiv":true,"paper":"/paper/weight-uncertainty-in-neural-networks","title":"Weight Uncertainty in Neural Networks","date":"2015-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saxena-mayur/Weight-Uncertainty-in-Neural-Networks","path":"FCN_Image_Classification/BBB.py","file_url":"https://github.com/saxena-mayur/Weight-Uncertainty-in-Neural-Networks/blob/HEAD/FCN_Image_Classification/BBB.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, saxena-mayur/Weight-Uncertainty-in-Neural-Networks when it was checked","code_sha256":"d0dfc3df96e8289c","code_sha256_prefix":"d0dfc3df96e8289c","mcp_get_code":{"code_sha256":"d0dfc3df96e8289c"}},{"arxiv_id":"1312.6114","arxiv_id_is_arxiv":true,"paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d0dfc3df96e8289c","code_sha256_prefix":"d0dfc3df96e8289c","mcp_get_code":{"code_sha256":"d0dfc3df96e8289c"}}],"record_sha256":"a4136432edfa058c4a54e0eb99bb9ee8374a6f47d912b3802849d75e08117bc7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}