{"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/gcn-2","entry":"gcn","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":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":2,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":7,"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":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":"2602.22270","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22270","title":"Prior Knowledge-enhanced Spatio-temporal Epidemic Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"stdi-lab/STOEP","path":"model/STOEP.py","file_url":"https://github.com/stdi-lab/STOEP/blob/HEAD/model/STOEP.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":"097b1661909d59a6","code_sha256_prefix":"097b1661909d59a6","mcp_get_code":{"code_sha256":"097b1661909d59a6"}},{"arxiv_id":"2505.22815","arxiv_id_is_arxiv":true,"paper":"/paper/imts-is-worth-time-times-channel-patches","title":"IMTS is Worth Time $\\times$ Channel Patches: Visual Masked Autoencoders for Irregular Multivariate Time Series Prediction","date":"2025-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"whu-hzy/vimts","path":"IMTS/lib/models/visionts/models_mae.py","file_url":"https://github.com/whu-hzy/vimts/blob/HEAD/IMTS/lib/models/visionts/models_mae.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, whu-hzy/vimts when it was checked","code_sha256":"319f1727947e81b0","code_sha256_prefix":"319f1727947e81b0","mcp_get_code":{"code_sha256":"319f1727947e81b0"}},{"arxiv_id":"2405.17507","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-sustainable-urban-mobility","title":"Enhancing Sustainable Urban Mobility Prediction with Telecom Data: A Spatio-Temporal Framework Approach","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nnzhan/Graph-WaveNet","path":"model.py","file_url":"https://github.com/nnzhan/Graph-WaveNet/blob/HEAD/model.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":"184e79d001191b9a","code_sha256_prefix":"184e79d001191b9a","mcp_get_code":{"code_sha256":"184e79d001191b9a"}},{"arxiv_id":"2310.00697","arxiv_id_is_arxiv":true,"paper":"/paper/learning-how-to-propagate-messages-in-graph","title":"Learning How to Propagate Messages in Graph Neural Networks","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/l2p","path":"full/normalization.py","file_url":"https://github.com/tengxiao1/l2p/blob/HEAD/full/normalization.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, tengxiao1/l2p when it was checked","code_sha256":"6c563d191528f1d3","code_sha256_prefix":"6c563d191528f1d3","mcp_get_code":{"code_sha256":"6c563d191528f1d3"}},{"arxiv_id":"1903.03825","arxiv_id_is_arxiv":true,"paper":"/paper/interpolation-consistency-training-for-semi","title":"Interpolation Consistency Training for Semi-Supervised Learning","date":"2019-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"20ec0d4caa9c361d","code_sha256_prefix":"20ec0d4caa9c361d","mcp_get_code":{"code_sha256":"20ec0d4caa9c361d"}},{"arxiv_id":"1804.09170","arxiv_id_is_arxiv":true,"paper":"/paper/realistic-evaluation-of-deep-semi-supervised","title":"Realistic Evaluation of Deep Semi-Supervised Learning Algorithms","date":"2018-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"perrying/realistic-ssl-evaluation-pytorch","path":"build_dataset.py","file_url":"https://github.com/perrying/realistic-ssl-evaluation-pytorch/blob/HEAD/build_dataset.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":"20ec0d4caa9c361d","code_sha256_prefix":"20ec0d4caa9c361d","mcp_get_code":{"code_sha256":"20ec0d4caa9c361d"}},{"arxiv_id":"1706.03762","arxiv_id_is_arxiv":true,"paper":"/paper/attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyunwookl/testam","path":"model.py","file_url":"https://github.com/hyunwookl/testam/blob/HEAD/model.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":"b8e1702541f10d9b","code_sha256_prefix":"b8e1702541f10d9b","mcp_get_code":{"code_sha256":"b8e1702541f10d9b"}}],"record_sha256":"43b1e9db5143f76b93aad0c2e1e7387298f570d314b8fa28cab7dcbbbfa987b0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}