Home › Code › minmax

minmax

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.

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

Licence is a property of each copy, so it is counted per place: 4 of the 12 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

12 papers shown of 12, newest first; 12 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; 2 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
From Association to Causation: Improving Retrieval Precision of Retrieval-Augmented Generation via Causal Relations and an Attention Mechanism added by Syntology 2026-08 (from id) Silk-Road/causal-rag-rerank/experiment_reranker.py 5d8d846d7eea6b45 ran · violated contract fingerprinted licence not identified · pointer only
KSE-Web: An Analysis of Hybrid Retrieval and LLM-Assisted Query Expansion for Low-Resource Khmer Semantic Search added by Syntology 2026-08 (from id) back-kh/Khmer-Semantic-Search/codes/evaluate_retrieval.py 0b8da80a15fb112a ran · violated contract fingerprinted MIT (permissive)
Monte Carlo Tree Search based Space Transfer for Black-box Optimization 10 Dec 2024 lamda-bbo/mcts-transfer/mcts/MCTS.py a89769c364b31a64 ran · violated contract fingerprinted no licence file found · pointer only
Temporal Feature Matters: A Framework for Diffusion Model Quantization 28 Jul 2024 modeltc/tfmq-dm/quant/quant_layer.py 71aaede90c9c1031 ran Apache-2.0 (permissive)
Kermut: Composite kernel regression for protein variant effects 9 Apr 2024 OATML-Markslab/ProteinGym/proteingym/performance_DMS_benchmarks.py 1b86eba6fab689e0 ran · violated contract fingerprinted MIT (permissive)
WyCryst: Wyckoff Inorganic Crystal Generator Framework 2023-11 (from id) raymondzhurm/wycryst/utils.py 487948bdbf959f32 ran fingerprinted no licence file found · pointer only
arXiv:2308.08231 2023-08 (from id) ZhangCYG/DDFHO/datasets/base_data.py 870e2b49af036743 ran fingerprinted no licence file found · pointer only
An invertible crystallographic representation for general inverse design of inorganic crystals with targeted properties 15 May 2020 PV-Lab/FTCP/utils.py 6c557e4e71b36dba ran fingerprinted Apache-2.0 (permissive)
Discrete Object Generation with Reversible Inductive Construction 18 Jul 2019 PrincetonLIPS/reversible-inductive-construction/code/genric/laman/joint_network.py 7f42965b0968e4e8 ran fingerprinted MIT (permissive)
EMNIST: an extension of MNIST to handwritten letters 17 Feb 2017 Chizuchizu/amplify-hackathon/src/utils.py 49fda2edf096ba10 ran fingerprinted MIT (permissive)
Spatial Transformer Networks 5 Jun 2015 dabane-ghassan/int-lab-book/src/what_where/display.py 55cf5bb59b4c12a8 ran fingerprinted MIT (permissive)
CVF open access id Huang_TFMQ-DM_Temporal_Feature_Maintenance_Quantization_for_Diffusion_Models_CVPR_2024_paper ModelTC/TFMQ-DM/quant/quant_layer.py 71aaede90c9c1031 ran Apache-2.0 (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