{"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/reset","entry":"reset","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":5,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":4},"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":"2501.03113","paper":"/paper/balancing-efficiency-and-expressiveness","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jks17/hymn","path":"counting_substructures/model.py","file_url":"https://github.com/jks17/hymn/blob/HEAD/counting_substructures/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"5523506924b65182","mcp_get_code":{"code_sha256":"5523506924b65182"}},{"arxiv_id":"2312.06660","paper":"/paper/edgesam-prompt-in-the-loop-distillation-for","title":"EdgeSAM: Prompt-In-the-Loop Distillation for On-Device Deployment of SAM","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chongzhou96/edgesam","path":"web_demo/gradio_app.py","file_url":"https://github.com/chongzhou96/edgesam/blob/HEAD/web_demo/gradio_app.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"b74756c6e0866ed8","mcp_get_code":{"code_sha256":"b74756c6e0866ed8"}},{"arxiv_id":"2305.12074","paper":"/paper/disco-distilled-student-models-co-training","title":"DisCo: Distilled Student Models Co-training for Semi-supervised Text Mining","date":"2023-05-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opensum/bigae","path":"pretraining/src_gae/gae.py","file_url":"https://github.com/opensum/bigae/blob/HEAD/pretraining/src_gae/gae.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"440e5dffb0327ed4","mcp_get_code":{"code_sha256":"440e5dffb0327ed4"}},{"arxiv_id":"2303.10371","paper":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling","title":"UNREAL:Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification","date":"2023-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yanliang3612/UNREAL","path":"models/Summer.py","file_url":"https://github.com/yanliang3612/UNREAL/blob/HEAD/models/Summer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8988d78678494da0","mcp_get_code":{"code_sha256":"8988d78678494da0"}},{"arxiv_id":"1809.10341","paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SpaceLearner/DisenGraphRep","path":"models/infomax.py","file_url":"https://github.com/SpaceLearner/DisenGraphRep/blob/HEAD/models/infomax.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"63491bdac79e3e64","mcp_get_code":{"code_sha256":"63491bdac79e3e64"}}]}