{"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/gat","entry":"GAT","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":16,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":13,"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":25,"n_samples_ran":17,"n_samples_constructed":11,"n_samples_ran_checked":17,"n_samples_instrument":0,"n_samples_unverified":8,"n_samples_fingerprinted":1,"n_places":25,"n_places_pointer_only":12,"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":0,"ran_fixture":0,"ran":17,"unverified":8},"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.07812","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07812","title":"GRASP -Graph-Based Anomaly Detection Through Self-Supervised Classification","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"grbaande/grasp","path":"grasp/detection/classification.py","file_url":"https://github.com/grbaande/grasp/blob/HEAD/grasp/detection/classification.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":"0856f7c786b110a9","code_sha256_prefix":"0856f7c786b110a9","mcp_get_code":{"code_sha256":"0856f7c786b110a9"}},{"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":"25f967655d033233","code_sha256_prefix":"25f967655d033233","mcp_get_code":{"code_sha256":"25f967655d033233"}},{"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":"deterministic","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":"f2287369b0e7bb9b","code_sha256_prefix":"f2287369b0e7bb9b","mcp_get_code":{"code_sha256":"f2287369b0e7bb9b"}},{"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":"8eb47eb449cf9a33","code_sha256_prefix":"8eb47eb449cf9a33","mcp_get_code":{"code_sha256":"8eb47eb449cf9a33"}},{"arxiv_id":"2503.13110","arxiv_id_is_arxiv":true,"paper":"/paper/dtgbrepgen-a-novel-b-rep-generative-model","title":"DTGBrepGen: A Novel B-rep Generative Model through Decoupling Topology and Geometry","date":"2025-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jinli99/DTGBrepGen","path":"model.py","file_url":"https://github.com/jinli99/DTGBrepGen/blob/HEAD/model.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, jinli99/DTGBrepGen when it was checked","code_sha256":"62dce3c7fcf2de8b","code_sha256_prefix":"62dce3c7fcf2de8b","mcp_get_code":{"code_sha256":"62dce3c7fcf2de8b"}},{"arxiv_id":"2412.15496","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-when-and-why-graph-attention","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","date":"2024-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mztmzt/gat_csbm","path":"real_world_experiments/models.py","file_url":"https://github.com/mztmzt/gat_csbm/blob/HEAD/real_world_experiments/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mztmzt/gat_csbm when it was checked","code_sha256":"6e7e1893eef531de","code_sha256_prefix":"6e7e1893eef531de","mcp_get_code":{"code_sha256":"6e7e1893eef531de"}},{"arxiv_id":"2407.16168","arxiv_id_is_arxiv":true,"paper":"/paper/progressively-modality-freezing-for-multi","title":"Progressively Modality Freezing for Multi-Modal Entity Alignment","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninibymilk/PMF-MMEA","path":"model/PMF.py","file_url":"https://github.com/ninibymilk/PMF-MMEA/blob/HEAD/model/PMF.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":"d6be02987f151a14","code_sha256_prefix":"d6be02987f151a14","mcp_get_code":{"code_sha256":"d6be02987f151a14"}},{"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":"1d174c7f1898b9b2","code_sha256_prefix":"1d174c7f1898b9b2","mcp_get_code":{"code_sha256":"1d174c7f1898b9b2"}},{"arxiv_id":"2401.01232","arxiv_id_is_arxiv":true,"paper":"/paper/motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"riemanngraph/motifrgc","path":"models.py","file_url":"https://github.com/riemanngraph/motifrgc/blob/HEAD/models.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":"cbb8804ff702cf89","code_sha256_prefix":"cbb8804ff702cf89","mcp_get_code":{"code_sha256":"cbb8804ff702cf89"}},{"arxiv_id":"2305.11719","arxiv_id_is_arxiv":true,"paper":"/paper/information-screening-whilst-exploiting","title":"Information Screening whilst Exploiting! Multimodal Relation Extraction with Feature Denoising and Multimodal Topic Modeling","date":"2023-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChocoWu/MRE-ISE","path":"cores/gene/model.py","file_url":"https://github.com/ChocoWu/MRE-ISE/blob/HEAD/cores/gene/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, ChocoWu/MRE-ISE when it was checked","code_sha256":"607bce72cdf483ac","code_sha256_prefix":"607bce72cdf483ac","mcp_get_code":{"code_sha256":"607bce72cdf483ac"}},{"arxiv_id":"2207.10398","arxiv_id_is_arxiv":true,"paper":"/paper/d2-tpred-discontinuous-dependency-for","title":"D2-TPred: Discontinuous Dependency for Trajectory Prediction under Traffic Lights","date":"2022-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VTP-TL/D2-TPred","path":"D2TP/models.py","file_url":"https://github.com/VTP-TL/D2-TPred/blob/HEAD/D2TP/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9f6389d6a6ee574","code_sha256_prefix":"a9f6389d6a6ee574","mcp_get_code":{"code_sha256":"a9f6389d6a6ee574"}},{"arxiv_id":"2203.13471","arxiv_id_is_arxiv":true,"paper":"/paper/non-probability-sampling-network-for","title":"Non-Probability Sampling Network for Stochastic Human Trajectory Prediction","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inhwanbae/NPSN","path":"npsn/model.py","file_url":"https://github.com/inhwanbae/NPSN/blob/HEAD/npsn/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7399d4f9a67f6c68","code_sha256_prefix":"7399d4f9a67f6c68","mcp_get_code":{"code_sha256":"7399d4f9a67f6c68"}},{"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":"ef26781a55d5c8c5","code_sha256_prefix":"ef26781a55d5c8c5","mcp_get_code":{"code_sha256":"ef26781a55d5c8c5"}},{"arxiv_id":"2002.07375","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-neural-policies-for-relational","title":"Symbolic Network: Generalized Neural Policies for Relational MDPs","date":"2020-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dair-iitd/symnet","path":"multi_train/symnet/estimators.py","file_url":"https://github.com/dair-iitd/symnet/blob/HEAD/multi_train/symnet/estimators.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, dair-iitd/symnet when it was checked","code_sha256":"54ac990cf4b2df6b","code_sha256_prefix":"54ac990cf4b2df6b","mcp_get_code":{"code_sha256":"54ac990cf4b2df6b"}},{"arxiv_id":"2001.08837","arxiv_id_is_arxiv":true,"paper":"/paper/graph-constrained-reinforcement-learning-for-1","title":"Graph Constrained Reinforcement Learning for Natural Language Action Spaces","date":"2020-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajammanabrolu/KG-A2C","path":"kga2c/models.py","file_url":"https://github.com/rajammanabrolu/KG-A2C/blob/HEAD/kga2c/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"70278f47af24045d","code_sha256_prefix":"70278f47af24045d","mcp_get_code":{"code_sha256":"70278f47af24045d"}},{"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":"isotlaboratory/ml4vrp","path":"modules/layers.py","file_url":"https://github.com/isotlaboratory/ml4vrp/blob/HEAD/modules/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, isotlaboratory/ml4vrp when it was checked","code_sha256":"0543c5506767fe53","code_sha256_prefix":"0543c5506767fe53","mcp_get_code":{"code_sha256":"0543c5506767fe53"}},{"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":"marblet/GNN_models_pytorch_geometric","path":"models/gat.py","file_url":"https://github.com/marblet/GNN_models_pytorch_geometric/blob/HEAD/models/gat.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":"ef36abf2c8ed6532","code_sha256_prefix":"ef36abf2c8ed6532","mcp_get_code":{"code_sha256":"ef36abf2c8ed6532"}},{"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":"marblet/gat-pytorch","path":"gat.py","file_url":"https://github.com/marblet/gat-pytorch/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":"14b29bb3c2e77060","code_sha256_prefix":"14b29bb3c2e77060","mcp_get_code":{"code_sha256":"14b29bb3c2e77060"}},{"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":"1d632b6bedff39f7","code_sha256_prefix":"1d632b6bedff39f7","mcp_get_code":{"code_sha256":"1d632b6bedff39f7"}},{"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":"605946bfc2bfb229","code_sha256_prefix":"605946bfc2bfb229","mcp_get_code":{"code_sha256":"605946bfc2bfb229"}},{"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":"ColdenChan/GAT_D","path":"models/gat.py","file_url":"https://github.com/ColdenChan/GAT_D/blob/HEAD/models/gat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e9b126f3a88cbdd","code_sha256_prefix":"8e9b126f3a88cbdd","mcp_get_code":{"code_sha256":"8e9b126f3a88cbdd"}},{"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":"taishan1994/pytorch_gat","path":"model.py","file_url":"https://github.com/taishan1994/pytorch_gat/blob/HEAD/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, taishan1994/pytorch_gat when it was checked","code_sha256":"ca3843aa2d3c4206","code_sha256_prefix":"ca3843aa2d3c4206","mcp_get_code":{"code_sha256":"ca3843aa2d3c4206"}},{"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":"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, gcucurull/jax-gat when it was checked","code_sha256":"628b8816e46fa27f","code_sha256_prefix":"628b8816e46fa27f","mcp_get_code":{"code_sha256":"628b8816e46fa27f"}},{"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":"Kaimaoge/IGNNK","path":"basic_structure.py","file_url":"https://github.com/Kaimaoge/IGNNK/blob/HEAD/basic_structure.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, Kaimaoge/IGNNK when it was checked","code_sha256":"fb04b1d471c6acc1","code_sha256_prefix":"fb04b1d471c6acc1","mcp_get_code":{"code_sha256":"fb04b1d471c6acc1"}},{"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":"handasontam/GAT-with-edgewise-attention","path":"models/gat.py","file_url":"https://github.com/handasontam/GAT-with-edgewise-attention/blob/HEAD/models/gat.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be71c975b356bf8f","code_sha256_prefix":"be71c975b356bf8f","mcp_get_code":{"code_sha256":"be71c975b356bf8f"}}],"record_sha256":"e728ff5aabaa36e14c987b081d2a0955818b3984fe7379631be0d7239872f087","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}