{"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/graphattention","entry":"GraphAttention","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":5,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":3,"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":8,"n_samples_ran":3,"n_samples_constructed":3,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"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":3,"unverified":5},"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":"2603.22315","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AnthonySu/decision-transformer-traffic when it was checked","code_sha256":"adfb0b0e9093c975","code_sha256_prefix":"adfb0b0e9093c975","mcp_get_code":{"code_sha256":"adfb0b0e9093c975"}},{"arxiv_id":"2204.13413","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd7f3f33e7bb0f41","code_sha256_prefix":"fd7f3f33e7bb0f41","mcp_get_code":{"code_sha256":"fd7f3f33e7bb0f41"}},{"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":"61af68f9191fc0d0","code_sha256_prefix":"61af68f9191fc0d0","mcp_get_code":{"code_sha256":"61af68f9191fc0d0"}},{"arxiv_id":"2004.12704","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"237245c0dd0c21c1","code_sha256_prefix":"237245c0dd0c21c1","mcp_get_code":{"code_sha256":"237245c0dd0c21c1"}},{"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":"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3bd3e21f7881b3ad","code_sha256_prefix":"3bd3e21f7881b3ad","mcp_get_code":{"code_sha256":"3bd3e21f7881b3ad"}},{"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":"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ef6599b549742dd","code_sha256_prefix":"5ef6599b549742dd","mcp_get_code":{"code_sha256":"5ef6599b549742dd"}},{"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":"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89ba00d981eb9302","code_sha256_prefix":"89ba00d981eb9302","mcp_get_code":{"code_sha256":"89ba00d981eb9302"}},{"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":"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,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, abhilash1910/GraphAttentionNetworks (NOASSERTION)","code_sha256":"5e93c4b4d21d5d71","code_sha256_prefix":"5e93c4b4d21d5d71","mcp_get_code":{"code_sha256":"5e93c4b4d21d5d71"}}],"record_sha256":"2fc441ccc16ea6aa905ac6f0d9c63aeba390a1a01af72a21e4d38beaed4e9a69","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}