{"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/num-params","entry":"num_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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":7,"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":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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.11609","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-few-shot-adaptation-of-vision","title":"Rethinking Few-Shot Adaptation of Vision-Language Models in Two Stages","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FarinaMatteo/rethinking_fewshot_vlms","path":"fs/twostage.py","file_url":"https://github.com/FarinaMatteo/rethinking_fewshot_vlms/blob/HEAD/fs/twostage.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a2c8ca13520da36","code_sha256_prefix":"3a2c8ca13520da36","mcp_get_code":{"code_sha256":"3a2c8ca13520da36"}},{"arxiv_id":"2503.02597","arxiv_id_is_arxiv":true,"paper":"/paper/seeing-is-understanding-unlocking-causal","title":"Seeing is Understanding: Unlocking Causal Attention into Modality-Mutual Attention for Multimodal LLMs","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/aki","path":"codes/open_flamingo/src/modeling_aki.py","file_url":"https://github.com/sony/aki/blob/HEAD/codes/open_flamingo/src/modeling_aki.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, sony/aki (NOASSERTION)","code_sha256":"660aaca8fc241af6","code_sha256_prefix":"660aaca8fc241af6","mcp_get_code":{"code_sha256":"660aaca8fc241af6"}},{"arxiv_id":"2410.22113","arxiv_id_is_arxiv":true,"paper":"/paper/where-do-large-learning-rates-lead-us","title":"Where Do Large Learning Rates Lead Us?","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"isadrtdinov/understanding-large-lrs","path":"synthetic_example/model.py","file_url":"https://github.com/isadrtdinov/understanding-large-lrs/blob/HEAD/synthetic_example/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d28ce1ac93c376f2","code_sha256_prefix":"d28ce1ac93c376f2","mcp_get_code":{"code_sha256":"d28ce1ac93c376f2"}},{"arxiv_id":"2307.04686","arxiv_id_is_arxiv":true,"paper":"/paper/vampnet-music-generation-via-masked-acoustic","title":"VampNet: Music Generation via Masked Acoustic Token Modeling","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugofloresgarcia/vampnet","path":"vampnet/modules/layers.py","file_url":"https://github.com/hugofloresgarcia/vampnet/blob/HEAD/vampnet/modules/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48689cd65df839d6","code_sha256_prefix":"48689cd65df839d6","mcp_get_code":{"code_sha256":"48689cd65df839d6"}},{"arxiv_id":"2307.03214","arxiv_id_is_arxiv":true,"paper":"/paper/preadd-prefix-adaptive-decoding-for","title":"PREADD: Prefix-Adaptive Decoding for Controlled Text Generation","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jonnypei/acl23-preadd","path":"methods/fudge/util.py","file_url":"https://github.com/jonnypei/acl23-preadd/blob/HEAD/methods/fudge/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"48689cd65df839d6","code_sha256_prefix":"48689cd65df839d6","mcp_get_code":{"code_sha256":"48689cd65df839d6"}},{"arxiv_id":"2212.00309","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-adaptive-optimization","title":"Differentially Private Adaptive Optimization with Delayed Preconditioners","date":"2022-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kenziyuliu/dp2","path":"trainers/dp2_adagrad.py","file_url":"https://github.com/kenziyuliu/dp2/blob/HEAD/trainers/dp2_adagrad.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af4f5b33931d44c0","code_sha256_prefix":"af4f5b33931d44c0","mcp_get_code":{"code_sha256":"af4f5b33931d44c0"}},{"arxiv_id":"2112.02761","arxiv_id_is_arxiv":true,"paper":"/paper/bcd-nets-scalable-variational-approaches-for-1","title":"BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery","date":"2021-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ermongroup/bcd-nets","path":"utils.py","file_url":"https://github.com/ermongroup/bcd-nets/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ermongroup/bcd-nets when it was checked","code_sha256":"8872c9d9133d1c5e","code_sha256_prefix":"8872c9d9133d1c5e","mcp_get_code":{"code_sha256":"8872c9d9133d1c5e"}}],"record_sha256":"b18367d9a86530828d3ce5a58694fd31a47d5d19c26056e968ea11dcc6818a5c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}