{"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/dist","entry":"dist","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":20,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":13,"n_papers_ran_instrument_only":4,"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":18,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":10,"n_places":20,"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":2,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":2,"ran":8,"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":"2506.15933","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.15933","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"SankarLab/coral-lt-diffusion","path":"diffusion.py","file_url":"https://github.com/SankarLab/coral-lt-diffusion/blob/HEAD/diffusion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dd2712749abbaa24","code_sha256_prefix":"dd2712749abbaa24","mcp_get_code":{"code_sha256":"dd2712749abbaa24"}},{"arxiv_id":"2501.06999","arxiv_id_is_arxiv":true,"paper":"/paper/likelihood-training-of-cascaded-diffusion","title":"Likelihood Training of Cascaded Diffusion Models via Hierarchical Volume-preserving Maps","date":"2025-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lihenryhfl/pcdm","path":"utils.py","file_url":"https://github.com/lihenryhfl/pcdm/blob/HEAD/utils.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":"4ff86972ab4194f5","code_sha256_prefix":"4ff86972ab4194f5","mcp_get_code":{"code_sha256":"4ff86972ab4194f5"}},{"arxiv_id":"2410.05128","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-online-riemannian-optimization","title":"Decentralized Online Riemannian Optimization with Dynamic Environments","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"statsle/dprgd","path":"src/utils/spd.py","file_url":"https://github.com/statsle/dprgd/blob/HEAD/src/utils/spd.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, statsle/dprgd when it was checked","code_sha256":"8b247b8af1325f38","code_sha256_prefix":"8b247b8af1325f38","mcp_get_code":{"code_sha256":"8b247b8af1325f38"}},{"arxiv_id":"2403.06075","arxiv_id_is_arxiv":true,"paper":"/paper/multisize-dataset-condensation","title":"Multisize Dataset Condensation","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-y/multisize-dataset-condensation","path":"reg_ipcx.py","file_url":"https://github.com/he-y/multisize-dataset-condensation/blob/HEAD/reg_ipcx.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9cd6c3a551ef511d","code_sha256_prefix":"9cd6c3a551ef511d","mcp_get_code":{"code_sha256":"9cd6c3a551ef511d"}},{"arxiv_id":"2312.13236","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-models-with-learned-adaptive-noise","title":"Diffusion Models With Learned Adaptive Noise","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-sahoo/mulan","path":"ldm/utils.py","file_url":"https://github.com/s-sahoo/mulan/blob/HEAD/ldm/utils.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":"4ff86972ab4194f5","code_sha256_prefix":"4ff86972ab4194f5","mcp_get_code":{"code_sha256":"4ff86972ab4194f5"}},{"arxiv_id":"2311.17057","arxiv_id_is_arxiv":true,"paper":"/paper/remos-reactive-3d-motion-synthesis-for-two","title":"ReMoS: 3D Motion-Conditioned Reaction Synthesis for Two-Person Interactions","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anindita127/ReMoS","path":"src/Lindyhop/train_body_diffusion.py","file_url":"https://github.com/anindita127/ReMoS/blob/HEAD/src/Lindyhop/train_body_diffusion.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, anindita127/ReMoS when it was checked","code_sha256":"0c9a7d4e93643241","code_sha256_prefix":"0c9a7d4e93643241","mcp_get_code":{"code_sha256":"0c9a7d4e93643241"}},{"arxiv_id":"2305.16645","arxiv_id_is_arxiv":true,"paper":"/paper/summarizing-stream-data-for-memory-restricted","title":"Summarizing Stream Data for Memory-Constrained Online Continual Learning","date":"2023-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vimar-gu/ssd","path":"utils/buffer/summarize_update.py","file_url":"https://github.com/vimar-gu/ssd/blob/HEAD/utils/buffer/summarize_update.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, vimar-gu/ssd when it was checked","code_sha256":"fb69a263598242eb","code_sha256_prefix":"fb69a263598242eb","mcp_get_code":{"code_sha256":"fb69a263598242eb"}},{"arxiv_id":"2305.03935","arxiv_id_is_arxiv":true,"paper":"/paper/improved-techniques-for-maximum-likelihood","title":"Improved Techniques for Maximum Likelihood Estimation for Diffusion ODEs","date":"2023-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/i-dode","path":"utils.py","file_url":"https://github.com/thu-ml/i-dode/blob/HEAD/utils.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":"4ff86972ab4194f5","code_sha256_prefix":"4ff86972ab4194f5","mcp_get_code":{"code_sha256":"4ff86972ab4194f5"}},{"arxiv_id":"2210.03164","arxiv_id_is_arxiv":true,"paper":"/paper/infoot-information-maximizing-optimal","title":"InfoOT: Information Maximizing Optimal Transport","date":"2022-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chingyaoc/infoot","path":"infoot.py","file_url":"https://github.com/chingyaoc/infoot/blob/HEAD/infoot.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":"69f57b89a4daa734","code_sha256_prefix":"69f57b89a4daa734","mcp_get_code":{"code_sha256":"69f57b89a4daa734"}},{"arxiv_id":"2203.12208","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-learning-of-adversarial","title":"Self-supervised Learning of Adversarial Example: Towards Good Generalizations for Deepfake Detection","date":"2022-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangchen527/SLADD","path":"src/networks/synthesizer.py","file_url":"https://github.com/liangchen527/SLADD/blob/HEAD/src/networks/synthesizer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"669a43459c1dcc98","code_sha256_prefix":"669a43459c1dcc98","mcp_get_code":{"code_sha256":"669a43459c1dcc98"}},{"arxiv_id":"2107.14483","arxiv_id_is_arxiv":true,"paper":"/paper/maniskill-learning-from-demonstrations","title":"ManiSkill: Generalizable Manipulation Skill Benchmark with Large-Scale Demonstrations","date":"2021-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidan-curtis/az-manipulator","path":"pointcloud_utils.py","file_url":"https://github.com/aidan-curtis/az-manipulator/blob/HEAD/pointcloud_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6671d48f49a1cae","code_sha256_prefix":"a6671d48f49a1cae","mcp_get_code":{"code_sha256":"a6671d48f49a1cae"}},{"arxiv_id":"2002.08276","arxiv_id_is_arxiv":true,"paper":"/paper/partial-gromov-wasserstein-with-applications","title":"Partial Optimal Transport with Applications on Positive-Unlabeled Learning","date":"2020-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rflamary/POT","path":"ot/dr.py","file_url":"https://github.com/rflamary/POT/blob/HEAD/ot/dr.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":"2118fa5b8b878d5a","code_sha256_prefix":"2118fa5b8b878d5a","mcp_get_code":{"code_sha256":"2118fa5b8b878d5a"}},{"arxiv_id":"2002.03113","arxiv_id_is_arxiv":true,"paper":"/paper/projective-preferential-bayesian-optimization","title":"Projective Preferential Bayesian Optimization","date":"2020-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"P-Mikkola/PPBO","path":"src/kernels.py","file_url":"https://github.com/P-Mikkola/PPBO/blob/HEAD/src/kernels.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":"569567299c57a97c","code_sha256_prefix":"569567299c57a97c","mcp_get_code":{"code_sha256":"569567299c57a97c"}},{"arxiv_id":"1907.08653","arxiv_id_is_arxiv":true,"paper":"/paper/surfing-iterative-optimization-over","title":"Surfing: Iterative optimization over incrementally trained deep networks","date":"2019-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jdlafferty/surfing","path":"codes/Fashion-MNIST/DCGAN/GD_surfing.py","file_url":"https://github.com/jdlafferty/surfing/blob/HEAD/codes/Fashion-MNIST/DCGAN/GD_surfing.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, jdlafferty/surfing when it was checked","code_sha256":"c4d78cc22ede4945","code_sha256_prefix":"c4d78cc22ede4945","mcp_get_code":{"code_sha256":"c4d78cc22ede4945"}},{"arxiv_id":"1904.05068","arxiv_id_is_arxiv":true,"paper":"/paper/relational-knowledge-distillation","title":"Relational Knowledge Distillation","date":"2019-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aquvitae/aquvitae","path":"aquvitae/dist.py","file_url":"https://github.com/aquvitae/aquvitae/blob/HEAD/aquvitae/dist.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":"d14d058d883fceb0","code_sha256_prefix":"d14d058d883fceb0","mcp_get_code":{"code_sha256":"d14d058d883fceb0"}},{"arxiv_id":"1811.01255","arxiv_id_is_arxiv":true,"paper":"/paper/adjoint-method-and-inverse-design-for","title":"Adjoint method and inverse design for nonlinear nanophotonic devices","date":null,"month_inferred_from_arxiv_id":"2018-11","title_source":"archive","repo":"fancompute/angler","path":"angler/filter.py","file_url":"https://github.com/fancompute/angler/blob/HEAD/angler/filter.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":"1744298ad3e56411","code_sha256_prefix":"1744298ad3e56411","mcp_get_code":{"code_sha256":"1744298ad3e56411"}},{"arxiv_id":"1707.06961","arxiv_id_is_arxiv":true,"paper":"/paper/mimicking-word-embeddings-using-subword-rnns","title":"Mimicking Word Embeddings using Subword RNNs","date":"2017-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuvalpinter/Mimick","path":"mimick/model.py","file_url":"https://github.com/yuvalpinter/Mimick/blob/HEAD/mimick/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, yuvalpinter/Mimick, is not in the permissive set Syntology serves inline","code_sha256":"368ebaf2b44bdf06","code_sha256_prefix":"368ebaf2b44bdf06","mcp_get_code":{"code_sha256":"368ebaf2b44bdf06"}},{"arxiv_id":"1705.08039","arxiv_id_is_arxiv":true,"paper":"/paper/poincare-embeddings-for-learning-hierarchical","title":"Poincaré Embeddings for Learning Hierarchical Representations","date":"2017-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nishnik/poincare_embeddings","path":"poincare.py","file_url":"https://github.com/nishnik/poincare_embeddings/blob/HEAD/poincare.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"286b2d4f46b065fb","code_sha256_prefix":"286b2d4f46b065fb","mcp_get_code":{"code_sha256":"286b2d4f46b065fb"}},{"arxiv_id":"1603.00831","arxiv_id_is_arxiv":true,"paper":"/paper/mot16-a-benchmark-for-multi-object-tracking","title":"MOT16: A Benchmark for Multi-Object Tracking","date":"2016-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MedChaabane/DEFT","path":"src/extract_nuscenes_difficulty_splits.py","file_url":"https://github.com/MedChaabane/DEFT/blob/HEAD/src/extract_nuscenes_difficulty_splits.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":"5dd2c507931f01cb","code_sha256_prefix":"5dd2c507931f01cb","mcp_get_code":{"code_sha256":"5dd2c507931f01cb"}},{"arxiv_id":"Liu_FlexUOD_The_Answer_to_Real-world_Unsupervised_Image_Outlier_Detection_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Liu_FlexUOD_The_Answer_to_Real-world_Unsupervised_Image_Outlier_Detection_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zhliu-uod/FlexUOD","path":"method.py","file_url":"https://github.com/zhliu-uod/FlexUOD/blob/HEAD/method.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":"2a73ccd940d25d54","code_sha256_prefix":"2a73ccd940d25d54","mcp_get_code":{"code_sha256":"2a73ccd940d25d54"}}],"record_sha256":"6d37ee921d91d83d3fab390915f1fd7a421bc8963e60d2b42e24218b23cba62e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}