{"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/is-conversational","entry":"is_conversational","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":8,"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":5,"ran_draft_wrong":0,"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":"2608.23149","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23149","title":"Language Chain in Alignment: Cross-lingual Ranking Preference Optimization","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"dltmddbs100/CRPO","path":"data_utils.py","file_url":"https://github.com/dltmddbs100/CRPO/blob/HEAD/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"653f5e9b926455b8","code_sha256_prefix":"653f5e9b926455b8","mcp_get_code":{"code_sha256":"653f5e9b926455b8"}},{"arxiv_id":"2606.29712","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-29712","title":"Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Miraclecsc/Discrete-Latent-Reasoning","path":"latent_llm/trl/trl/data_utils.py","file_url":"https://github.com/Miraclecsc/Discrete-Latent-Reasoning/blob/HEAD/latent_llm/trl/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Miraclecsc/Discrete-Latent-Reasoning when it was checked","code_sha256":"7d917ecb72ab517d","code_sha256_prefix":"7d917ecb72ab517d","mcp_get_code":{"code_sha256":"7d917ecb72ab517d"}},{"arxiv_id":"2605.11974","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11974","title":"Towards Order Fairness: Mitigating LLMs Order Sensitivity through Dual Group Advantage Optimization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Hyalinesky/DGAO","path":"trl/data_utils.py","file_url":"https://github.com/Hyalinesky/DGAO/blob/HEAD/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5439c57a72337fa8","code_sha256_prefix":"5439c57a72337fa8","mcp_get_code":{"code_sha256":"5439c57a72337fa8"}},{"arxiv_id":"2509.13760","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-13760","title":"Iterative Prompt Refinement for Safer Text-to-Image Generation","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"ku-dmlab/IPR","path":"trl/data_utils.py","file_url":"https://github.com/ku-dmlab/IPR/blob/HEAD/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c42df7a6e98e89c","code_sha256_prefix":"3c42df7a6e98e89c","mcp_get_code":{"code_sha256":"3c42df7a6e98e89c"}},{"arxiv_id":"2505.15656","arxiv_id_is_arxiv":true,"paper":"/paper/be-careful-when-fine-tuning-on-open-source","title":"Be Careful When Fine-tuning On Open-Source LLMs: Your Fine-tuning Data Could Be Secretly Stolen!","date":"2025-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-coai/backdoor-data-extraction","path":"train/trl/data_utils.py","file_url":"https://github.com/thu-coai/backdoor-data-extraction/blob/HEAD/train/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c42df7a6e98e89c","code_sha256_prefix":"3c42df7a6e98e89c","mcp_get_code":{"code_sha256":"3c42df7a6e98e89c"}},{"arxiv_id":"2505.09655","arxiv_id_is_arxiv":true,"paper":"/paper/dra-grpo-exploring-diversity-aware-reward","title":"DRA-GRPO: Exploring Diversity-Aware Reward Adjustment for R1-Zero-Like Training of Large Language Models","date":"2025-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiwenc1/dra-grpo","path":"src/open_r1/trl/data_utils.py","file_url":"https://github.com/xiwenc1/dra-grpo/blob/HEAD/src/open_r1/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c42df7a6e98e89c","code_sha256_prefix":"3c42df7a6e98e89c","mcp_get_code":{"code_sha256":"3c42df7a6e98e89c"}},{"arxiv_id":"2504.20157","arxiv_id_is_arxiv":true,"paper":"/paper/toward-evaluative-thinking-meta-policy","title":"Toward Evaluative Thinking: Meta Policy Optimization with Evolving Reward Models","date":"2025-04-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minnesotanlp/mpo","path":"trl/data_utils.py","file_url":"https://github.com/minnesotanlp/mpo/blob/HEAD/trl/data_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, minnesotanlp/mpo, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"61c97cdf90c40f26","code_sha256_prefix":"61c97cdf90c40f26","mcp_get_code":{"code_sha256":"61c97cdf90c40f26"}},{"arxiv_id":"2403.10088","arxiv_id_is_arxiv":true,"paper":"/paper/intent-conditioned-and-non-toxic","title":"Intent-conditioned and Non-toxic Counterspeech Generation using Multi-Task Instruction Tuning with RLAIF","date":"2024-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lvwerra/trl","path":"trl/data_utils.py","file_url":"https://github.com/lvwerra/trl/blob/HEAD/trl/data_utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92674d32e9e8fe15","code_sha256_prefix":"92674d32e9e8fe15","mcp_get_code":{"code_sha256":"92674d32e9e8fe15"}}],"record_sha256":"bb7ea2dd1b1b1a0ab307b6ed0ec7fba34409555cfa83164732e0c21120fe9fa5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}