Home › Code › random

random

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.

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

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

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

15 papers shown of 15, newest first; 16 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 3 papers added by Syntology. 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
Domain-Adapted Molecular Language Models for Efficient Search of Make-on-Demand Libraries added by Syntology 2026-08 (from id) fsk-lab/bayleys/src/bayleys/acquisition/acquisition_function.py 42c75da1b51b1483 unverified no licence file found · pointer only
How smoothing the affinity matrix affects neighborhood preservation in t-SNE added by Syntology 2026-08 (from id) aida-ugent/smooth_affinity_tsne/openTSNE/initialization.py 321c8c3b648319f4 ran fingerprinted BSD-3-Clause (permissive)
LC-Opt: Benchmarking Reinforcement Learning and Agentic AI for End-to-End Liquid Cooling Optimization in Data Centers added by Syntology 2025-11 (from id) lbl-srg/modelica-buildings/Buildings/Resources/Python-Sources/KalmanFilter.py 3c198028edf7a2b3 ran · honoured contract fingerprinted no licence file found · pointer only
Graph Neural Flows for Unveiling Systemic Interactions Among Irregularly Sampled Time Series 17 Oct 2024 gmerca/GNeuralFlow/nfe/models/mask.py 0e143234bbc4f077 ran · our draft was wrong MIT (permissive)
Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits 17 Feb 2024 jajajang/lowpopart/calcsubset.py 4cf818bbd16056ad unverified Apache-2.0 (permissive)
Can Active Sampling Reduce Causal Confusion in Offline Reinforcement Learning? 28 Dec 2023 gunshi/offline_active_rl/offline_active_rl/acquisitions.py 8976987f31c76cdb ran MIT (permissive)
Variational Annealing on Graphs for Combinatorial Optimization 23 Nov 2023 ml-jku/vag-co/VAG_CO/GreedyAlgorithms/GreedyGeneral.py 54144a0233d5f681 unverified no licence file found · pointer only
BatchGFN: Generative Flow Networks for Batch Active Learning 26 Jun 2023 s-a-malik/batchgfn/batchgfn/acquisitions/topk.py a4f7d78be6c6ca4f ran Apache-2.0 (permissive)
Black-Box Batch Active Learning for Regression 17 Feb 2023 uqhwen2/MACAL/causal_bald/library/acquisitions.py 19f07f2e51d71313 ran · honoured contract no licence file found · pointer only
A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games 12 Jun 2022 ssokota/mmd/examples/h2h/evaluate.py 01d9233798b0f630 ran; the contract check could not run (RAISES) · metamorphic tier: well formed fingerprinted MIT (permissive)
Learning to Imagine: Diversify Memory for Incremental Learning using Unlabeled Data 19 Apr 2022 TOM-tym/Learn-to-Imagine/CIFAR100/inclearn/lib/herding.py 1e3aea8df18626bf ran fingerprinted MIT (permissive)
Active Learning Helps Pretrained Models Learn the Intended Task 18 Apr 2022 alextamkin/active-learning-pretrained-models/models/acquisition.py 2152d1eded7cbdc7 ran Apache-2.0 (permissive)
Causal-BALD: Deep Bayesian Active Learning of Outcomes to Infer Treatment-Effects from Observational Data 3 Nov 2021 OATML/causal-bald/causal_bald/library/acquisitions.py d1d75b1a3ca1e0b9 ran · honoured contract Apache-2.0 (permissive)
Causal-BALD: Deep Bayesian Active Learning of Outcomes to Infer Treatment-Effects from Observational Data 3 Nov 2021 anndvision/causal-bald/causal_bald/library/acquisitions.py 19f07f2e51d71313 ran · honoured contract Apache-2.0 (permissive) here; the stored copy is pointer only
Learning Reward Functions from Scale Feedback 1 Oct 2021 stanford-iliad/reward-learning-scale-feedback/algos.py dacb1672d08b7dad ran MIT (permissive)
Universal Sentence Encoder 29 Mar 2018 ceshine/textrank_summary_benchmark/baselines.py 06039e3720a58652 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