{"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/load-experiment-data","entry":"load_experiment_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":6,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":4},"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":"2606.06673","paper":"/paper/arxiv-2606-06673","title":"Uncertainty-Aware LLM-Guided Policy Shaping for Sparse-Reward Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"USD-AI-ResearchLab/uncertainty-aware-llm-rl","path":"MainCode/plot.py","file_url":"https://github.com/USD-AI-ResearchLab/uncertainty-aware-llm-rl/blob/HEAD/MainCode/plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4de5f1119e2fa623","mcp_get_code":{"code_sha256":"4de5f1119e2fa623"}},{"arxiv_id":"2605.07796","paper":"/paper/arxiv-2605-07796","title":"Scaling Text-to-SQL Evaluation Across SQL Dialects via Automated Backend Isomorphism","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"IBM/polysql","path":"src/polysql/evaluation/analysis/results.py","file_url":"https://github.com/IBM/polysql/blob/HEAD/src/polysql/evaluation/analysis/results.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9cd2b46f4daf4690","mcp_get_code":{"code_sha256":"9cd2b46f4daf4690"}},{"arxiv_id":"2603.25047","paper":"/paper/arxiv-2603-25047","title":"The Order Is The Message","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"JordanRL/OrderedLearning","path":"analysis_tools/data_loader.py","file_url":"https://github.com/JordanRL/OrderedLearning/blob/HEAD/analysis_tools/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51f7b538bdb764c1","mcp_get_code":{"code_sha256":"51f7b538bdb764c1"}},{"arxiv_id":"2602.01334","paper":"/paper/arxiv-2602-01334","title":"What Does Vision Tool-Use Reinforcement Learning Really Learn? Disentangling Tool-Induced and Intrinsic Effects for Crop-and-Zoom","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"GAIR-NLP/Med","path":"recipe/med/analysis_plot/calculate_and_plot_area.py","file_url":"https://github.com/GAIR-NLP/Med/blob/HEAD/recipe/med/analysis_plot/calculate_and_plot_area.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"c83961fe47cdbec3","mcp_get_code":{"code_sha256":"c83961fe47cdbec3"}},{"arxiv_id":"2501.11120","paper":"/paper/tell-me-about-yourself-llms-are-aware-of","title":"Tell me about yourself: LLMs are aware of their learned behaviors","date":"2025-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuchanbao/behavioral-self-awareness","path":"code/multiple-choice/evaluation/self-report-free-separate-rephrasings.py","file_url":"https://github.com/xuchanbao/behavioral-self-awareness/blob/HEAD/code/multiple-choice/evaluation/self-report-free-separate-rephrasings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"44e4dabdc39df853","mcp_get_code":{"code_sha256":"44e4dabdc39df853"}},{"arxiv_id":"2501.11120","paper":"/paper/tell-me-about-yourself-llms-are-aware-of","title":"Tell me about yourself: LLMs are aware of their learned behaviors","date":"2025-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuchanbao/behavioral-self-awareness","path":"code/multiple-choice/evaluation/self-report-free.py","file_url":"https://github.com/xuchanbao/behavioral-self-awareness/blob/HEAD/code/multiple-choice/evaluation/self-report-free.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fd725540fd515abb","mcp_get_code":{"code_sha256":"fd725540fd515abb"}},{"arxiv_id":"2406.03152","paper":"/paper/dynamic-spectral-clustering-with-provable","title":"Dynamic Spectral Clustering with Provable Approximation Guarantee","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee","path":"plots/plot_mnist_emnist.py","file_url":"https://github.com/SteinarLaenen/Dynamic-Spectral-Clustering-With-Provable-Approximation-Guarantee/blob/HEAD/plots/plot_mnist_emnist.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c704390cd00b7a76","mcp_get_code":{"code_sha256":"c704390cd00b7a76"}}]}