{"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/graphattention","entry":"GraphAttention","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":8,"n_samples_ran":3,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":5},"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":"2603.22315","paper":"/paper/arxiv-2603-22315","title":"Emergency Preemption Without Online Exploration: A Decision Transformer Approach","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AnthonySu/decision-transformer-traffic","path":"src/models/madt.py","file_url":"https://github.com/AnthonySu/decision-transformer-traffic/blob/HEAD/src/models/madt.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"adfb0b0e9093c975","mcp_get_code":{"code_sha256":"adfb0b0e9093c975"}},{"arxiv_id":"2204.13413","paper":"/paper/hpt-hierarchy-aware-prompt-tuning-for","title":"HPT: Hierarchy-aware Prompt Tuning for Hierarchical Text Classification","date":"2022-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzh9969/HPT","path":"models/prompt.py","file_url":"https://github.com/wzh9969/HPT/blob/HEAD/models/prompt.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd7f3f33e7bb0f41","mcp_get_code":{"code_sha256":"fd7f3f33e7bb0f41"}},{"arxiv_id":"2005.05806","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,"code_sha256_prefix":"61af68f9191fc0d0","mcp_get_code":{"code_sha256":"61af68f9191fc0d0"}},{"arxiv_id":"2004.12704","paper":"/paper/semantic-graphs-for-generating-deep-questions","title":"Semantic Graphs for Generating Deep Questions","date":"2020-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WING-NUS/SG-Deep-Question-Generation","path":"src/onqg/models/Encoders.py","file_url":"https://github.com/WING-NUS/SG-Deep-Question-Generation/blob/HEAD/src/onqg/models/Encoders.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"237245c0dd0c21c1","mcp_get_code":{"code_sha256":"237245c0dd0c21c1"}},{"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":"noahtren/Graph-Attention-Networks-TensorFlow-2","path":"gat.py","file_url":"https://github.com/noahtren/Graph-Attention-Networks-TensorFlow-2/blob/HEAD/gat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3bd3e21f7881b3ad","mcp_get_code":{"code_sha256":"3bd3e21f7881b3ad"}},{"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":"meliketoy/graph-cnn.pytorch","path":"layers.py","file_url":"https://github.com/meliketoy/graph-cnn.pytorch/blob/HEAD/layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ef6599b549742dd","mcp_get_code":{"code_sha256":"5ef6599b549742dd"}},{"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":"YunseobShin/wiki_GAT","path":"keras_gat/graph_attention_layer.py","file_url":"https://github.com/YunseobShin/wiki_GAT/blob/HEAD/keras_gat/graph_attention_layer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"89ba00d981eb9302","mcp_get_code":{"code_sha256":"89ba00d981eb9302"}},{"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":"abhilash1910/GraphAttentionNetworks","path":"GraphAttentionNetworks/GraphMultiheadAttention.py","file_url":"https://github.com/abhilash1910/GraphAttentionNetworks/blob/HEAD/GraphAttentionNetworks/GraphMultiheadAttention.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"5e93c4b4d21d5d71","mcp_get_code":{"code_sha256":"5e93c4b4d21d5d71"}}]}