{"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/compute-loss-and-nll","entry":"compute_loss_and_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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":3,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"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":0,"ran_fixture":0,"ran":2,"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":"2606.01595","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-01595","title":"Uncertainty-Calibrated Diffusion for Reliable 3D Molecular Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"jiuguaiwf/UCD","path":"edm/qm9/losses.py","file_url":"https://github.com/jiuguaiwf/UCD/blob/HEAD/edm/qm9/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":"4ed06d5114046b7e","code_sha256_prefix":"4ed06d5114046b7e","mcp_get_code":{"code_sha256":"4ed06d5114046b7e"}},{"arxiv_id":"2410.06502","arxiv_id_is_arxiv":true,"paper":"/paper/chemistry-inspired-diffusion-with-non","title":"Chemistry-Inspired Diffusion with Non-Differentiable Guidance","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"A-Chicharito-S/ChemGuide","path":"qm9/losses.py","file_url":"https://github.com/A-Chicharito-S/ChemGuide/blob/HEAD/qm9/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":"4ed06d5114046b7e","code_sha256_prefix":"4ed06d5114046b7e","mcp_get_code":{"code_sha256":"4ed06d5114046b7e"}},{"arxiv_id":"2410.06262","arxiv_id_is_arxiv":true,"paper":"/paper/symdiff-equivariant-diffusion-via-stochastic","title":"SymDiff: Equivariant Diffusion via Stochastic Symmetrisation","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leozhangML/SymDiff","path":"qm9/losses.py","file_url":"https://github.com/leozhangML/SymDiff/blob/HEAD/qm9/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":"4ed06d5114046b7e","code_sha256_prefix":"4ed06d5114046b7e","mcp_get_code":{"code_sha256":"4ed06d5114046b7e"}},{"arxiv_id":"2407.16193","arxiv_id_is_arxiv":true,"paper":"/paper/cloudfixer-test-time-adaptation-for-3d-point","title":"CloudFixer: Test-Time Adaptation for 3D Point Clouds via Diffusion-Guided Geometric Transformation","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shimazing/CloudFixer","path":"utils/losses.py","file_url":"https://github.com/shimazing/CloudFixer/blob/HEAD/utils/losses.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":"b8c2aca158049aa6","code_sha256_prefix":"b8c2aca158049aa6","mcp_get_code":{"code_sha256":"b8c2aca158049aa6"}},{"arxiv_id":"2305.01140","arxiv_id_is_arxiv":true,"paper":"/paper/geometric-latent-diffusion-models-for-3d","title":"Geometric Latent Diffusion Models for 3D Molecule Generation","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rlacombe/accgeoldm","path":"qm9/losses.py","file_url":"https://github.com/rlacombe/accgeoldm/blob/HEAD/qm9/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":"4ed06d5114046b7e","code_sha256_prefix":"4ed06d5114046b7e","mcp_get_code":{"code_sha256":"4ed06d5114046b7e"}},{"arxiv_id":"2203.17003","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-diffusion-for-molecule-generation","title":"Equivariant Diffusion for Molecule Generation in 3D","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ehoogeboom/e3_diffusion_for_molecules","path":"qm9/losses.py","file_url":"https://github.com/ehoogeboom/e3_diffusion_for_molecules/blob/HEAD/qm9/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":"4ed06d5114046b7e","code_sha256_prefix":"4ed06d5114046b7e","mcp_get_code":{"code_sha256":"4ed06d5114046b7e"}},{"arxiv_id":"2105.09016","arxiv_id_is_arxiv":true,"paper":"/paper/e-n-equivariant-normalizing-flows-for","title":"E(n) Equivariant Normalizing Flows","date":"2021-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vgsatorras/en_flows","path":"dw4_experiment/losses.py","file_url":"https://github.com/vgsatorras/en_flows/blob/HEAD/dw4_experiment/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":"50bea83403489eb5","code_sha256_prefix":"50bea83403489eb5","mcp_get_code":{"code_sha256":"50bea83403489eb5"}}],"record_sha256":"790b9c9bf69c20e290c73ae2e152f3de2c75cca8cc03e50e402d8982f7d3a892","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}