{"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/calculate-statistics","entry":"calculate_statistics","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":11,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":6,"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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":4,"n_samples_fingerprinted":3,"n_places":11,"n_places_pointer_only":6,"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":1,"ran_violates":0,"ran_draft_wrong":5,"ran_fixture":0,"ran":0,"unverified":4},"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":"2605.08305","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08305","title":"LLMSYS-HPOBench: Hyperparameter Optimization Benchmark Suite for Real-World LLM Systems","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ideas-labo/llmsys-hpobench","path":"sampler/RAG/lightrag_sampler/fidelity_analyze.py","file_url":"https://github.com/ideas-labo/llmsys-hpobench/blob/HEAD/sampler/RAG/lightrag_sampler/fidelity_analyze.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, ideas-labo/llmsys-hpobench, is not in the permissive set Syntology serves inline","code_sha256":"636bdb2bc120aa1f","code_sha256_prefix":"636bdb2bc120aa1f","mcp_get_code":{"code_sha256":"636bdb2bc120aa1f"}},{"arxiv_id":"2604.17808","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-17808","title":"Enabling AI ASICs for Zero Knowledge Proof","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"EfficientPPML/MORPH","path":"profiler.py","file_url":"https://github.com/EfficientPPML/MORPH/blob/HEAD/profiler.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, EfficientPPML/MORPH when it was checked","code_sha256":"339bad322971c3c7","code_sha256_prefix":"339bad322971c3c7","mcp_get_code":{"code_sha256":"339bad322971c3c7"}},{"arxiv_id":"2601.22162","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-22162","title":"UniFinEval: Towards Unified Evaluation of Financial Multimodal Models across Text, Images and Videos","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"aifinlab/UniFinEval","path":"evaluate_py/statistics.py","file_url":"https://github.com/aifinlab/UniFinEval/blob/HEAD/evaluate_py/statistics.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":"197585381b7bb3fd","code_sha256_prefix":"197585381b7bb3fd","mcp_get_code":{"code_sha256":"197585381b7bb3fd"}},{"arxiv_id":"2511.01307","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-01307","title":"Perturb a Model, Not an Image: Towards Robust Privacy Protection via Anti-Personalized Diffusion Models","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"KU-VGI/APDM","path":"evaluation/fid.py","file_url":"https://github.com/KU-VGI/APDM/blob/HEAD/evaluation/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, KU-VGI/APDM when it was checked","code_sha256":"93b8fbfaaf3d24e6","code_sha256_prefix":"93b8fbfaaf3d24e6","mcp_get_code":{"code_sha256":"93b8fbfaaf3d24e6"}},{"arxiv_id":"2412.04905","arxiv_id_is_arxiv":true,"paper":"/paper/demo-reframing-dialogue-interaction-with-fine","title":"DEMO: Reframing Dialogue Interaction with Fine-grained Element Modeling","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozerwang/demo","path":"step3_result.py","file_url":"https://github.com/mozerwang/demo/blob/HEAD/step3_result.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a926e96a8e33392","code_sha256_prefix":"1a926e96a8e33392","mcp_get_code":{"code_sha256":"1a926e96a8e33392"}},{"arxiv_id":"2409.02772","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-causal-representation-learning-with","title":"Unifying Causal Representation Learning with the Invariance Principle","date":"2024-09-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"causallearningai/istant","path":"src/fid.py","file_url":"https://github.com/causallearningai/istant/blob/HEAD/src/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f2bff88ef89ab53a","code_sha256_prefix":"f2bff88ef89ab53a","mcp_get_code":{"code_sha256":"f2bff88ef89ab53a"}},{"arxiv_id":"2406.12753","arxiv_id_is_arxiv":true,"paper":"/paper/olympicarena-benchmarking-multi-discipline","title":"OlympicArena: Benchmarking Multi-discipline Cognitive Reasoning for Superintelligent AI","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gair-nlp/olympicarena","path":"code/evaluation.py","file_url":"https://github.com/gair-nlp/olympicarena/blob/HEAD/code/evaluation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gair-nlp/olympicarena when it was checked","code_sha256":"74675bd591f5fd9f","code_sha256_prefix":"74675bd591f5fd9f","mcp_get_code":{"code_sha256":"74675bd591f5fd9f"}},{"arxiv_id":"2405.09879","arxiv_id_is_arxiv":true,"paper":"/paper/generative-unlearning-for-any-identity","title":"Generative Unlearning for Any Identity","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KHU-AGI/GUIDE","path":"evaluate_fid.py","file_url":"https://github.com/KHU-AGI/GUIDE/blob/HEAD/evaluate_fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, KHU-AGI/GUIDE when it was checked","code_sha256":"93b8fbfaaf3d24e6","code_sha256_prefix":"93b8fbfaaf3d24e6","mcp_get_code":{"code_sha256":"93b8fbfaaf3d24e6"}},{"arxiv_id":"2405.08958","arxiv_id_is_arxiv":true,"paper":"/paper/learned-radio-interferometric-imaging-for","title":"Learned radio interferometric imaging for varying visibility coverage","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"astro-informatics/leia","path":"src/util.py","file_url":"https://github.com/astro-informatics/leia/blob/HEAD/src/util.py","status":"unverified","verification_level":0,"contract_check":null,"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, astro-informatics/leia when it was checked","code_sha256":"c6f61623bc55ca46","code_sha256_prefix":"c6f61623bc55ca46","mcp_get_code":{"code_sha256":"c6f61623bc55ca46"}},{"arxiv_id":"2107.11264","arxiv_id_is_arxiv":true,"paper":"/paper/standardized-max-logits-a-simple-yet","title":"Standardized Max Logits: A Simple yet Effective Approach for Identifying Unexpected Road Obstacles in Urban-Scene Segmentation","date":"2021-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shjung13/standardized-max-logits","path":"calculate_statistics.py","file_url":"https://github.com/shjung13/standardized-max-logits/blob/HEAD/calculate_statistics.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":"69e83314d27a0782","code_sha256_prefix":"69e83314d27a0782","mcp_get_code":{"code_sha256":"69e83314d27a0782"}},{"arxiv_id":"aaai_26923","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26923","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"aivaslab/standoff","path":"src/calculate_statistics.py","file_url":"https://github.com/aivaslab/standoff/blob/HEAD/src/calculate_statistics.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":"5ec33bd895407e61","code_sha256_prefix":"5ec33bd895407e61","mcp_get_code":{"code_sha256":"5ec33bd895407e61"}}],"record_sha256":"eab8003998d9a8c06e29dccf3b97f27c891976316000f92a4984eb6f177c325b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}