{"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/interpolation","entry":"interpolation","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":2,"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_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_fixture":1,"ran":1,"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":"2502.18969","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hadasah/scaling_laws when it was checked","code_sha256":"910a5e11cfe206a8","code_sha256_prefix":"910a5e11cfe206a8","mcp_get_code":{"code_sha256":"910a5e11cfe206a8"}},{"arxiv_id":"2410.03782","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3fa6fd6e7e271a85","code_sha256_prefix":"3fa6fd6e7e271a85","mcp_get_code":{"code_sha256":"3fa6fd6e7e271a85"}},{"arxiv_id":"2401.02610","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jinec98/dhgcn when it was checked","code_sha256":"f14f4d4fbdfa04ec","code_sha256_prefix":"f14f4d4fbdfa04ec","mcp_get_code":{"code_sha256":"f14f4d4fbdfa04ec"}},{"arxiv_id":"2311.17707","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60bae3c637ca79fb","code_sha256_prefix":"60bae3c637ca79fb","mcp_get_code":{"code_sha256":"60bae3c637ca79fb"}},{"arxiv_id":"2109.04212","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0fb204a7e30e1277","code_sha256_prefix":"0fb204a7e30e1277","mcp_get_code":{"code_sha256":"0fb204a7e30e1277"}},{"arxiv_id":"1810.05893","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, andrerclaudio/channel_estimation, is not in the permissive set Syntology serves inline","code_sha256":"5fd8b0b04164e5d7","code_sha256_prefix":"5fd8b0b04164e5d7","mcp_get_code":{"code_sha256":"5fd8b0b04164e5d7"}}],"record_sha256":"f9e59fd079e2ceaea0e4f801f7ac8c09e24c925d1281c286de717b062128087b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}