{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/graphconvlayer","entry":"GraphConvLayer","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":5,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":3},"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.10023","paper":"/paper/arxiv-2602-10023","title":"MEVER: Multi-Modal and Explainable Claim Verification with Graph-based Evidence Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"cezhang01/mever","path":"ver_and_exp/aggregator.py","file_url":"https://github.com/cezhang01/mever/blob/HEAD/ver_and_exp/aggregator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4170f71389a208be","mcp_get_code":{"code_sha256":"4170f71389a208be"}},{"arxiv_id":"2601.21560","paper":"/paper/arxiv-2601-21560","title":"HistoPrism: Unlocking Functional Pathway Analysis from Pan-Cancer Histology via Gene Expression Prediction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"susuhu/HistoPrism","path":"models/HistoPrIsm.py","file_url":"https://github.com/susuhu/HistoPrism/blob/HEAD/models/HistoPrIsm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"90fab81480328bf0","mcp_get_code":{"code_sha256":"90fab81480328bf0"}},{"arxiv_id":"2304.00789","paper":"/paper/combinatorial-optimization-enriched-machine","title":"Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows","date":"2023-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tumbais/euro-meets-neurips-2022","path":"training/optimization.py","file_url":"https://github.com/tumbais/euro-meets-neurips-2022/blob/HEAD/training/optimization.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"29a904c381ea69eb","mcp_get_code":{"code_sha256":"29a904c381ea69eb"}},{"arxiv_id":"2110.09807","paper":"/paper/learning-to-learn-graph-topologies","title":"Learning to Learn Graph Topologies","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xpuoxford/l2g-neurips2021","path":"src/models.py","file_url":"https://github.com/xpuoxford/l2g-neurips2021/blob/HEAD/src/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6a76fab2baf3ecfb","mcp_get_code":{"code_sha256":"6a76fab2baf3ecfb"}},{"arxiv_id":"2005.06312","paper":"/paper/reasoning-with-latent-structure-refinement","title":"Reasoning with Latent Structure Refinement for Document-Level Relation Extraction","date":"2020-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nanguoshun/LSR","path":"code/models/lsr.py","file_url":"https://github.com/nanguoshun/LSR/blob/HEAD/code/models/lsr.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ba46f3df56f000df","mcp_get_code":{"code_sha256":"ba46f3df56f000df"}},{"arxiv_id":"1509.09292","paper":"/paper/convolutional-networks-on-graphs-for-learning","title":"Convolutional Networks on Graphs for Learning Molecular Fingerprints","date":"2015-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kimisyo/simple-GCN","path":"simpleGCN/layers/graph_conv_layer.py","file_url":"https://github.com/kimisyo/simple-GCN/blob/HEAD/simpleGCN/layers/graph_conv_layer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"073f2d3106c10299","mcp_get_code":{"code_sha256":"073f2d3106c10299"}}]}