Home › Code › logit

logit

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

logit appears in the code Syntology harvested for 16 papers, as 14 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 16 papers, 16 with a sample that ran: 14 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument. 13 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named logit do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 14 distinct code bodies named logit: 14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 2 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
2ran · violated contract
2ran · our draft was wrong
0ran; the contract check could not run
9ran
0unverified
13fingerprinted

Licence is a property of each copy, so it is counted per place: 4 of the 16 places are pointer only (Syntology does not serve that copy's text); at 1 of them this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text (hover the licence cell for why). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

16 papers shown of 16, newest first; 16 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Hide&Seek: Learning to Explain in an End-to-End Differentiable Network added by Syntology 2026-08 (from id) shap/shap/shap/links.py ff39ee5daf145263 ran · honoured contract fingerprinted MIT (permissive)
Quickest Detection of Hallucination Onset: Delay Bounds and Learned CUSUM Statistics added by Syntology 2026-06 (from id) YehudaItkin/quickest-hallucination-onset/gap_analysis.py b4d244c709d78560 ran · violated contract fingerprinted MIT (permissive)
Sloth: scaling laws for LLM skills to predict multi-benchmark performance across families 9 Dec 2024 felipemaiapolo/sloth/sloth/sloth.py c96121833ed7e023 ran fingerprinted MIT (permissive)
CAFuser: Condition-Aware Multimodal Fusion for Robust Semantic Perception of Driving Scenes 14 Oct 2024 timbroed/cafuser/cafuser/modeling/feature_adapter/mlp_learnable_ratio.py efc14f938a363004 ran · our draft was wrong fingerprinted MIT (permissive)
CaloDREAM -- Detector Response Emulation via Attentive flow Matching 2024-05 (from id) heidelberg-hepml/calo_dreamer/src/transforms.py 0de7a61745a2f6c0 ran fingerprinted no licence file found · pointer only
SyntaxShap: Syntax-aware Explainability Method for Text Generation 14 Feb 2024 k-amara/syntax-shap/syntaxshap/links.py fecc5a713db5e4c9 ran · violated contract fingerprinted MIT (permissive)
High-dimensional Bayesian Optimization with Group Testing 5 Oct 2023 gtboauthors/gtbo/gtbo/util.py 0063cd243163f52e ran fingerprinted Apache-2.0 (permissive)
Diffusion Variational Autoencoder for Tackling Stochasticity in Multi-Step Regression Stock Price Prediction 18 Aug 2023 koa-fin/dva/model/neural_operations.py d42ce56b29f68801 ran fingerprinted AGPL-3.0 (copyleft) · pointer only
Improving Adaptive Conformal Prediction Using Self-Supervised Learning 23 Feb 2023 seedatnabeel/sscp/src/VIME/supervised_models.py c3a4797422393459 ran MIT (permissive)
MM-SHAP: A Performance-agnostic Metric for Measuring Multimodal Contributions in Vision and Language Models & Tasks 15 Dec 2022 heidelberg-nlp/mm-shap/shap/links.py bb689134796e145f ran fingerprinted MIT (permissive)
D2C: Diffusion-Denoising Models for Few-shot Conditional Generation 12 Jun 2021 jiamings/d2c/d2c/autoencoder/neural_operations.py d42ce56b29f68801 ran fingerprinted MIT (permissive) here; the stored copy is pointer only
Efficient Variational Inference for Sparse Deep Learning with Theoretical Guarantee 15 Nov 2020 JinchengBai/sparse-variational-bnn/models/sparsefunc.py 0126ad8ebd601b60 ran · our draft was wrong fingerprinted no licence file found · pointer only
GPUTreeShap: Massively Parallel Exact Calculation of SHAP Scores for Tree Ensembles 27 Oct 2020 slundberg/esvalues/shap/links.py ff39ee5daf145263 ran · honoured contract fingerprinted MIT (permissive)
Neural Autoregressive Flows 3 Apr 2018 bradyneal/realcause/models/preprocess.py 4560f0beb233e14c ran fingerprinted MIT (permissive)
Variational Boosting: Iteratively Refining Posterior Approximations 20 Nov 2016 andymiller/vboost/code/vbproj/vi/vboost/misc.py 6484ceeef4eab518 ran fingerprinted MIT (permissive)
On Galactic density modeling in the presence of dust extinction 2015-09 (from id) jobovy/apogee-maps/py/densprofiles.py 29e8793857a17a31 ran fingerprinted BSD-3-Clause (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections