{"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/generate-random-string","entry":"generate_random_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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":6,"n_places":10,"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":3,"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":"2604.27998","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-27998","title":"Latent-GRPO: Group Relative Policy Optimization for Latent Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"DJC-GO-SOLO/Latent-SFT","path":"sglang_latent_reasoning_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/DJC-GO-SOLO/Latent-SFT/blob/HEAD/sglang_latent_reasoning_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.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":"70f1d10961d52f6d","code_sha256_prefix":"70f1d10961d52f6d","mcp_get_code":{"code_sha256":"70f1d10961d52f6d"}},{"arxiv_id":"2604.04356","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-04356","title":"REAM: Merging Improves Pruning of Experts in LLMs","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"zai-org/glm-simple-evals","path":"evaluate.py","file_url":"https://github.com/zai-org/glm-simple-evals/blob/HEAD/evaluate.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, zai-org/glm-simple-evals when it was checked","code_sha256":"707dde13249b8653","code_sha256_prefix":"707dde13249b8653","mcp_get_code":{"code_sha256":"707dde13249b8653"}},{"arxiv_id":"2602.11683","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-11683","title":"THINKROUTER: Efficient Reasoning via Routing Thinking between Latent and Discrete Spaces","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"eric-ai-lab/Soft-Thinking","path":"sglang_soft_thinking_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/eric-ai-lab/Soft-Thinking/blob/HEAD/sglang_soft_thinking_pkg/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.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":"70f1d10961d52f6d","code_sha256_prefix":"70f1d10961d52f6d","mcp_get_code":{"code_sha256":"70f1d10961d52f6d"}},{"arxiv_id":"2602.01296","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01296","title":"Interacted Planes Reveal 3D Line Mapping","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"calmke/LiPMAP","path":"run_gradio_demo.py","file_url":"https://github.com/calmke/LiPMAP/blob/HEAD/run_gradio_demo.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, calmke/LiPMAP when it was checked","code_sha256":"014be9f82921c0d4","code_sha256_prefix":"014be9f82921c0d4","mcp_get_code":{"code_sha256":"014be9f82921c0d4"}},{"arxiv_id":"2601.18999","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-18999","title":"Randomization Boosts KV Caching, Learning Balances Query Load: A Joint Perspective","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"fzwark/KVRouting","path":"sglang-0.4.6/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.py","file_url":"https://github.com/fzwark/KVRouting/blob/HEAD/sglang-0.4.6/benchmark/bench_in_batch_prefix/bench_in_batch_prefix.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, fzwark/KVRouting when it was checked","code_sha256":"70f1d10961d52f6d","code_sha256_prefix":"70f1d10961d52f6d","mcp_get_code":{"code_sha256":"70f1d10961d52f6d"}},{"arxiv_id":"2402.12991","arxiv_id_is_arxiv":true,"paper":"/paper/trap-targeted-random-adversarial-prompt","title":"TRAP: Targeted Random Adversarial Prompt Honeypot for Black-Box Identification","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"framartin/trap","path":"detect_llm/generate_csv.py","file_url":"https://github.com/framartin/trap/blob/HEAD/detect_llm/generate_csv.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":"76bb37c1f3570e55","code_sha256_prefix":"76bb37c1f3570e55","mcp_get_code":{"code_sha256":"76bb37c1f3570e55"}},{"arxiv_id":"2401.15563","arxiv_id_is_arxiv":true,"paper":"/paper/brepgen-a-b-rep-generative-diffusion-model","title":"BrepGen: A B-rep Generative Diffusion Model with Structured Latent Geometry","date":"2024-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samxuxiang/brepgen","path":"utils.py","file_url":"https://github.com/samxuxiang/brepgen/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, samxuxiang/brepgen (NOASSERTION)","code_sha256":"62e1cadfe8f7ca4c","code_sha256_prefix":"62e1cadfe8f7ca4c","mcp_get_code":{"code_sha256":"62e1cadfe8f7ca4c"}},{"arxiv_id":"2308.15991","arxiv_id_is_arxiv":true,"paper":"/paper/drl-based-trajectory-tracking-for-motion","title":"DRL-Based Trajectory Tracking for Motion-Related Modules in Autonomous Driving","date":"2023-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marmotatzju/drl-based-trajectory-tracking","path":"drltt/common/io.py","file_url":"https://github.com/marmotatzju/drl-based-trajectory-tracking/blob/HEAD/drltt/common/io.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":"a11eefd006cf196c","code_sha256_prefix":"a11eefd006cf196c","mcp_get_code":{"code_sha256":"a11eefd006cf196c"}},{"arxiv_id":"2206.14262","arxiv_id_is_arxiv":true,"paper":"/paper/supervised-training-of-conditional-monge-maps","title":"Supervised Training of Conditional Monge Maps","date":"2022-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bunnech/condot","path":"condot/train/experiment.py","file_url":"https://github.com/bunnech/condot/blob/HEAD/condot/train/experiment.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":"b20871a32fbc05e0","code_sha256_prefix":"b20871a32fbc05e0","mcp_get_code":{"code_sha256":"b20871a32fbc05e0"}},{"arxiv_id":"2025.findings-acl.193","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.193","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"THUDM/SWE-Dev","path":"swedev/crawl/pypi_crawler.py","file_url":"https://github.com/THUDM/SWE-Dev/blob/HEAD/swedev/crawl/pypi_crawler.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":"b55336380d6bad82","code_sha256_prefix":"b55336380d6bad82","mcp_get_code":{"code_sha256":"b55336380d6bad82"}}],"record_sha256":"01c78ae02505cec3f957c03117a24d1687c662d4215eada89a5e8bd7195a73a2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}