{"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/get-loss-fn","entry":"get_loss_fn","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":12,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":12,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":5,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":12,"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":0,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":3,"unverified":4},"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":"2603.09187","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-09187","title":"The Costs of Reproducibility in Music Separation Research: a Replication of Band-Split RNN","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"magronp/bsrnn","path":"models/pl_module.py","file_url":"https://github.com/magronp/bsrnn/blob/HEAD/models/pl_module.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b00a5adb83faeda3","code_sha256_prefix":"b00a5adb83faeda3","mcp_get_code":{"code_sha256":"b00a5adb83faeda3"}},{"arxiv_id":"2601.03042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03042","title":"BaseCal: Unsupervised Confidence Calibration via Base Model Signals","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Tan-Hexiang/BaseCal","path":"basecal.py","file_url":"https://github.com/Tan-Hexiang/BaseCal/blob/HEAD/basecal.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, Tan-Hexiang/BaseCal when it was checked","code_sha256":"c93832b7f136eb16","code_sha256_prefix":"c93832b7f136eb16","mcp_get_code":{"code_sha256":"c93832b7f136eb16"}},{"arxiv_id":"2511.02986","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-02986","title":"Scalable Single-Cell Gene Expression Generation with Latent Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"ArcInstitute/State-reproduce","path":"baselines/state_sets_reproduce/models/utils.py","file_url":"https://github.com/ArcInstitute/State-reproduce/blob/HEAD/baselines/state_sets_reproduce/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ArcInstitute/State-reproduce when it was checked","code_sha256":"60cf3f07a75f8206","code_sha256_prefix":"60cf3f07a75f8206","mcp_get_code":{"code_sha256":"60cf3f07a75f8206"}},{"arxiv_id":"2412.16156","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-representation-from-personalized","title":"Personalized Representation from Personalized Generation","date":"2024-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ssundaram21/personalized-rep","path":"contrastive/losses.py","file_url":"https://github.com/ssundaram21/personalized-rep/blob/HEAD/contrastive/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":"36a2e6971921cd26","code_sha256_prefix":"36a2e6971921cd26","mcp_get_code":{"code_sha256":"36a2e6971921cd26"}},{"arxiv_id":"2402.12789","arxiv_id_is_arxiv":true,"paper":"/paper/fair-classifiers-without-fair-training-an","title":"Fairness Without Harm: An Influence-Guided Active Sampling Approach","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairnesswithoutharm","path":"src/loss_func.py","file_url":"https://github.com/ucsc-real/fairnesswithoutharm/blob/HEAD/src/loss_func.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, ucsc-real/fairnesswithoutharm when it was checked","code_sha256":"d2b7e008a778fe42","code_sha256_prefix":"d2b7e008a778fe42","mcp_get_code":{"code_sha256":"d2b7e008a778fe42"}},{"arxiv_id":"2309.16585","arxiv_id_is_arxiv":true,"paper":"/paper/text-to-3d-using-gaussian-splatting","title":"Text-to-3D using Gaussian Splatting","date":"2023-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsgen3d/gsgen","path":"utils/loss.py","file_url":"https://github.com/gsgen3d/gsgen/blob/HEAD/utils/loss.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":"777d7588f77beee4","code_sha256_prefix":"777d7588f77beee4","mcp_get_code":{"code_sha256":"777d7588f77beee4"}},{"arxiv_id":"2303.05376","arxiv_id_is_arxiv":true,"paper":"/paper/pc-jedi-diffusion-for-particle-cloud","title":"PC-JeDi: Diffusion for Particle Cloud Generation in High Energy Physics","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rodem-hep/pc-jedi","path":"src/torch_utils.py","file_url":"https://github.com/rodem-hep/pc-jedi/blob/HEAD/src/torch_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":"03b2ee87958648c6","code_sha256_prefix":"03b2ee87958648c6","mcp_get_code":{"code_sha256":"03b2ee87958648c6"}},{"arxiv_id":"2210.06441","arxiv_id_is_arxiv":true,"paper":"/paper/how-much-data-are-augmentations-worth-an","title":"How Much Data Are Augmentations Worth? An Investigation into Scaling Laws, Invariance, and Implicit Regularization","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JonasGeiping/dataaugs","path":"dataaug/training/training.py","file_url":"https://github.com/JonasGeiping/dataaugs/blob/HEAD/dataaug/training/training.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"inline_ok_link":false,"withheld_clause":"LGPL-2.1, as GitHub detects it on this paper's repository, JonasGeiping/dataaugs, is not in the permissive set Syntology serves inline","code_sha256":"8a9718aa8b1e0a7f","code_sha256_prefix":"8a9718aa8b1e0a7f","mcp_get_code":{"code_sha256":"8a9718aa8b1e0a7f"}},{"arxiv_id":"2209.15174","arxiv_id_is_arxiv":true,"paper":"/paper/music-source-separation-with-band-split-rnn","title":"Music Source Separation with Band-split RNN","date":"2022-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naba89/iseparate-sdx","path":"iSeparate/losses/loss_switcher.py","file_url":"https://github.com/naba89/iseparate-sdx/blob/HEAD/iSeparate/losses/loss_switcher.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":"75844b7074c2a1ae","code_sha256_prefix":"75844b7074c2a1ae","mcp_get_code":{"code_sha256":"75844b7074c2a1ae"}},{"arxiv_id":"2207.06046","arxiv_id_is_arxiv":true,"paper":"/paper/deeptime-deep-time-index-meta-learning-for","title":"Learning Deep Time-index Models for Time Series Forecasting","date":"2022-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforce/deeptime","path":"utils/losses.py","file_url":"https://github.com/salesforce/deeptime/blob/HEAD/utils/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3216b1c702b2238d","code_sha256_prefix":"3216b1c702b2238d","mcp_get_code":{"code_sha256":"3216b1c702b2238d"}},{"arxiv_id":"2205.14546","arxiv_id_is_arxiv":true,"paper":"/paper/the-missing-invariance-principle-found-the","title":"The Missing Invariance Principle Found -- the Reciprocal Twin of Invariant Risk Minimization","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/mri","path":"domainbed/algorithms.py","file_url":"https://github.com/ibm/mri/blob/HEAD/domainbed/algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79a63acaa13df2ea","code_sha256_prefix":"79a63acaa13df2ea","mcp_get_code":{"code_sha256":"79a63acaa13df2ea"}},{"arxiv_id":"2002.11616","arxiv_id_is_arxiv":true,"paper":"/paper/zooming-slow-mo-fast-and-accurate-one-stage","title":"Zooming Slow-Mo: Fast and Accurate One-Stage Space-Time Video Super-Resolution","date":"2020-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YapengTian/TDAN-VSR-CVPR-2020","path":"loss.py","file_url":"https://github.com/YapengTian/TDAN-VSR-CVPR-2020/blob/HEAD/loss.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":"d4e819ca1651f5bd","code_sha256_prefix":"d4e819ca1651f5bd","mcp_get_code":{"code_sha256":"d4e819ca1651f5bd"}}],"record_sha256":"9668c3eb927b7415cd08029d439ad2272198209b8a783fa0fa020cf04f4bb0a3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}