Home › Code › Aggregator

Aggregator

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

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

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

13 papers shown of 13, newest first; 13 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
AutoPyVerifier: Learning Compact Executable Verifiers for Large Language Model Outputs added by Syntology 2026-04 (from id) megagonlabs/AutoPyVerifier/src/autopyverifier/search.py f9865b0e7574bb0f unverified BSD-3-Clause (permissive)
Subgraph Pooling: Tackling Negative Transfer on Graphs 14 Feb 2024 Zehong-Wang/Subgraph-Pooling/model.py 52ee9c9202618df7 unverified no licence file found · pointer only
Shatter and Gather: Learning Referring Image Segmentation with Text Supervision 29 Aug 2023 kdwonn/SaG/model/cross_modal_attention.py c40d3f0b01f5ae8d unverified no licence file found · pointer only
SimpleNet: A Simple Network for Image Anomaly Detection and Localization 27 Mar 2023 donaldrr/simplenet/simplenet.py 678e7187ec61f5fd ran fingerprinted MIT (permissive)
FedRC: Tackling Diverse Distribution Shifts Challenge in Federated Learning by Robust Clustering 29 Jan 2023 lins-lab/fedrc/aggregator.py ca3492d95fdd8118 unverified Apache-2.0 (permissive)
Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs 28 Jul 2022 Tebmer/SNRI/model/dgl/graph_classifier.py d46dff6f46c30ccc ran no licence file found · pointer only
Learning Bellman Complete Representations for Offline Policy Evaluation 12 Jul 2022 causalml/bcrl/bcrl/agent.py 9997a720459478f5 ran MIT (permissive)
Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs 5 Mar 2021 MIRALab-USTC/KG-TACT/code/Ranking/model/dgl/rgcn_model.py b72691639fe6422f ran no licence file found · pointer only
Entity Linking in 100 Languages 5 Nov 2020 hazyresearch/tabi/tabi/models/biencoder.py e911f82624c5244f ran · metamorphic tier: deterministic fingerprinted Apache-2.0 (permissive)
Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropout 14 Oct 2020 torchjd/torchjd/src/torchjd/aggregation/_graddrop.py 330de73e3d9328f8 unverified licence not identified · pointer only
Federated Optimization in Heterogeneous Networks 14 Dec 2018 omarfoq/fedem/aggregator.py 60422dff1153974f unverified Apache-2.0 (permissive)
Relational inductive biases, deep learning, and graph networks 4 Jun 2018 TQCAI/graph_nets_pytorch/modules.py 33a8530945e1ca58 ran no licence file found · pointer only
ACL Anthology id 2024.acl-long.332 BUAAw-ML/SKP/lavis/models/adapt_module/amortized_encdec.py d7c5991fb3ad95d3 ran · metamorphic tier: deterministic BSD-3-Clause (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