{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/aggregator","entry":"Aggregator","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":13,"n_papers_ran":7,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":13,"n_samples_ran":7,"n_samples_fingerprinted":2,"n_places":13,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"unverified":6},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2604.22937","paper":"/paper/arxiv-2604-22937","title":"AutoPyVerifier: Learning Compact Executable Verifiers for Large Language Model Outputs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"megagonlabs/AutoPyVerifier","path":"src/autopyverifier/search.py","file_url":"https://github.com/megagonlabs/AutoPyVerifier/blob/HEAD/src/autopyverifier/search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"f9865b0e7574bb0f","mcp_get_code":{"code_sha256":"f9865b0e7574bb0f"}},{"arxiv_id":"2402.08907","paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zehong-Wang/Subgraph-Pooling","path":"model.py","file_url":"https://github.com/Zehong-Wang/Subgraph-Pooling/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"52ee9c9202618df7","mcp_get_code":{"code_sha256":"52ee9c9202618df7"}},{"arxiv_id":"2308.15512","paper":"/paper/shatter-and-gather-learning-referring-image","title":"Shatter and Gather: Learning Referring Image Segmentation with Text Supervision","date":"2023-08-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kdwonn/SaG","path":"model/cross_modal_attention.py","file_url":"https://github.com/kdwonn/SaG/blob/HEAD/model/cross_modal_attention.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c40d3f0b01f5ae8d","mcp_get_code":{"code_sha256":"c40d3f0b01f5ae8d"}},{"arxiv_id":"2303.15140","paper":"/paper/simplenet-a-simple-network-for-image-anomaly","title":"SimpleNet: A Simple Network for Image Anomaly Detection and Localization","date":"2023-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donaldrr/simplenet","path":"simplenet.py","file_url":"https://github.com/donaldrr/simplenet/blob/HEAD/simplenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"678e7187ec61f5fd","mcp_get_code":{"code_sha256":"678e7187ec61f5fd"}},{"arxiv_id":"2301.12379","paper":"/paper/fedconceptem-robust-federated-learning-under","title":"FedRC: Tackling Diverse Distribution Shifts Challenge in Federated Learning by Robust Clustering","date":"2023-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/fedrc","path":"aggregator.py","file_url":"https://github.com/lins-lab/fedrc/blob/HEAD/aggregator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ca3492d95fdd8118","mcp_get_code":{"code_sha256":"ca3492d95fdd8118"}},{"arxiv_id":"2208.00850","paper":"/paper/subgraph-neighboring-relations-infomax-for","title":"Subgraph Neighboring Relations Infomax for Inductive Link Prediction on Knowledge Graphs","date":"2022-07-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tebmer/SNRI","path":"model/dgl/graph_classifier.py","file_url":"https://github.com/Tebmer/SNRI/blob/HEAD/model/dgl/graph_classifier.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d46dff6f46c30ccc","mcp_get_code":{"code_sha256":"d46dff6f46c30ccc"}},{"arxiv_id":"2207.05837","paper":"/paper/learning-bellman-complete-representations-for","title":"Learning Bellman Complete Representations for Offline Policy Evaluation","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causalml/bcrl","path":"bcrl/agent.py","file_url":"https://github.com/causalml/bcrl/blob/HEAD/bcrl/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9997a720459478f5","mcp_get_code":{"code_sha256":"9997a720459478f5"}},{"arxiv_id":"2103.03642","paper":"/paper/topology-aware-correlations-between-relations","title":"Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs","date":"2021-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MIRALab-USTC/KG-TACT","path":"code/Ranking/model/dgl/rgcn_model.py","file_url":"https://github.com/MIRALab-USTC/KG-TACT/blob/HEAD/code/Ranking/model/dgl/rgcn_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b72691639fe6422f","mcp_get_code":{"code_sha256":"b72691639fe6422f"}},{"arxiv_id":"2011.02690","paper":"/paper/entity-linking-in-100-languages","title":"Entity Linking in 100 Languages","date":"2020-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/tabi","path":"tabi/models/biencoder.py","file_url":"https://github.com/hazyresearch/tabi/blob/HEAD/tabi/models/biencoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e911f82624c5244f","mcp_get_code":{"code_sha256":"e911f82624c5244f"}},{"arxiv_id":"2010.06808","paper":"/paper/just-pick-a-sign-optimizing-deep-multitask","title":"Just Pick a Sign: Optimizing Deep Multitask Models with Gradient Sign Dropout","date":"2020-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"torchjd/torchjd","path":"src/torchjd/aggregation/_graddrop.py","file_url":"https://github.com/torchjd/torchjd/blob/HEAD/src/torchjd/aggregation/_graddrop.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"330de73e3d9328f8","mcp_get_code":{"code_sha256":"330de73e3d9328f8"}},{"arxiv_id":"1812.06127","paper":"/paper/federated-optimization-for-heterogeneous","title":"Federated Optimization in Heterogeneous Networks","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"omarfoq/fedem","path":"aggregator.py","file_url":"https://github.com/omarfoq/fedem/blob/HEAD/aggregator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"60422dff1153974f","mcp_get_code":{"code_sha256":"60422dff1153974f"}},{"arxiv_id":"1806.01261","paper":"/paper/relational-inductive-biases-deep-learning-and","title":"Relational inductive biases, deep learning, and graph networks","date":"2018-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TQCAI/graph_nets_pytorch","path":"modules.py","file_url":"https://github.com/TQCAI/graph_nets_pytorch/blob/HEAD/modules.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"33a8530945e1ca58","mcp_get_code":{"code_sha256":"33a8530945e1ca58"}},{"arxiv_id":"2024.acl-long.332","paper":null,"title":"arXiv:2024.acl-long.332","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BUAAw-ML/SKP","path":"lavis/models/adapt_module/amortized_encdec.py","file_url":"https://github.com/BUAAw-ML/SKP/blob/HEAD/lavis/models/adapt_module/amortized_encdec.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"d7c5991fb3ad95d3","mcp_get_code":{"code_sha256":"d7c5991fb3ad95d3"}}]}