Home › Code › search

search

Syntologyentry name in harvested coderead from the graph 2026-09-24

search appears in the code Syntology harvested for 23 papers, as 22 distinct code bodies found in 23 places (a place is one code body under one paper). At least one of them ran in 5 of the papers; 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 search 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 5 of the 22 distinct code bodies named search; 17 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
1ran · violated contract
3ran · our draft was wrong
1ran · fixture could not drive it
0ran
17unverified
1fingerprinted

Licence is a property of each copy, so it is counted per place: 7 of the 23 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 “fixture could not drive it” 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.

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 7 papers added by Syntology; 3 papers have no page here and are shown by arXiv id only. 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, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
The Checking Problem What must be true before AI ships in a regulated firm added by Syntology 2026-07 (from id) dsauce/checking-problem/eval/fetch_public_corpus.py d3dc9cb12fe5b39a unverified licence not identified · pointer only
SAAS: Self-Aware Reinforcement Learning for Over-Search Mitigation in Agentic Search added by Syntology 2026-05 (from id) XMUDeepLIT/SAAS/search/generate_with_search.py e28d00233351c9b2 ran · fixture could not drive it Apache-2.0 (permissive)
An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions added by Syntology 2026-05 (from id) PaulsonLab/PALM-Mean/figure/animate_palm_mean_1d.py c6f27f8feaa4b784 unverified MIT (permissive)
UniHetCO: A Unified Heterogeneous Representation for Multi-Problem Learning in Unsupervised Neural Combinatorial Optimization added by Syntology 2026-03 (from id) drdarshan/ssgetpy/ssgetpy/query.py f67ea4592ba11551 unverified no licence file found · pointer only
EMA Policy Gradient: Taming Reinforcement Learning for LLMs with EMA Anchor and Top-k KL added by Syntology 2026-02 (from id) LunjunZhang/ema-pg/search/infer.py b0919972b9febb29 unverified MIT (permissive)
Language-Coupled Reinforcement Learning for Multilingual Retrieval-Augmented Generation added by Syntology 2026-01 (from id) Cherry-qwq/LcRL-Open/infer.py b0919972b9febb29 unverified Apache-2.0 (permissive)
NeuroPath: Neurobiology-Inspired Path Tracking and Reflection for Semantically Coherent Retrieval added by Syntology 2025-11 (from id) KennyCaty/NeuroPath/src/elastic_search_tool.py 9c0a071dfc20995e unverified MIT (permissive)
SMARTCAL: An Approach to Self-Aware Tool-Use Evaluation and Calibration 11 Dec 2024 Henrysyh2000/SMARTCAL/ART_SM_CAL/sequential_interpreter.py 4d8b1a7898526649 unverified MIT (permissive)
Robustifying and Boosting Training-Free Neural Architecture Search 12 Mar 2024 hzf1174/robot/search_nb201.py a9a567af7564f3f0 unverified Apache-2.0 (permissive)
Key Patch Proposer: Key Patches Contain Rich Information 18 Feb 2024 CA-TT-AC/key-patch-proposer/KPP_utils.py 1227ad7072193a83 unverified no licence file found · pointer only
Align on the Fly: Adapting Chatbot Behavior to Established Norms 26 Dec 2023 gair-nlp/opo/exam_generation/select_principles_for_question_generation.py 2c8d03267be08d1c ran · our draft was wrong fingerprinted no licence file found · pointer only
arXiv:2311.04943 2023-11 (from id) wangqinsi1/MathNAS/dynamic/Linprog.py 56fba0fb8aca624f unverified no licence file found · pointer only
Learning quantum states and unitaries of bounded gate complexity 30 Oct 2023 haimengzhao/bounded-gate-tomography/learn.py 3c29d898400056b1 ran · violated contract no licence file found · pointer only
arXiv:2310.01551 2023-10 (from id) SullivanC19/pydl8.5-topk/topk/algorithms/run_topk.py 908b7793f57c3be0 unverified MIT (permissive)
Adapting Large Language Models to Domains via Reading Comprehension 18 Sep 2023 microsoft/lmops/adaptllm/raw2read.py d6fab253b8d06efb ran · our draft was wrong MIT (permissive)
Unifying and Boosting Gradient-Based Training-Free Neural Architecture Search 24 Jan 2022 shuyao95/HNAS/darts_space/search.py 6cf5b3cb27cb5cd4 unverified no licence file found · pointer only
Improving Graph-based Sentence Ordering with Iteratively Predicted Pairwise Orderings 13 Oct 2021 DeepLearnXMU/IRSEG/dataset_information/TokenMatch.py 555976b5675b1de7 unverified Apache-2.0 (permissive)
Simple Entity-Centric Questions Challenge Dense Retrievers 17 Sep 2021 princeton-nlp/entityquestions/bm25/bm25_retriever.py 7d5cfda09688b35a ran · our draft was wrong MIT (permissive)
Improving Tree-Structured Decoder Training for Code Generation via Mutual Learning 31 May 2021 DeepLearnXMU/CGML/exp_distillation.py c8ef224e9bbb07d6 unverified Apache-2.0 (permissive)
Bringing Old Photos Back to Life 20 Apr 2020 microsoft/Bringing-Old-Photos-Back-to-Life/Face_Detection/detect_all_dlib.py 761a87b13ffc3dfb unverified MIT (permissive)
Relational inductive biases, deep learning, and graph networks 4 Jun 2018 mylonasc/tf-gnns/tf_gnns/agent_docs.py bba2920bf9e6ce2d unverified Apache-2.0 (permissive)
RedNet: Residual Encoder-Decoder Network for indoor RGB-D Semantic Segmentation 4 Jun 2018 lyqcom/rednet30/Initial/common.py 7c1f6cd7e279ed21 unverified Apache-2.0 (permissive)
arXiv:2025.findings-acl.1384 Muennighoff/sgpt/crossencoder/beir/openai_search_endpoint_functionality.py 28d1ad439bb312af 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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