{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/graphattentionlayer","entry":"GraphAttentionLayer","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":24,"n_samples_ran":21,"n_samples_constructed":13,"n_samples_ran_checked":20,"n_samples_instrument":1,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":24,"n_places_pointer_only":11,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":20,"unverified":3},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2605.18072","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18072","title":"MusicDET: Zero-Shot AI-Generated Music Detection","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Chaolei98/MusicDET","path":"model.py","file_url":"https://github.com/Chaolei98/MusicDET/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"208c7531bb636765","code_sha256_prefix":"208c7531bb636765","mcp_get_code":{"code_sha256":"208c7531bb636765"}},{"arxiv_id":"2603.06260","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-06260","title":"Learning to Solve Orienteering Problem with Time Windows and Variable Profits","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"SwonGao/DeCoST","path":"DeCoST/models/SINGLEModel.py","file_url":"https://github.com/SwonGao/DeCoST/blob/HEAD/DeCoST/models/SINGLEModel.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ed80a36e25591db","code_sha256_prefix":"1ed80a36e25591db","mcp_get_code":{"code_sha256":"1ed80a36e25591db"}},{"arxiv_id":"2602.08322","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08322","title":"A Generative Model for Joint Multiple Intent Detection and Slot Filling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LooperXX/AGIF","path":"models/module.py","file_url":"https://github.com/LooperXX/AGIF/blob/HEAD/models/module.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-2.0, as GitHub detects it on this paper's repository, LooperXX/AGIF, is not in the permissive set Syntology serves inline","code_sha256":"4efa9075e8c74ca3","code_sha256_prefix":"4efa9075e8c74ca3","mcp_get_code":{"code_sha256":"4efa9075e8c74ca3"}},{"arxiv_id":"2505.03507","arxiv_id_is_arxiv":true,"paper":"/paper/modality-guided-dynamic-graph-fusion-and","title":"Modality-Guided Dynamic Graph Fusion and Temporal Diffusion for Self-Supervised RGB-T Tracking","date":"2025-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiShenglana/GDSTrack","path":"lib/model/models/WFCG.py","file_url":"https://github.com/LiShenglana/GDSTrack/blob/HEAD/lib/model/models/WFCG.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, LiShenglana/GDSTrack, is not in the permissive set Syntology serves inline","code_sha256":"ed361137aba0c65e","code_sha256_prefix":"ed361137aba0c65e","mcp_get_code":{"code_sha256":"ed361137aba0c65e"}},{"arxiv_id":"2405.04009","arxiv_id_is_arxiv":true,"paper":"/paper/structured-click-control-in-transformer-based","title":"Structured Click Control in Transformer-based Interactive Segmentation","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hahamyt/scc","path":"isegm/model/modeling/gatlayers.py","file_url":"https://github.com/hahamyt/scc/blob/HEAD/isegm/model/modeling/gatlayers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, hahamyt/scc, is not in the permissive set Syntology serves inline","code_sha256":"6e2dfb3168df266d","code_sha256_prefix":"6e2dfb3168df266d","mcp_get_code":{"code_sha256":"6e2dfb3168df266d"}},{"arxiv_id":"2306.15886","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-attention-source-identification","title":"Sequential Attention Source Identification Based on Feature Representation","date":"2023-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cgao-comp/TGASI","path":"code/model.py","file_url":"https://github.com/cgao-comp/TGASI/blob/HEAD/code/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cgao-comp/TGASI when it was checked","code_sha256":"6b47224096e3609b","code_sha256_prefix":"6b47224096e3609b","mcp_get_code":{"code_sha256":"6b47224096e3609b"}},{"arxiv_id":"2306.00172","arxiv_id_is_arxiv":true,"paper":"/paper/learning-for-edge-weighted-online-bipartite","title":"Learning for Edge-Weighted Online Bipartite Matching with Robustness Guarantees","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ren-research/lomar","path":"policy/gnn_hist.py","file_url":"https://github.com/ren-research/lomar/blob/HEAD/policy/gnn_hist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1e0a32bd5e09cc68","code_sha256_prefix":"1e0a32bd5e09cc68","mcp_get_code":{"code_sha256":"1e0a32bd5e09cc68"}},{"arxiv_id":"2110.08551","arxiv_id_is_arxiv":true,"paper":"/paper/hrkd-hierarchical-relational-knowledge","title":"HRKD: Hierarchical Relational Knowledge Distillation for Cross-domain Language Model Compression","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cheneydon/hrkd","path":"models/gnn.py","file_url":"https://github.com/cheneydon/hrkd/blob/HEAD/models/gnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cheneydon/hrkd when it was checked","code_sha256":"8aa25df21252f5a5","code_sha256_prefix":"8aa25df21252f5a5","mcp_get_code":{"code_sha256":"8aa25df21252f5a5"}},{"arxiv_id":"2106.01562","arxiv_id_is_arxiv":true,"paper":"/paper/discriminative-reasoning-for-document-level","title":"Discriminative Reasoning for Document-level Relation Extraction","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xwjim/DRN","path":"code/models/DRN.py","file_url":"https://github.com/xwjim/DRN/blob/HEAD/code/models/DRN.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"91e688bdb73b0536","code_sha256_prefix":"91e688bdb73b0536","mcp_get_code":{"code_sha256":"91e688bdb73b0536"}},{"arxiv_id":"2005.05806","arxiv_id_is_arxiv":true,"paper":"/paper/document-modeling-with-graph-attention","title":"Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension","date":"2020-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DancingSoul/NQ_BERT-DM","path":"modules/graph_encoder.py","file_url":"https://github.com/DancingSoul/NQ_BERT-DM/blob/HEAD/modules/graph_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, DancingSoul/NQ_BERT-DM when it was checked","code_sha256":"472f4c28f8396e93","code_sha256_prefix":"472f4c28f8396e93","mcp_get_code":{"code_sha256":"472f4c28f8396e93"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pengsl-lab/mssl","path":"MSSL/models/layers.py","file_url":"https://github.com/pengsl-lab/mssl/blob/HEAD/MSSL/models/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, pengsl-lab/mssl when it was checked","code_sha256":"ef1e2b2dc826e35c","code_sha256_prefix":"ef1e2b2dc826e35c","mcp_get_code":{"code_sha256":"ef1e2b2dc826e35c"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"subercui/pyGConvAT","path":"layers.py","file_url":"https://github.com/subercui/pyGConvAT/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b9d25ebc1ad21fe","code_sha256_prefix":"2b9d25ebc1ad21fe","mcp_get_code":{"code_sha256":"2b9d25ebc1ad21fe"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"labmlai/annotated_deep_learning_paper_implementations","path":"labml_nn/graphs/gat/experiment.py","file_url":"https://github.com/labmlai/annotated_deep_learning_paper_implementations/blob/HEAD/labml_nn/graphs/gat/experiment.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f133a4cc58a34a5b","code_sha256_prefix":"f133a4cc58a34a5b","mcp_get_code":{"code_sha256":"f133a4cc58a34a5b"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Messham87/COVID_GAT","path":"layers.py","file_url":"https://github.com/Messham87/COVID_GAT/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4830f24ef485057f","code_sha256_prefix":"4830f24ef485057f","mcp_get_code":{"code_sha256":"4830f24ef485057f"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yindong-Zhang/myGAT","path":"layers.py","file_url":"https://github.com/Yindong-Zhang/myGAT/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"deefaca543b8cc51","code_sha256_prefix":"deefaca543b8cc51","mcp_get_code":{"code_sha256":"deefaca543b8cc51"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gcucurull/jax-gat","path":"models.py","file_url":"https://github.com/gcucurull/jax-gat/blob/HEAD/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gcucurull/jax-gat when it was checked","code_sha256":"aaafc660d13f4e16","code_sha256_prefix":"aaafc660d13f4e16","mcp_get_code":{"code_sha256":"aaafc660d13f4e16"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aveek-Saha/Graph-Attention-Net","path":"gat.py","file_url":"https://github.com/Aveek-Saha/Graph-Attention-Net/blob/HEAD/gat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2b7d556bf1ddeea2","code_sha256_prefix":"2b7d556bf1ddeea2","mcp_get_code":{"code_sha256":"2b7d556bf1ddeea2"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AngusMonroe/GAT-pytorch","path":"layers.py","file_url":"https://github.com/AngusMonroe/GAT-pytorch/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bfd816be65963aae","code_sha256_prefix":"bfd816be65963aae","mcp_get_code":{"code_sha256":"bfd816be65963aae"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/RG-Select","path":"models_gat.py","file_url":"https://github.com/basiralab/RG-Select/blob/HEAD/models_gat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, basiralab/RG-Select when it was checked","code_sha256":"7de5ed842bb1f8ae","code_sha256_prefix":"7de5ed842bb1f8ae","mcp_get_code":{"code_sha256":"7de5ed842bb1f8ae"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiyangfb/PyTorchSparseGAT","path":"models.py","file_url":"https://github.com/weiyangfb/PyTorchSparseGAT/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1460d4df9be2ad5","code_sha256_prefix":"a1460d4df9be2ad5","mcp_get_code":{"code_sha256":"a1460d4df9be2ad5"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tatp22/pytorch-fast-GAT","path":"fast_gat/GAT.py","file_url":"https://github.com/tatp22/pytorch-fast-GAT/blob/HEAD/fast_gat/GAT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ae6f08a8fb439cf","code_sha256_prefix":"5ae6f08a8fb439cf","mcp_get_code":{"code_sha256":"5ae6f08a8fb439cf"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dzb1998/pyGAT","path":"layers.py","file_url":"https://github.com/dzb1998/pyGAT/blob/HEAD/layers.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"81f6c5575edeb0bf","code_sha256_prefix":"81f6c5575edeb0bf","mcp_get_code":{"code_sha256":"81f6c5575edeb0bf"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fongyk/graph-attention","path":"layer.py","file_url":"https://github.com/fongyk/graph-attention/blob/HEAD/layer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fongyk/graph-attention when it was checked","code_sha256":"d1505ed1f609826b","code_sha256_prefix":"d1505ed1f609826b","mcp_get_code":{"code_sha256":"d1505ed1f609826b"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"4pygmalion/GAT_tensorflow","path":"GAT/_model.py","file_url":"https://github.com/4pygmalion/GAT_tensorflow/blob/HEAD/GAT/_model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, 4pygmalion/GAT_tensorflow when it was checked","code_sha256":"c2cadcfe69abfe1c","code_sha256_prefix":"c2cadcfe69abfe1c","mcp_get_code":{"code_sha256":"c2cadcfe69abfe1c"}}],"record_sha256":"447f318ccf7d1c655401d36e4b0b8ad14867a4eceed517a77b611d2e9833ac07","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}