{"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/get-raw-data","entry":"get_raw_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":9,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":9,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":1,"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":0,"ran":3,"unverified":3},"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":"2510.05566","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-05566","title":"Domain-Shift-Aware Conformal Prediction for Large Language Models","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"smartyfh/LLM-Uncertainty-Bench","path":"uncertainty_quantification_via_cp.py","file_url":"https://github.com/smartyfh/LLM-Uncertainty-Bench/blob/HEAD/uncertainty_quantification_via_cp.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":"f1da4e31dbe5407b","code_sha256_prefix":"f1da4e31dbe5407b","mcp_get_code":{"code_sha256":"f1da4e31dbe5407b"}},{"arxiv_id":"2506.07298","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.07298","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"DaiYijia02/icl-hmm","path":"real_world/load_ibl_data.py","file_url":"https://github.com/DaiYijia02/icl-hmm/blob/HEAD/real_world/load_ibl_data.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":"581eb9ad722eabab","code_sha256_prefix":"581eb9ad722eabab","mcp_get_code":{"code_sha256":"581eb9ad722eabab"}},{"arxiv_id":"2412.01981","arxiv_id_is_arxiv":true,"paper":"/paper/free-process-rewards-without-process-labels","title":"Free Process Rewards without Process Labels","date":"2024-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lifan-yuan/implicitprm","path":"eval/prm_eval_utils.py","file_url":"https://github.com/lifan-yuan/implicitprm/blob/HEAD/eval/prm_eval_utils.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":"1d78ad671b732515","code_sha256_prefix":"1d78ad671b732515","mcp_get_code":{"code_sha256":"1d78ad671b732515"}},{"arxiv_id":"2401.12794","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-llms-via-uncertainty","title":"Benchmarking LLMs via Uncertainty Quantification","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartyfh/llm-uncertainty-bench","path":"uncertainty_quantification_via_cp.py","file_url":"https://github.com/smartyfh/llm-uncertainty-bench/blob/HEAD/uncertainty_quantification_via_cp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"756bbcda282e506a","code_sha256_prefix":"756bbcda282e506a","mcp_get_code":{"code_sha256":"756bbcda282e506a"}},{"arxiv_id":"2401.12794","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-llms-via-uncertainty","title":"Benchmarking LLMs via Uncertainty Quantification","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartyfh/llm-uncertainty-bench","path":"uncertainty_quantification_via_cp.py","file_url":"https://github.com/smartyfh/llm-uncertainty-bench/blob/HEAD/uncertainty_quantification_via_cp.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":"f1da4e31dbe5407b","code_sha256_prefix":"f1da4e31dbe5407b","mcp_get_code":{"code_sha256":"f1da4e31dbe5407b"}},{"arxiv_id":"2211.02093","arxiv_id_is_arxiv":true,"paper":"/paper/domain-adaptation-under-missingness-shift","title":"Domain Adaptation under Missingness Shift","date":"2022-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acmi-lab/missingness-shift","path":"missingness.py","file_url":"https://github.com/acmi-lab/missingness-shift/blob/HEAD/missingness.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, acmi-lab/missingness-shift when it was checked","code_sha256":"8ef057be107513cb","code_sha256_prefix":"8ef057be107513cb","mcp_get_code":{"code_sha256":"8ef057be107513cb"}},{"arxiv_id":"2209.02970","arxiv_id_is_arxiv":true,"paper":"/paper/fengshenbang-1-0-being-the-foundation-of","title":"Fengshenbang 1.0: Being the Foundation of Chinese Cognitive Intelligence","date":"2022-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"idea-ccnl/fengshenbang-lm","path":"fengshen/models/DAVAE/run_latent_generation.py","file_url":"https://github.com/idea-ccnl/fengshenbang-lm/blob/HEAD/fengshen/models/DAVAE/run_latent_generation.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":"759222e69650dede","code_sha256_prefix":"759222e69650dede","mcp_get_code":{"code_sha256":"759222e69650dede"}},{"arxiv_id":"2106.09761","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-resource-allocation-with-graph","title":"Unsupervised Resource Allocation with Graph Neural Networks","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MilesCranmer/gnn_resource_allocation","path":"data.py","file_url":"https://github.com/MilesCranmer/gnn_resource_allocation/blob/HEAD/data.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":"cb694ec276c25e0a","code_sha256_prefix":"cb694ec276c25e0a","mcp_get_code":{"code_sha256":"cb694ec276c25e0a"}},{"arxiv_id":"openreview_eIZlhnkH2W","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_eIZlhnkH2W","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"YJYTJ/DyGMoCE","path":"graph_properties/DataLoader.py","file_url":"https://github.com/YJYTJ/DyGMoCE/blob/HEAD/graph_properties/DataLoader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ed7188dce2d59be","code_sha256_prefix":"3ed7188dce2d59be","mcp_get_code":{"code_sha256":"3ed7188dce2d59be"}},{"arxiv_id":"2022.findings-emnlp.497","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.497","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lancopku/Avg-Avg","path":"lib/data_loader.py","file_url":"https://github.com/lancopku/Avg-Avg/blob/HEAD/lib/data_loader.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a32f7e64f80b7f78","code_sha256_prefix":"a32f7e64f80b7f78","mcp_get_code":{"code_sha256":"a32f7e64f80b7f78"}}],"record_sha256":"c1d2b0dfa9a7b1b15728b66514ae7ff8591a89d2abfc7777d4e33ff314b7aacd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}