{"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/load-experiment-data","entry":"load_experiment_data","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"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":5,"ran_fixture":0,"ran":2,"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":"2606.06673","arxiv_id_is_arxiv":true,"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_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, USD-AI-ResearchLab/uncertainty-aware-llm-rl when it was checked","code_sha256":"4de5f1119e2fa623","code_sha256_prefix":"4de5f1119e2fa623","mcp_get_code":{"code_sha256":"4de5f1119e2fa623"}},{"arxiv_id":"2605.07796","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9cd2b46f4daf4690","code_sha256_prefix":"9cd2b46f4daf4690","mcp_get_code":{"code_sha256":"9cd2b46f4daf4690"}},{"arxiv_id":"2603.25047","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51f7b538bdb764c1","code_sha256_prefix":"51f7b538bdb764c1","mcp_get_code":{"code_sha256":"51f7b538bdb764c1"}},{"arxiv_id":"2602.01334","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, GAIR-NLP/Med (NOASSERTION)","code_sha256":"c83961fe47cdbec3","code_sha256_prefix":"c83961fe47cdbec3","mcp_get_code":{"code_sha256":"c83961fe47cdbec3"}},{"arxiv_id":"2501.11120","arxiv_id_is_arxiv":true,"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":"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":"44e4dabdc39df853","code_sha256_prefix":"44e4dabdc39df853","mcp_get_code":{"code_sha256":"44e4dabdc39df853"}},{"arxiv_id":"2501.11120","arxiv_id_is_arxiv":true,"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":"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":"fd725540fd515abb","code_sha256_prefix":"fd725540fd515abb","mcp_get_code":{"code_sha256":"fd725540fd515abb"}},{"arxiv_id":"2406.03152","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c704390cd00b7a76","code_sha256_prefix":"c704390cd00b7a76","mcp_get_code":{"code_sha256":"c704390cd00b7a76"}}],"record_sha256":"25ccd006431622b6855d2bfd9e00df7b354d483fcc23902af684b2f8a08579d1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}