{"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/load-config-file","entry":"load_config_file","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":4,"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":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":0,"ran":3,"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":"2605.29434","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-29434","title":"AliMark: Enhancing Robustness of Sentence-Level Watermarking Against Text Paraphrasing","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"THU-BPM/MarkLLM","path":"utils/utils.py","file_url":"https://github.com/THU-BPM/MarkLLM/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from redwyd/SymMark, and GitHub detected no licence in that repository when it was checked","code_sha256":"0d816de51e8bf895","code_sha256_prefix":"0d816de51e8bf895","mcp_get_code":{"code_sha256":"0d816de51e8bf895"}},{"arxiv_id":"2601.20209","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20209","title":"SPARK: Strategic Policy-Aware Exploration via Dynamic Branching for Long-Horizon Agentic Learning","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"jinyangwu/SPARK","path":"agent_system/environments/env_package/alfworld/envs_spark.py","file_url":"https://github.com/jinyangwu/SPARK/blob/HEAD/agent_system/environments/env_package/alfworld/envs_spark.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3127633565ff7913","code_sha256_prefix":"3127633565ff7913","mcp_get_code":{"code_sha256":"3127633565ff7913"}},{"arxiv_id":"2506.09650","arxiv_id_is_arxiv":true,"paper":"/paper/hopadiff-holistic-partial-aware-fourier","title":"HopaDIFF: Holistic-Partial Aware Fourier Conditioned Diffusion for Referring Human Action Segmentation in Multi-Person Scenarios","date":"2025-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KPeng9510/HopaDIFF","path":"utils.py","file_url":"https://github.com/KPeng9510/HopaDIFF/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aba00282ba9d4d0b","code_sha256_prefix":"aba00282ba9d4d0b","mcp_get_code":{"code_sha256":"aba00282ba9d4d0b"}},{"arxiv_id":"2505.09924","arxiv_id_is_arxiv":true,"paper":"/paper/from-trade-off-to-synergy-a-versatile","title":"From Trade-off to Synergy: A Versatile Symbiotic Watermarking Framework for Large Language Models","date":"2025-05-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"redwyd/SymMark","path":"watermark/kgw_exp/kgw_exp.py","file_url":"https://github.com/redwyd/SymMark/blob/HEAD/watermark/kgw_exp/kgw_exp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, redwyd/SymMark when it was checked","code_sha256":"0d816de51e8bf895","code_sha256_prefix":"0d816de51e8bf895","mcp_get_code":{"code_sha256":"0d816de51e8bf895"}},{"arxiv_id":"2405.13028","arxiv_id_is_arxiv":true,"paper":"/paper/duetsim-building-user-simulator-with-dual","title":"DuetSim: Building User Simulator with Dual Large Language Models for Task-Oriented Dialogues","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"suntea233/duetsim","path":"deploy/config.py","file_url":"https://github.com/suntea233/duetsim/blob/HEAD/deploy/config.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ce421e54329a523","code_sha256_prefix":"5ce421e54329a523","mcp_get_code":{"code_sha256":"5ce421e54329a523"}},{"arxiv_id":"2306.00416","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-motion-diffusion-model","title":"Interactive Character Control with Auto-Regressive Motion Diffusion Models","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yi-Shi94/AMDM","path":"model/trainer_builder.py","file_url":"https://github.com/Yi-Shi94/AMDM/blob/HEAD/model/trainer_builder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1932057d61bd2b87","code_sha256_prefix":"1932057d61bd2b87","mcp_get_code":{"code_sha256":"1932057d61bd2b87"}},{"arxiv_id":"1902.07638","arxiv_id_is_arxiv":true,"paper":"/paper/random-search-and-reproducibility-for-neural","title":"Random Search and Reproducibility for Neural Architecture Search","date":"2019-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/nn-meter","path":"nn_meter/builder/config_manager.py","file_url":"https://github.com/microsoft/nn-meter/blob/HEAD/nn_meter/builder/config_manager.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a5022a04158a95d","code_sha256_prefix":"7a5022a04158a95d","mcp_get_code":{"code_sha256":"7a5022a04158a95d"}}],"record_sha256":"d059fb853693e42db2820dc2b29a4f5d58cced05e08a65249223ecac7286e292","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}