{"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/gnn","entry":"GNN","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":23,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":17,"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":23,"n_samples_ran":17,"n_samples_constructed":13,"n_samples_ran_checked":17,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":1,"n_places":23,"n_places_pointer_only":15,"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":17,"unverified":6},"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":"2606.03068","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03068","title":"Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"bdi-lab/MAVN","path":"code/models.py","file_url":"https://github.com/bdi-lab/MAVN/blob/HEAD/code/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, bdi-lab/MAVN (NOASSERTION)","code_sha256":"90195cae24c9bd2a","code_sha256_prefix":"90195cae24c9bd2a","mcp_get_code":{"code_sha256":"90195cae24c9bd2a"}},{"arxiv_id":"2505.17214","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.17214","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"XiaochenWang-PSU/MedMKG","path":"multimodal_retrieval/model.py","file_url":"https://github.com/XiaochenWang-PSU/MedMKG/blob/HEAD/multimodal_retrieval/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, XiaochenWang-PSU/MedMKG when it was checked","code_sha256":"0532f0d259bcf2b4","code_sha256_prefix":"0532f0d259bcf2b4","mcp_get_code":{"code_sha256":"0532f0d259bcf2b4"}},{"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":"1fdbae2fa6548e67","code_sha256_prefix":"1fdbae2fa6548e67","mcp_get_code":{"code_sha256":"1fdbae2fa6548e67"}},{"arxiv_id":"2412.09399","arxiv_id_is_arxiv":true,"paper":"/paper/a-geometry-aware-message-passing-neural","title":"A Geometry-Aware Message Passing Neural Network for Modeling Aerodynamics over Airfoils","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/AIRS","path":"OpenPDE/GeoMPNN/GeoMPNN/my_augmented_simulator.py","file_url":"https://github.com/divelab/AIRS/blob/HEAD/OpenPDE/GeoMPNN/GeoMPNN/my_augmented_simulator.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, divelab/AIRS, is not in the permissive set Syntology serves inline","code_sha256":"0788585724d457fd","code_sha256_prefix":"0788585724d457fd","mcp_get_code":{"code_sha256":"0788585724d457fd"}},{"arxiv_id":"2410.06366","arxiv_id_is_arxiv":true,"paper":"/paper/physics-informed-regularization-for-domain","title":"Physics-Informed Regularization for Domain-Agnostic Dynamical System Modeling","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanjiaZhao1203/TREAT","path":"lib/trsoden.py","file_url":"https://github.com/wanjiaZhao1203/TREAT/blob/HEAD/lib/trsoden.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":"34f19b6fac5bf7b7","code_sha256_prefix":"34f19b6fac5bf7b7","mcp_get_code":{"code_sha256":"34f19b6fac5bf7b7"}},{"arxiv_id":"2405.15252","arxiv_id_is_arxiv":true,"paper":"/paper/fast-3d-molecule-generation-via-unified","title":"Fast 3D Molecule Generation via Unified Geometric Optimal Transport","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HaokaiHong/GOAT","path":"models/goat.py","file_url":"https://github.com/HaokaiHong/GOAT/blob/HEAD/models/goat.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, HaokaiHong/GOAT when it was checked","code_sha256":"d6b4d81e5c7eb060","code_sha256_prefix":"d6b4d81e5c7eb060","mcp_get_code":{"code_sha256":"d6b4d81e5c7eb060"}},{"arxiv_id":"2310.12798","arxiv_id_is_arxiv":true,"paper":"/paper/molca-molecular-graph-language-modeling-with","title":"MolCA: Molecular Graph-Language Modeling with Cross-Modal Projector and Uni-Modal Adapter","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acharkq/MolCA","path":"model/gin_model.py","file_url":"https://github.com/acharkq/MolCA/blob/HEAD/model/gin_model.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, acharkq/MolCA when it was checked","code_sha256":"7282c89d36347662","code_sha256_prefix":"7282c89d36347662","mcp_get_code":{"code_sha256":"7282c89d36347662"}},{"arxiv_id":"2310.00052","arxiv_id_is_arxiv":true,"paper":"/paper/ai-ensemble-for-signal-detection-of-higher","title":"AI ensemble for signal detection of higher order gravitational wave modes of quasi-circular, spinning, non-precessing binary black hole mergers","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtian8/higher_order_gw_spatiotemporal_gnn","path":"utils.py","file_url":"https://github.com/mtian8/higher_order_gw_spatiotemporal_gnn/blob/HEAD/utils.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, mtian8/higher_order_gw_spatiotemporal_gnn when it was checked","code_sha256":"396e4978a886357f","code_sha256_prefix":"396e4978a886357f","mcp_get_code":{"code_sha256":"396e4978a886357f"}},{"arxiv_id":"2306.09463","arxiv_id_is_arxiv":true,"paper":"/paper/kriging-convolutional-networks","title":"Kriging Convolutional Networks","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tufts-ml/kcn-torch","path":"kcn.py","file_url":"https://github.com/tufts-ml/kcn-torch/blob/HEAD/kcn.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, tufts-ml/kcn-torch when it was checked","code_sha256":"9c53852f343a1d38","code_sha256_prefix":"9c53852f343a1d38","mcp_get_code":{"code_sha256":"9c53852f343a1d38"}},{"arxiv_id":"2305.14642","arxiv_id_is_arxiv":true,"paper":"/paper/2305-14642","title":"Newton-Cotes Graph Neural Networks: On the Time Evolution of Dynamic Systems","date":"2023-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/ncgnn","path":"spatial_graph/models/ncgnn.py","file_url":"https://github.com/zjukg/ncgnn/blob/HEAD/spatial_graph/models/ncgnn.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":"de28ce446503e1fc","code_sha256_prefix":"de28ce446503e1fc","mcp_get_code":{"code_sha256":"de28ce446503e1fc"}},{"arxiv_id":"2305.00664","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-transfer-learning-across-graphs","title":"EvoluNet: Advancing Dynamic Non-IID Transfer Learning on Graphs","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanghh7/evolunet","path":"model/model.py","file_url":"https://github.com/wanghh7/evolunet/blob/HEAD/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wanghh7/evolunet when it was checked","code_sha256":"8b45ad308015a342","code_sha256_prefix":"8b45ad308015a342","mcp_get_code":{"code_sha256":"8b45ad308015a342"}},{"arxiv_id":"2303.10538","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-for-solving-the","title":"Unsupervised Learning for Solving the Travelling Salesman Problem","date":"2023-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yimengmin/UTSP","path":"models.py","file_url":"https://github.com/yimengmin/UTSP/blob/HEAD/models.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, yimengmin/UTSP when it was checked","code_sha256":"d7bbed06f00e7b26","code_sha256_prefix":"d7bbed06f00e7b26","mcp_get_code":{"code_sha256":"d7bbed06f00e7b26"}},{"arxiv_id":"2303.10371","arxiv_id_is_arxiv":true,"paper":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling","title":"UNREAL:Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanliang3612/UNREAL","path":"models/Summer.py","file_url":"https://github.com/yanliang3612/UNREAL/blob/HEAD/models/Summer.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":"a0f51d43b2936c11","code_sha256_prefix":"a0f51d43b2936c11","mcp_get_code":{"code_sha256":"a0f51d43b2936c11"}},{"arxiv_id":"2206.01506","arxiv_id_is_arxiv":true,"paper":"/paper/can-hybrid-geometric-scattering-networks-help","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","date":"2022-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yimengmin/geometricscatteringmaximalclique","path":"models.py","file_url":"https://github.com/yimengmin/geometricscatteringmaximalclique/blob/HEAD/models.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, yimengmin/geometricscatteringmaximalclique when it was checked","code_sha256":"283312fcd6861324","code_sha256_prefix":"283312fcd6861324","mcp_get_code":{"code_sha256":"283312fcd6861324"}},{"arxiv_id":"2205.01782","arxiv_id_is_arxiv":true,"paper":"/paper/learning-multi-dimensional-edge-feature-based","title":"Learning Multi-dimensional Edge Feature-based AU Relation Graph for Facial Action Unit Recognition","date":"2022-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tomas-gajarsky/facetorch","path":"model_defs/au_model.py","file_url":"https://github.com/tomas-gajarsky/facetorch/blob/HEAD/model_defs/au_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"871d4585235c0cf7","code_sha256_prefix":"871d4585235c0cf7","mcp_get_code":{"code_sha256":"871d4585235c0cf7"}},{"arxiv_id":"2202.12481","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-graph-representation-for","title":"Multi-View Graph Representation for Programming Language Processing: An Investigation into Algorithm Detection","date":"2022-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"githubg0/mvg","path":"models.py","file_url":"https://github.com/githubg0/mvg/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, githubg0/mvg when it was checked","code_sha256":"b2e0a669f7bbf2fb","code_sha256_prefix":"b2e0a669f7bbf2fb","mcp_get_code":{"code_sha256":"b2e0a669f7bbf2fb"}},{"arxiv_id":"2202.07857","arxiv_id_is_arxiv":true,"paper":"/paper/graph-augmented-normalizing-flows-for-anomaly-1","title":"Graph-Augmented Normalizing Flows for Anomaly Detection of Multiple Time Series","date":"2022-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enyandai/ganf","path":"models/GANF.py","file_url":"https://github.com/enyandai/ganf/blob/HEAD/models/GANF.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enyandai/ganf when it was checked","code_sha256":"9115fcfda4b932e3","code_sha256_prefix":"9115fcfda4b932e3","mcp_get_code":{"code_sha256":"9115fcfda4b932e3"}},{"arxiv_id":"2106.02172","arxiv_id_is_arxiv":true,"paper":"/paper/counterfactual-graph-learning-for-link","title":"Learning from Counterfactual Links for Link Prediction","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DM2-ND/CFLP","path":"models.py","file_url":"https://github.com/DM2-ND/CFLP/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"012be499f262ee24","code_sha256_prefix":"012be499f262ee24","mcp_get_code":{"code_sha256":"012be499f262ee24"}},{"arxiv_id":"2106.01939","arxiv_id_is_arxiv":true,"paper":"/paper/graph-intervention-networks-for-causal-effect","title":"Causal Effect Inference for Structured Treatments","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeankaddour/sin","path":"models/sin.py","file_url":"https://github.com/jeankaddour/sin/blob/HEAD/models/sin.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, jeankaddour/sin when it was checked","code_sha256":"73fa9c282a076a52","code_sha256_prefix":"73fa9c282a076a52","mcp_get_code":{"code_sha256":"73fa9c282a076a52"}},{"arxiv_id":"2103.07889","arxiv_id_is_arxiv":true,"paper":"/paper/learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daip13/LPC_MOT","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.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":"7e35382b5c5a5ae5","code_sha256_prefix":"7e35382b5c5a5ae5","mcp_get_code":{"code_sha256":"7e35382b5c5a5ae5"}},{"arxiv_id":"2009.13504","arxiv_id_is_arxiv":true,"paper":"/paper/graph-adversarial-networks-protecting","title":"Information Obfuscation of Graph Neural Networks","date":"2020-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liaopeiyuan/GAL","path":"Movielens_Wasserstein/models.py","file_url":"https://github.com/liaopeiyuan/GAL/blob/HEAD/Movielens_Wasserstein/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":"c64894d0c9a6c279","code_sha256_prefix":"c64894d0c9a6c279","mcp_get_code":{"code_sha256":"c64894d0c9a6c279"}},{"arxiv_id":"2007.05703","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-for-massive-mimo","title":"Graph Neural Networks for Massive MIMO Detection","date":"2020-07-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GNN-based-MIMO-Detection/GNN-based-MIMO-Detection","path":"GNN_MIMO_detector/GNN_model.py","file_url":"https://github.com/GNN-based-MIMO-Detection/GNN-based-MIMO-Detection/blob/HEAD/GNN_MIMO_detector/GNN_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GNN-based-MIMO-Detection/GNN-based-MIMO-Detection when it was checked","code_sha256":"4234a8134284cfe7","code_sha256_prefix":"4234a8134284cfe7","mcp_get_code":{"code_sha256":"4234a8134284cfe7"}},{"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":"60430168649550b5","code_sha256_prefix":"60430168649550b5","mcp_get_code":{"code_sha256":"60430168649550b5"}}],"record_sha256":"8b3130849c5bd01a5291279ec458dbe01e6e5f918d20a846eafd8a529cd06790","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}