{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/kde","entry":"kde","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":3,"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":5,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":2},"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":"2505.17003","paper":"/paper/sufficient-conditions-for-offline-1","title":"Sufficient conditions for offline reactivation in recurrent neural networks","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nandahkrishna/RNNReactivation","path":"utils.py","file_url":"https://github.com/nandahkrishna/RNNReactivation/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"a40a282018beddee","mcp_get_code":{"code_sha256":"a40a282018beddee"}},{"arxiv_id":"2407.01171","paper":"/paper/neural-conditional-probability-for-inference","title":"Neural Conditional Probability for Uncertainty Quantification","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lee-group-cmu/NNKCDE","path":"python/src/nnkcde/core.py","file_url":"https://github.com/lee-group-cmu/NNKCDE/blob/HEAD/python/src/nnkcde/core.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ef6f976bc872ec2c","mcp_get_code":{"code_sha256":"ef6f976bc872ec2c"}},{"arxiv_id":"2305.15404","paper":"/paper/roma-revisiting-robust-losses-for-dense","title":"RoMa: Robust Dense Feature Matching","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parskatt/roma","path":"experiments/train_tiny_roma_v1_outdoor.py","file_url":"https://github.com/parskatt/roma/blob/HEAD/experiments/train_tiny_roma_v1_outdoor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bede7ad2720ef8b3","mcp_get_code":{"code_sha256":"bede7ad2720ef8b3"}},{"arxiv_id":"2303.17342","paper":"/paper/pmatch-paired-masked-image-modeling-for-dense","title":"PMatch: Paired Masked Image Modeling for Dense Geometric Matching","date":"2023-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShngJZ/PMatch","path":"PMatch/PMatch/models/pmatch.py","file_url":"https://github.com/ShngJZ/PMatch/blob/HEAD/PMatch/PMatch/models/pmatch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"50ff7bbc1a8ffd18","mcp_get_code":{"code_sha256":"50ff7bbc1a8ffd18"}},{"arxiv_id":"1910.09779","paper":"/paper/bridging-the-gap-between-f-gans-and","title":"Bridging the Gap Between $f$-GANs and Wasserstein GANs","date":"2019-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/f-wgan","path":"synthetic/kl_wgan.py","file_url":"https://github.com/ermongroup/f-wgan/blob/HEAD/synthetic/kl_wgan.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e43821aa97af1d18","mcp_get_code":{"code_sha256":"e43821aa97af1d18"}},{"arxiv_id":"Edstedt_RoMa_Robust_Dense_Feature_Matching_CVPR_2024_paper","paper":null,"title":"arXiv:Edstedt_RoMa_Robust_Dense_Feature_Matching_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Parskatt/RoMa","path":"experiments/train_tiny_roma_v1_outdoor.py","file_url":"https://github.com/Parskatt/RoMa/blob/HEAD/experiments/train_tiny_roma_v1_outdoor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bede7ad2720ef8b3","mcp_get_code":{"code_sha256":"bede7ad2720ef8b3"}}]}