Home › Code › greedy_decode

greedy_decode

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

greedy_decode appears in the code Syntology harvested for 9 papers, as 7 distinct code bodies found in 9 places (a place is one code body under one paper). At least one of them ran in 5 of the papers; 0 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 greedy_decode 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 3 of the 7 distinct code bodies named greedy_decode; 4 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

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

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

9 papers shown of 9, newest first; 9 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. 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
A Comparative Evaluation of Embeddings and LLMs in a Greek Book Publisher Setting -The CUP Dataset added by Syntology 2026-07 (from id) beir-cellar/beir/beir/reranking/models/mono_t5.py d85aa8152436724b ran Apache-2.0 (permissive)
M3DBench: Let's Instruct Large Models with Multi-modal 3D Prompts 17 Dec 2023 OpenM3D/M3DBench/models/llm_decoder/generation_utils.py 775ed3f78bf348a5 ran no licence file found · pointer only
LL3DA: Visual Interactive Instruction Tuning for Omni-3D Understanding, Reasoning, and Planning 30 Nov 2023 open3da/ll3da/models/ll3da/generation_utils.py 775ed3f78bf348a5 ran MIT (permissive)
Sentence Embedding Leaks More Information than You Expect: Generative Embedding Inversion Attack to Recover the Whole Sentence 4 May 2023 hkust-knowcomp/geia/decode_beam_search.py 352397365a26270f unverified MIT (permissive)
DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems 8 Oct 2022 dimesteam/dimes/MIS/solvers/intel_treesearch/NPHard/gcn/models.py 4def9750b7938697 ran · our draft was wrong MIT (permissive)
DialoGraph: Incorporating Interpretable Strategy-Graph Networks into Negotiation Dialogues 2 Jun 2021 rishabhjoshi/DialoGraph_ICLR21/src/bot/bot_models.py 8e2d784cf34c95cd unverified Apache-2.0 (permissive)
BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models 17 Apr 2021 UKPLab/beir/beir/reranking/models/mono_t5.py d85aa8152436724b ran Apache-2.0 (permissive)
On the Computational Power of Transformers and its Implications in Sequence Modeling 16 Jun 2020 satwik77/Transformer-Computation-Analysis/Transformer/src/components/utils.py 5f0fe04ab8eb68da unverified MIT (permissive)
An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition 21 Jul 2015 GitYCC/crnn-pytorch/src/ctc_decoder.py f056f6c91ff28c7e 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