{"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/aggregate-max","entry":"aggregate_max","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":5,"n_papers_ran":3,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":2},"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":"2310.18716","paper":"/paper/laplacian-canonization-a-minimalist-approach-1","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"georgemlp/laplacian-canonization","path":"layers/pna_utils.py","file_url":"https://github.com/georgemlp/laplacian-canonization/blob/HEAD/layers/pna_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0cb93154c335108f","mcp_get_code":{"code_sha256":"0cb93154c335108f"}},{"arxiv_id":"2205.00354","paper":"/paper/graph-anisotropic-diffusion","title":"Graph Anisotropic Diffusion","date":"2022-04-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahmed-a-a-elhag/gad","path":"src/gad_layer.py","file_url":"https://github.com/ahmed-a-a-elhag/gad/blob/HEAD/src/gad_layer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6e209aaa6a7b8d96","mcp_get_code":{"code_sha256":"6e209aaa6a7b8d96"}},{"arxiv_id":"2110.07875","paper":"/paper/graph-neural-networks-with-learnable-1","title":"Graph Neural Networks with Learnable Structural and Positional Representations","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vijaydwivedi75/gnn-lspe","path":"layers/pna_utils.py","file_url":"https://github.com/vijaydwivedi75/gnn-lspe/blob/HEAD/layers/pna_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0cb93154c335108f","mcp_get_code":{"code_sha256":"0cb93154c335108f"}},{"arxiv_id":"2010.02863","paper":"/paper/directional-graph-networks-1","title":"Directional Graph Networks","date":"2020-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gbouritsas/gsn","path":"directional_gsn/nets/aggregators.py","file_url":"https://github.com/gbouritsas/gsn/blob/HEAD/directional_gsn/nets/aggregators.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ee86c81b47055403","mcp_get_code":{"code_sha256":"ee86c81b47055403"}},{"arxiv_id":"2004.05718","paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Saro00/DGN","path":"models/pytorch/dgn_layer.py","file_url":"https://github.com/Saro00/DGN/blob/HEAD/models/pytorch/dgn_layer.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a8ff41179e540bd","mcp_get_code":{"code_sha256":"6a8ff41179e540bd"}},{"arxiv_id":"2004.05718","paper":"/paper/principal-neighbourhood-aggregation-for-graph","title":"Principal Neighbourhood Aggregation for Graph Nets","date":"2020-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"changminwu/expandergnn","path":"layers/pna_layer.py","file_url":"https://github.com/changminwu/expandergnn/blob/HEAD/layers/pna_layer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0cb93154c335108f","mcp_get_code":{"code_sha256":"0cb93154c335108f"}}]}