{"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":"/paper/combining-label-propagation-and-simple-models-1","title":"Combining Label Propagation and Simple Models Out-performs Graph Neural Networks","arxiv_id":"2010.13993","date":"2020-10-27","proceeding":"ICLR 2021 1","authors":["Qian Huang","Horace He","Abhay Singh","Ser-Nam Lim","Austin R. Benson"],"abstract":"Graph Neural Networks (GNNs) are the predominant technique for learning over graphs. However, there is relatively little understanding of why GNNs are successful in practice and whether they are necessary for good performance. Here, we show that for many standard transductive node classification benchmarks, we can exceed or match the performance of state-of-the-art GNNs by combining shallow models that ignore the graph structure with two simple post-processing steps that exploit correlation in the label structure: (i) an \"error correlation\" that spreads residual errors in training data to correct errors in test data and (ii) a \"prediction correlation\" that smooths the predictions on the test data. We call this overall procedure Correct and Smooth (C&S), and the post-processing steps are implemented via simple modifications to standard label propagation techniques from early graph-based semi-supervised learning methods. Our approach exceeds or nearly matches the performance of state-of-the-art GNNs on a wide variety of benchmarks, with just a small fraction of the parameters and orders of magnitude faster runtime. For instance, we exceed the best known GNN performance on the OGB-Products dataset with 137 times fewer parameters and greater than 100 times less training time. The performance of our methods highlights how directly incorporating label information into the learning algorithm (as was done in traditional techniques) yields easy and substantial performance gains. We can also incorporate our techniques into big GNN models, providing modest gains. Our code for the OGB results is at https://github.com/Chillee/CorrectAndSmooth.","url_abs":"https://arxiv.org/abs/2010.13993v2","url_pdf":"https://arxiv.org/pdf/2010.13993v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/CUAI/CorrectAndSmooth","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/Chillee/CorrectAndSmoothOGB","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/xnuohz/CorrectAndSmooth-dgl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/ytchx1999/GCN_res-CS-v2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/ytchx1999/PyG-GCN_res-CS","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"combining-label-propagation-and-simple-models-1","repo_url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/correct_and_smooth","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"node-classification","task_name":"Node Classification"},{"task_slug":"node-classification-on-non-homophilic","task_name":"Node Classification on Non-Homophilic (Heterophilic) Graphs"},{"task_slug":"node-property-prediction","task_name":"Node Property Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"C&S 2-hop","rank_in_archive_order":24,"of":32,"metrics":{"Accuracy":"78.40 ± 3.12"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-penn94","task":"Node Classification","dataset":"Penn94","model":"C&S 1-hop","rank_in_archive_order":28,"of":32,"metrics":{"Accuracy":"74.28 ± 1.19"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"C&S 2-hop","rank_in_archive_order":17,"of":26,"metrics":{"Accuracy":"84.94 ± 0.49"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-genius","task":"Node Classification","dataset":"genius","model":"C&S 1-hop","rank_in_archive_order":18,"of":26,"metrics":{"Accuracy":"82.93 ± 0.15"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"C&S(1hop)","rank_in_archive_order":19,"of":28,"metrics":{"1:1 Accuracy":"64.60±0.57"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-6","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Deezer-Europe","model":"C&S(2hop)","rank_in_archive_order":20,"of":28,"metrics":{"1:1 Accuracy":"64.52±0.62"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-13","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Penn94","model":"C&S 2-hop","rank_in_archive_order":20,"of":28,"metrics":{"1:1 Accuracy":"78.40 ± 3.12"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-13","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"Penn94","model":"C&S 1-hop","rank_in_archive_order":24,"of":28,"metrics":{"1:1 Accuracy":"74.28 ± 1.19"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-14","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"genius","model":"C&S 2-hop","rank_in_archive_order":19,"of":26,"metrics":{"1:1 Accuracy":"84.94 ± 0.49"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-14","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"genius","model":"C&S 1-hop","rank_in_archive_order":20,"of":26,"metrics":{"1:1 Accuracy":"82.93 ± 0.15"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-15","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"twitch-gamers","model":"C&S 2-hop","rank_in_archive_order":11,"of":26,"metrics":{"1:1 Accuracy":"65.02 ± 0.16"},"uses_additional_data":false},{"leaderboard":"/sota/node-classification-on-non-homophilic-15","task":"Node Classification on Non-Homophilic (Heterophilic) Graphs","dataset":"twitch-gamers","model":"C&S 1-hop","rank_in_archive_order":12,"of":26,"metrics":{"1:1 Accuracy":"64.86 ± 0.27"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"GAT(norm.adj.)+label reuse+C&S","rank_in_archive_order":33,"of":86,"metrics":{"Ext. data":"No","Number of params":"1441580","Test Accuracy":"0.7395 ± 0.0012","Validation Accuracy":"0.7519 ± 0.0008"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"GAT + C&S","rank_in_archive_order":35,"of":86,"metrics":{"Ext. data":"No","Number of params":"1567000","Test Accuracy":"0.7386 ± 0.0014","Validation Accuracy":"0.7484 ± 0.0007"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"GCN_res + C&S_v2","rank_in_archive_order":46,"of":86,"metrics":{"Ext. data":"No","Number of params":"155824","Test Accuracy":"0.7313 ± 0.0017","Validation Accuracy":"0.7445 ± 0.0011"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"MLP + C&S","rank_in_archive_order":47,"of":86,"metrics":{"Ext. data":"No","Number of params":"175656","Test Accuracy":"0.7312 ± 0.0012","Validation Accuracy":"0.7391 ± 0.0015"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"GCN_res + C&S","rank_in_archive_order":51,"of":86,"metrics":{"Ext. data":"No","Number of params":"155824","Test Accuracy":"0.7297 ± 0.0022","Validation Accuracy":"0.7423 ± 0.0014"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"Linear + C&S","rank_in_archive_order":63,"of":86,"metrics":{"Ext. data":"No","Number of params":"15400","Test Accuracy":"0.7222 ± 0.0002","Validation Accuracy":"0.7368 ± 0.0004"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-arxiv","task":"Node Property Prediction","dataset":"ogbn-arxiv","model":"Plain Linear + C&S","rank_in_archive_order":78,"of":86,"metrics":{"Ext. data":"No","Number of params":"5160","Test Accuracy":"0.7126 ± 0.0001","Validation Accuracy":"0.7300 ± 0.0001"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"Spec-MLP-Wide + C&S","rank_in_archive_order":21,"of":64,"metrics":{"Ext. data":"No","Number of params":"406063","Test Accuracy":"0.8451 ± 0.0006","Validation Accuracy":"0.9132 ± 0.0010"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"MLP + C&S","rank_in_archive_order":24,"of":64,"metrics":{"Ext. data":"No","Number of params":"96247","Test Accuracy":"0.8418 ± 0.0007","Validation Accuracy":"0.9147 ± 0.0009"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"Linear + C&S","rank_in_archive_order":31,"of":64,"metrics":{"Ext. data":"No","Number of params":"10763","Test Accuracy":"0.8301 ± 0.0001","Validation Accuracy":"0.9134 ± 0.0001"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"Plain Linear + C&S","rank_in_archive_order":33,"of":64,"metrics":{"Ext. data":"No","Number of params":"4747","Test Accuracy":"0.8254 ± 0.0003","Validation Accuracy":"0.9103 ± 0.0001"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"GAT w/NS + C&S","rank_in_archive_order":42,"of":64,"metrics":{"Ext. data":"No","Number of params":"753622","Test Accuracy":"0.8092 ± 0.0037","Validation Accuracy":"0.9263 ± 0.0008"},"uses_additional_data":false},{"leaderboard":"/sota/node-property-prediction-on-ogbn-products","task":"Node Property Prediction","dataset":"ogbn-products","model":"GraphSAGE w/NS + C&S","rank_in_archive_order":45,"of":64,"metrics":{"Ext. data":"No","Number of params":"207919","Test Accuracy":"0.8041 ± 0.0022","Validation Accuracy":"0.9238 ± 0.0007"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.13993","atlas_url":"https://app.syntology.ai/?focus=2010.13993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13993"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.13993"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.13993"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.13993\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2010.13993"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2010.13993\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2010.13993"},"call":"get_concepts_for_paper(arxiv_id=\"2010.13993\")"}],"by_repo":[{"repo":"CUAI/CorrectAndSmooth","kind":"official","samples":2,"ran":2,"instrument":2,"unverified":0},{"repo":"Chillee/CorrectAndSmoothOGB","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"sangyx/gtrick","kind":"listed","samples":3,"ran":1,"instrument":0,"unverified":2},{"repo":"xnuohz/CorrectAndSmooth-dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ytchx1999/GCN_res-CS-v2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"ytchx1999/PyG-GCN_res-CS","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"dmlc/dgl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":6,"harvested_for":["1607.00653","1612.00222","1802.04364","1806.01973","2006.05582","2010.16103"],"harvested_for_calls":[{"arxiv_id":"1607.00653","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1607.00653"},"call":"get_harvested_code_for_paper(arxiv_id=\"1607.00653\")"},{"arxiv_id":"1612.00222","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1612.00222"},"call":"get_harvested_code_for_paper(arxiv_id=\"1612.00222\")"},{"arxiv_id":"1802.04364","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1802.04364"},"call":"get_harvested_code_for_paper(arxiv_id=\"1802.04364\")"},{"arxiv_id":"1806.01973","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.01973"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.01973\")"},{"arxiv_id":"2006.05582","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2006.05582"},"call":"get_harvested_code_for_paper(arxiv_id=\"2006.05582\")"},{"arxiv_id":"2010.16103","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.16103"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.16103\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2010.13993.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2010.13993.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ytchx1999/GCN_res-CS-v2","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Chillee/CorrectAndSmoothOGB","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ytchx1999/PyG-GCN_res-CS","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/xnuohz/CorrectAndSmooth-dgl","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/CUAI/CorrectAndSmooth","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/correct_and_smooth","reach":null}],"summary":{"ran":1,"ran_draft_wrong":2,"unverified":2},"n_samples":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":2,"ran":2,"n_ran_checked":0,"n_instrument":2,"repositories":1},"listed":{"samples":3,"ran":1,"n_ran_checked":1,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":2,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"95753adaeccb24eb","code_sha256_prefix":"95753adaeccb24eb","entry":"random_feature","repo":"sangyx/gtrick","repo_kind":"listed","path":"gtrick/random_feature.py","file_url":"https://github.com/sangyx/gtrick/blob/HEAD/gtrick/random_feature.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-24T22:55:07.240920+00:00","retrieve_with":{"tool":"get_code","code_sha256":"95753adaeccb24eb"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"95753adaeccb24eb"}},{"code_sha256":"5a209cddf7b3e52f","code_sha256_prefix":"5a209cddf7b3e52f","entry":"test","repo":"CUAI/CorrectAndSmooth","repo_kind":"official","path":"gen_models.py","file_url":"https://github.com/CUAI/CorrectAndSmooth/blob/HEAD/gen_models.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"model:callable/0/?, x:Tensor/2/float, y:Tensor/2/int, split_idx:dict/0/?, evaluator:Evaluator/0/?","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/test","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CUAI/CorrectAndSmooth when it was checked","mcp_get_code":{"code_sha256":"5a209cddf7b3e52f"}},{"code_sha256":"fac9425843013f50","code_sha256_prefix":"fac9425843013f50","entry":"train","repo":"CUAI/CorrectAndSmooth","repo_kind":"official","path":"gen_models.py","file_url":"https://github.com/CUAI/CorrectAndSmooth/blob/HEAD/gen_models.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"model:callable/0/?, x:Tensor/2/float, y_true:Tensor/2/int, train_idx:Tensor/1/int, optimizer:Adam/0/?","fixture_out_type":"float","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/train","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CUAI/CorrectAndSmooth when it was checked","mcp_get_code":{"code_sha256":"fac9425843013f50"}},{"code_sha256":"3f05a96b5815dd82","code_sha256_prefix":"3f05a96b5815dd82","entry":"eval","repo":"sangyx/gtrick","repo_kind":"listed","path":"benchmark/dgl/graph_pred.py","file_url":"https://github.com/sangyx/gtrick/blob/HEAD/benchmark/dgl/graph_pred.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/eval","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"3f05a96b5815dd82"}},{"code_sha256":"4254dbfb6411b68f","code_sha256_prefix":"4254dbfb6411b68f","entry":"train","repo":"sangyx/gtrick","repo_kind":"listed","path":"benchmark/dgl/graph_pred.py","file_url":"https://github.com/sangyx/gtrick/blob/HEAD/benchmark/dgl/graph_pred.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/train","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4254dbfb6411b68f"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"98f2a1875849546890baa05b1bcbed337dc0f9f85609894af256c0d5c3f5c677","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}