{"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/normalize-string","entry":"normalize_string","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":9,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":9,"n_places":14,"n_places_pointer_only":7,"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":6,"ran_fixture":0,"ran":4,"unverified":1},"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.31584","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-31584","title":"LongTraceRL: Learning Long-Context Reasoning from Search Agent Trajectories with Rubric Rewards","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"THU-KEG/LongTraceRL","path":"launch_server.py","file_url":"https://github.com/THU-KEG/LongTraceRL/blob/HEAD/launch_server.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, THU-KEG/LongTraceRL when it was checked","code_sha256":"f5878c7f521fc22b","code_sha256_prefix":"f5878c7f521fc22b","mcp_get_code":{"code_sha256":"f5878c7f521fc22b"}},{"arxiv_id":"2602.08877","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08877","title":"PROMPT-LEVEL STRATEGIC DECEPTION","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"oliveradk/audit-stress-test","path":"envs/ssc/ssc_prefill/audit_prefill.py","file_url":"https://github.com/oliveradk/audit-stress-test/blob/HEAD/envs/ssc/ssc_prefill/audit_prefill.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, oliveradk/audit-stress-test when it was checked","code_sha256":"0cd5086849b5d32f","code_sha256_prefix":"0cd5086849b5d32f","mcp_get_code":{"code_sha256":"0cd5086849b5d32f"}},{"arxiv_id":"2503.10460","arxiv_id_is_arxiv":true,"paper":"/paper/light-r1-curriculum-sft-dpo-and-rl-for-long","title":"Light-R1: Curriculum SFT, DPO and RL for Long COT from Scratch and Beyond","date":"2025-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Qihoo360/Light-R1","path":"decontaminate/n_gram_check.py","file_url":"https://github.com/Qihoo360/Light-R1/blob/HEAD/decontaminate/n_gram_check.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":"927fae1304011f13","code_sha256_prefix":"927fae1304011f13","mcp_get_code":{"code_sha256":"927fae1304011f13"}},{"arxiv_id":"2411.08147","arxiv_id_is_arxiv":true,"paper":"/paper/large-language-models-can-self-improve-in","title":"Large Language Models Can Self-Improve in Long-context Reasoning","date":"2024-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sihengli99/sealong","path":"process_data.py","file_url":"https://github.com/sihengli99/sealong/blob/HEAD/process_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, sihengli99/sealong when it was checked","code_sha256":"3a1b300cb40b8be4","code_sha256_prefix":"3a1b300cb40b8be4","mcp_get_code":{"code_sha256":"3a1b300cb40b8be4"}},{"arxiv_id":"2310.13522","arxiv_id_is_arxiv":true,"paper":"/paper/teaching-language-models-to-self-improve","title":"Teaching Language Models to Self-Improve through Interactive Demonstrations","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasonyux/tripost","path":"models/filters/logical_deduction.py","file_url":"https://github.com/jasonyux/tripost/blob/HEAD/models/filters/logical_deduction.py","status":"ran","verification_level":1,"contract_check":null,"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, jasonyux/tripost when it was checked","code_sha256":"39c7486a0598d69d","code_sha256_prefix":"39c7486a0598d69d","mcp_get_code":{"code_sha256":"39c7486a0598d69d"}},{"arxiv_id":"2310.00149","arxiv_id_is_arxiv":true,"paper":"/paper/one-for-all-towards-training-one-graph-model","title":"One for All: Towards Training One Graph Model for All Classification Tasks","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lechengkong/oneforall","path":"models/model.py","file_url":"https://github.com/lechengkong/oneforall/blob/HEAD/models/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff7d55c8c0dd7dde","code_sha256_prefix":"ff7d55c8c0dd7dde","mcp_get_code":{"code_sha256":"ff7d55c8c0dd7dde"}},{"arxiv_id":"2306.08274","arxiv_id_is_arxiv":true,"paper":"/paper/why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/a2dug","path":"src/layers.py","file_url":"https://github.com/seijimaekawa/a2dug/blob/HEAD/src/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff7d55c8c0dd7dde","code_sha256_prefix":"ff7d55c8c0dd7dde","mcp_get_code":{"code_sha256":"ff7d55c8c0dd7dde"}},{"arxiv_id":"2206.09144","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-real-world-benchmark-datasets-an","title":"Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/empirical-study-of-gnns","path":"models/layers.py","file_url":"https://github.com/seijimaekawa/empirical-study-of-gnns/blob/HEAD/models/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff7d55c8c0dd7dde","code_sha256_prefix":"ff7d55c8c0dd7dde","mcp_get_code":{"code_sha256":"ff7d55c8c0dd7dde"}},{"arxiv_id":"1906.01698","arxiv_id_is_arxiv":true,"paper":"/paper/open-sesame-getting-inside-berts-linguistic","title":"Open Sesame: Getting Inside BERT's Linguistic Knowledge","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yongjie-lin/bert-opensesame","path":"pytorch_pretrained_bert/dd_utils.py","file_url":"https://github.com/yongjie-lin/bert-opensesame/blob/HEAD/pytorch_pretrained_bert/dd_utils.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":"5c1d1e5a7edda4cd","code_sha256_prefix":"5c1d1e5a7edda4cd","mcp_get_code":{"code_sha256":"5c1d1e5a7edda4cd"}},{"arxiv_id":"1810.12541","arxiv_id_is_arxiv":true,"paper":"/paper/robots-learn-social-skills-end-to-end","title":"Robots Learn Social Skills: End-to-End Learning of Co-Speech Gesture Generation for Humanoid Robots","date":null,"month_inferred_from_arxiv_id":"2018-10","title_source":"archive","repo":"youngwoo-yoon/youtube-gesture-dataset","path":"script/make_ted_dataset.py","file_url":"https://github.com/youngwoo-yoon/youtube-gesture-dataset/blob/HEAD/script/make_ted_dataset.py","status":"unverified","verification_level":0,"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":"61474285bf6c43cc","code_sha256_prefix":"61474285bf6c43cc","mcp_get_code":{"code_sha256":"61474285bf6c43cc"}},{"arxiv_id":"1703.03906","arxiv_id_is_arxiv":true,"paper":"/paper/massive-exploration-of-neural-machine","title":"Massive Exploration of Neural Machine Translation Architectures","date":"2017-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simonjisu/NMT","path":"model/preprocessing.py","file_url":"https://github.com/simonjisu/NMT/blob/HEAD/model/preprocessing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"376ab047b1a94d61","code_sha256_prefix":"376ab047b1a94d61","mcp_get_code":{"code_sha256":"376ab047b1a94d61"}},{"arxiv_id":"1506.05869","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-conversational-model","title":"A Neural Conversational Model","date":"2015-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Paarth3098/chatbot_p","path":"chatbot.py","file_url":"https://github.com/Paarth3098/chatbot_p/blob/HEAD/chatbot.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, Paarth3098/chatbot_p when it was checked","code_sha256":"b916fe78de840fa5","code_sha256_prefix":"b916fe78de840fa5","mcp_get_code":{"code_sha256":"b916fe78de840fa5"}},{"arxiv_id":"1409.3215","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-to-sequence-learning-with-neural","title":"Sequence to Sequence Learning with Neural Networks","date":"2014-09-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rileynwong/pytorch-seq2seq-joke2punchline","path":"seq2seq.py","file_url":"https://github.com/rileynwong/pytorch-seq2seq-joke2punchline/blob/HEAD/seq2seq.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, rileynwong/pytorch-seq2seq-joke2punchline when it was checked","code_sha256":"0249f2927bd76913","code_sha256_prefix":"0249f2927bd76913","mcp_get_code":{"code_sha256":"0249f2927bd76913"}},{"arxiv_id":"1409.0473","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-by-jointly","title":"Neural Machine Translation by Jointly Learning to Align and Translate","date":"2014-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"0249f2927bd76913","code_sha256_prefix":"0249f2927bd76913","mcp_get_code":{"code_sha256":"0249f2927bd76913"}}],"record_sha256":"40dffaea92fa9e3e40ce0991d5ccd5df15ebfa42dd0ef9fe3c4e644904c148de","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}