{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/update-node","entry":"update_node","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":6,"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":2,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":0},"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":"2406.09031","paper":"/paper/a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goose315/graph_pooling_benchmark","path":"SEP/SEPG/trans_graph.py","file_url":"https://github.com/goose315/graph_pooling_benchmark/blob/HEAD/SEP/SEPG/trans_graph.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bc1bd0cbe71477b","mcp_get_code":{"code_sha256":"1bc1bd0cbe71477b"}},{"arxiv_id":"2405.11225","paper":"/paper/sebot-structural-entropy-guided-multi-view","title":"SeBot: Structural Entropy Guided Multi-View Contrastive Learning for Social Bot Detection","date":"2024-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"846468230/sebot","path":"SEPG/trans_graph.py","file_url":"https://github.com/846468230/sebot/blob/HEAD/SEPG/trans_graph.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1bc1bd0cbe71477b","mcp_get_code":{"code_sha256":"1bc1bd0cbe71477b"}},{"arxiv_id":"2305.15182","paper":"/paper/hitin-hierarchy-aware-tree-isomorphism","title":"HiTIN: Hierarchy-aware Tree Isomorphism Network for Hierarchical Text Classification","date":"2023-05-24","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":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"33d71761e0a8d2f1","mcp_get_code":{"code_sha256":"33d71761e0a8d2f1"}},{"arxiv_id":"2304.12000","paper":"/paper/hierarchical-state-abstraction-based-on","title":"Hierarchical State Abstraction Based on Structural Information Principles","date":"2023-04-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/sisa","path":"source code/dmcontrol/hcse/structural_optimization.py","file_url":"https://github.com/ringbdstack/sisa/blob/HEAD/source%20code/dmcontrol/hcse/structural_optimization.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1bc1bd0cbe71477b","mcp_get_code":{"code_sha256":"1bc1bd0cbe71477b"}},{"arxiv_id":"2206.13510","paper":"/paper/structural-entropy-guided-graph-hierarchical","title":"Structural Entropy Guided Graph Hierarchical Pooling","date":"2022-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-junran/sep","path":"SEPG/trans_graph.py","file_url":"https://github.com/wu-junran/sep/blob/HEAD/SEPG/trans_graph.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1bc1bd0cbe71477b","mcp_get_code":{"code_sha256":"1bc1bd0cbe71477b"}},{"arxiv_id":"2110.02047","paper":"/paper/tent-text-classification-based-on-encoding","title":"Hierarchical information matters: Text classification via tree based graph neural network","date":"2021-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daisean/hint","path":"build_coding_tree.py","file_url":"https://github.com/daisean/hint/blob/HEAD/build_coding_tree.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"33d71761e0a8d2f1","mcp_get_code":{"code_sha256":"33d71761e0a8d2f1"}}]}