{"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/gatlayer","entry":"GATLayer","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":4,"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":10,"n_samples_ran":8,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"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":"2608.11658","paper":"/paper/arxiv-2608-11658","title":"Is Per-Agent Policy Composition Safe? Rethinking Successor-Feature Transfer in Cooperative Multi-Agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"RS2002/MA-USFA","path":"tsc/agent.py","file_url":"https://github.com/RS2002/MA-USFA/blob/HEAD/tsc/agent.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4a1bb946049ee916","mcp_get_code":{"code_sha256":"4a1bb946049ee916"}},{"arxiv_id":"2605.00929","paper":"/paper/arxiv-2605-00929","title":"PhaseNet++: Phase-Aware Frequency-Domain Anomaly Detection for Industrial Control Systems via Phase Coherence Graphs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"raviteja-bommireddy/PhaseNet","path":"IS_Project/model/phasenet.py","file_url":"https://github.com/raviteja-bommireddy/PhaseNet/blob/HEAD/IS_Project/model/phasenet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"3d62167cc1d927ed","mcp_get_code":{"code_sha256":"3d62167cc1d927ed"}},{"arxiv_id":"2201.00625","paper":"/paper/gat-cadnet-graph-attention-network-for","title":"GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings","date":"2022-01-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Liberation-happy/GAT-CADNet","path":"model/GATCADNet.py","file_url":"https://github.com/Liberation-happy/GAT-CADNet/blob/HEAD/model/GATCADNet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"11874ac19f2dbef7","mcp_get_code":{"code_sha256":"11874ac19f2dbef7"}},{"arxiv_id":"2010.03994","paper":"/paper/grade-automatic-graph-enhanced-coherence","title":"GRADE: Automatic Graph-Enhanced Coherence Metric for Evaluating Open-Domain Dialogue Systems","date":"2020-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"li3cmz/GRADE","path":"model/evaluation_model/GRADE/model_grade_K1.py","file_url":"https://github.com/li3cmz/GRADE/blob/HEAD/model/evaluation_model/GRADE/model_grade_K1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b6faec2ba335f56","mcp_get_code":{"code_sha256":"5b6faec2ba335f56"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gordicaleksa/pytorch-GAT","path":"models/definitions/GAT.py","file_url":"https://github.com/gordicaleksa/pytorch-GAT/blob/HEAD/models/definitions/GAT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5d5e29ef042a08a8","mcp_get_code":{"code_sha256":"5d5e29ef042a08a8"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lukecavabarrett/pna","path":"models/pytorch/gat/layer.py","file_url":"https://github.com/lukecavabarrett/pna/blob/HEAD/models/pytorch/gat/layer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"50fe8f71c8211753","mcp_get_code":{"code_sha256":"50fe8f71c8211753"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snowkylin/gnn","path":"gnn.py","file_url":"https://github.com/snowkylin/gnn/blob/HEAD/gnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"084e19b084167399","mcp_get_code":{"code_sha256":"084e19b084167399"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhao-tong/GNNs-easy-to-use","path":"GNNs.py","file_url":"https://github.com/zhao-tong/GNNs-easy-to-use/blob/HEAD/GNNs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2e1cd02fdff09cfc","mcp_get_code":{"code_sha256":"2e1cd02fdff09cfc"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"giuseppefutia/link-prediction-code","path":"net.py","file_url":"https://github.com/giuseppefutia/link-prediction-code/blob/HEAD/net.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"52e34cb027943420","mcp_get_code":{"code_sha256":"52e34cb027943420"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shenweichen/GraphNeuralNetwork","path":"gnn/gat.py","file_url":"https://github.com/shenweichen/GraphNeuralNetwork/blob/HEAD/gnn/gat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bd896967c973d652","mcp_get_code":{"code_sha256":"bd896967c973d652"}}]}