{"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-model-response","entry":"get_model_response","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":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":6,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_fixture":0,"ran":3,"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":"2605.01630","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01630","title":"Prosa: Rubric-Based Evaluation of LLMs on Real User Chats in Brazilian Portuguese","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"maritaca-ai/Prosa","path":"Prosa-benchmark/prosa/gen_score.py","file_url":"https://github.com/maritaca-ai/Prosa/blob/HEAD/Prosa-benchmark/prosa/gen_score.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, maritaca-ai/Prosa when it was checked","code_sha256":"62055c6ce37e2c52","code_sha256_prefix":"62055c6ce37e2c52","mcp_get_code":{"code_sha256":"62055c6ce37e2c52"}},{"arxiv_id":"2505.12531","arxiv_id_is_arxiv":true,"paper":"/paper/esc-judge-a-framework-for-comparing-emotional","title":"ESC-Judge: A Framework for Comparing Emotional Support Conversational Agents","date":"2025-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"navidmdn/ESC-Judge","path":"hf_persona_based_chat.py","file_url":"https://github.com/navidmdn/ESC-Judge/blob/HEAD/hf_persona_based_chat.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":"79b0e4143f36738c","code_sha256_prefix":"79b0e4143f36738c","mcp_get_code":{"code_sha256":"79b0e4143f36738c"}},{"arxiv_id":"2406.05132","arxiv_id_is_arxiv":true,"paper":"/paper/3d-grand-towards-better-grounding-and-less","title":"3D-GRAND: A Million-Scale Dataset for 3D-LLMs with Better Grounding and Less Hallucination","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sled-group/3D-GRAND","path":"demo/model.py","file_url":"https://github.com/sled-group/3D-GRAND/blob/HEAD/demo/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sled-group/3D-GRAND when it was checked","code_sha256":"e862c855cc60e170","code_sha256_prefix":"e862c855cc60e170","mcp_get_code":{"code_sha256":"e862c855cc60e170"}},{"arxiv_id":"2403.09488","arxiv_id_is_arxiv":true,"paper":"/paper/rectifying-demonstration-shortcut-in-in","title":"Rectifying Demonstration Shortcut in In-Context Learning","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lainshower/in-context-calibration","path":"utils.py","file_url":"https://github.com/lainshower/in-context-calibration/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lainshower/in-context-calibration when it was checked","code_sha256":"b18ccaa5f7df5e9f","code_sha256_prefix":"b18ccaa5f7df5e9f","mcp_get_code":{"code_sha256":"b18ccaa5f7df5e9f"}},{"arxiv_id":"2308.02223","arxiv_id_is_arxiv":true,"paper":"/paper/esrl-efficient-sampling-based-reinforcement","title":"ESRL: Efficient Sampling-based Reinforcement Learning for Sequence Generation","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wangclnlp/DeepSpeed-Chat-Extension","path":"rlhf_llama/deepspeed_chat/inference/chatbot.py","file_url":"https://github.com/wangclnlp/DeepSpeed-Chat-Extension/blob/HEAD/rlhf_llama/deepspeed_chat/inference/chatbot.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":"2e5ee103f1579536","code_sha256_prefix":"2e5ee103f1579536","mcp_get_code":{"code_sha256":"2e5ee103f1579536"}},{"arxiv_id":"2025.emnlp-main.67","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.67","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"isyuhaochen/RRC-DSCD","path":"code/model.py","file_url":"https://github.com/isyuhaochen/RRC-DSCD/blob/HEAD/code/model.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":"2ba35ebf177c6ba3","code_sha256_prefix":"2ba35ebf177c6ba3","mcp_get_code":{"code_sha256":"2ba35ebf177c6ba3"}}],"record_sha256":"13e83c7873467067f626faf0e05e55e9cd8fbef313c82ff4343febb7faecd083","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}