Home › Code › log1mexp

log1mexp

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

log1mexp appears in the code Syntology harvested for 11 papers, as 10 distinct code bodies found in 11 places (a place is one code body under one paper). Of the 11 papers, 11 with a sample that ran: 9 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument. 9 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 log1mexp 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 10 distinct code bodies named log1mexp: 10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 1 violated, 7 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:

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

Licence is a property of each copy, so it is counted per place: 1 of the 11 places is pointer only (Syntology does not serve that copy's text). 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

11 papers shown of 11, newest first; 11 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; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). 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
Cross-Tokenizer Distillation via Approximate Likelihood Matching 25 Mar 2025 bminixhofer/alm/tokenkit/training/losses.py 291bf36d858a5fae ran · violated contract fingerprinted Apache-2.0 (permissive)
A Unified Approach to Count-Based Weakly-Supervised Learning 22 Nov 2023 ucla-starai/countloss/PU/count_loss_funcs/loss_func.py fa12928489b0b771 ran fingerprinted no licence file found · pointer only
DiNADO: Norm-Disentangled Neurally-Decomposed Oracles for Controlling Language Models 20 Jun 2023 pluslabnlp/dinado/modeling_nado_gpt2.py 8ba0f8f3e23a2d69 ran · our draft was wrong fingerprinted MIT (permissive)
Greedy Poisson Rejection Sampling 2023-05 (from id) gergely-flamich/greedy-poisson-rejection-sampling/greedy_poisson_rejection_sampling/util.py 92c8e6cbc338e078 ran fingerprinted MIT (permissive)
arXiv:2212.12393 2022-12 (from id) HEmile/a-nesi/anesi/util.py e6d270b8b278238d ran fingerprinted Apache-2.0 (permissive)
Differentiable Top-k Classification Learning 15 Jun 2022 felix-petersen/difftopk/difftopk/smooth_topk.py b02fd556128a43d3 ran MIT (permissive)
Easy Variational Inference for Categorical Models via an Independent Binary Approximation 31 May 2022 tufts-ml/categorical-from-binary/src/categorical_from_binary/math.py 3ab47a237d19109f ran fingerprinted MIT (permissive)
Sparse Graph Learning from Spatiotemporal Time Series 26 May 2022 andreacini/sparse-graph-learning/lib/utils/distributions.py 4b6920b87353639b ran fingerprinted MIT (permissive)
A Differentiable Point Process with Its Application to Spiking Neural Networks 2 Jun 2021 ibm-research-tokyo/diffsnn/src/diffsnn/diffpopp/base.py 97c36c49c9eaba81 ran · our draft was wrong fingerprinted Apache-2.0 (permissive)
SPPL: Probabilistic Programming with Fast Exact Symbolic Inference 7 Oct 2020 probcomp/sppl/src/math_util.py 27e10e42bf839bd7 ran fingerprinted Apache-2.0 (permissive)
Smooth Loss Functions for Deep Top-k Classification 21 Feb 2018 oval-group/smooth-topk/topk/logarithm.py b02fd556128a43d3 ran MIT (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