{"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/graphlayer","entry":"GraphLayer","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":6,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":4,"unverified":2},"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.01657","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01657","title":"FreeGNN: Continual Source-Free Graph Neural Network Adaptation for Renewable Energy Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AraoufBh/FreeGNN","path":"models/freegnn_backbone.py","file_url":"https://github.com/AraoufBh/FreeGNN/blob/HEAD/models/freegnn_backbone.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":"756566dc798a5996","code_sha256_prefix":"756566dc798a5996","mcp_get_code":{"code_sha256":"756566dc798a5996"}},{"arxiv_id":"2207.11484","arxiv_id_is_arxiv":true,"paper":"/paper/graphfit-learning-multi-scale-graph","title":"GraphFit: Learning Multi-scale Graph-Convolutional Representation for Point Cloud Normal Estimation","date":"2022-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"UestcJay/GraphFit","path":"models/GraphFit_ms.py","file_url":"https://github.com/UestcJay/GraphFit/blob/HEAD/models/GraphFit_ms.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":"72d3c41e3196966b","code_sha256_prefix":"72d3c41e3196966b","mcp_get_code":{"code_sha256":"72d3c41e3196966b"}},{"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":"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":"83ad8091e5f423e8","code_sha256_prefix":"83ad8091e5f423e8","mcp_get_code":{"code_sha256":"83ad8091e5f423e8"}},{"arxiv_id":"2203.03825","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-hierarchy-into-text-encoder-a","title":"Incorporating Hierarchy into Text Encoder: a Contrastive Learning Approach for Hierarchical Text Classification","date":"2022-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wzh9969/contrastive-htc","path":"model/contrast.py","file_url":"https://github.com/wzh9969/contrastive-htc/blob/HEAD/model/contrast.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":"da6ef7283c459235","code_sha256_prefix":"da6ef7283c459235","mcp_get_code":{"code_sha256":"da6ef7283c459235"}},{"arxiv_id":"2106.06947","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-network-based-anomaly-detection","title":"Graph Neural Network-Based Anomaly Detection in Multivariate Time Series","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d-ailin/GDN","path":"models/GDN.py","file_url":"https://github.com/d-ailin/GDN/blob/HEAD/models/GDN.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":"ca482b12c909dd59","code_sha256_prefix":"ca482b12c909dd59","mcp_get_code":{"code_sha256":"ca482b12c909dd59"}},{"arxiv_id":"2004.13826","arxiv_id_is_arxiv":true,"paper":"/paper/every-document-owns-its-structure-inductive","title":"Every Document Owns Its Structure: Inductive Text Classification via Graph Neural Networks","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Niousha12/Text_Classification_via_GNN","path":"model.py","file_url":"https://github.com/Niousha12/Text_Classification_via_GNN/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, Niousha12/Text_Classification_via_GNN when it was checked","code_sha256":"e90730bdf82179a1","code_sha256_prefix":"e90730bdf82179a1","mcp_get_code":{"code_sha256":"e90730bdf82179a1"}}],"record_sha256":"9092ad6e163badb39055089cebae8fbc66521fdf93ad3352a7e60dd7cd7e552e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}