{"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/initialize-params","entry":"initialize_params","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":5,"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":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"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":"2503.12811","paper":"/paper/a-multi-power-law-for-loss-curve-prediction","title":"A Multi-Power Law for Loss Curve Prediction Across Learning Rate Schedules","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-yao-01-luo/multipowerlaw","path":"src/fitting.py","file_url":"https://github.com/thu-yao-01-luo/multipowerlaw/blob/HEAD/src/fitting.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f787cc931f766988","mcp_get_code":{"code_sha256":"f787cc931f766988"}},{"arxiv_id":"2410.21955","paper":"/paper/activesplat-high-fidelity-scene","title":"ActiveSplat: High-Fidelity Scene Reconstruction through Active Gaussian Splatting","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Li-Yuetao/ActiveSplat","path":"src/mapper/splatam/splatam.py","file_url":"https://github.com/Li-Yuetao/ActiveSplat/blob/HEAD/src/mapper/splatam/splatam.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e49fc7c22fe0d991","mcp_get_code":{"code_sha256":"e49fc7c22fe0d991"}},{"arxiv_id":"2410.14787","paper":"/paper/privacy-for-free-in-the-over-parameterized","title":"Privacy for Free in the Overparameterized Regime","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simone-bombari/privacy-for-free","path":"utils_NN_JAX.py","file_url":"https://github.com/simone-bombari/privacy-for-free/blob/HEAD/utils_NN_JAX.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"724b2f122c38aaa1","mcp_get_code":{"code_sha256":"724b2f122c38aaa1"}},{"arxiv_id":"2403.07494","paper":"/paper/semgauss-slam-dense-semantic-gaussian","title":"SemGauss-SLAM: Dense Semantic Gaussian Splatting SLAM","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IRMVLab/SemGauss-SLAM","path":"sem_gauss.py","file_url":"https://github.com/IRMVLab/SemGauss-SLAM/blob/HEAD/sem_gauss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5d74e4292739fbc6","mcp_get_code":{"code_sha256":"5d74e4292739fbc6"}},{"arxiv_id":"1906.03972","paper":"/paper/evaluating-the-robustness-of-nearest-neighbor","title":"Evaluating the Robustness of Nearest Neighbor Classifiers: A Primal-Dual Perspective","date":"2019-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangwllu/knn_robustness","path":"knn_robustness/utils/initialize_main.py","file_url":"https://github.com/wangwllu/knn_robustness/blob/HEAD/knn_robustness/utils/initialize_main.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6f49e95895bdf451","mcp_get_code":{"code_sha256":"6f49e95895bdf451"}}]}