{"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/initialize-params","entry":"initialize_params","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":5,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"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":2},"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":"2503.12811","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f787cc931f766988","code_sha256_prefix":"f787cc931f766988","mcp_get_code":{"code_sha256":"f787cc931f766988"}},{"arxiv_id":"2410.21955","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e49fc7c22fe0d991","code_sha256_prefix":"e49fc7c22fe0d991","mcp_get_code":{"code_sha256":"e49fc7c22fe0d991"}},{"arxiv_id":"2410.14787","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, simone-bombari/privacy-for-free when it was checked","code_sha256":"724b2f122c38aaa1","code_sha256_prefix":"724b2f122c38aaa1","mcp_get_code":{"code_sha256":"724b2f122c38aaa1"}},{"arxiv_id":"2403.07494","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, IRMVLab/SemGauss-SLAM when it was checked","code_sha256":"5d74e4292739fbc6","code_sha256_prefix":"5d74e4292739fbc6","mcp_get_code":{"code_sha256":"5d74e4292739fbc6"}},{"arxiv_id":"1906.03972","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f49e95895bdf451","code_sha256_prefix":"6f49e95895bdf451","mcp_get_code":{"code_sha256":"6f49e95895bdf451"}}],"record_sha256":"70fb208e947c21b4880cce98dab2adea615ed4784715fc19c9c2c586193f6c1f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}