Home › Code › sizeof_fmt

sizeof_fmt

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.

sizeof_fmt appears in the code Syntology harvested for 11 papers, as 6 distinct code bodies found in 13 places (a place is one code body under one paper). Of the 11 papers, 11 with a sample that ran: 2 with a run with no instrument failure, 9 where every run was a failure of Syntology's instrument. 6 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 sizeof_fmt 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 6 distinct code bodies named sizeof_fmt: 6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 5 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
0ran · violated contract
5ran · our draft was wrong
0ran; the contract check could not run
1ran
0unverified
6fingerprinted

Licence is a property of each copy, so it is counted per place: 8 of the 13 places are pointer only (Syntology does not serve that copy's text); at 3 of those 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

11 papers shown of 11, newest first; 13 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
Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues 19 Nov 2024 automl/unlocking_state_tracking/flash-linear-attention_mod/benchmarks/benchmark_training_throughput.py 0292a5d351b11c64 ran · our draft was wrong fingerprinted no licence file found · pointer only
Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues 19 Nov 2024 automl/unlocking_state_tracking/flash-linear-attention_mod/benchmarks/benchmark_generation.py f5a04c30a95f92b6 ran · our draft was wrong fingerprinted no licence file found · pointer only
Multi-marginal Schrödinger Bridges with Iterative Reference Refinement 12 Aug 2024 YunyiShen/SBIRR/package/SBIRR/mem_utils.py 8924c0af3b27df7b ran · our draft was wrong fingerprinted no licence file found · pointer only
Parallelizing Linear Transformers with the Delta Rule over Sequence Length 10 Jun 2024 identical code first harvested elsewhere 0292a5d351b11c64 ran · our draft was wrong fingerprinted licence of this copy not recorded
Gated Linear Attention Transformers with Hardware-Efficient Training 11 Dec 2023 fla-org/flash-linear-attention/benchmarks/benchmark_training_throughput.py 0292a5d351b11c64 ran · our draft was wrong fingerprinted MIT (permissive)
Practical Blind Image Denoising via Swin-Conv-UNet and Data Synthesis 24 Mar 2022 cszn/scunet/utils/utils_googledownload.py 8e2cdf074541b1a3 ran fingerprinted Apache-2.0 (permissive)
Solving Schrödinger Bridges via Maximum Likelihood 3 Jun 2021 franciscovargas/GP_Sinkhorn/gp_sinkhorn/mem_utils.py 8924c0af3b27df7b ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only
Designing a Practical Degradation Model for Deep Blind Image Super-Resolution 25 Mar 2021 cszn/BSRGAN/utils/utils_googledownload.py 8e2cdf074541b1a3 ran fingerprinted Apache-2.0 (permissive)
ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT 27 Apr 2020 littlewine/zeco2/python_pipeline.py 61e01e539c37a709 ran · our draft was wrong fingerprinted MIT (permissive)
On the Relationship between Self-Attention and Convolutional Layers 8 Nov 2019 epfml/attention-cnn/utils/logging.py b6bef72aa7ff57a5 ran · our draft was wrong fingerprinted Apache-2.0 (permissive) here; the stored copy is pointer only
How to Fine-Tune BERT for Text Classification? 14 May 2019 GeorgeLuImmortal/Hierarchical-BERT-Model-with-Limited-Labelled-Data/run_hbm.py b6bef72aa7ff57a5 ran · our draft was wrong fingerprinted no licence file found · pointer only
OpenReview id openreview_WsNpCXq6SG AlayaDB-AI/FiX/benchmarks/benchmark_training_throughput.py 0292a5d351b11c64 ran · our draft was wrong fingerprinted MIT (permissive)
OpenReview id openreview_WsNpCXq6SG AlayaDB-AI/FiX/benchmarks/benchmark_generation.py f5a04c30a95f92b6 ran · our draft was wrong fingerprinted MIT (permissive) here; the stored copy is pointer only

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