{"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/parameters-to-vector","entry":"parameters_to_vector","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":"2412.00420","arxiv_id_is_arxiv":true,"paper":"/paper/tarot-targeted-data-selection-via-optimal","title":"TAROT: Targeted Data Selection via Optimal Transport","date":"2024-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vita-epfl/tarot","path":"tarot/utils.py","file_url":"https://github.com/vita-epfl/tarot/blob/HEAD/tarot/utils.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":"1beca9a599ec7fec","code_sha256_prefix":"1beca9a599ec7fec","mcp_get_code":{"code_sha256":"1beca9a599ec7fec"}},{"arxiv_id":"2409.18153","arxiv_id_is_arxiv":true,"paper":"/paper/most-influential-subset-selection-challenges","title":"Most Influential Subset Selection: Challenges, Promises, and Beyond","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sleepymalc/miss","path":"MLP/utlis/grad_calculator.py","file_url":"https://github.com/sleepymalc/miss/blob/HEAD/MLP/utlis/grad_calculator.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, sleepymalc/miss when it was checked","code_sha256":"1def74edcd0ae636","code_sha256_prefix":"1def74edcd0ae636","mcp_get_code":{"code_sha256":"1def74edcd0ae636"}},{"arxiv_id":"2312.06205","arxiv_id_is_arxiv":true,"paper":"/paper/the-journey-not-the-destination-how-data","title":"The Journey, Not the Destination: How Data Guides Diffusion Models","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"madrylab/journey-trak","path":"diffusion_trak/utils.py","file_url":"https://github.com/madrylab/journey-trak/blob/HEAD/diffusion_trak/utils.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":"6063a31c76899f75","code_sha256_prefix":"6063a31c76899f75","mcp_get_code":{"code_sha256":"6063a31c76899f75"}},{"arxiv_id":"2106.04753","arxiv_id_is_arxiv":true,"paper":"/paper/on-sample-based-explanation-methods-for-nlp","title":"On Sample Based Explanation Methods for NLP:Efficiency, Faithfulness, and Semantic Evaluation","date":"2021-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/TracInF","path":"code/pif/influence_functions/hvp_grad.py","file_url":"https://github.com/IBM/TracInF/blob/HEAD/code/pif/influence_functions/hvp_grad.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":"5b72c46a260d3754","code_sha256_prefix":"5b72c46a260d3754","mcp_get_code":{"code_sha256":"5b72c46a260d3754"}},{"arxiv_id":"1902.00744","arxiv_id_is_arxiv":true,"paper":"/paper/asymmetric-valleys-beyond-sharp-and-flat","title":"Asymmetric Valleys: Beyond Sharp and Flat Local Minima","date":"2019-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"962086838/code-for-Asymmetric-Valley","path":"logistic_regression_2params.py","file_url":"https://github.com/962086838/code-for-Asymmetric-Valley/blob/HEAD/logistic_regression_2params.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, 962086838/code-for-Asymmetric-Valley when it was checked","code_sha256":"80ba171bb3f25f9a","code_sha256_prefix":"80ba171bb3f25f9a","mcp_get_code":{"code_sha256":"80ba171bb3f25f9a"}},{"arxiv_id":"1807.02901","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-model-form-uncertainty-in","title":"Quantifying model form uncertainty in Reynolds-averaged turbulence models with Bayesian deep neural networks","date":"2018-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cics-nd/rans-uncertainty","path":"invar-nn/nn/nnUtils.py","file_url":"https://github.com/cics-nd/rans-uncertainty/blob/HEAD/invar-nn/nn/nnUtils.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":"65b3abaaab74f846","code_sha256_prefix":"65b3abaaab74f846","mcp_get_code":{"code_sha256":"65b3abaaab74f846"}},{"arxiv_id":"2024.acl-long.803","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-long.803","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MadryLab/trak","path":"trak/utils.py","file_url":"https://github.com/MadryLab/trak/blob/HEAD/trak/utils.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":"1beca9a599ec7fec","code_sha256_prefix":"1beca9a599ec7fec","mcp_get_code":{"code_sha256":"1beca9a599ec7fec"}}],"record_sha256":"d7a3db848c54d6aa7f068b6f837a11ef2cde9b0d48c3ad47eecbcf06cdc4868a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}