{"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/fit-model","entry":"fit_model","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":9,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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":8,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":5,"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":2,"ran_fixture":0,"ran":0,"unverified":6},"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":"2606.29331","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29331","title":"Sample Complexity of Scientific Discovery: PAC Learnability of Compositional Function Trees","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"suayptalha/scientific-pac","path":"run_experiments.py","file_url":"https://github.com/suayptalha/scientific-pac/blob/HEAD/run_experiments.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":"746a088e29ceb105","code_sha256_prefix":"746a088e29ceb105","mcp_get_code":{"code_sha256":"746a088e29ceb105"}},{"arxiv_id":"2506.10077","arxiv_id_is_arxiv":true,"paper":"/paper/2506-10077","title":"A quantum semantic framework for natural language processing","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"npc-worldwide/npcpy","path":"npcpy/ml_funcs.py","file_url":"https://github.com/npc-worldwide/npcpy/blob/HEAD/npcpy/ml_funcs.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":"f478d181a9352803","code_sha256_prefix":"f478d181a9352803","mcp_get_code":{"code_sha256":"f478d181a9352803"}},{"arxiv_id":"2311.16026","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-framework-for-generalized-causal","title":"A Neural Framework for Generalized Causal Sensitivity Analysis","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dennisfrauen/neuralcsa","path":"models/stage2.py","file_url":"https://github.com/dennisfrauen/neuralcsa/blob/HEAD/models/stage2.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, dennisfrauen/neuralcsa when it was checked","code_sha256":"720725b37a7c7b4a","code_sha256_prefix":"720725b37a7c7b4a","mcp_get_code":{"code_sha256":"720725b37a7c7b4a"}},{"arxiv_id":"2309.16965","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-continuous-relaxation-for","title":"Controlling Continuous Relaxation for Combinatorial Optimization","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yuma-Ichikawa/CRA4CO","path":"src/gnn.py","file_url":"https://github.com/Yuma-Ichikawa/CRA4CO/blob/HEAD/src/gnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, Yuma-Ichikawa/CRA4CO, is not in the permissive set Syntology serves inline","code_sha256":"335f1f5bcab83bec","code_sha256_prefix":"335f1f5bcab83bec","mcp_get_code":{"code_sha256":"335f1f5bcab83bec"}},{"arxiv_id":"2209.05364","arxiv_id_is_arxiv":true,"paper":"/paper/if-influence-functions-are-the-answer-then","title":"If Influence Functions are the Answer, Then What is the Question?","date":"2022-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"7795d93831d5b4cc","code_sha256_prefix":"7795d93831d5b4cc","mcp_get_code":{"code_sha256":"7795d93831d5b4cc"}},{"arxiv_id":"2107.08189","arxiv_id_is_arxiv":true,"paper":"/paper/beds-bench-behavior-of-ehr-models-under","title":"BEDS-Bench: Behavior of EHR-models under Distributional Shift--A Benchmark","date":"2021-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-health/records-research","path":"beds-bench/benchmark.py","file_url":"https://github.com/google-health/records-research/blob/HEAD/beds-bench/benchmark.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, google-health/records-research when it was checked","code_sha256":"a625fb2efe302935","code_sha256_prefix":"a625fb2efe302935","mcp_get_code":{"code_sha256":"a625fb2efe302935"}},{"arxiv_id":"2102.11249","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-process-nowcasting-application-to","title":"Gaussian Process Nowcasting: Application to COVID-19 Mortality Reporting","date":"2021-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ihawryluk/GP_nowcasting","path":"nowcasting_functions.py","file_url":"https://github.com/ihawryluk/GP_nowcasting/blob/HEAD/nowcasting_functions.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, ihawryluk/GP_nowcasting when it was checked","code_sha256":"75496a2c6fc5ff15","code_sha256_prefix":"75496a2c6fc5ff15","mcp_get_code":{"code_sha256":"75496a2c6fc5ff15"}},{"arxiv_id":"2012.01426","arxiv_id_is_arxiv":true,"paper":"/paper/stellar-population-inference-with-prospector","title":"Stellar Population Inference with Prospector","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"bd-j/prospector","path":"prospect/fitting/fitting.py","file_url":"https://github.com/bd-j/prospector/blob/HEAD/prospect/fitting/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":"c5e301f4210cdfc9","code_sha256_prefix":"c5e301f4210cdfc9","mcp_get_code":{"code_sha256":"c5e301f4210cdfc9"}},{"arxiv_id":"1703.04730","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-black-box-predictions-via","title":"Understanding Black-box Predictions via Influence Functions","date":"2017-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alstonlo/torch-influence","path":"examples/analyze_dogfish.py","file_url":"https://github.com/alstonlo/torch-influence/blob/HEAD/examples/analyze_dogfish.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7795d93831d5b4cc","code_sha256_prefix":"7795d93831d5b4cc","mcp_get_code":{"code_sha256":"7795d93831d5b4cc"}}],"record_sha256":"b8ce2717ba75fc87638d700a6d7dec97fef939f7b904682c76cbb9f9609aeb64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}