{"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/interpolation","entry":"interpolation","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":6,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"unverified":3},"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":"2502.18969","paper":"/paper/mis-fitting-a-survey-of-scaling-laws","title":"(Mis)Fitting: A Survey of Scaling Laws","date":"2025-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hadasah/scaling_laws","path":"paper_analysis_and_plots.py","file_url":"https://github.com/hadasah/scaling_laws/blob/HEAD/paper_analysis_and_plots.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"910a5e11cfe206a8","mcp_get_code":{"code_sha256":"910a5e11cfe206a8"}},{"arxiv_id":"2410.03782","paper":"/paper/dawin-training-free-dynamic-weight","title":"DaWin: Training-free Dynamic Weight Interpolation for Robust Adaptation","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naver-ai/dawin","path":"dawin_rft/main_dawin.py","file_url":"https://github.com/naver-ai/dawin/blob/HEAD/dawin_rft/main_dawin.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3fa6fd6e7e271a85","mcp_get_code":{"code_sha256":"3fa6fd6e7e271a85"}},{"arxiv_id":"2401.02610","paper":"/paper/dhgcn-dynamic-hop-graph-convolution-network","title":"DHGCN: Dynamic Hop Graph Convolution Network for Self-Supervised Point Cloud Learning","date":"2024-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinec98/dhgcn","path":"obj_cls/pranet_lib/inter_region.py","file_url":"https://github.com/jinec98/dhgcn/blob/HEAD/obj_cls/pranet_lib/inter_region.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f14f4d4fbdfa04ec","mcp_get_code":{"code_sha256":"f14f4d4fbdfa04ec"}},{"arxiv_id":"2311.17707","paper":"/paper/sampro3d-locating-sam-prompts-in-3d-for-zero","title":"SAMPro3D: Locating SAM Prompts in 3D for Zero-Shot Scene Segmentation","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GAP-LAB-CUHK-SZ/SAMPro3D","path":"libs/pointops/functions/interpolation.py","file_url":"https://github.com/GAP-LAB-CUHK-SZ/SAMPro3D/blob/HEAD/libs/pointops/functions/interpolation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"60bae3c637ca79fb","mcp_get_code":{"code_sha256":"60bae3c637ca79fb"}},{"arxiv_id":"2109.04212","paper":"/paper/efficient-nearest-neighbor-language-models","title":"Efficient Nearest Neighbor Language Models","date":"2021-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/efficient-knnlm","path":"ef_knnlm/adaptive_retrieval/adaptive_retrieval.py","file_url":"https://github.com/jxhe/efficient-knnlm/blob/HEAD/ef_knnlm/adaptive_retrieval/adaptive_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0fb204a7e30e1277","mcp_get_code":{"code_sha256":"0fb204a7e30e1277"}},{"arxiv_id":"1810.05893","paper":"/paper/deep-learning-based-channel-estimation","title":"Deep Learning-Based Channel Estimation","date":"2018-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrerclaudio/channel_estimation","path":"models.py","file_url":"https://github.com/andrerclaudio/channel_estimation/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"5fd8b0b04164e5d7","mcp_get_code":{"code_sha256":"5fd8b0b04164e5d7"}}]}