{"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/parse-result","entry":"parse_result","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":2},"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.05167","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05167","title":"CNM-BERT: A Drop-In Structural Embedding for Chinese Characters via Ideographic Description Sequences","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"fxsjy/jieba","path":"jieba/lac_small/utils.py","file_url":"https://github.com/fxsjy/jieba/blob/HEAD/jieba/lac_small/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":"98bf29cbed6ce4d0","code_sha256_prefix":"98bf29cbed6ce4d0","mcp_get_code":{"code_sha256":"98bf29cbed6ce4d0"}},{"arxiv_id":"2409.12822","arxiv_id_is_arxiv":true,"paper":"/paper/language-models-learn-to-mislead-humans-via","title":"Language Models Learn to Mislead Humans via RLHF","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaxin-wen/misleadlm","path":"trlx/ray_tune/wandb.py","file_url":"https://github.com/jiaxin-wen/misleadlm/blob/HEAD/trlx/ray_tune/wandb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2c3cae9e92c72e8","code_sha256_prefix":"e2c3cae9e92c72e8","mcp_get_code":{"code_sha256":"e2c3cae9e92c72e8"}},{"arxiv_id":"2409.10683","arxiv_id_is_arxiv":true,"paper":"/paper/motif-motion-instruction-fine-tuning","title":"MotIF: Motion Instruction Fine-tuning","date":"2024-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Minyoung1005/motif","path":"utils/parse_utils.py","file_url":"https://github.com/Minyoung1005/motif/blob/HEAD/utils/parse_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Minyoung1005/motif (NOASSERTION)","code_sha256":"74a647b52caeb161","code_sha256_prefix":"74a647b52caeb161","mcp_get_code":{"code_sha256":"74a647b52caeb161"}},{"arxiv_id":"2406.18925","arxiv_id_is_arxiv":true,"paper":"/paper/selective-vision-is-the-challenge-for-visual","title":"Selective Vision is the Challenge for Visual Reasoning: A Benchmark for Visual Argument Understanding","date":"2024-06-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiwanChung/VisArgs","path":"src/visarg/tasks/classification/classification.py","file_url":"https://github.com/JiwanChung/VisArgs/blob/HEAD/src/visarg/tasks/classification/classification.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, JiwanChung/VisArgs when it was checked","code_sha256":"9f4883895666b0aa","code_sha256_prefix":"9f4883895666b0aa","mcp_get_code":{"code_sha256":"9f4883895666b0aa"}},{"arxiv_id":"2306.02231","arxiv_id_is_arxiv":true,"paper":"/paper/fine-tuning-language-models-with-advantage","title":"Fine-Tuning Language Models with Advantage-Induced Policy Alignment","date":"2023-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/rlhf-apa","path":"trlx/ray_tune/wandb.py","file_url":"https://github.com/microsoft/rlhf-apa/blob/HEAD/trlx/ray_tune/wandb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2c3cae9e92c72e8","code_sha256_prefix":"e2c3cae9e92c72e8","mcp_get_code":{"code_sha256":"e2c3cae9e92c72e8"}},{"arxiv_id":"2210.01753","arxiv_id_is_arxiv":true,"paper":"/paper/hypro-a-hybridly-normalized-probabilistic","title":"HYPRO: A Hybridly Normalized Probabilistic Model for Long-Horizon Prediction of Event Sequences","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ivan-chai/hotpp-benchmark","path":"hotpp/eval_downstream.py","file_url":"https://github.com/ivan-chai/hotpp-benchmark/blob/HEAD/hotpp/eval_downstream.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":"7893975b324c3d57","code_sha256_prefix":"7893975b324c3d57","mcp_get_code":{"code_sha256":"7893975b324c3d57"}},{"arxiv_id":"2111.10367","arxiv_id_is_arxiv":true,"paper":"/paper/slue-new-benchmark-tasks-for-spoken-language","title":"SLUE: New Benchmark Tasks for Spoken Language Understanding Evaluation on Natural Speech","date":"2021-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asappresearch/slue-toolkit","path":"slue_toolkit/eval/eval_w2v.py","file_url":"https://github.com/asappresearch/slue-toolkit/blob/HEAD/slue_toolkit/eval/eval_w2v.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":"400008f29f6e7364","code_sha256_prefix":"400008f29f6e7364","mcp_get_code":{"code_sha256":"400008f29f6e7364"}},{"arxiv_id":"1911.03705","arxiv_id_is_arxiv":true,"paper":"/paper/commongen-a-constrained-text-generation","title":"CommonGen: A Constrained Text Generation Challenge for Generative Commonsense Reasoning","date":"2019-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/CommonGen-Eval","path":"evaluate.py","file_url":"https://github.com/allenai/CommonGen-Eval/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":"f8baf14dbe5cc687","code_sha256_prefix":"f8baf14dbe5cc687","mcp_get_code":{"code_sha256":"f8baf14dbe5cc687"}}],"record_sha256":"d030cd6aa26dd5ac396e46b01960a8b7a81ccee68a25af202bc11a5a09991efe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}