{"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/check-data","entry":"check_data","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":7,"n_papers_ran":4,"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":7,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":3},"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":"2511.00116","paper":"/paper/arxiv-2511-00116","title":"LC-Opt: Benchmarking Reinforcement Learning and Agentic AI for End-to-End Liquid Cooling Optimization in Data Centers","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"lbl-srg/modelica-buildings","path":"Buildings/Resources/bin/convert_weather_data.py","file_url":"https://github.com/lbl-srg/modelica-buildings/blob/HEAD/Buildings/Resources/bin/convert_weather_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d934f4dc88128fbd","mcp_get_code":{"code_sha256":"d934f4dc88128fbd"}},{"arxiv_id":"2404.09937","paper":"/paper/compression-represents-intelligence-linearly","title":"Compression Represents Intelligence Linearly","date":"2024-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-nlp/llm-compression-intelligence","path":"code/data_collection/arxiv/arxiv_downloader.py","file_url":"https://github.com/hkust-nlp/llm-compression-intelligence/blob/HEAD/code/data_collection/arxiv/arxiv_downloader.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f59f28920403bbb9","mcp_get_code":{"code_sha256":"f59f28920403bbb9"}},{"arxiv_id":"2402.14767","paper":"/paper/dualfocus-integrating-macro-and-micro","title":"DualFocus: Integrating Macro and Micro Perspectives in Multi-modal Large Language Models","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"InternLM/InternLM-XComposer","path":"InternLM-XComposer-2.5-Reward/training/finetune.py","file_url":"https://github.com/InternLM/InternLM-XComposer/blob/HEAD/InternLM-XComposer-2.5-Reward/training/finetune.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b3350d09de4014cf","mcp_get_code":{"code_sha256":"b3350d09de4014cf"}},{"arxiv_id":"2205.11412","paper":"/paper/instance-based-uncertainty-estimation-for","title":"Instance-Based Uncertainty Estimation for Gradient-Boosted Regression Trees","date":"2022-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjbrophy47/ibug","path":"ibug/parsers/util.py","file_url":"https://github.com/jjbrophy47/ibug/blob/HEAD/ibug/parsers/util.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":"b89dbb1e39b71e15","mcp_get_code":{"code_sha256":"b89dbb1e39b71e15"}},{"arxiv_id":"2104.07876","paper":"/paper/deep-stable-learning-for-out-of-distribution","title":"Deep Stable Learning for Out-Of-Distribution Generalization","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coling2022-depro/depro","path":"utilis/datasets.py","file_url":"https://github.com/coling2022-depro/depro/blob/HEAD/utilis/datasets.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":"2b4521bc664e87e8","mcp_get_code":{"code_sha256":"2b4521bc664e87e8"}},{"arxiv_id":"2103.15316","paper":"/paper/whitening-sentence-representations-for-better","title":"Whitening Sentence Representations for Better Semantics and Faster Retrieval","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sleepthroughdifficulties/kernelwhitening","path":"EMNLP22/utilis/datasets.py","file_url":"https://github.com/sleepthroughdifficulties/kernelwhitening/blob/HEAD/EMNLP22/utilis/datasets.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d259d4952723bb10","mcp_get_code":{"code_sha256":"d259d4952723bb10"}},{"arxiv_id":"2009.05567","paper":"/paper/dart-data-addition-and-removal-trees","title":"Machine Unlearning for Random Forests","date":"2020-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jjbrophy47/dare","path":"dare/_classes.py","file_url":"https://github.com/jjbrophy47/dare/blob/HEAD/dare/_classes.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"ee4e70f9a8313061","mcp_get_code":{"code_sha256":"ee4e70f9a8313061"}}]}