Home › Code › GraphEncoder

GraphEncoder

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

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

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

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

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 3 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
Mol-JEPA: A multimodal Joint Embedding Predictive Architecture for Molecules added by Syntology 2026-08 (from id) Boehringer-Ingelheim/mol-jepa/src/models/modules/jepa.py 003c2e4f38303a54 ran · metamorphic tier: invariant no licence file found · pointer only
NodeJEPA: Structure-Conditioned Latent Prediction for Node-Level Graph Self-Supervised Learning added by Syntology 2026-08 (from id) OliverZ-dot/Node-Jepa/graph_jepa/models/graph_jepa.py e7ab863ffa7d71c7 unverified MIT (permissive)
Mastering the Minority: An Uncertainty-guided Multi-Expert Framework for Challenging-tailed Sequence Learning added by Syntology 2026-03 (from id) CQUPTWZX/Multi-experts/code/model/contrast_multi.py 3d94942968d1dc55 unverified no licence file found · pointer only
Graph Edit Distance with General Costs Using Neural Set Divergence 26 Sep 2024 structlearning/graphedx/models/graphedx.py 3f351498dcb392cc unverified MIT (permissive)
HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classification 28 Apr 2022 wzh9969/HPT/models/prompt.py 1f016bcbbfeb4f1f unverified MIT (permissive)
Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification 8 Mar 2022 wzh9969/contrastive-htc/model/contrast.py aa93cb13fe01f92c unverified MIT (permissive)
Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning 12 May 2021 GRAND-Lab/MERIT/net/merit.py c529b4d31915af24 ran MIT (permissive)
Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension 12 May 2020 DancingSoul/NQ_BERT-DM/modules/graph_encoder.py 8d472f7368f335e3 unverified no licence file found · pointer only
Semantic Graphs for Generating Deep Questions 27 Apr 2020 WING-NUS/SG-Deep-Question-Generation/src/onqg/models/Encoders.py 86df33d346709e8e 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