{"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/linear-regression","entry":"linear_regression","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":5,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":1,"ran_fixture":2,"ran":4,"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":"2408.13442","arxiv_id_is_arxiv":true,"paper":"/paper/a-law-of-next-token-prediction-in-large","title":"A Law of Next-Token Prediction in Large Language Models","date":"2024-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hornhehhf/llm-ell","path":"utils.py","file_url":"https://github.com/hornhehhf/llm-ell/blob/HEAD/utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hornhehhf/llm-ell when it was checked","code_sha256":"6b7a283014ad42b4","code_sha256_prefix":"6b7a283014ad42b4","mcp_get_code":{"code_sha256":"6b7a283014ad42b4"}},{"arxiv_id":"2407.06423","arxiv_id_is_arxiv":true,"paper":"/paper/insightbench-evaluating-business-analytics","title":"InsightBench: Evaluating Business Analytics Agents Through Multi-Step Insight Generation","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ServiceNow/insight-bench","path":"insightbench/tools.py","file_url":"https://github.com/ServiceNow/insight-bench/blob/HEAD/insightbench/tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2a116422c9ef6fe","code_sha256_prefix":"b2a116422c9ef6fe","mcp_get_code":{"code_sha256":"b2a116422c9ef6fe"}},{"arxiv_id":"2404.07544","arxiv_id_is_arxiv":true,"paper":"/paper/from-words-to-numbers-your-large-language","title":"From Words to Numbers: Your Large Language Model Is Secretly A Capable Regressor When Given In-Context Examples","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robertvacareanu/llm4regression","path":"src/regressors/sklearn_regressors.py","file_url":"https://github.com/robertvacareanu/llm4regression/blob/HEAD/src/regressors/sklearn_regressors.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, robertvacareanu/llm4regression when it was checked","code_sha256":"8345d65d7210cd50","code_sha256_prefix":"8345d65d7210cd50","mcp_get_code":{"code_sha256":"8345d65d7210cd50"}},{"arxiv_id":"2403.03772","arxiv_id_is_arxiv":true,"paper":"/paper/acceleratedlingam-learning-causal-dags-at-the","title":"AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUs","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"viktour19/culingam","path":"src/culingam/utils.py","file_url":"https://github.com/viktour19/culingam/blob/HEAD/src/culingam/utils.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":"193b3aba5cfe563c","code_sha256_prefix":"193b3aba5cfe563c","mcp_get_code":{"code_sha256":"193b3aba5cfe563c"}},{"arxiv_id":"2212.03771","arxiv_id_is_arxiv":true,"paper":"/paper/expressive-architectures-enhance","title":"Expressive architectures enhance interpretability of dynamics-based neural population models","date":"2022-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snel-repo/expressive-latent-dynamics-paper","path":"paper_src/metrics.py","file_url":"https://github.com/snel-repo/expressive-latent-dynamics-paper/blob/HEAD/paper_src/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c71322c7a67019c6","code_sha256_prefix":"c71322c7a67019c6","mcp_get_code":{"code_sha256":"c71322c7a67019c6"}},{"arxiv_id":"2010.11994","arxiv_id_is_arxiv":true,"paper":"/paper/thresholded-lasso-bandit","title":"Thresholded Lasso Bandit","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cyberagentailab/thresholded-lasso-bandit","path":"algorithms/th_lasso_bandit.py","file_url":"https://github.com/cyberagentailab/thresholded-lasso-bandit/blob/HEAD/algorithms/th_lasso_bandit.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"258dc839c5504047","code_sha256_prefix":"258dc839c5504047","mcp_get_code":{"code_sha256":"258dc839c5504047"}},{"arxiv_id":"2007.11718","arxiv_id_is_arxiv":true,"paper":"/paper/safety-critical-model-predictive-control-with","title":"Safety-Critical Model Predictive Control with Discrete-Time Control Barrier Function","date":"2020-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hybridrobotics/car-racing","path":"car_racing/system/system_identification.py","file_url":"https://github.com/hybridrobotics/car-racing/blob/HEAD/car_racing/system/system_identification.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":"2a3ad68ace23d315","code_sha256_prefix":"2a3ad68ace23d315","mcp_get_code":{"code_sha256":"2a3ad68ace23d315"}},{"arxiv_id":"1905.11979","arxiv_id_is_arxiv":true,"paper":"/paper/causal-confusion-in-imitation-learning","title":"Causal Confusion in Imitation Learning","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pimdh/causal-confusion","path":"ccil/intervention_policy_execution.py","file_url":"https://github.com/pimdh/causal-confusion/blob/HEAD/ccil/intervention_policy_execution.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pimdh/causal-confusion when it was checked","code_sha256":"bfbe698bbd7ffd52","code_sha256_prefix":"bfbe698bbd7ffd52","mcp_get_code":{"code_sha256":"bfbe698bbd7ffd52"}}],"record_sha256":"09d57fa4e77355944213fd8de8ff97f65282a9a551269162b04df37ed1e065d9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}