Home › Code › none_or_str

none_or_str

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.

none_or_str appears in the code Syntology harvested for 23 papers, as 4 distinct code bodies found in 23 places (a place is one code body under one paper). Of the 23 papers, 1 with a sample that ran: 1 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. 1 of the code bodies carries 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 none_or_str 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 4 distinct code bodies named none_or_str: 1 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; 0 where Syntology's instrument failed) · 3 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
0ran · our draft was wrong
0ran; the contract check could not run
1ran
3unverified
1fingerprinted

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

23 papers shown of 23, newest first; 23 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 5 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
LionMuon: Alternating Spectral and Sign Descent for Efficient Training added by Syntology 2026-05 (from id) brain-lab-research/lion-muon/src/config/base.py 2fc6fdb85f13dc41 unverified MIT (permissive)
When and Why SignSGD Outperforms SGD: A Theoretical Study Based on ℓ 1 -norm Lower Bounds added by Syntology 2026-05 (from id) Dingzhen230/SignSGD_Outperforms_SGD/nanoGPT_expt/src/config/base.py 2fc6fdb85f13dc41 unverified no licence file found · pointer only
Optimsyn: Influence-Guided Rubrics Optimization for Synthetic Data Generation added by Syntology 2026-04 (from id) FanZT6/OptimSyn/training/influence/warmup/data_arguments.py 12b6473bde25b1dd unverified no licence file found · pointer only
The Chicken and Egg Dilemma: Co-optimizing Data and Model Configurations for LLMs added by Syntology 2026-02 (from id) princeton-nlp/LESS/less/train/data_arguments.py 12b6473bde25b1dd unverified MIT (permissive) here; the stored copy is pointer only
Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise added by Syntology 7 Feb 2026 Dingzhen230/Heavy-tailed-Noise-in-LLMs/src/config/base.py 2fc6fdb85f13dc41 unverified no licence file found · pointer only
arXiv:2507.09846 2025-07 (from id) epfml/llm-baselines/src/config/base.py 2fc6fdb85f13dc41 unverified MIT (permissive)
Lumina-Image 2.0: A Unified and Efficient Image Generative Framework 27 Mar 2025 Alpha-VLLM/Lumina-Image-2.0/sample.py 2fc6fdb85f13dc41 unverified Apache-2.0 (permissive)
Multi-Modal Grounded Planning and Efficient Replanning For Learning Embodied Agents with A Few Examples 23 Dec 2024 snumprlab/flare/models/instructions_processed_LP/ALFRED_task_helper.py 3ad8e7f1396f4717 ran fingerprinted MIT (permissive)
DiMSUM: Diffusion Mamba -- A Scalable and Unified Spatial-Frequency Method for Image Generation 6 Nov 2024 vinairesearch/dimsum/dimsum/sample.py 2fc6fdb85f13dc41 unverified BSD-3-Clause (permissive)
FlowTurbo: Towards Real-time Flow-Based Image Generation with Velocity Refiner 26 Sep 2024 shiml20/FlowTurbo/train_utils.py 2fc6fdb85f13dc41 unverified MIT (permissive)
PixWizard: Versatile Image-to-Image Visual Assistant with Open-Language Instructions 23 Sep 2024 afeng-x/pixwizard/sample_pixwizard.py 2fc6fdb85f13dc41 unverified MIT (permissive)
Efficient Diffusion Transformer with Step-wise Dynamic Attention Mediators 11 Aug 2024 leaplabthu/attention-mediators/attention_mediator/train_utils.py 2fc6fdb85f13dc41 unverified no licence file found · pointer only
Lumina-mGPT: Illuminate Flexible Photorealistic Text-to-Image Generation with Multimodal Generative Pretraining 5 Aug 2024 identical code first harvested elsewhere 2fc6fdb85f13dc41 unverified licence of this copy not recorded
TAGCOS: Task-agnostic Gradient Clustered Coreset Selection for Instruction Tuning Data 21 Jul 2024 2003pro/tagcos/train/data_arguments.py 12b6473bde25b1dd unverified no licence file found · pointer only
FiT: Flexible Vision Transformer for Diffusion Model 19 Feb 2024 whlzy/fit/fit/utils/sit_eval_utils.py 2fc6fdb85f13dc41 unverified Apache-2.0 (permissive)
LESS: Selecting Influential Data for Targeted Instruction Tuning 6 Feb 2024 princeton-nlp/less/less/train/data_arguments.py 12b6473bde25b1dd unverified MIT (permissive) here; the stored copy is pointer only
SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformers 16 Jan 2024 willisma/sit/train_utils.py 2fc6fdb85f13dc41 unverified MIT (permissive)
Test-Time Adaptation with CLIP Reward for Zero-Shot Generalization in Vision-Language Models 29 May 2023 mzhaoshuai/RLCF/TPT/params.py 2fc6fdb85f13dc41 unverified Apache-2.0 (permissive)
Challenging interferometric imaging: Machine learning-based source localization from uv-plane observations 2023-05 (from id) tarano/ml-based_source_localization_from_uv-plane/src/libs/utils.py 2fc6fdb85f13dc41 unverified MIT (permissive)
Trust Region Policy Optimisation in Multi-Agent Reinforcement Learning 23 Sep 2021 eduardosebastianrodriguez/phmarl/parse_args.py 2fc6fdb85f13dc41 unverified MIT (permissive)
Recurrent Independent Mechanisms 24 Sep 2019 identical code first harvested elsewhere 2fc6fdb85f13dc41 unverified licence of this copy not recorded
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding 11 Oct 2018 anton-bushuiev/ppiformer/ppiformer/utils/typing.py c44e3a6568479588 unverified MIT (permissive)
Task-Oriented Hand Motion Retargeting for Dexterous Manipulation Imitation 3 Oct 2018 DaphneAntotsiou/task-oriented-hand-retargeting/replay_trajectories.py 2fc6fdb85f13dc41 unverified CC0-1.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