{"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/ginconv","entry":"GINConv","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":2,"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":5,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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":"2501.03113","paper":"/paper/balancing-efficiency-and-expressiveness","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jks17/hymn","path":"counting_substructures/model.py","file_url":"https://github.com/jks17/hymn/blob/HEAD/counting_substructures/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7e9bf75a0899a21a","mcp_get_code":{"code_sha256":"7e9bf75a0899a21a"}},{"arxiv_id":"2310.12798","paper":"/paper/molca-molecular-graph-language-modeling-with","title":"MolCA: Molecular Graph-Language Modeling with Cross-Modal Projector and Uni-Modal Adapter","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acharkq/MolCA","path":"model/gin_model.py","file_url":"https://github.com/acharkq/MolCA/blob/HEAD/model/gin_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c0c440f396ed14ca","mcp_get_code":{"code_sha256":"c0c440f396ed14ca"}},{"arxiv_id":"2305.00664","paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"model/model.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1a91488ba132deac","mcp_get_code":{"code_sha256":"1a91488ba132deac"}},{"arxiv_id":"2302.08840","paper":"/paper/learnable-topological-features-for","title":"Learnable Topological Features for Phylogenetic Inference via Graph Neural Networks","date":"2023-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zcrabbit/vbpi-gnn","path":"gnnModels_slim.py","file_url":"https://github.com/zcrabbit/vbpi-gnn/blob/HEAD/gnnModels_slim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1322d79d7d191624","mcp_get_code":{"code_sha256":"1322d79d7d191624"}},{"arxiv_id":"2201.08821","paper":"/paper/representing-long-range-context-for-graph-1","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","date":"2022-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucbrise/graphtrans","path":"models/gnn_transformer.py","file_url":"https://github.com/ucbrise/graphtrans/blob/HEAD/models/gnn_transformer.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":"ca2f5cd1f82b9713","mcp_get_code":{"code_sha256":"ca2f5cd1f82b9713"}}]}