{"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/bias","entry":"bias","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":6,"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":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":1},"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":"2403.09919","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-drafter-for-fast-speculative","title":"Recurrent Drafter for Fast Speculative Decoding in Large Language Models","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-recurrent-drafter","path":"recurrent_drafting/attention.py","file_url":"https://github.com/apple/ml-recurrent-drafter/blob/HEAD/recurrent_drafting/attention.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":"b6b2e19c2f35f52c","code_sha256_prefix":"b6b2e19c2f35f52c","mcp_get_code":{"code_sha256":"b6b2e19c2f35f52c"}},{"arxiv_id":"2402.10797","arxiv_id_is_arxiv":true,"paper":"/paper/blackjax-composable-bayesian-inference-in-jax","title":"BlackJAX: Composable Bayesian inference in JAX","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blackjax-devs/blackjax","path":"blackjax/adaptation/laps.py","file_url":"https://github.com/blackjax-devs/blackjax/blob/HEAD/blackjax/adaptation/laps.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"905d11e4487465d9","code_sha256_prefix":"905d11e4487465d9","mcp_get_code":{"code_sha256":"905d11e4487465d9"}},{"arxiv_id":"2310.04565","arxiv_id_is_arxiv":true,"paper":"/paper/binary-quantification-and-dataset-shift-an","title":"Binary Quantification and Dataset Shift: An Experimental Investigation","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pglez82/quant_datasetshift","path":"reviews_concept_shift.py","file_url":"https://github.com/pglez82/quant_datasetshift/blob/HEAD/reviews_concept_shift.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, pglez82/quant_datasetshift when it was checked","code_sha256":"476c6a3f9ce90398","code_sha256_prefix":"476c6a3f9ce90398","mcp_get_code":{"code_sha256":"476c6a3f9ce90398"}},{"arxiv_id":"2203.14493","arxiv_id_is_arxiv":true,"paper":"/paper/arcs-accurate-rotation-and-correspondence","title":"ARCS: Accurate Rotation and Correspondence Search","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zgojcic/3DSmoothNet","path":"core/ops.py","file_url":"https://github.com/zgojcic/3DSmoothNet/blob/HEAD/core/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ebcac3e4f5ed1d7","code_sha256_prefix":"6ebcac3e4f5ed1d7","mcp_get_code":{"code_sha256":"6ebcac3e4f5ed1d7"}},{"arxiv_id":"2009.06472","arxiv_id_is_arxiv":true,"paper":"/paper/estimating-individual-treatment-effects-using","title":"Estimating Individual Treatment Effects using Non-Parametric Regression Models: a Review","date":"2020-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albicaron/estite","path":"Simulations/ACTG/Code/Python/ACTGdata_GPs.py","file_url":"https://github.com/albicaron/estite/blob/HEAD/Simulations/ACTG/Code/Python/ACTGdata_GPs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, albicaron/estite when it was checked","code_sha256":"66771983c77faa57","code_sha256_prefix":"66771983c77faa57","mcp_get_code":{"code_sha256":"66771983c77faa57"}},{"arxiv_id":"1811.06879","arxiv_id_is_arxiv":true,"paper":"/paper/the-perfect-match-3d-point-cloud-matching","title":"The Perfect Match: 3D Point Cloud Matching with Smoothed Densities","date":"2018-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LONG-9621/Match_SmoothNet","path":"core/ops.py","file_url":"https://github.com/LONG-9621/Match_SmoothNet/blob/HEAD/core/ops.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6ebcac3e4f5ed1d7","code_sha256_prefix":"6ebcac3e4f5ed1d7","mcp_get_code":{"code_sha256":"6ebcac3e4f5ed1d7"}}],"record_sha256":"4991f38b986a3d3487dedbdeba3d78a736a942c42be4c1259d8a9fcac1a25a7c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}