{"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/eval-acc","entry":"eval_acc","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":15,"n_papers_ran":10,"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":14,"n_samples_ran":8,"n_samples_fingerprinted":0,"n_places":16,"n_places_pointer_only":3,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":6,"unverified":6},"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":"2605.22898","paper":"/paper/arxiv-2605-22898","title":"FIRMA: FIbonacci Ring Model Aggregation for Privacy-preserving Federated Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hedjrachid/FIRMA","path":"fibfl/fibfl.py","file_url":"https://github.com/Hedjrachid/FIRMA/blob/HEAD/fibfl/fibfl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d540b19f20258e37","mcp_get_code":{"code_sha256":"d540b19f20258e37"}},{"arxiv_id":"2410.20724","paper":"/paper/simple-is-effective-the-roles-of-graphs-and","title":"Simple Is Effective: The Roles of Graphs and Large Language Models in Knowledge-Graph-Based Retrieval-Augmented Generation","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/SubgraphRAG","path":"reason/metrics/evaluate_results.py","file_url":"https://github.com/Graph-COM/SubgraphRAG/blob/HEAD/reason/metrics/evaluate_results.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e8b1bf34a1cb6dc9","mcp_get_code":{"code_sha256":"e8b1bf34a1cb6dc9"}},{"arxiv_id":"2410.00812","paper":"/paper/a-generative-framework-to-bridge-data-driven","title":"Generative causal testing to bridge data-driven models and scientific theories in language neuroscience","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/automated-explanations","path":"experiments/03_finetune.py","file_url":"https://github.com/microsoft/automated-explanations/blob/HEAD/experiments/03_finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"52cd62735dc91c81","mcp_get_code":{"code_sha256":"52cd62735dc91c81"}},{"arxiv_id":"2407.11372","paper":"/paper/unit-backdoor-mitigation-via-automated-neural","title":"UNIT: Backdoor Mitigation via Automated Neural Distribution Tightening","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megum1/unit","path":"evaluate.py","file_url":"https://github.com/megum1/unit/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c72a4b5d656afd4d","mcp_get_code":{"code_sha256":"c72a4b5d656afd4d"}},{"arxiv_id":"2406.08993","paper":"/paper/classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUOyk1999/tunedGNN","path":"large_graph/data_utils.py","file_url":"https://github.com/LUOyk1999/tunedGNN/blob/HEAD/large_graph/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"319c36c17da75fed","mcp_get_code":{"code_sha256":"319c36c17da75fed"}},{"arxiv_id":"2403.01232","paper":"/paper/polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cornell-zhang/Polynormer","path":"data_utils.py","file_url":"https://github.com/cornell-zhang/Polynormer/blob/HEAD/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"319c36c17da75fed","mcp_get_code":{"code_sha256":"319c36c17da75fed"}},{"arxiv_id":"2402.11199","paper":"/paper/direct-evaluation-of-chain-of-thought-in","title":"Direct Evaluation of Chain-of-Thought in Multi-hop Reasoning with Knowledge Graphs","date":"2024-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minhvuong2000/llmreasoncert","path":"evaluate_results.py","file_url":"https://github.com/minhvuong2000/llmreasoncert/blob/HEAD/evaluate_results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"35d831fcc8aee4e2","mcp_get_code":{"code_sha256":"35d831fcc8aee4e2"}},{"arxiv_id":"2312.02619","paper":"/paper/rethinking-and-simplifying-bootstrapped-graph","title":"Rethinking and Simplifying Bootstrapped Graph Latents","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zszszs25/sgcl","path":"bgrl/linear_eval.py","file_url":"https://github.com/zszszs25/sgcl/blob/HEAD/bgrl/linear_eval.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9158f47985798953","mcp_get_code":{"code_sha256":"9158f47985798953"}},{"arxiv_id":"2310.06396","paper":"/paper/adversarial-robustness-in-graph-neural-1","title":"Adversarial Robustness in Graph Neural Networks: A Hamiltonian Approach","date":"2023-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LFhase/GIA-HAO","path":"attacks/metric.py","file_url":"https://github.com/LFhase/GIA-HAO/blob/HEAD/attacks/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"399418345f3feb4b","mcp_get_code":{"code_sha256":"399418345f3feb4b"}},{"arxiv_id":"2211.13609","paper":"/paper/pac-bayes-compression-bounds-so-tight-that","title":"PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/tight-pac-bayes","path":"experiments/prune_model.py","file_url":"https://github.com/activatedgeek/tight-pac-bayes/blob/HEAD/experiments/prune_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":"cbbf30f4b3d42a8d","mcp_get_code":{"code_sha256":"cbbf30f4b3d42a8d"}},{"arxiv_id":"2211.13609","paper":"/paper/pac-bayes-compression-bounds-so-tight-that","title":"PAC-Bayes Compression Bounds So Tight That They Can Explain Generalization","date":"2022-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"activatedgeek/tight-pac-bayes","path":"experiments/train_quantize_aware.py","file_url":"https://github.com/activatedgeek/tight-pac-bayes/blob/HEAD/experiments/train_quantize_aware.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":"abb4bda0a172ab1a","mcp_get_code":{"code_sha256":"abb4bda0a172ab1a"}},{"arxiv_id":"2208.11266","paper":"/paper/scale-online-self-supervised-lifelong","title":"SCALE: Online Self-Supervised Lifelong Learning without Prior Knowledge","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orienfish/scale","path":"eval_utils.py","file_url":"https://github.com/orienfish/scale/blob/HEAD/eval_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"60bc24fbf225a7b6","mcp_get_code":{"code_sha256":"60bc24fbf225a7b6"}},{"arxiv_id":"2111.04314","paper":"/paper/graph-robustness-benchmark-benchmarking-the","title":"Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THUDM/grb","path":"grb/evaluator/metric.py","file_url":"https://github.com/THUDM/grb/blob/HEAD/grb/evaluator/metric.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"399418345f3feb4b","mcp_get_code":{"code_sha256":"399418345f3feb4b"}},{"arxiv_id":"2003.03021","paper":"/paper/exploiting-verified-neural-networks-via","title":"Exploiting Verified Neural Networks via Floating Point Numerical Error","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jia-kai/realadv","path":"CROWN/realadv/attack.py","file_url":"https://github.com/jia-kai/realadv/blob/HEAD/CROWN/realadv/attack.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"56e37c76d1386371","mcp_get_code":{"code_sha256":"56e37c76d1386371"}},{"arxiv_id":"2002.06483","paper":"/paper/face-recognition-too-bias-or-not-too-bias","title":"Face Recognition: Too Bias, or Not Too Bias?","date":"2020-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visionjo/facerec-bias-bfw","path":"code/facebias/utils.py","file_url":"https://github.com/visionjo/facerec-bias-bfw/blob/HEAD/code/facebias/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"76a6b0da0557f9d4","mcp_get_code":{"code_sha256":"76a6b0da0557f9d4"}},{"arxiv_id":"1704.08063","paper":"/paper/sphereface-deep-hypersphere-embedding-for","title":"SphereFace: Deep Hypersphere Embedding for Face Recognition","date":"2017-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clcarwin/sphereface_pytorch","path":"lfw_eval.py","file_url":"https://github.com/clcarwin/sphereface_pytorch/blob/HEAD/lfw_eval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c9a3a206dbb3075f","mcp_get_code":{"code_sha256":"c9a3a206dbb3075f"}}]}