Home › Code › binarize

binarize

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.

binarize appears in the code Syntology harvested for 22 papers, as 19 distinct code bodies found in 22 places (a place is one code body under one paper). Of the 22 papers, 21 with a sample that ran: 16 with a run with no instrument failure, 5 where every run was a failure of Syntology's instrument. 11 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 binarize 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 19 distinct code bodies named binarize: 18 ran (of which 1 constructed an object rather than computing a result; 15 with no instrument failure: 4 honoured, 0 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 1 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:

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

Licence is a property of each copy, so it is counted per place: 6 of the 22 places are 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

22 papers shown of 22, newest first; 22 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 1 papers added by Syntology; 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
Memorize Early, Then Query: Inlier-Memorization-Guided Active Outlier Detection added by Syntology 2026-01 (from id) mskang0306/IMBoost/IMBoost.py 15c11a69ec2b760b ran · honoured contract fingerprinted no licence file found · pointer only
Online Continuous Generalized Category Discovery 24 Aug 2024 khu-agi/ocgcd/losses.py 9501bf152737299c ran · our draft was wrong no licence file found · pointer only
Advancing Multi-grained Alignment for Contrastive Language-Audio Pre-training 15 Aug 2024 ming-er/mga-clap/zero_shot_grounding.py d54701181d5e77fb ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only
Text-like Encoding of Collaborative Information in Large Language Models for Recommendation 5 Jun 2024 zyang1580/BinLLM/minigpt4/models/rec_base_models.py 2f7ae58aeda42ee6 ran · metamorphic tier: deterministic fingerprinted no licence file found · pointer only
Size-invariance Matters: Rethinking Metrics and Losses for Imbalanced Multi-object Salient Object Detection 16 May 2024 ferry-li/si-sod/src/datasets/utils.py c339b6b7b22e541d ran no licence file found · pointer only
Understanding Hyperbolic Metric Learning through Hard Negative Sampling 23 Apr 2024 yunyuny/hypmix/proxy_anchor/losses.py 9501bf152737299c ran · our draft was wrong MIT (permissive)
OLMo: Accelerating the Science of Language Models 1 Feb 2024 ningyuxu/tip_of_tongue/calf/utils/file.py c445b3401a0c2dc5 ran MIT (permissive)
Individualizing Glioma Radiotherapy Planning by Optimization of Data and Physics-Informed Discrete Loss 2023-12 (from id) rayzhangzirui/pinn/losses.py ee7e0a67eca3ee28 ran · honoured contract fingerprinted no licence file found · pointer only
Proxy Anchor-based Unsupervised Learning for Continuous Generalized Category Discovery 20 Jul 2023 hy2mk/cgcd/losses.py 9501bf152737299c ran · our draft was wrong MIT (permissive)
Injecting Logical Constraints into Neural Networks via Straight-Through Estimators 10 Jul 2023 azreasoners/cl-ste/ste.py 2229724b2f4c61c8 ran · honoured contract fingerprinted MIT (permissive)
Energy-Motivated Equivariant Pretraining for 3D Molecular Graphs 18 Jul 2022 jiaor17/3d-emgp/script/finetune_qm9.py 6d5f9e03fb5171ad ran · honoured contract fingerprinted MIT (permissive)
SQUID: Deep Feature In-Painting for Unsupervised Anomaly Detection 26 Nov 2021 tiangexiang/squid/models/basic_modules.py 3fa73f2e0d35c1f3 ran fingerprinted MIT (permissive)
Variational Inference with Continuously-Indexed Normalizing Flows 10 Jul 2020 anthonycaterini/cif-vi/cif/metrics.py f07338c77c98e2a7 ran fingerprinted MIT (permissive)
Generalized and Scalable Optimal Sparse Decision Trees 15 Jun 2020 zhichen96/interpretable_ml_metamaterials/create_bin_datasets.py 9e227a78a07c0705 ran MIT (permissive)
PanNuke Dataset Extension, Insights and Baselines 24 Mar 2020 okunator/Dippa/src/utils/mask_utils.py df537567c64fea4a ran fingerprinted MIT (permissive)
GP-VAE: Deep Probabilistic Time Series Imputation 9 Jul 2019 ratschlab/GP-VAE/lib/healing_mnist.py a3d689eec1875034 unverified MIT (permissive)
Beyond the Selected Completely At Random Assumption for Learning from Positive and Unlabeled Data 10 Sep 2018 ML-KULeuven/SAR-PU/sarpu/sarpu/data_processing.py 3d1135a1974c4aa5 ran MIT (permissive)
Towards the first adversarially robust neural network model on MNIST 23 May 2018 bethgelab/AnalysisBySynthesis/abs_models/utils.py 2c8f5ea9c0e6fd95 ran fingerprinted Apache-2.0 (permissive)
Grammar Variational Autoencoder 6 Mar 2017 ZmeiGorynych/generative_playground/src/generative_playground/codec/cyk.py bc3ae4805ca43d87 ran MIT (permissive)
Opening the Black Box of Deep Neural Networks via Information 2 Mar 2017 etherandrius/information-networks/information/NaftaliTishby.py 0625e50998d14878 ran · our draft was wrong fingerprinted MIT (permissive)
WaveNet: A Generative Model for Raw Audio 12 Sep 2016 rampage644/wavenet/wavenet/utils.py 3a12c3886a1fc338 ran Apache-2.0 (permissive)
AAAI id aaai_25978 jiaor17/3D-EMGP/script/finetune_md17.py 6d5f9e03fb5171ad ran · honoured contract fingerprinted 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