{"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/gcnlayer","entry":"GCNLayer","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":10,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":10,"n_samples_ran":8,"n_samples_constructed":7,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":10,"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":8,"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":"2604.01595","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-01595","title":"Optimizing EEG Graph Structure for Seizure Detection: An Information Bottleneck and Self-Supervised Learning Approach","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"LabRAI/IRENE","path":"model/IRENE.py","file_url":"https://github.com/LabRAI/IRENE/blob/HEAD/model/IRENE.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":"0781a1cc1150744d","code_sha256_prefix":"0781a1cc1150744d","mcp_get_code":{"code_sha256":"0781a1cc1150744d"}},{"arxiv_id":"2505.13489","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-cross-course-knowledge-tracing","title":"Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer","date":"2025-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DQYZHWK/TransKT","path":"model/TransKT.py","file_url":"https://github.com/DQYZHWK/TransKT/blob/HEAD/model/TransKT.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":"468b69dcd19612b7","code_sha256_prefix":"468b69dcd19612b7","mcp_get_code":{"code_sha256":"468b69dcd19612b7"}},{"arxiv_id":"2410.14970","arxiv_id_is_arxiv":true,"paper":"/paper/taming-the-long-tail-in-human-mobility","title":"Taming the Long Tail in Human Mobility Prediction","date":"2024-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yukayo/lotnext","path":"network.py","file_url":"https://github.com/yukayo/lotnext/blob/HEAD/network.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":"0128b93f0fc0c806","code_sha256_prefix":"0128b93f0fc0c806","mcp_get_code":{"code_sha256":"0128b93f0fc0c806"}},{"arxiv_id":"2405.20690","arxiv_id_is_arxiv":true,"paper":"/paper/unleashing-the-potential-of-diffusion-models","title":"Unleashing the Potential of Diffusion Models for Incomplete Data Imputation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"G-AILab/IGRM","path":"training/gae.py","file_url":"https://github.com/G-AILab/IGRM/blob/HEAD/training/gae.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, G-AILab/IGRM when it was checked","code_sha256":"2bf6368bf67d5224","code_sha256_prefix":"2bf6368bf67d5224","mcp_get_code":{"code_sha256":"2bf6368bf67d5224"}},{"arxiv_id":"2306.07472","arxiv_id_is_arxiv":true,"paper":"/paper/von-mises-mixture-distributions-for-molecular","title":"Von Mises Mixture Distributions for Molecular Conformation Generation","date":"2023-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thejonaslab/vonmises-icml-2023","path":"vonmises/nets.py","file_url":"https://github.com/thejonaslab/vonmises-icml-2023/blob/HEAD/vonmises/nets.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":"168c93ad9382ceab","code_sha256_prefix":"168c93ad9382ceab","mcp_get_code":{"code_sha256":"168c93ad9382ceab"}},{"arxiv_id":"2305.12685","arxiv_id_is_arxiv":true,"paper":"/paper/denoised-self-augmented-learning-for-social","title":"Denoised Self-Augmented Learning for Social Recommendation","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUDS/DSL","path":"Model.py","file_url":"https://github.com/HKUDS/DSL/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, HKUDS/DSL when it was checked","code_sha256":"204cc308fd28e5e4","code_sha256_prefix":"204cc308fd28e5e4","mcp_get_code":{"code_sha256":"204cc308fd28e5e4"}},{"arxiv_id":"2010.06115","arxiv_id_is_arxiv":true,"paper":"/paper/supertagging-combinatory-categorial-grammar","title":"Supertagging Combinatory Categorial Grammar with Attentive Graph Convolutional Networks","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuhksz-nlp/NeST-CCG","path":"nest_ccg_model.py","file_url":"https://github.com/cuhksz-nlp/NeST-CCG/blob/HEAD/nest_ccg_model.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":"33e0ccd21e650af7","code_sha256_prefix":"33e0ccd21e650af7","mcp_get_code":{"code_sha256":"33e0ccd21e650af7"}},{"arxiv_id":"1703.06103","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"parkererickson/crunchBaseGraph","path":"py_scripts/gcn.py","file_url":"https://github.com/parkererickson/crunchBaseGraph/blob/HEAD/py_scripts/gcn.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, parkererickson/crunchBaseGraph when it was checked","code_sha256":"2bfb21c319767958","code_sha256_prefix":"2bfb21c319767958","mcp_get_code":{"code_sha256":"2bfb21c319767958"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HamzaGbada/GCN-Numpy","path":"core/GCN_scratch/model.py","file_url":"https://github.com/HamzaGbada/GCN-Numpy/blob/HEAD/core/GCN_scratch/model.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":"f35bf2b12ecf1db2","code_sha256_prefix":"f35bf2b12ecf1db2","mcp_get_code":{"code_sha256":"f35bf2b12ecf1db2"}},{"arxiv_id":"ijcai2024_0250","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0250","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"BIMK/Intelligent-Education","path":"DGCD/model.py","file_url":"https://github.com/BIMK/Intelligent-Education/blob/HEAD/DGCD/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, BIMK/Intelligent-Education when it was checked","code_sha256":"0b3c87af4ee082b2","code_sha256_prefix":"0b3c87af4ee082b2","mcp_get_code":{"code_sha256":"0b3c87af4ee082b2"}}],"record_sha256":"51dc1f8912aff76d25f1f355bdc757995baa1b14a2f5961e50d47185bece1fa5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}