{"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-init","entry":"glorot_init","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":9,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":10,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"unverified":1},"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":"2502.16076","arxiv_id_is_arxiv":true,"paper":"/paper/category-free-out-of-distribution-node","title":"Category-free Out-of-Distribution Node Detection with Feature Resonance","date":"2025-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShenzhiYang2000/RSL","path":"model/oodgat.py","file_url":"https://github.com/ShenzhiYang2000/RSL/blob/HEAD/model/oodgat.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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 songyyyy/kdd22-oodgat, and GitHub detected no licence in that repository when it was checked","code_sha256":"bf6f0b5a65218aa0","code_sha256_prefix":"bf6f0b5a65218aa0","mcp_get_code":{"code_sha256":"bf6f0b5a65218aa0"}},{"arxiv_id":"2401.03194","arxiv_id_is_arxiv":true,"paper":"/paper/learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kundtx/MFC-TopoReg","path":"Models/DAEGC.py","file_url":"https://github.com/kundtx/MFC-TopoReg/blob/HEAD/Models/DAEGC.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, kundtx/MFC-TopoReg when it was checked","code_sha256":"ad2dfcc862e08db6","code_sha256_prefix":"ad2dfcc862e08db6","mcp_get_code":{"code_sha256":"ad2dfcc862e08db6"}},{"arxiv_id":"2308.06714","arxiv_id_is_arxiv":true,"paper":"/paper/learning-on-graphs-with-out-of-distribution","title":"Learning on Graphs with Out-of-Distribution Nodes","date":"2023-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songyyyy/kdd22-oodgat","path":"layer.py","file_url":"https://github.com/songyyyy/kdd22-oodgat/blob/HEAD/layer.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, songyyyy/kdd22-oodgat when it was checked","code_sha256":"bf6f0b5a65218aa0","code_sha256_prefix":"bf6f0b5a65218aa0","mcp_get_code":{"code_sha256":"bf6f0b5a65218aa0"}},{"arxiv_id":"2306.14852","arxiv_id_is_arxiv":true,"paper":"/paper/coarsenconf-equivariant-coarsening-with","title":"CoarsenConf: Equivariant Coarsening with Aggregated Attention for Molecular Conformer Generation","date":"2023-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ask-berkeley/coarsenconf","path":"utils/equivariant_model_utils.py","file_url":"https://github.com/ask-berkeley/coarsenconf/blob/HEAD/utils/equivariant_model_utils.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":"adfb39ff6429da01","code_sha256_prefix":"adfb39ff6429da01","mcp_get_code":{"code_sha256":"adfb39ff6429da01"}},{"arxiv_id":"2106.00967","arxiv_id_is_arxiv":true,"paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bachnguyente/temporal-mgn","path":"chickenpox/temporal_model.py","file_url":"https://github.com/bachnguyente/temporal-mgn/blob/HEAD/chickenpox/temporal_model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33c8d926f0ebceb3","code_sha256_prefix":"33c8d926f0ebceb3","mcp_get_code":{"code_sha256":"33c8d926f0ebceb3"}},{"arxiv_id":"2106.00967","arxiv_id_is_arxiv":true,"paper":"/paper/multiresolution-graph-variational-autoencoder","title":"Multiresolution Equivariant Graph Variational Autoencoder","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hytruongson/mgvae","path":"image_generation/train_mgvae.py","file_url":"https://github.com/hytruongson/mgvae/blob/HEAD/image_generation/train_mgvae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hytruongson/mgvae when it was checked","code_sha256":"636ecbcda942ffd4","code_sha256_prefix":"636ecbcda942ffd4","mcp_get_code":{"code_sha256":"636ecbcda942ffd4"}},{"arxiv_id":"1811.00210","arxiv_id_is_arxiv":true,"paper":"/paper/online-planner-selection-with-graph-neural","title":"Online Planner Selection with Graph Neural Networks and Adaptive Scheduling","date":"2018-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matenure/GNN_planner","path":"utils.py","file_url":"https://github.com/matenure/GNN_planner/blob/HEAD/utils.py","status":"ran","verification_level":1,"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, matenure/GNN_planner, 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":"06808ce31cb3ddd3","code_sha256_prefix":"06808ce31cb3ddd3","mcp_get_code":{"code_sha256":"06808ce31cb3ddd3"}},{"arxiv_id":"1810.03958","arxiv_id_is_arxiv":true,"paper":"/paper/deterministic-variational-inference-for","title":"Deterministic Variational Inference for Robust Bayesian Neural Networks","date":"2018-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/deterministic-variational-inference","path":"gaussian_variables.py","file_url":"https://github.com/Microsoft/deterministic-variational-inference/blob/HEAD/gaussian_variables.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":"a9439e641c4c1ff4","code_sha256_prefix":"a9439e641c4c1ff4","mcp_get_code":{"code_sha256":"a9439e641c4c1ff4"}},{"arxiv_id":"1611.07308","arxiv_id_is_arxiv":true,"paper":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DaehanKim/vgae_pytorch","path":"model.py","file_url":"https://github.com/DaehanKim/vgae_pytorch/blob/HEAD/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"33c8d926f0ebceb3","code_sha256_prefix":"33c8d926f0ebceb3","mcp_get_code":{"code_sha256":"33c8d926f0ebceb3"}},{"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":"nieci2024/pyglcn","path":"glcn/layers.py","file_url":"https://github.com/nieci2024/pyglcn/blob/HEAD/glcn/layers.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":"ea40475de51187a2","code_sha256_prefix":"ea40475de51187a2","mcp_get_code":{"code_sha256":"ea40475de51187a2"}}],"record_sha256":"c50f0e1e8825d9d477060e86ee0fe92147304601ed88632ba5a3c9e17126f76d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}