{"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/glorot","entry":"glorot","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":26,"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":16,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":12,"n_samples_fingerprinted":0,"n_places":31,"n_places_pointer_only":18,"n_places_pointer_only_link_open":13,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":12},"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":"2509.15857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-15857","title":"EvoBrain: Dynamic Multi-Channel EEG Graph Modeling for Time-Evolving Brain Networks","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Kotoge/EvoBrain","path":"model/gru_gcn.py","file_url":"https://github.com/Kotoge/EvoBrain/blob/HEAD/model/gru_gcn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e43e89f910632281","code_sha256_prefix":"e43e89f910632281","mcp_get_code":{"code_sha256":"e43e89f910632281"}},{"arxiv_id":"2509.15857","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-15857","title":"EvoBrain: Dynamic Multi-Channel EEG Graph Modeling for Time-Evolving Brain Networks","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"Kotoge/EvoBrain","path":"model/EvoBrain.py","file_url":"https://github.com/Kotoge/EvoBrain/blob/HEAD/model/EvoBrain.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":"bc8d1567729595a2","code_sha256_prefix":"bc8d1567729595a2","mcp_get_code":{"code_sha256":"bc8d1567729595a2"}},{"arxiv_id":"2311.01196","arxiv_id_is_arxiv":true,"paper":"/paper/combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flyingdoog/PTDNet","path":"inits.py","file_url":"https://github.com/flyingdoog/PTDNet/blob/HEAD/inits.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, flyingdoog/PTDNet when it was checked","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"2206.13176","arxiv_id_is_arxiv":true,"paper":"/paper/a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifan-h/pge","path":"pge/inits.py","file_url":"https://github.com/yifan-h/pge/blob/HEAD/pge/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"2203.03315","arxiv_id_is_arxiv":true,"paper":"/paper/deep-reinforcement-learning-for-entity-1","title":"Deep Reinforcement Learning for Entity Alignment","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guolingbing/RLEA","path":"src/openea/approaches/gcn_align.py","file_url":"https://github.com/guolingbing/RLEA/blob/HEAD/src/openea/approaches/gcn_align.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"2202.02514","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-generative-modeling-of-graphs-via","title":"Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AdrienC21/CCSD","path":"ccsd/src/models/ScoreNetwork_A.py","file_url":"https://github.com/AdrienC21/CCSD/blob/HEAD/ccsd/src/models/ScoreNetwork_A.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":"b26ee0603cfc49f5","code_sha256_prefix":"b26ee0603cfc49f5","mcp_get_code":{"code_sha256":"b26ee0603cfc49f5"}},{"arxiv_id":"2202.02514","arxiv_id_is_arxiv":true,"paper":"/paper/score-based-generative-modeling-of-graphs-via","title":"Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations","date":"2022-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harryjo97/gdss","path":"models/ScoreNetwork_A.py","file_url":"https://github.com/harryjo97/gdss/blob/HEAD/models/ScoreNetwork_A.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, harryjo97/gdss when it was checked","code_sha256":"99fea4b7e50f6464","code_sha256_prefix":"99fea4b7e50f6464","mcp_get_code":{"code_sha256":"99fea4b7e50f6464"}},{"arxiv_id":"2106.02248","arxiv_id_is_arxiv":true,"paper":"/paper/knowing-the-no-match-entity-alignment-with","title":"Knowing the No-match: Entity Alignment with Dangling Cases","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/OpenEA","path":"src/openea/approaches/gmnn.py","file_url":"https://github.com/nju-websoft/OpenEA/blob/HEAD/src/openea/approaches/gmnn.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, nju-websoft/OpenEA, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"2104.04638","arxiv_id_is_arxiv":true,"paper":"/paper/pixel-codec-avatars","title":"Pixel Codec Avatars","date":"2021-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/multiface","path":"models.py","file_url":"https://github.com/facebookresearch/multiface/blob/HEAD/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, facebookresearch/multiface (NOASSERTION)","code_sha256":"0f6bb5f67673c772","code_sha256_prefix":"0f6bb5f67673c772","mcp_get_code":{"code_sha256":"0f6bb5f67673c772"}},{"arxiv_id":"2007.09547","arxiv_id_is_arxiv":true,"paper":"/paper/sat2graph-road-graph-extraction-through-graph","title":"Sat2Graph: Road Graph Extraction through Graph-Tensor Encoding","date":"2020-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songtaohe/Sat2Graph","path":"model/tf_common_layer.py","file_url":"https://github.com/songtaohe/Sat2Graph/blob/HEAD/model/tf_common_layer.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":"db1a1fef3f66db9e","code_sha256_prefix":"db1a1fef3f66db9e","mcp_get_code":{"code_sha256":"db1a1fef3f66db9e"}},{"arxiv_id":"2007.00216","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-neighborhood-based-interaction","title":"An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph","date":"2020-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jinjiarui/GraphHINGE","path":"utils/utils.py","file_url":"https://github.com/Jinjiarui/GraphHINGE/blob/HEAD/utils/utils.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":"57be8b785a8f8a0b","code_sha256_prefix":"57be8b785a8f8a0b","mcp_get_code":{"code_sha256":"57be8b785a8f8a0b"}},{"arxiv_id":"2006.11468","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/gcn","path":"gcn/inits.py","file_url":"https://github.com/tkipf/gcn/blob/HEAD/gcn/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"2006.07331","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maysir/GEM-GCN","path":"inits.py","file_url":"https://github.com/Maysir/GEM-GCN/blob/HEAD/inits.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":"aa622c9b6b2d0332","code_sha256_prefix":"aa622c9b6b2d0332","mcp_get_code":{"code_sha256":"aa622c9b6b2d0332"}},{"arxiv_id":"2006.05806","arxiv_id_is_arxiv":true,"paper":"/paper/bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierzw/ogb-geniepath-bs","path":"models.py","file_url":"https://github.com/xavierzw/ogb-geniepath-bs/blob/HEAD/models.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":"d30cc18b0c05a6ae","code_sha256_prefix":"d30cc18b0c05a6ae","mcp_get_code":{"code_sha256":"d30cc18b0c05a6ae"}},{"arxiv_id":"2006.05806","arxiv_id_is_arxiv":true,"paper":"/paper/bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierzw/ogb-geniepath-bs","path":"inits.py","file_url":"https://github.com/xavierzw/ogb-geniepath-bs/blob/HEAD/inits.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":"7886d7d7e49e3627","code_sha256_prefix":"7886d7d7e49e3627","mcp_get_code":{"code_sha256":"7886d7d7e49e3627"}},{"arxiv_id":"2006.05806","arxiv_id_is_arxiv":true,"paper":"/paper/bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierzw/ogb-geniepath-bs","path":"utils.py","file_url":"https://github.com/xavierzw/ogb-geniepath-bs/blob/HEAD/utils.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":"30f4098902a4d64d","code_sha256_prefix":"30f4098902a4d64d","mcp_get_code":{"code_sha256":"30f4098902a4d64d"}},{"arxiv_id":"2004.01024","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-dynamic-heterogeneous-network-for","title":"Modeling Dynamic Heterogeneous Network for Link Prediction using Hierarchical Attention with Temporal RNN","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skx300/DyHATR","path":"src/models/inits.py","file_url":"https://github.com/skx300/DyHATR/blob/HEAD/src/models/inits.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":"de4aa826c438014b","code_sha256_prefix":"de4aa826c438014b","mcp_get_code":{"code_sha256":"de4aa826c438014b"}},{"arxiv_id":"2002.06755","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"achalagarwal/gcn-lpa","path":"src/inits.py","file_url":"https://github.com/achalagarwal/gcn-lpa/blob/HEAD/src/inits.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":"0ff0dc0369c94cbe","code_sha256_prefix":"0ff0dc0369c94cbe","mcp_get_code":{"code_sha256":"0ff0dc0369c94cbe"}},{"arxiv_id":"2002.06755","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/GCN-LPA","path":"src/inits.py","file_url":"https://github.com/hwwang55/GCN-LPA/blob/HEAD/src/inits.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":"8efce639c727cd2d","code_sha256_prefix":"8efce639c727cd2d","mcp_get_code":{"code_sha256":"8efce639c727cd2d"}},{"arxiv_id":"1911.01731","arxiv_id_is_arxiv":true,"paper":"/paper/graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/GraphAIR","path":"tensorflow_code/inits.py","file_url":"https://github.com/CRIPAC-DIG/GraphAIR/blob/HEAD/tensorflow_code/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1908.01491","arxiv_id_is_arxiv":true,"paper":"/paper/pixel2mesh-multi-view-3d-mesh-generation-via","title":"Pixel2Mesh++: Multi-View 3D Mesh Generation via Deformation","date":"2019-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"walsvid/Pixel2MeshPlusPlus","path":"modules/inits.py","file_url":"https://github.com/walsvid/Pixel2MeshPlusPlus/blob/HEAD/modules/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1905.13403","arxiv_id_is_arxiv":true,"paper":"/paper/deep-bayesian-optimization-on-attributed","title":"Deep Bayesian Optimization on Attributed Graphs","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csjtx1021/DGBO","path":"gcn/inits.py","file_url":"https://github.com/csjtx1021/DGBO/blob/HEAD/gcn/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1902.06667","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/H-GCN","path":"tensorflow_code/inits.py","file_url":"https://github.com/CRIPAC-DIG/H-GCN/blob/HEAD/tensorflow_code/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1901.09993","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-label-propagation-methods-for","title":"Label Efficient Semi-Supervised Learning via Graph Filtering","date":"2019-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqimai/Efficient-SSL","path":"gcn/inits.py","file_url":"https://github.com/liqimai/Efficient-SSL/blob/HEAD/gcn/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1811.11103","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/BGCN","path":"src/inits.py","file_url":"https://github.com/huawei-noah/BGCN/blob/HEAD/src/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, huawei-noah/BGCN, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1811.02061","arxiv_id_is_arxiv":true,"paper":"/paper/a-recurrent-graph-neural-network-for-multi","title":"A Recurrent Graph Neural Network for Multi-Relational Data","date":"2018-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioannidis/adaptive_recurrent_graph_neural_network","path":"inits.py","file_url":"https://github.com/bioannidis/adaptive_recurrent_graph_neural_network/blob/HEAD/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1804.01654","arxiv_id_is_arxiv":true,"paper":"/paper/pixel2mesh-generating-3d-mesh-models-from","title":"Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images","date":"2018-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nywang16/Pixel2Mesh","path":"p2m/inits.py","file_url":"https://github.com/nywang16/Pixel2Mesh/blob/HEAD/p2m/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1804.00823","arxiv_id_is_arxiv":true,"paper":"/paper/graph2seq-graph-to-sequence-learning-with","title":"Graph2Seq: Graph to Sequence Learning with Attention-based Neural Networks","date":"2018-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/Graph2Seq","path":"main/inits.py","file_url":"https://github.com/IBM/Graph2Seq/blob/HEAD/main/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"1710.10568","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-training-of-graph-convolutional","title":"Stochastic Training of Graph Convolutional Networks with Variance Reduction","date":"2017-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/stochastic_gcn","path":"gcn/inits.py","file_url":"https://github.com/thu-ml/stochastic_gcn/blob/HEAD/gcn/inits.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":"0828b0182597436a","code_sha256_prefix":"0828b0182597436a","mcp_get_code":{"code_sha256":"0828b0182597436a"}},{"arxiv_id":"1603.08861","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asarigun/la-gcn-tensorflow","path":"inits.py","file_url":"https://github.com/asarigun/la-gcn-tensorflow/blob/HEAD/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}},{"arxiv_id":"aaai_20873","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20873","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RICE-EIC/Early-Bird-GCN","path":"gcn/inits.py","file_url":"https://github.com/RICE-EIC/Early-Bird-GCN/blob/HEAD/gcn/inits.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from nju-websoft/OpenEA, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"1b491f3f784b7cb0","code_sha256_prefix":"1b491f3f784b7cb0","mcp_get_code":{"code_sha256":"1b491f3f784b7cb0"}}],"record_sha256":"c8cc969c94d4dd7972a4b876537ff63e30d297175aedf8302d3736f867b36bab","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}