{"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/masked-softmax-cross-entropy","entry":"masked_softmax_cross_entropy","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"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":5,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"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/metrics.py","file_url":"https://github.com/yifan-h/pge/blob/HEAD/pge/metrics.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":"962a128cca9473ed","code_sha256_prefix":"962a128cca9473ed","mcp_get_code":{"code_sha256":"962a128cca9473ed"}},{"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":"GemsLab/H2GCN","path":"h2gcn/models/H2GCN.py","file_url":"https://github.com/GemsLab/H2GCN/blob/HEAD/h2gcn/models/H2GCN.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, GemsLab/H2GCN when it was checked","code_sha256":"2fc7117a43f16d67","code_sha256_prefix":"2fc7117a43f16d67","mcp_get_code":{"code_sha256":"2fc7117a43f16d67"}},{"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/metrics.py","file_url":"https://github.com/tkipf/gcn/blob/HEAD/gcn/metrics.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/metrics.py","file_url":"https://github.com/CRIPAC-DIG/GraphAIR/blob/HEAD/tensorflow_code/metrics.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/metrics.py","file_url":"https://github.com/csjtx1021/DGBO/blob/HEAD/gcn/metrics.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"arxiv_id":"1903.04154","arxiv_id_is_arxiv":true,"paper":"/paper/fisher-bures-adversary-graph-convolutional","title":"Fisher-Bures Adversary Graph Convolutional Networks","date":"2019-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stellargraph/FisherGCN","path":"gcn/metrics.py","file_url":"https://github.com/stellargraph/FisherGCN/blob/HEAD/gcn/metrics.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":"38c4e4b6d2de6143","code_sha256_prefix":"38c4e4b6d2de6143","mcp_get_code":{"code_sha256":"38c4e4b6d2de6143"}},{"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/metrics.py","file_url":"https://github.com/CRIPAC-DIG/H-GCN/blob/HEAD/tensorflow_code/metrics.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/metrics.py","file_url":"https://github.com/liqimai/Efficient-SSL/blob/HEAD/gcn/metrics.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":"af1b9b374ffa6411","code_sha256_prefix":"af1b9b374ffa6411","mcp_get_code":{"code_sha256":"af1b9b374ffa6411"}},{"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/metrics.py","file_url":"https://github.com/huawei-noah/BGCN/blob/HEAD/src/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/metrics.py","file_url":"https://github.com/thu-ml/stochastic_gcn/blob/HEAD/gcn/metrics.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/nfc-gcn","path":"models.py","file_url":"https://github.com/asarigun/nfc-gcn/blob/HEAD/models.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":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}},{"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/metrics.py","file_url":"https://github.com/RICE-EIC/Early-Bird-GCN/blob/HEAD/gcn/metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d103f29cc58337a2","code_sha256_prefix":"d103f29cc58337a2","mcp_get_code":{"code_sha256":"d103f29cc58337a2"}}],"record_sha256":"da9240ae2c9305636ab0c0208256f6cec504e5aee25319527628dee11a7d0fca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}