{"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-messages","entry":"get_messages","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":5,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":6,"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":1,"ran_fixture":0,"ran":4,"unverified":1},"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":"2505.10981","arxiv_id_is_arxiv":true,"paper":"/paper/2505-10981","title":"Rethinking the Role of Prompting Strategies in LLM Test-Time Scaling: A Perspective of Probability Theory","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MraDonkey/rethinking_prompting","path":"model.py","file_url":"https://github.com/MraDonkey/rethinking_prompting/blob/HEAD/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":"22f36d100d431b72","code_sha256_prefix":"22f36d100d431b72","mcp_get_code":{"code_sha256":"22f36d100d431b72"}},{"arxiv_id":"2408.08067","arxiv_id_is_arxiv":true,"paper":"/paper/ragchecker-a-fine-grained-framework-for","title":"RAGChecker: A Fine-grained Framework for Diagnosing Retrieval-Augmented Generation","date":"2024-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/ragchecker","path":"rag_baselines/generation.py","file_url":"https://github.com/amazon-science/ragchecker/blob/HEAD/rag_baselines/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":"ff81b5723118624d","code_sha256_prefix":"ff81b5723118624d","mcp_get_code":{"code_sha256":"ff81b5723118624d"}},{"arxiv_id":"2406.13375","arxiv_id_is_arxiv":true,"paper":"/paper/aliice-evaluating-positional-fine-grained","title":"ALiiCE: Evaluating Positional Fine-grained Citation Generation","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ylXuu/ALiiCE","path":"generate.py","file_url":"https://github.com/ylXuu/ALiiCE/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d3454cb82cfad8b3","code_sha256_prefix":"d3454cb82cfad8b3","mcp_get_code":{"code_sha256":"d3454cb82cfad8b3"}},{"arxiv_id":"2405.15383","arxiv_id_is_arxiv":true,"paper":"/paper/generating-code-world-models-with-large","title":"Generating Code World Models with Large Language Models Guided by Monte Carlo Tree Search","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicoladainese96/code-world-models","path":"src/code_helpers.py","file_url":"https://github.com/nicoladainese96/code-world-models/blob/HEAD/src/code_helpers.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":"b4b79bcfa9a97f09","code_sha256_prefix":"b4b79bcfa9a97f09","mcp_get_code":{"code_sha256":"b4b79bcfa9a97f09"}},{"arxiv_id":"2404.19094","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-symbolic-regression-leveraging","title":"In-Context Symbolic Regression: Leveraging Large Language Models for Function Discovery","date":"2024-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"merlerm/in-context-symbolic-regression","path":"utils.py","file_url":"https://github.com/merlerm/in-context-symbolic-regression/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"996ffcf5697d3b6a","code_sha256_prefix":"996ffcf5697d3b6a","mcp_get_code":{"code_sha256":"996ffcf5697d3b6a"}},{"arxiv_id":"2025.findings-acl.491","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.491","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"biodatlab/ec-raft","path":"evaluate.py","file_url":"https://github.com/biodatlab/ec-raft/blob/HEAD/evaluate.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3301e9b305e3c1b5","code_sha256_prefix":"3301e9b305e3c1b5","mcp_get_code":{"code_sha256":"3301e9b305e3c1b5"}}],"record_sha256":"34bc39a9a613e37e04cd4c07830c63c154f882afe1c70ba8aca16fdca4695600","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}