{"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/relabel","entry":"relabel","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":7,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":2,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":8,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":2,"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":"2601.15779","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-15779","title":"Diffusion Model-Based Data Augmentation for Enhanced Neuron Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"HeadLiuYun/NeuroDiff","path":"segmentation_scripts/evaluate.py","file_url":"https://github.com/HeadLiuYun/NeuroDiff/blob/HEAD/segmentation_scripts/evaluate.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, HeadLiuYun/NeuroDiff when it was checked","code_sha256":"781ac8f422a292c6","code_sha256_prefix":"781ac8f422a292c6","mcp_get_code":{"code_sha256":"781ac8f422a292c6"}},{"arxiv_id":"2410.03396","arxiv_id_is_arxiv":true,"paper":"/paper/graphcroc-cross-correlation-autoencoder-for","title":"GraphCroc: Cross-Correlation Autoencoder for Graph Structural Reconstruction","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjduan/GraphCroc","path":"IMDB_B/wl_test_util.py","file_url":"https://github.com/sjduan/GraphCroc/blob/HEAD/IMDB_B/wl_test_util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b9e2a85aa8b8be6","code_sha256_prefix":"6b9e2a85aa8b8be6","mcp_get_code":{"code_sha256":"6b9e2a85aa8b8be6"}},{"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":"d55adf463cf24712","code_sha256_prefix":"d55adf463cf24712","mcp_get_code":{"code_sha256":"d55adf463cf24712"}},{"arxiv_id":"2207.10888","arxiv_id_is_arxiv":true,"paper":"/paper/fairgrape-fairness-aware-gradient-pruning","title":"FairGRAPE: Fairness-aware GRAdient Pruning mEthod for Face Attribute Classification","date":"2022-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bernardo1998/FairGRAPE","path":"dataset.py","file_url":"https://github.com/Bernardo1998/FairGRAPE/blob/HEAD/dataset.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":"8058091ab48564ea","code_sha256_prefix":"8058091ab48564ea","mcp_get_code":{"code_sha256":"8058091ab48564ea"}},{"arxiv_id":"2202.12950","arxiv_id_is_arxiv":true,"paper":"/paper/2021-beetl-competition-advancing-transfer","title":"2021 BEETL Competition: Advancing Transfer Learning for Subject Independence & Heterogenous EEG Data Sets","date":"2022-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mcd4874/neurips_competition","path":"EEG_Lightning/submission/generate_task_2_data.py","file_url":"https://github.com/mcd4874/neurips_competition/blob/HEAD/EEG_Lightning/submission/generate_task_2_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ab2131db01e45dc2","code_sha256_prefix":"ab2131db01e45dc2","mcp_get_code":{"code_sha256":"ab2131db01e45dc2"}},{"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":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e3ffbd6a2bf78a6b","code_sha256_prefix":"e3ffbd6a2bf78a6b","mcp_get_code":{"code_sha256":"e3ffbd6a2bf78a6b"}},{"arxiv_id":"2010.15727","arxiv_id_is_arxiv":true,"paper":"/paper/attentive-clustering-processes","title":"Amortized Probabilistic Detection of Communities in Graphs","date":"2020-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aripakman/attentive_clustering_processes","path":"acp/models/acp_sampler.py","file_url":"https://github.com/aripakman/attentive_clustering_processes/blob/HEAD/acp/models/acp_sampler.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":"b45ce271447069e5","code_sha256_prefix":"b45ce271447069e5","mcp_get_code":{"code_sha256":"b45ce271447069e5"}},{"arxiv_id":"2020.acl-main.514","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.acl-main.514","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bfelbo/DeepMoji","path":"deepmoji/class_avg_finetuning.py","file_url":"https://github.com/bfelbo/DeepMoji/blob/HEAD/deepmoji/class_avg_finetuning.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":"eb9385b42132d64b","code_sha256_prefix":"eb9385b42132d64b","mcp_get_code":{"code_sha256":"eb9385b42132d64b"}}],"record_sha256":"0defc4ea6eb7fbc1f487c30564e11da40445dffbe438b73d9fedcb507f515171","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}