{"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/logit","entry":"logit","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":16,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":2,"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":14,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":13,"n_places":16,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":1,"ran_violates":2,"ran_draft_wrong":2,"ran_fixture":0,"ran":9,"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":"2608.16689","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-16689","title":"Hide&Seek: Learning to Explain in an End-to-End Differentiable Network","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"shap/shap","path":"shap/links.py","file_url":"https://github.com/shap/shap/blob/HEAD/shap/links.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff39ee5daf145263","code_sha256_prefix":"ff39ee5daf145263","mcp_get_code":{"code_sha256":"ff39ee5daf145263"}},{"arxiv_id":"2606.12476","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-12476","title":"Quickest Detection of Hallucination Onset: Delay Bounds and Learned CUSUM Statistics","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"YehudaItkin/quickest-hallucination-onset","path":"gap_analysis.py","file_url":"https://github.com/YehudaItkin/quickest-hallucination-onset/blob/HEAD/gap_analysis.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4d244c709d78560","code_sha256_prefix":"b4d244c709d78560","mcp_get_code":{"code_sha256":"b4d244c709d78560"}},{"arxiv_id":"2412.06540","arxiv_id_is_arxiv":true,"paper":"/paper/sloth-scaling-laws-for-llm-skills-to-predict","title":"Sloth: scaling laws for LLM skills to predict multi-benchmark performance across families","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"felipemaiapolo/sloth","path":"sloth/sloth.py","file_url":"https://github.com/felipemaiapolo/sloth/blob/HEAD/sloth/sloth.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c96121833ed7e023","code_sha256_prefix":"c96121833ed7e023","mcp_get_code":{"code_sha256":"c96121833ed7e023"}},{"arxiv_id":"2410.10791","arxiv_id_is_arxiv":true,"paper":"/paper/condition-aware-multimodal-fusion-for-robust","title":"CAFuser: Condition-Aware Multimodal Fusion for Robust Semantic Perception of Driving Scenes","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timbroed/cafuser","path":"cafuser/modeling/feature_adapter/mlp_learnable_ratio.py","file_url":"https://github.com/timbroed/cafuser/blob/HEAD/cafuser/modeling/feature_adapter/mlp_learnable_ratio.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"efc14f938a363004","code_sha256_prefix":"efc14f938a363004","mcp_get_code":{"code_sha256":"efc14f938a363004"}},{"arxiv_id":"2405.09629","arxiv_id_is_arxiv":true,"paper":"/paper/calodream-detector-response-emulation-via","title":"CaloDREAM -- Detector Response Emulation via Attentive flow Matching","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"heidelberg-hepml/calo_dreamer","path":"src/transforms.py","file_url":"https://github.com/heidelberg-hepml/calo_dreamer/blob/HEAD/src/transforms.py","status":"ran","verification_level":1,"contract_check":null,"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, heidelberg-hepml/calo_dreamer when it was checked","code_sha256":"0de7a61745a2f6c0","code_sha256_prefix":"0de7a61745a2f6c0","mcp_get_code":{"code_sha256":"0de7a61745a2f6c0"}},{"arxiv_id":"2402.09259","arxiv_id_is_arxiv":true,"paper":"/paper/syntaxshap-syntax-aware-explainability-method","title":"SyntaxShap: Syntax-aware Explainability Method for Text Generation","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"k-amara/syntax-shap","path":"syntaxshap/links.py","file_url":"https://github.com/k-amara/syntax-shap/blob/HEAD/syntaxshap/links.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fecc5a713db5e4c9","code_sha256_prefix":"fecc5a713db5e4c9","mcp_get_code":{"code_sha256":"fecc5a713db5e4c9"}},{"arxiv_id":"2310.03515","arxiv_id_is_arxiv":true,"paper":"/paper/high-dimensional-bayesian-optimization-with-6","title":"High-dimensional Bayesian Optimization with Group Testing","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gtboauthors/gtbo","path":"gtbo/util.py","file_url":"https://github.com/gtboauthors/gtbo/blob/HEAD/gtbo/util.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":"0063cd243163f52e","code_sha256_prefix":"0063cd243163f52e","mcp_get_code":{"code_sha256":"0063cd243163f52e"}},{"arxiv_id":"2309.00073","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-variational-autoencoder-for","title":"Diffusion Variational Autoencoder for Tackling Stochasticity in Multi-Step Regression Stock Price Prediction","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"koa-fin/dva","path":"model/neural_operations.py","file_url":"https://github.com/koa-fin/dva/blob/HEAD/model/neural_operations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, koa-fin/dva, is not in the permissive set Syntology serves inline","code_sha256":"d42ce56b29f68801","code_sha256_prefix":"d42ce56b29f68801","mcp_get_code":{"code_sha256":"d42ce56b29f68801"}},{"arxiv_id":"2302.12238","arxiv_id_is_arxiv":true,"paper":"/paper/improving-adaptive-conformal-prediction-using","title":"Improving Adaptive Conformal Prediction Using Self-Supervised Learning","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seedatnabeel/sscp","path":"src/VIME/supervised_models.py","file_url":"https://github.com/seedatnabeel/sscp/blob/HEAD/src/VIME/supervised_models.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":"c3a4797422393459","code_sha256_prefix":"c3a4797422393459","mcp_get_code":{"code_sha256":"c3a4797422393459"}},{"arxiv_id":"2212.08158","arxiv_id_is_arxiv":true,"paper":"/paper/mm-shap-a-performance-agnostic-metric-for","title":"MM-SHAP: A Performance-agnostic Metric for Measuring Multimodal Contributions in Vision and Language Models & Tasks","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"heidelberg-nlp/mm-shap","path":"shap/links.py","file_url":"https://github.com/heidelberg-nlp/mm-shap/blob/HEAD/shap/links.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bb689134796e145f","code_sha256_prefix":"bb689134796e145f","mcp_get_code":{"code_sha256":"bb689134796e145f"}},{"arxiv_id":"2106.06819","arxiv_id_is_arxiv":true,"paper":"/paper/d2c-diffusion-denoising-models-for-few-shot","title":"D2C: Diffusion-Denoising Models for Few-shot Conditional Generation","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiamings/d2c","path":"d2c/autoencoder/neural_operations.py","file_url":"https://github.com/jiamings/d2c/blob/HEAD/d2c/autoencoder/neural_operations.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from koa-fin/dva, and AGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"d42ce56b29f68801","code_sha256_prefix":"d42ce56b29f68801","mcp_get_code":{"code_sha256":"d42ce56b29f68801"}},{"arxiv_id":"2011.07439","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-variational-inference-for-sparse-1","title":"Efficient Variational Inference for Sparse Deep Learning with Theoretical Guarantee","date":"2020-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JinchengBai/sparse-variational-bnn","path":"models/sparsefunc.py","file_url":"https://github.com/JinchengBai/sparse-variational-bnn/blob/HEAD/models/sparsefunc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, JinchengBai/sparse-variational-bnn when it was checked","code_sha256":"0126ad8ebd601b60","code_sha256_prefix":"0126ad8ebd601b60","mcp_get_code":{"code_sha256":"0126ad8ebd601b60"}},{"arxiv_id":"2010.13972","arxiv_id_is_arxiv":true,"paper":"/paper/gputreeshap-fast-parallel-tree","title":"GPUTreeShap: Massively Parallel Exact Calculation of SHAP Scores for Tree Ensembles","date":"2020-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slundberg/esvalues","path":"shap/links.py","file_url":"https://github.com/slundberg/esvalues/blob/HEAD/shap/links.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff39ee5daf145263","code_sha256_prefix":"ff39ee5daf145263","mcp_get_code":{"code_sha256":"ff39ee5daf145263"}},{"arxiv_id":"1804.00779","arxiv_id_is_arxiv":true,"paper":"/paper/neural-autoregressive-flows","title":"Neural Autoregressive Flows","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bradyneal/realcause","path":"models/preprocess.py","file_url":"https://github.com/bradyneal/realcause/blob/HEAD/models/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4560f0beb233e14c","code_sha256_prefix":"4560f0beb233e14c","mcp_get_code":{"code_sha256":"4560f0beb233e14c"}},{"arxiv_id":"1611.06585","arxiv_id_is_arxiv":true,"paper":"/paper/variational-boosting-iteratively-refining","title":"Variational Boosting: Iteratively Refining Posterior Approximations","date":"2016-11-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andymiller/vboost","path":"code/vbproj/vi/vboost/misc.py","file_url":"https://github.com/andymiller/vboost/blob/HEAD/code/vbproj/vi/vboost/misc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6484ceeef4eab518","code_sha256_prefix":"6484ceeef4eab518","mcp_get_code":{"code_sha256":"6484ceeef4eab518"}},{"arxiv_id":"1509.06751","arxiv_id_is_arxiv":true,"paper":"/paper/on-galactic-density-modeling-in-the-presence","title":"On Galactic density modeling in the presence of dust extinction","date":null,"month_inferred_from_arxiv_id":"2015-09","title_source":"archive","repo":"jobovy/apogee-maps","path":"py/densprofiles.py","file_url":"https://github.com/jobovy/apogee-maps/blob/HEAD/py/densprofiles.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"29e8793857a17a31","code_sha256_prefix":"29e8793857a17a31","mcp_get_code":{"code_sha256":"29e8793857a17a31"}}],"record_sha256":"ba8e3efecf9061e72ce85d11e45e1ba7b237cf45ac8563b0b51b6b5b2d7f0bef","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}