{"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/graphconvolutionlayer","entry":"GraphConvolutionLayer","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":7,"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":7,"n_samples_ran":7,"n_samples_constructed":3,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":4,"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":7,"unverified":0},"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.07961","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-07961","title":"Graph Representation Learning Augmented Model Manipulation on Federated Fine-Tuning of LLMs","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"GuangLun2000/AugMP","path":"models.py","file_url":"https://github.com/GuangLun2000/AugMP/blob/HEAD/models.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":"f8e7149fe7998410","code_sha256_prefix":"f8e7149fe7998410","mcp_get_code":{"code_sha256":"f8e7149fe7998410"}},{"arxiv_id":"2410.02195","arxiv_id_is_arxiv":true,"paper":"/paper/backtime-backdoor-attacks-on-multivariate","title":"BACKTIME: Backdoor Attacks on Multivariate Time Series Forecasting","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaolin-cs/backtime","path":"attack.py","file_url":"https://github.com/xiaolin-cs/backtime/blob/HEAD/attack.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xiaolin-cs/backtime when it was checked","code_sha256":"3633ef331728c18d","code_sha256_prefix":"3633ef331728c18d","mcp_get_code":{"code_sha256":"3633ef331728c18d"}},{"arxiv_id":"2303.05095","arxiv_id_is_arxiv":true,"paper":"/paper/trajectory-aware-body-interaction-transformer","title":"Trajectory-Aware Body Interaction Transformer for Multi-Person Pose Forecasting","date":"2023-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiaogangpeng/socialtgcn","path":"baselines/SocialTGCN/net.py","file_url":"https://github.com/xiaogangpeng/socialtgcn/blob/HEAD/baselines/SocialTGCN/net.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, xiaogangpeng/socialtgcn when it was checked","code_sha256":"81deb80b5a9cf4aa","code_sha256_prefix":"81deb80b5a9cf4aa","mcp_get_code":{"code_sha256":"81deb80b5a9cf4aa"}},{"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":"a71906f960cae0a7","code_sha256_prefix":"a71906f960cae0a7","mcp_get_code":{"code_sha256":"a71906f960cae0a7"}},{"arxiv_id":"2101.12555","arxiv_id_is_arxiv":true,"paper":"/paper/out-of-town-recommendation-with-travel","title":"Out-of-Town Recommendation with Travel Intention Modeling","date":"2021-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xhran2010/TrainOR_AAAI21","path":"Pytorch/model.py","file_url":"https://github.com/xhran2010/TrainOR_AAAI21/blob/HEAD/Pytorch/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xhran2010/TrainOR_AAAI21 when it was checked","code_sha256":"500404a100ddddea","code_sha256_prefix":"500404a100ddddea","mcp_get_code":{"code_sha256":"500404a100ddddea"}},{"arxiv_id":"1809.10341","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sam131112/Deep-Graph-Infomax-Implementation","path":"deepgraphinfomax.py","file_url":"https://github.com/Sam131112/Deep-Graph-Infomax-Implementation/blob/HEAD/deepgraphinfomax.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, Sam131112/Deep-Graph-Infomax-Implementation when it was checked","code_sha256":"3410df5150572826","code_sha256_prefix":"3410df5150572826","mcp_get_code":{"code_sha256":"3410df5150572826"}},{"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":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1dbf66eba24dbc7e","code_sha256_prefix":"1dbf66eba24dbc7e","mcp_get_code":{"code_sha256":"1dbf66eba24dbc7e"}}],"record_sha256":"3ad1faaebf4fb5c5ea0f308244b403a1d24372282cd5b3e724ec42e9895a2e0d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}