{"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/cal-accuracy","entry":"cal_accuracy","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":15,"n_papers_ran":15,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":5,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":15,"n_places_pointer_only":10,"n_places_pointer_only_link_open":4,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"unverified":0},"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.00599","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00599","title":"Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Mingzhang21/HealHGNN","path":"HealHGNN/utils/eval_utils.py","file_url":"https://github.com/Mingzhang21/HealHGNN/blob/HEAD/HealHGNN/utils/eval_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9dc4838146d93e39","code_sha256_prefix":"9dc4838146d93e39","mcp_get_code":{"code_sha256":"9dc4838146d93e39"}},{"arxiv_id":"2510.17457","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-17457","title":"Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"ZhenhHuang/GBN","path":"utils/eval_utils.py","file_url":"https://github.com/ZhenhHuang/GBN/blob/HEAD/utils/eval_utils.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, ZhenhHuang/GBN when it was checked","code_sha256":"9dc4838146d93e39","code_sha256_prefix":"9dc4838146d93e39","mcp_get_code":{"code_sha256":"9dc4838146d93e39"}},{"arxiv_id":"2510.16511","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-16511","title":"Structured Temporal Causality for Interpretable Multivariate Time Series Anomaly Detection","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"decisionintelligence/CATCH","path":"ts_benchmark/baselines/catch/utils/tools.py","file_url":"https://github.com/decisionintelligence/CATCH/blob/HEAD/ts_benchmark/baselines/catch/utils/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, decisionintelligence/CATCH when it was checked","code_sha256":"1a1c47411dbeec1f","code_sha256_prefix":"1a1c47411dbeec1f","mcp_get_code":{"code_sha256":"1a1c47411dbeec1f"}},{"arxiv_id":"2412.11085","arxiv_id_is_arxiv":true,"paper":"/paper/graphmore-mitigating-topological","title":"GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Experts","date":"2024-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/graphmore","path":"utils.py","file_url":"https://github.com/ringbdstack/graphmore/blob/HEAD/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, ringbdstack/graphmore when it was checked","code_sha256":"36dd622d9ccb4792","code_sha256_prefix":"36dd622d9ccb4792","mcp_get_code":{"code_sha256":"36dd622d9ccb4792"}},{"arxiv_id":"2411.01623","arxiv_id_is_arxiv":true,"paper":"/paper/filternet-harnessing-frequency-filters-for","title":"FilterNet: Harnessing Frequency Filters for Time Series Forecasting","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aikunyi/FilterNet","path":"utils/tools.py","file_url":"https://github.com/aikunyi/FilterNet/blob/HEAD/utils/tools.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c40a10623118d49","code_sha256_prefix":"3c40a10623118d49","mcp_get_code":{"code_sha256":"3c40a10623118d49"}},{"arxiv_id":"2410.17941","arxiv_id_is_arxiv":true,"paper":"/paper/spiking-graph-neural-network-on-riemannian","title":"Spiking Graph Neural Network on Riemannian Manifolds","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhenhHuang/MSG","path":"utils/eval_utils.py","file_url":"https://github.com/ZhenhHuang/MSG/blob/HEAD/utils/eval_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, ZhenhHuang/MSG when it was checked","code_sha256":"36dd622d9ccb4792","code_sha256_prefix":"36dd622d9ccb4792","mcp_get_code":{"code_sha256":"36dd622d9ccb4792"}},{"arxiv_id":"2405.20139","arxiv_id_is_arxiv":true,"paper":"/paper/gnn-rag-graph-neural-retrieval-for-large","title":"GNN-RAG: Graph Neural Retrieval for Large Language Model Reasoning","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmavro/gnn-rag","path":"gnn/evaluate.py","file_url":"https://github.com/cmavro/gnn-rag/blob/HEAD/gnn/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, cmavro/gnn-rag when it was checked","code_sha256":"e2b0054974cf0526","code_sha256_prefix":"e2b0054974cf0526","mcp_get_code":{"code_sha256":"e2b0054974cf0526"}},{"arxiv_id":"2402.12694","arxiv_id_is_arxiv":true,"paper":"/paper/revitalizing-multivariate-time-series","title":"Revitalizing Multivariate Time Series Forecasting: Learnable Decomposition with Inter-Series Dependencies and Intra-Series Variations Modeling","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Levi-Ackman/Leddam","path":"utils/tools.py","file_url":"https://github.com/Levi-Ackman/Leddam/blob/HEAD/utils/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Levi-Ackman/Leddam when it was checked","code_sha256":"1a1c47411dbeec1f","code_sha256_prefix":"1a1c47411dbeec1f","mcp_get_code":{"code_sha256":"1a1c47411dbeec1f"}},{"arxiv_id":"2310.15484","arxiv_id_is_arxiv":true,"paper":"/paper/nutrea-neural-tree-search-for-context-guided-1","title":"NuTrea: Neural Tree Search for Context-guided Multi-hop KGQA","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlvlab/NuTrea","path":"src/evaluate.py","file_url":"https://github.com/mlvlab/NuTrea/blob/HEAD/src/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"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 cmavro/gnn-rag, and GitHub detected no licence in that repository when it was checked","code_sha256":"e2b0054974cf0526","code_sha256_prefix":"e2b0054974cf0526","mcp_get_code":{"code_sha256":"e2b0054974cf0526"}},{"arxiv_id":"2310.09751","arxiv_id_is_arxiv":true,"paper":"/paper/unitime-a-language-empowered-unified-model","title":"UniTime: A Language-Empowered Unified Model for Cross-Domain Time Series Forecasting","date":"2023-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxu77/unitime","path":"utils/tools.py","file_url":"https://github.com/liuxu77/unitime/blob/HEAD/utils/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from decisionintelligence/CATCH, and GitHub detected no licence in that repository when it was checked","code_sha256":"1a1c47411dbeec1f","code_sha256_prefix":"1a1c47411dbeec1f","mcp_get_code":{"code_sha256":"1a1c47411dbeec1f"}},{"arxiv_id":"2308.08469","arxiv_id_is_arxiv":true,"paper":"/paper/llm4ts-two-stage-fine-tuning-for-time-series","title":"LLM4TS: Aligning Pre-Trained LLMs as Data-Efficient Time-Series Forecasters","date":"2023-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"blacksnail789521/LLM4TS","path":"utils/tools.py","file_url":"https://github.com/blacksnail789521/LLM4TS/blob/HEAD/utils/tools.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"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 decisionintelligence/CATCH, and GitHub detected no licence in that repository when it was checked","code_sha256":"1a1c47411dbeec1f","code_sha256_prefix":"1a1c47411dbeec1f","mcp_get_code":{"code_sha256":"1a1c47411dbeec1f"}},{"arxiv_id":"2105.11367","arxiv_id_is_arxiv":true,"paper":"/paper/fedscale-benchmarking-model-and-system","title":"FedScale: Benchmarking Model and System Performance of Federated Learning at Scale","date":"2021-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SymbioticLab/FedScale","path":"fedscale/utils/model_test_module.py","file_url":"https://github.com/SymbioticLab/FedScale/blob/HEAD/fedscale/utils/model_test_module.py","status":"ran","verification_level":1,"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":"69d05e9ff15832cb","code_sha256_prefix":"69d05e9ff15832cb","mcp_get_code":{"code_sha256":"69d05e9ff15832cb"}},{"arxiv_id":"1912.05617","arxiv_id_is_arxiv":true,"paper":"/paper/molecular-generative-model-based-on-1","title":"Molecular Generative Model Based On Adversarially Regularized Autoencoder","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gicsaw/ARAE_SMILES","path":"gen_ARAE_QM9.py","file_url":"https://github.com/gicsaw/ARAE_SMILES/blob/HEAD/gen_ARAE_QM9.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1d69617e288c4eb4","code_sha256_prefix":"1d69617e288c4eb4","mcp_get_code":{"code_sha256":"1d69617e288c4eb4"}},{"arxiv_id":"2024.acl-long.438","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-long.438","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Hengrui-Gu/PokeMQA","path":"train_disambiguator.py","file_url":"https://github.com/Hengrui-Gu/PokeMQA/blob/HEAD/train_disambiguator.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":"91e43f36bd048177","code_sha256_prefix":"91e43f36bd048177","mcp_get_code":{"code_sha256":"91e43f36bd048177"}},{"arxiv_id":"2022.findings-emnlp.181","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.181","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"cmavro/ReaRev_KGQA","path":"evaluate.py","file_url":"https://github.com/cmavro/ReaRev_KGQA/blob/HEAD/evaluate.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"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 cmavro/gnn-rag, and GitHub detected no licence in that repository when it was checked","code_sha256":"e2b0054974cf0526","code_sha256_prefix":"e2b0054974cf0526","mcp_get_code":{"code_sha256":"e2b0054974cf0526"}}],"record_sha256":"cb9e7ceaab716648a51b78f74b444bae46a116d4c1e59f58121e8a78945eff9e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}