Home › Code › get_colors

get_colors

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.

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

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

13 papers shown of 13, 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, and the graph's for 2 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
Twisted Schrödinger Bridge Matching added by Syntology 2026-07 (from id) maxencenoble/twisted-sb-matching/bridge/runners/plotters.py 241ac1670aa7bf23 unverified MIT (permissive)
Model Forensics: Investigating Whether Concerning Behavior Reflects Misalignment added by Syntology 2026-06 (from id) gkroiz/model_forensics_paper/src/model_incrimination_paper/plotting.py d134fa1b3032ebc7 ran · honoured contract no licence file found · pointer only
UniScene: Unified Occupancy-centric Driving Scene Generation 6 Dec 2024 arlo0o/uniscene-unified-occupancy-centric-driving-scene-generation/occupancy_gen/map_visualizer.py bcc7fc71a1ced4e3 ran Apache-2.0 (permissive)
Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees 14 Oct 2024 pnnl/neuromancer/src/neuromancer/plot.py f7718aa07053729c ran · honoured contract fingerprinted licence not identified · pointer only
Superpoint Gaussian Splatting for Real-Time High-Fidelity Dynamic Scene Reconstruction 6 Jun 2024 dnvtmf/SP_GS/gui_edit.py 1424b4f89bc83042 ran · honoured contract fingerprinted MIT (permissive)
Nearest Neighbors GParareal: Improving Scalability of Gaussian Processes for Parallel-in-Time Solvers 2024-05 (from id) Parallel-in-Time-Differential-Equations/Nearest-Neighbors-GParareal/Figure_1.py 3b7dc7e3ead52d15 unverified MIT (permissive)
How Far Are We on the Decision-Making of LLMs? Evaluating LLMs' Gaming Ability in Multi-Agent Environments 18 Mar 2024 CUHK-ARISE/GAMABench/analysis/analysis.py 64fc07382b37576a ran · honoured contract GPL-3.0 (copyleft) · pointer only
Game-theoretic statistics and safe anytime-valid inference 2022-10 (from id) yjchoe/ComparingForecasters/comparecast/plotting.py 375a4934fe59f491 ran MIT (permissive)
Layered Neural Atlases for Consistent Video Editing 23 Sep 2021 ykasten/layered-neural-atlases/evaluate.py b517b213dc8155a1 ran MIT (permissive)
Contrastive Learning of Structured World Models 27 Nov 2019 tkipf/c-swm/utils.py cc674952bed89380 ran MIT (permissive)
Unsupervised Emergence of Egocentric Spatial Structure from Sensorimotor Prediction 4 Jun 2019 alaflaquiere/learn-spatial-structure/gqn_renderer/bullet_tools.py f449c1a2566eada5 ran MIT (permissive)
Fast Patch-based Style Transfer of Arbitrary Style 13 Dec 2016 sylvielee/style-swap-819/evaluate_k_usage.py 0a1c9327c082bad6 ran fingerprinted MIT (permissive)
Neural NILM: Deep Neural Networks Applied to Energy Disaggregation 23 Jul 2015 JackKelly/neuralnilm_prototype/neuralnilm/plot.py 4888c794edf157be 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