{"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-output-path","entry":"get_output_path","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":5,"n_papers_ran_instrument_only":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":11,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":0,"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":4,"ran_fixture":0,"ran":5,"unverified":2},"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":"2609.01982","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01982","title":"Benchmarking Language Models for Statistical Problem Formulation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"THU-CongLab/StatFormBench","path":"src/run_benchmark.py","file_url":"https://github.com/THU-CongLab/StatFormBench/blob/HEAD/src/run_benchmark.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":"0fc2552d1b2f040a","code_sha256_prefix":"0fc2552d1b2f040a","mcp_get_code":{"code_sha256":"0fc2552d1b2f040a"}},{"arxiv_id":"2605.01350","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01350","title":"LLM Output Detectability and Task Performance Can be Jointly Optimized","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"pakapaka333/PUPPET","path":"experimental/common/utils.py","file_url":"https://github.com/pakapaka333/PUPPET/blob/HEAD/experimental/common/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":"5669bd60defaceea","code_sha256_prefix":"5669bd60defaceea","mcp_get_code":{"code_sha256":"5669bd60defaceea"}},{"arxiv_id":"2603.01990","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01990","title":"According to Me: Long-Term Personalized Referential Memory QA","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"JingbiaoMei/ATM-Bench","path":"memqa/global_config.py","file_url":"https://github.com/JingbiaoMei/ATM-Bench/blob/HEAD/memqa/global_config.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":"3b464087313f9c13","code_sha256_prefix":"3b464087313f9c13","mcp_get_code":{"code_sha256":"3b464087313f9c13"}},{"arxiv_id":"2505.17479","arxiv_id_is_arxiv":true,"paper":"/paper/twin-2k-500-a-dataset-for-building-digital","title":"Twin-2K-500: A dataset for building digital twins of over 2,000 people based on their answers to over 500 questions","date":"2025-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianyipeng-lab/digital-twin-simulation","path":"text_simulation/run_LLM_simulations.py","file_url":"https://github.com/tianyipeng-lab/digital-twin-simulation/blob/HEAD/text_simulation/run_LLM_simulations.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":"1b525d98f94cb69e","code_sha256_prefix":"1b525d98f94cb69e","mcp_get_code":{"code_sha256":"1b525d98f94cb69e"}},{"arxiv_id":"2502.13311","arxiv_id_is_arxiv":true,"paper":"/paper/training-turn-by-turn-verifiers-for-dialogue","title":"Training Turn-by-Turn Verifiers for Dialogue Tutoring Agents: The Curious Case of LLMs as Your Coding Tutors","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iwangjian/Coding-Tutor","path":"traver/run_traver.py","file_url":"https://github.com/iwangjian/Coding-Tutor/blob/HEAD/traver/run_traver.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8eec9276730422ba","code_sha256_prefix":"8eec9276730422ba","mcp_get_code":{"code_sha256":"8eec9276730422ba"}},{"arxiv_id":"2403.01632","arxiv_id_is_arxiv":true,"paper":"/paper/improving-llm-code-generation-with-grammar","title":"SynCode: LLM Generation with Grammar Augmentation","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uiuc-focal-lab/syncode","path":"syncode/common.py","file_url":"https://github.com/uiuc-focal-lab/syncode/blob/HEAD/syncode/common.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":"1fe7e96df922ed43","code_sha256_prefix":"1fe7e96df922ed43","mcp_get_code":{"code_sha256":"1fe7e96df922ed43"}},{"arxiv_id":"2308.00065","arxiv_id_is_arxiv":true,"paper":"/paper/finpt-financial-risk-prediction-with-profile","title":"FinPT: Financial Risk Prediction with Profile Tuning on Pretrained Foundation Models","date":"2023-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuweiyin/finpt","path":"utils/io_utils.py","file_url":"https://github.com/yuweiyin/finpt/blob/HEAD/utils/io_utils.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":"8d35f47b61089e77","code_sha256_prefix":"8d35f47b61089e77","mcp_get_code":{"code_sha256":"8d35f47b61089e77"}},{"arxiv_id":"2203.17271","arxiv_id_is_arxiv":true,"paper":"/paper/do-vision-language-pretrained-models-learn","title":"Do Vision-Language Pretrained Models Learn Composable Primitive Concepts?","date":"2022-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tttyuntian/vlm_primitive_concepts","path":"vlm_concept/mit_states/train_retrieval_model.py","file_url":"https://github.com/tttyuntian/vlm_primitive_concepts/blob/HEAD/vlm_concept/mit_states/train_retrieval_model.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":"102caf3e5c00141a","code_sha256_prefix":"102caf3e5c00141a","mcp_get_code":{"code_sha256":"102caf3e5c00141a"}},{"arxiv_id":"2112.09081","arxiv_id_is_arxiv":true,"paper":"/paper/crossloc-scalable-aerial-localization","title":"CrossLoc: Scalable Aerial Localization Assisted by Multimodal Synthetic Data","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"topo-epfl/crossloc","path":"finetune_decoder_single_task.py","file_url":"https://github.com/topo-epfl/crossloc/blob/HEAD/finetune_decoder_single_task.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":"f4e2e606ab062829","code_sha256_prefix":"f4e2e606ab062829","mcp_get_code":{"code_sha256":"f4e2e606ab062829"}},{"arxiv_id":"1910.10235","arxiv_id_is_arxiv":true,"paper":"/paper/gci-detection-from-raw-speech-using-a-fully","title":"GCI detection from raw speech using a fully-convolutional network","date":"2019-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ardaillon/FCN_GCI","path":"FCN_GCI.py","file_url":"https://github.com/ardaillon/FCN_GCI/blob/HEAD/FCN_GCI.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":"8a6c663f3c2897f8","code_sha256_prefix":"8a6c663f3c2897f8","mcp_get_code":{"code_sha256":"8a6c663f3c2897f8"}},{"arxiv_id":"openreview_knVbandOWj","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_knVbandOWj","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"0SliverBullet/Neural-QAOA-Squared","path":"competitors/QAOA-in-QAOA/QAOA_in_QAOA.py","file_url":"https://github.com/0SliverBullet/Neural-QAOA-Squared/blob/HEAD/competitors/QAOA-in-QAOA/QAOA_in_QAOA.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":"057f10ac6d4c9436","code_sha256_prefix":"057f10ac6d4c9436","mcp_get_code":{"code_sha256":"057f10ac6d4c9436"}}],"record_sha256":"ff0e6032718a19dfcdbf0051e917a5df75d0b3ccf572ccb325b2ecc10f6cba33","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}