{"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-log-likelihood","entry":"gaussian_log_likelihood","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":6,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":0,"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":1,"ran_fixture":0,"ran":4,"unverified":3},"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":"2410.13027","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-trajectory-diffusion-models","title":"Geometric Trajectory Diffusion Models","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanjq17/geotdm","path":"diffusion/losses.py","file_url":"https://github.com/hanjq17/geotdm/blob/HEAD/diffusion/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":"64d1fb56f7e05906","code_sha256_prefix":"64d1fb56f7e05906","mcp_get_code":{"code_sha256":"64d1fb56f7e05906"}},{"arxiv_id":"2303.05246","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-certified-training-and-robustness","title":"Efficient Certified Training and Robustness Verification of Neural ODEs","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/gains","path":"latent_attack_MAE.py","file_url":"https://github.com/eth-sri/gains/blob/HEAD/latent_attack_MAE.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":"5b1337f672e212f6","code_sha256_prefix":"5b1337f672e212f6","mcp_get_code":{"code_sha256":"5b1337f672e212f6"}},{"arxiv_id":"2107.08924","arxiv_id_is_arxiv":true,"paper":"/paper/epistemic-neural-networks-1","title":"Epistemic Neural Networks","date":"2021-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-deepmind/enn","path":"enn/losses/vae_losses.py","file_url":"https://github.com/google-deepmind/enn/blob/HEAD/enn/losses/vae_losses.py","status":"ran","verification_level":1,"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":"cf2414e3657a07d7","code_sha256_prefix":"cf2414e3657a07d7","mcp_get_code":{"code_sha256":"cf2414e3657a07d7"}},{"arxiv_id":"2008.02401","arxiv_id_is_arxiv":true,"paper":"/paper/styleflow-attribute-conditioned-exploration","title":"StyleFlow: Attribute-conditioned Exploration of StyleGAN-Generated Images using Conditional Continuous Normalizing Flows","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuduo35/StyleFlowPytorch","path":"module/utils.py","file_url":"https://github.com/xuduo35/StyleFlowPytorch/blob/HEAD/module/utils.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":"6306abd15a0062d5","code_sha256_prefix":"6306abd15a0062d5","mcp_get_code":{"code_sha256":"6306abd15a0062d5"}},{"arxiv_id":"2006.04727","arxiv_id_is_arxiv":true,"paper":"/paper/theoretical-guarantees-for-learning","title":"Neural Jump Ordinary Differential Equations: Consistent Continuous-Time Prediction and Filtering","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HerreraKrachTeichmann/ControlledODERNN","path":"latent_ODE/likelihood_eval_LODE.py","file_url":"https://github.com/HerreraKrachTeichmann/ControlledODERNN/blob/HEAD/latent_ODE/likelihood_eval_LODE.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":"bd43eff2ee1d2449","code_sha256_prefix":"bd43eff2ee1d2449","mcp_get_code":{"code_sha256":"bd43eff2ee1d2449"}},{"arxiv_id":"1906.12320","arxiv_id_is_arxiv":true,"paper":"/paper/pointflow-3d-point-cloud-generation-with","title":"PointFlow: 3D Point Cloud Generation with Continuous Normalizing Flows","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stevenygd/PointFlow","path":"utils.py","file_url":"https://github.com/stevenygd/PointFlow/blob/HEAD/utils.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":"6306abd15a0062d5","code_sha256_prefix":"6306abd15a0062d5","mcp_get_code":{"code_sha256":"6306abd15a0062d5"}},{"arxiv_id":"1903.00450","arxiv_id_is_arxiv":true,"paper":"/paper/multi-object-representation-learning-with","title":"Multi-Object Representation Learning with Iterative Variational Inference","date":"2019-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/IODINE","path":"lib/modeling/iodine.py","file_url":"https://github.com/zhixuan-lin/IODINE/blob/HEAD/lib/modeling/iodine.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":"4b24cc3d787209ad","code_sha256_prefix":"4b24cc3d787209ad","mcp_get_code":{"code_sha256":"4b24cc3d787209ad"}},{"arxiv_id":"1610.02351","arxiv_id_is_arxiv":true,"paper":"/paper/panning-for-gold-model-x-knockoffs-for-high","title":"Panning for Gold: Model-X Knockoffs for High-dimensional Controlled Variable Selection","date":null,"month_inferred_from_arxiv_id":"2016-10","title_source":"archive","repo":"amspector100/knockpy","path":"knockpy/metro.py","file_url":"https://github.com/amspector100/knockpy/blob/HEAD/knockpy/metro.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":"ce1e7a9ba67294a2","code_sha256_prefix":"ce1e7a9ba67294a2","mcp_get_code":{"code_sha256":"ce1e7a9ba67294a2"}},{"arxiv_id":"1606.02185","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-neural-statistician","title":"Towards a Neural Statistician","date":"2016-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cravingoxygen/neuralstat","path":"tests.py","file_url":"https://github.com/cravingoxygen/neuralstat/blob/HEAD/tests.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":"2e7d466cc00bbeab","code_sha256_prefix":"2e7d466cc00bbeab","mcp_get_code":{"code_sha256":"2e7d466cc00bbeab"}}],"record_sha256":"8b97bfd8ec2a4ec28b9a724e8c2150ba0499e16c3204b0246ec29391dd8d4094","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}