{"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/convert-to-regular-types","entry":"convert_to_regular_types","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":9,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":8,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":1,"ran_fixture":0,"ran":1,"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":"2602.15564","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-15564","title":"Beyond Static Pipelines: Learning Dynamic Workflows for Text-to-SQL","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Satissss/SquRL","path":"verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/Satissss/SquRL/blob/HEAD/verl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2602.12735","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12735","title":"VimRAG: Navigating Massive Visual Context in Retrieval-Augmented Generation via Multimodal Memory Graph","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Alibaba-NLP/VRAG","path":"VRAG-RL/verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/Alibaba-NLP/VRAG/blob/HEAD/VRAG-RL/verl/trainer/fsdp_sft_trainer.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, Alibaba-NLP/VRAG when it was checked","code_sha256":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2602.04284","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-04284","title":"Agent-Omit: Adaptive Context Omission for Efficient LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"usail-hkust/Agent-Omit","path":"AgentOmit-RL/verl/agent_trainer/fsdp_sft_trainer.py","file_url":"https://github.com/usail-hkust/Agent-Omit/blob/HEAD/AgentOmit-RL/verl/agent_trainer/fsdp_sft_trainer.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, usail-hkust/Agent-Omit when it was checked","code_sha256":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2505.24630","arxiv_id_is_arxiv":true,"paper":"/paper/the-hallucination-dilemma-factuality-aware","title":"The Hallucination Dilemma: Factuality-Aware Reinforcement Learning for Large Reasoning Models","date":"2025-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nusnlp/fspo","path":"verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/nusnlp/fspo/blob/HEAD/verl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2505.18917","arxiv_id_is_arxiv":true,"paper":"/paper/behavior-injection-preparing-language-models","title":"Behavior Injection: Preparing Language Models for Reinforcement Learning","date":"2025-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czp16/bridge-llm-reasoning","path":"simple_verl/sverl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/czp16/bridge-llm-reasoning/blob/HEAD/simple_verl/sverl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2505.04588","arxiv_id_is_arxiv":true,"paper":"/paper/zerosearch-incentivize-the-search-capability","title":"ZeroSearch: Incentivize the Search Capability of LLMs without Searching","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-nlp/zerosearch","path":"verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/alibaba-nlp/zerosearch/blob/HEAD/verl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2504.05520","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-reinforcement-finetuning-via","title":"Efficient Reinforcement Finetuning via Adaptive Curriculum Learning","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uscnlp-lime/verl","path":"verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/uscnlp-lime/verl/blob/HEAD/verl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"2410.21236","arxiv_id_is_arxiv":true,"paper":"/paper/flaming-hot-initiation-with-regular-execution","title":"Flaming-hot Initiation with Regular Execution Sampling for Large Language Models","date":"2024-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaof20/real","path":"verl/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/yaof20/real/blob/HEAD/verl/trainer/fsdp_sft_trainer.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":"f887d72c9492d9ee","code_sha256_prefix":"f887d72c9492d9ee","mcp_get_code":{"code_sha256":"f887d72c9492d9ee"}},{"arxiv_id":"openreview_QrC8OgQyOI","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QrC8OgQyOI","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"viiika/Prism","path":"Dream/Dream_Prism/src/trainer/fsdp_sft_trainer.py","file_url":"https://github.com/viiika/Prism/blob/HEAD/Dream/Dream_Prism/src/trainer/fsdp_sft_trainer.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":"0aac3c307ba4a07b","code_sha256_prefix":"0aac3c307ba4a07b","mcp_get_code":{"code_sha256":"0aac3c307ba4a07b"}}],"record_sha256":"3d201c679786893c55fb168c769fc74bfcd2e69c509c44234aa85ddec4baf71c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}