{"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/compute-statistics","entry":"compute_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":14,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":8,"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":14,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":6,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":14,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":3,"ran":8,"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":"2607.26680","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-26680","title":"Efficient Heteroscedastic Bayesian Optimization for Risk-Aware AutoRL","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"LUH-AI/Efficient-Risk-Averse-BO","path":"dataset/plot_dataset_analysis.py","file_url":"https://github.com/LUH-AI/Efficient-Risk-Averse-BO/blob/HEAD/dataset/plot_dataset_analysis.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1ed1175f8ce698c7","code_sha256_prefix":"1ed1175f8ce698c7","mcp_get_code":{"code_sha256":"1ed1175f8ce698c7"}},{"arxiv_id":"2602.24040","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-24040","title":"RewardUQ: A Unified Framework for Uncertainty-Aware Reward Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"lasgroup/rewarduq","path":"src/rewarduq/metrics.py","file_url":"https://github.com/lasgroup/rewarduq/blob/HEAD/src/rewarduq/metrics.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":"8fdfb3ebc3b567cb","code_sha256_prefix":"8fdfb3ebc3b567cb","mcp_get_code":{"code_sha256":"8fdfb3ebc3b567cb"}},{"arxiv_id":"2511.18891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-18891","title":"Reproducibility Study of: Large Language Model Bayesian Optimization","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"spagnoloG/llambo-reproducibility","path":"LLAMBO/compare_with_baselines.py","file_url":"https://github.com/spagnoloG/llambo-reproducibility/blob/HEAD/LLAMBO/compare_with_baselines.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, spagnoloG/llambo-reproducibility when it was checked","code_sha256":"254a84d6fe230b8e","code_sha256_prefix":"254a84d6fe230b8e","mcp_get_code":{"code_sha256":"254a84d6fe230b8e"}},{"arxiv_id":"2507.03167","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-manipulation-of-reasoning-models","title":"Adversarial Manipulation of Reasoning Models using Internal Representations","date":"2025-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ky295/reasoning-manipulation","path":"utils/compute_layer_statistics.py","file_url":"https://github.com/ky295/reasoning-manipulation/blob/HEAD/utils/compute_layer_statistics.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a57a41ff1c82852a","code_sha256_prefix":"a57a41ff1c82852a","mcp_get_code":{"code_sha256":"a57a41ff1c82852a"}},{"arxiv_id":"2409.14083","arxiv_id_is_arxiv":true,"paper":"/paper/surf-teaching-large-vision-language-models-to","title":"SURf: Teaching Large Vision-Language Models to Selectively Utilize Retrieved Information","date":"2024-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GasolSun36/SURf","path":"eval/eval_pope.py","file_url":"https://github.com/GasolSun36/SURf/blob/HEAD/eval/eval_pope.py","status":"ran","verification_level":1,"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, GasolSun36/SURf when it was checked","code_sha256":"f63fb039437be784","code_sha256_prefix":"f63fb039437be784","mcp_get_code":{"code_sha256":"f63fb039437be784"}},{"arxiv_id":"2404.16807","arxiv_id_is_arxiv":true,"paper":"/paper/improving-diversity-of-commonsense-generation","title":"Improving Diversity of Commonsense Generation by Large Language Models via In-Context Learning","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AvataGarde/In_Context_Diversification","path":"eval/joint.py","file_url":"https://github.com/AvataGarde/In_Context_Diversification/blob/HEAD/eval/joint.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, AvataGarde/In_Context_Diversification when it was checked","code_sha256":"5b833a543767823e","code_sha256_prefix":"5b833a543767823e","mcp_get_code":{"code_sha256":"5b833a543767823e"}},{"arxiv_id":"2402.13213","arxiv_id_is_arxiv":true,"paper":"/paper/softmax-probabilities-mostly-predict-large","title":"Probabilities of Chat LLMs Are Miscalibrated but Still Predict Correctness on Multiple-Choice Q&A","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bplaut/softmax-probs-predict-llm-correctness","path":"show_msp_distributions.py","file_url":"https://github.com/bplaut/softmax-probs-predict-llm-correctness/blob/HEAD/show_msp_distributions.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74f56cba2c962f66","code_sha256_prefix":"74f56cba2c962f66","mcp_get_code":{"code_sha256":"74f56cba2c962f66"}},{"arxiv_id":"2312.01721","arxiv_id_is_arxiv":true,"paper":"/paper/the-self-loop-paradox-investigating-the","title":"The Self-Loop Paradox: Investigating the Impact of Self-Loops on Graph Neural Networks","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-lampert/self-loop-paradox","path":"src/stats/walk_statistics.py","file_url":"https://github.com/m-lampert/self-loop-paradox/blob/HEAD/src/stats/walk_statistics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, m-lampert/self-loop-paradox, is not in the permissive set Syntology serves inline","code_sha256":"817257ca0e31d6c5","code_sha256_prefix":"817257ca0e31d6c5","mcp_get_code":{"code_sha256":"817257ca0e31d6c5"}},{"arxiv_id":"2310.04590","arxiv_id_is_arxiv":true,"paper":"/paper/deep-model-predictive-optimization","title":"Deep Model Predictive Optimization","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jisacks/dmpo","path":"dmpo/utils.py","file_url":"https://github.com/jisacks/dmpo/blob/HEAD/dmpo/utils.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":"3ea10a274f22422d","code_sha256_prefix":"3ea10a274f22422d","mcp_get_code":{"code_sha256":"3ea10a274f22422d"}},{"arxiv_id":"2310.01386","arxiv_id_is_arxiv":true,"paper":"/paper/who-is-chatgpt-benchmarking-llms","title":"Who is ChatGPT? Benchmarking LLMs' Psychological Portrayal Using PsychoBench","date":"2023-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cuhk-arise/psychobench","path":"utils.py","file_url":"https://github.com/cuhk-arise/psychobench/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"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, cuhk-arise/psychobench, is not in the permissive set Syntology serves inline","code_sha256":"e83e5462199d078e","code_sha256_prefix":"e83e5462199d078e","mcp_get_code":{"code_sha256":"e83e5462199d078e"}},{"arxiv_id":"2306.05553","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-vs-invariant-layers-a-comparison","title":"Equivariant vs. Invariant Layers: A Comparison of Backbone and Pooling for Point Cloud Classification","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mint-vu/backbone_vs_pooling","path":"poolings/attention.py","file_url":"https://github.com/mint-vu/backbone_vs_pooling/blob/HEAD/poolings/attention.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mint-vu/backbone_vs_pooling when it was checked","code_sha256":"9438de8b6ff7860f","code_sha256_prefix":"9438de8b6ff7860f","mcp_get_code":{"code_sha256":"9438de8b6ff7860f"}},{"arxiv_id":"2207.09445","arxiv_id_is_arxiv":true,"paper":"/paper/posernet-refining-relative-camera-poses","title":"PoserNet: Refining Relative Camera Poses Exploiting Object Detections","date":"2022-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IIT-PAVIS/PoserNet","path":"utils/compute_statistics.py","file_url":"https://github.com/IIT-PAVIS/PoserNet/blob/HEAD/utils/compute_statistics.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":"3606a137db0b4eaf","code_sha256_prefix":"3606a137db0b4eaf","mcp_get_code":{"code_sha256":"3606a137db0b4eaf"}},{"arxiv_id":"2105.12245","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-properties-of-deep-residual-networks","title":"Scaling Properties of Deep Residual Networks","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"instadeepai/scaling-resnets","path":"regression.py","file_url":"https://github.com/instadeepai/scaling-resnets/blob/HEAD/regression.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":"f265b3995fbead49","code_sha256_prefix":"f265b3995fbead49","mcp_get_code":{"code_sha256":"f265b3995fbead49"}},{"arxiv_id":"1512.00567","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-inception-architecture-for","title":"Rethinking the Inception Architecture for Computer Vision","date":"2015-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"matthias-wright/jax-fid","path":"jax_fid/fid.py","file_url":"https://github.com/matthias-wright/jax-fid/blob/HEAD/jax_fid/fid.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":"a5a4622777935741","code_sha256_prefix":"a5a4622777935741","mcp_get_code":{"code_sha256":"a5a4622777935741"}}],"record_sha256":"a8cf2d565103e48d73bdf3f709ad12af819669518890388d9fab5c4fca5f4e87","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}