{"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/preprocess-adj","entry":"preprocess_adj","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":8,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":3,"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":2,"ran_fixture":0,"ran":3,"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":"2602.05358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-05358","title":"Bayesian Neighborhood Adaptation for Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"paribeshregmi/BNA-GNN","path":"utils/utils.py","file_url":"https://github.com/paribeshregmi/BNA-GNN/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, paribeshregmi/BNA-GNN when it was checked","code_sha256":"bc41b31eaba0e3bd","code_sha256_prefix":"bc41b31eaba0e3bd","mcp_get_code":{"code_sha256":"bc41b31eaba0e3bd"}},{"arxiv_id":"2312.02708","arxiv_id_is_arxiv":true,"paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a3cccfaa8bd4c86c","code_sha256_prefix":"a3cccfaa8bd4c86c","mcp_get_code":{"code_sha256":"a3cccfaa8bd4c86c"}},{"arxiv_id":"2307.07832","arxiv_id_is_arxiv":true,"paper":"/paper/mixupexplainer-generalizing-explanations-for","title":"MixupExplainer: Generalizing Explanations for Graph Neural Networks with Data Augmentation","date":"2023-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jz48/mixupexplainer","path":"MixupExplainer/ExplanationEvaluation/datasets/utils.py","file_url":"https://github.com/jz48/mixupexplainer/blob/HEAD/MixupExplainer/ExplanationEvaluation/datasets/utils.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, jz48/mixupexplainer when it was checked","code_sha256":"16491ca90b94e990","code_sha256_prefix":"16491ca90b94e990","mcp_get_code":{"code_sha256":"16491ca90b94e990"}},{"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/alinet.py","file_url":"https://github.com/guolingbing/RLEA/blob/HEAD/src/openea/approaches/alinet.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":"71e7cfcbeb1463b2","code_sha256_prefix":"71e7cfcbeb1463b2","mcp_get_code":{"code_sha256":"71e7cfcbeb1463b2"}},{"arxiv_id":"2109.14285","arxiv_id_is_arxiv":true,"paper":"/paper/be-confident-towards-trustworthy-graph-neural","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BUPT-GAMMA/CaGCN","path":"utils.py","file_url":"https://github.com/BUPT-GAMMA/CaGCN/blob/HEAD/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":"934ca60e9bd12c56","code_sha256_prefix":"934ca60e9bd12c56","mcp_get_code":{"code_sha256":"934ca60e9bd12c56"}},{"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":"utils.py","file_url":"https://github.com/Maysir/GEM-GCN/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":"a3b7442294809e8a","code_sha256_prefix":"a3b7442294809e8a","mcp_get_code":{"code_sha256":"a3b7442294809e8a"}},{"arxiv_id":"1906.12269","arxiv_id_is_arxiv":true,"paper":"/paper/certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/robust-gcn","path":"robust_gcn/robust_gcn.py","file_url":"https://github.com/danielzuegner/robust-gcn/blob/HEAD/robust_gcn/robust_gcn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a3cccfaa8bd4c86c","code_sha256_prefix":"a3cccfaa8bd4c86c","mcp_get_code":{"code_sha256":"a3cccfaa8bd4c86c"}},{"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":"DeepSurrogateModel.py","file_url":"https://github.com/csjtx1021/DGBO/blob/HEAD/DeepSurrogateModel.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":"cfa1f103b2b5388d","code_sha256_prefix":"cfa1f103b2b5388d","mcp_get_code":{"code_sha256":"cfa1f103b2b5388d"}}],"record_sha256":"0c083818ad5214cb28ba60cebee896353db2048a83e0f4ce44983dfbdbd4c5f2","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}