{"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/split-batch","entry":"split_batch","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":8,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":12,"n_places_pointer_only":7,"n_places_pointer_only_link_open":3,"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":3,"ran_fixture":0,"ran":3,"unverified":1},"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":"2603.01806","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01806","title":"GCTAM: Global and Contextual Truncated Affinity Combined Maximization Model For Unsupervised Graph Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"kgccc/GCTAM","path":"graph_generator.py","file_url":"https://github.com/kgccc/GCTAM/blob/HEAD/graph_generator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kgccc/GCTAM when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}},{"arxiv_id":"2506.15448","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.15448","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"mala-lab/RHO","path":"model.py","file_url":"https://github.com/mala-lab/RHO/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mala-lab/RHO when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}},{"arxiv_id":"2410.06581","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-legal-case-retrieval-via-scaling","title":"Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/DeepTHULAC","path":"deepthulac/seg/cut_sent.py","file_url":"https://github.com/thunlp/DeepTHULAC/blob/HEAD/deepthulac/seg/cut_sent.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":"ce6b466b301b7acb","code_sha256_prefix":"ce6b466b301b7acb","mcp_get_code":{"code_sha256":"ce6b466b301b7acb"}},{"arxiv_id":"2409.17386","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-redundancy-information-aware","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/infomgf","path":"InfoMGF/utils.py","file_url":"https://github.com/zxlearningdeep/infomgf/blob/HEAD/InfoMGF/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxlearningdeep/infomgf when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}},{"arxiv_id":"2406.10471","arxiv_id_is_arxiv":true,"paper":"/paper/personalized-pieces-efficient-personalized","title":"Personalized Pieces: Efficient Personalized Large Language Models through Collaborative Efforts","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TamSiuhin/Per-Pcs","path":"anchor_selection/history_anchor.py","file_url":"https://github.com/TamSiuhin/Per-Pcs/blob/HEAD/anchor_selection/history_anchor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, TamSiuhin/Per-Pcs when it was checked","code_sha256":"83e7fa7c6fecc249","code_sha256_prefix":"83e7fa7c6fecc249","mcp_get_code":{"code_sha256":"83e7fa7c6fecc249"}},{"arxiv_id":"2311.04419","arxiv_id_is_arxiv":true,"paper":"/paper/pepland-a-large-scale-pre-trained-peptide","title":"PepLand: a large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids","date":"2023-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangruochi/pepland","path":"inference/inference_pepland.py","file_url":"https://github.com/zhangruochi/pepland/blob/HEAD/inference/inference_pepland.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4ec1780278936634","code_sha256_prefix":"4ec1780278936634","mcp_get_code":{"code_sha256":"4ec1780278936634"}},{"arxiv_id":"2210.16966","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-geometric-deep-learning-via","title":"Interpretable Geometric Deep Learning via Learnable Randomness Injection","date":"2022-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/xgdl","path":"src/xgdl/baselines/new_method.py","file_url":"https://github.com/Graph-COM/xgdl/blob/HEAD/src/xgdl/baselines/new_method.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":"deb2712a258e8789","code_sha256_prefix":"deb2712a258e8789","mcp_get_code":{"code_sha256":"deb2712a258e8789"}},{"arxiv_id":"2201.12872","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-invariant-rationales-for-graph-1","title":"Discovering Invariant Rationales for Graph Neural Networks","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wuyxin/dir-gnn","path":"train/spmotif_dir.py","file_url":"https://github.com/wuyxin/dir-gnn/blob/HEAD/train/spmotif_dir.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"496db6912d4f2482","code_sha256_prefix":"496db6912d4f2482","mcp_get_code":{"code_sha256":"496db6912d4f2482"}},{"arxiv_id":"2201.06367","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unsupervised-deep-graph-structure","title":"Towards Unsupervised Deep Graph Structure Learning","date":"2022-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grand-lab/sublime","path":"utils.py","file_url":"https://github.com/grand-lab/sublime/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mala-lab/RHO, and GitHub detected no licence in that repository when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}},{"arxiv_id":"aaai_25573","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25573","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yixinliu233/GREET","path":"utils.py","file_url":"https://github.com/yixinliu233/GREET/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mala-lab/RHO, and GitHub detected no licence in that repository when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}},{"arxiv_id":"2025.acl-long.1159","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.acl-long.1159","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ulab-uiuc/GoR","path":"retrieval.py","file_url":"https://github.com/ulab-uiuc/GoR/blob/HEAD/retrieval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"892868b6b99079e9","code_sha256_prefix":"892868b6b99079e9","mcp_get_code":{"code_sha256":"892868b6b99079e9"}},{"arxiv_id":"2023.emnlp-main.771","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.emnlp-main.771","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Patrick-Ni/KnowEE","path":"src/batch_generate.py","file_url":"https://github.com/Patrick-Ni/KnowEE/blob/HEAD/src/batch_generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from mala-lab/RHO, and GitHub detected no licence in that repository when it was checked","code_sha256":"52877319159d65f9","code_sha256_prefix":"52877319159d65f9","mcp_get_code":{"code_sha256":"52877319159d65f9"}}],"record_sha256":"f8c3bb8b651c8a9ea0453cb4aa7534f684f21de67e51fceca41dfa5df86ddb17","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}