{"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/train-one-step","entry":"train_one_step","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":1,"n_papers_ran_no_instrument_failure":1,"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":8,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":7,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":0,"ran_fixture":0,"ran":1,"unverified":7},"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.08354","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08354","title":"Auto-Rubric as Reward: From Implicit Preferences to Explicit Multimodal Generative Criteria","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"OpenEnvision/AutoRubric-as-Reward","path":"fastvideo/train_rpo_flux.py","file_url":"https://github.com/OpenEnvision/AutoRubric-as-Reward/blob/HEAD/fastvideo/train_rpo_flux.py","status":"unverified","verification_level":0,"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":"fa905e7d6e488d4f","code_sha256_prefix":"fa905e7d6e488d4f","mcp_get_code":{"code_sha256":"fa905e7d6e488d4f"}},{"arxiv_id":"2603.02200","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-02200","title":"Adaptive Confidence Regularization for Multimodal Failure Detection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"mona4399/ACR","path":"EPIC-rgb-flow/train_video_flow_epic.py","file_url":"https://github.com/mona4399/ACR/blob/HEAD/EPIC-rgb-flow/train_video_flow_epic.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, mona4399/ACR when it was checked","code_sha256":"815fc17703915666","code_sha256_prefix":"815fc17703915666","mcp_get_code":{"code_sha256":"815fc17703915666"}},{"arxiv_id":"2509.25774","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-25774","title":"PCPO: Proportionate Credit Policy Optimization for Aligning Image Generation Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"jaylee2000/pcpo","path":"dancegrpo/fastvideo/train_pcpo_flux.py","file_url":"https://github.com/jaylee2000/pcpo/blob/HEAD/dancegrpo/fastvideo/train_pcpo_flux.py","status":"unverified","verification_level":0,"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":"7e92049ae74b8274","code_sha256_prefix":"7e92049ae74b8274","mcp_get_code":{"code_sha256":"7e92049ae74b8274"}},{"arxiv_id":"2505.16985","arxiv_id_is_arxiv":true,"paper":"/paper/extremely-simple-multimodal-outlier-synthesis","title":"Extremely Simple Multimodal Outlier Synthesis for Out-of-Distribution Detection and Segmentation","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mona4399/featuremixing","path":"OOD_detection/HMDB-rgb-flow/train_video_flow.py","file_url":"https://github.com/mona4399/featuremixing/blob/HEAD/OOD_detection/HMDB-rgb-flow/train_video_flow.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, mona4399/featuremixing when it was checked","code_sha256":"39accc161d6e707d","code_sha256_prefix":"39accc161d6e707d","mcp_get_code":{"code_sha256":"39accc161d6e707d"}},{"arxiv_id":"2409.10502","arxiv_id_is_arxiv":true,"paper":"/paper/causal-language-modeling-can-elicit-search","title":"Causal Language Modeling Can Elicit Search and Reasoning Capabilities on Logic Puzzles","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kulinshah98/llm-reasoning-logic-puzzles","path":"zebra-code/train/trainer.py","file_url":"https://github.com/kulinshah98/llm-reasoning-logic-puzzles/blob/HEAD/zebra-code/train/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":"594c91edb211f85b","code_sha256_prefix":"594c91edb211f85b","mcp_get_code":{"code_sha256":"594c91edb211f85b"}},{"arxiv_id":"2407.01518","arxiv_id_is_arxiv":true,"paper":"/paper/towards-multimodal-open-set-domain","title":"Towards Multimodal Open-Set Domain Generalization and Adaptation through Self-supervision","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donghao51/moosa","path":"EPIC-rgb-flow-audio/train_video_flow_audio_EPIC_MOOSA.py","file_url":"https://github.com/donghao51/moosa/blob/HEAD/EPIC-rgb-flow-audio/train_video_flow_audio_EPIC_MOOSA.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, donghao51/moosa when it was checked","code_sha256":"2ce70bd6ce6bec3d","code_sha256_prefix":"2ce70bd6ce6bec3d","mcp_get_code":{"code_sha256":"2ce70bd6ce6bec3d"}},{"arxiv_id":"2310.19795","arxiv_id_is_arxiv":true,"paper":"/paper/simmmdg-a-simple-and-effective-framework-for-1","title":"SimMMDG: A Simple and Effective Framework for Multi-modal Domain Generalization","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donghao51/SimMMDG","path":"EPIC-rgb-flow-audio/train_video_flow_audio_EPIC_SimMMDG.py","file_url":"https://github.com/donghao51/SimMMDG/blob/HEAD/EPIC-rgb-flow-audio/train_video_flow_audio_EPIC_SimMMDG.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, donghao51/SimMMDG when it was checked","code_sha256":"8e0e0a55c8f2f231","code_sha256_prefix":"8e0e0a55c8f2f231","mcp_get_code":{"code_sha256":"8e0e0a55c8f2f231"}},{"arxiv_id":"2205.02593","arxiv_id_is_arxiv":true,"paper":"/paper/metgen-a-module-based-entailment-tree","title":"METGEN: A Module-Based Entailment Tree Generation Framework for Answer Explanation","date":"2022-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tencent-ailab/metalogic","path":"code/ModuleGenerator.py","file_url":"https://github.com/tencent-ailab/metalogic/blob/HEAD/code/ModuleGenerator.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":"eadaf1fa3927a98e","code_sha256_prefix":"eadaf1fa3927a98e","mcp_get_code":{"code_sha256":"eadaf1fa3927a98e"}}],"record_sha256":"5d4c0257f012cf226036d958e852d885789e716506f260b7b701e944a99ffbed","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}