Home › Code › lmap

lmap

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.

lmap appears in the code Syntology harvested for 15 papers, as 10 distinct code bodies found in 16 places (a place is one code body under one paper). Of the 15 papers, 15 with a sample that ran: 13 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument. 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 lmap 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 10 distinct code bodies named lmap: 10 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; 2 where Syntology's instrument failed) · 0 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
0ran; the contract check could not run
8ran
0unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 3 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. 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
Generative Dense Retrieval: Memory Can Be a Burden 19 Jan 2024 ypw0102/gdr/GDR_model/main_utils.py 64e8746cf3f62e8e ran · our draft was wrong no licence file found · pointer only
FREED++: Improving RL Agents for Fragment-Based Molecule Generation by Thorough Reproduction 18 Jan 2024 airi-institute/ffreed/ffreed/utils.py a18ae998f817f851 ran MIT (permissive)
NapSS: Paragraph-level Medical Text Simplification via Narrative Prompting and Sentence-matching Summarization 11 Feb 2023 LuJunru/NapSS/modeling/utils.py 7c43af131a6f39a6 ran MIT (permissive)
Multimodal Analogical Reasoning over Knowledge Graphs 1 Oct 2022 zjunlp/MKGformer/MKG/lit_models/transformer.py cca3a1dc3db5bbf1 ran MIT (permissive)
RnG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering 17 Sep 2021 salesforce/rng-kbqa/framework/run_generator.py 599d7419b72e40aa ran · our draft was wrong BSD-3-Clause (permissive)
A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation 9 Sep 2021 neukg/kat-tslf/run_kat.py 64e8746cf3f62e8e ran · our draft was wrong MIT (permissive) here; the stored copy is pointer only
A Three-Stage Learning Framework for Low-Resource Knowledge-Grounded Dialogue Generation 9 Sep 2021 neukg/kat-tslf/dial/utils.py 7c43af131a6f39a6 ran MIT (permissive)
Robust Predictable Control 7 Sep 2021 eleurent/highway-env/highway_env/utils.py 56a643e4c0476688 ran MIT (permissive)
Alleviating Exposure Bias via Contrastive Learning for Abstractive Text Summarization 26 Aug 2021 shichaosun/conabssum/src/utils.py 7c43af131a6f39a6 ran MIT (permissive)
Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering 5 Aug 2021 awslabs/durepa-hybrid-qa/src/utils.py e8f0c6a01a6823df ran Apache-2.0 (permissive)
Retrieval Enhanced Model for Commonsense Generation 24 May 2021 HanNight/RE-T5/code/RE-T5/utils.py 7c43af131a6f39a6 ran Apache-2.0 (permissive)
EL-Attention: Memory Efficient Lossless Attention for Generation 11 May 2021 microsoft/fastseq/fastseq_cli/transformers_utils.py 6a66f22f0034f9d3 ran MIT (permissive)
The Power of Scale for Parameter-Efficient Prompt Tuning 18 Apr 2021 exelents/soft-prompt-tuning/utils1.py 7c43af131a6f39a6 ran MIT (permissive)
Structure-Aware Abstractive Conversation Summarization via Discourse and Action Graphs 16 Apr 2021 GT-SALT/Structure-Aware-BART/src/utils.py b508796abb35571f ran MIT (permissive)
Unsupervised Extractive Summarization by Pre-training Hierarchical Transformers 16 Oct 2020 xssstory/STAS/ensemble.py c9934030622e1adf ran MIT recorded; this copy not marked cleared · pointer only
Investigating Pretrained Language Models for Graph-to-Text Generation 16 Jul 2020 UKPLab/plms-graph2text/agenda/utils.py 7c43af131a6f39a6 ran Apache-2.0 (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