Home › Code › cluster

cluster

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.

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

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

18 papers shown of 18, newest first; 18 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
AdaMuS: Adaptive Multi-view Sparsity Learning for Dimensionally Unbalanced Data added by Syntology 2026-03 (from id) Hayd-coder/AdaMuS/model.py 8081bb690b0a0156 ran · our draft was wrong no licence file found · pointer only
SMIR: Efficient Synthetic Data Pipeline To Improve Multi-Image Reasoning 7 Jan 2025 togethercomputer/smir/pipelines/utils.py 85f12650295bdf24 ran Apache-2.0 (permissive)
Divide, Conquer and Combine: A Training-Free Framework for High-Resolution Image Perception in Multimodal Large Language Models 28 Aug 2024 DreamMr/HR-Bench/dc2_code/dc2/utils.py 3f9926a519f5ffb2 ran; the contract check could not run (RAISES) fingerprinted no licence file found · pointer only
Enhancing Argument Summarization: Prioritizing Exhaustiveness in Key Point Generation and Introducing an Automatic Coverage Evaluation Metric 17 Apr 2024 b14ck-sun/arg-sum/Method/methods.py 38af21b7320fcb58 ran no licence file found · pointer only
Which Examples to Annotate for In-Context Learning? Towards Effective and Efficient Selection 30 Oct 2023 amazon-science/adaptive-in-context-learning/algorithms.py a7424bb088354401 ran Apache-2.0 (permissive)
Learning Concise and Descriptive Attributes for Visual Recognition 7 Aug 2023 wangyu-ustc/LM4CV/cluster.py dbbc089ece1bfd75 unverified no licence file found · pointer only
Learning Achievement Structure for Structured Exploration in Domains with Sparse Reward 30 Apr 2023 pairlab/iclr-23-sea/torchbeast/core/clustering.py e495eadf9ce0d91a unverified no licence file found · pointer only
Interpretable statistical representations of neural population dynamics and geometry 6 Apr 2023 Dynamics-of-Neural-Systems-Lab/MARBLE/MARBLE/geometry.py 741d528192ec3611 ran MIT (permissive)
Combating noisy labels in object detection datasets 25 Nov 2022 safednn-group/safednn-clean/safednn-clean.py f6aa8e08cab69de8 ran · our draft was wrong GPL-3.0 (copyleft) · pointer only
PlaneMVS: 3D Plane Reconstruction from Multi-View Stereo 22 Mar 2022 oppo-us-research/planemvs/data_preparation/cluster.py e69c3883b85c1033 ran fingerprinted MIT (permissive)
$AIR^2$ for Interaction Prediction 16 Nov 2021 david9dragon9/air/clustering.py b79faa5e5d306089 unverified Apache-2.0 (permissive)
Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning 15 Sep 2020 cmavro/HeMI/layers/cluster.py c6f62788994e24d4 ran MIT (permissive)
Towards Robust Classification with Deep Generative Forests 11 Jul 2020 AlCorreia/GeFs/gefs/cluster.py f0903cda1a853f9f unverified MIT (permissive)
Modeling Shared Responses in Neuroimaging Studies through MultiView ICA 11 Jun 2020 hbp-brain-charting/public_protocols/Color/colored_patch.py 9d5bc491034f54ec ran fingerprinted BSD-3-Clause (permissive)
End to end learning and optimization on graphs 31 May 2019 bwilder0/clusternet/models.py 1578e3feffde89cb unverified MIT (permissive)
Towards End-to-End Lane Detection: an Instance Segmentation Approach 15 Feb 2018 hq-jiang/instance-segmentation-with-discriminative-loss-tensorflow/clustering.py 861f83b2deb0beda unverified MIT (permissive)
Joint 2D-3D-Semantic Data for Indoor Scene Understanding 3 Feb 2017 jamycheung/trans4pass/adaptations/model/memory.py 525fc4fc5ea60036 ran Apache-2.0 (permissive)
AAAI id aaai_6994 dlinzhao/JSNet/utils/clustering.py 2036959ea2b2653d unverified 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