{"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/get-dtype","entry":"get_dtype","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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":6,"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":7,"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":"2606.27683","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27683","title":"CBD: API-Only LLM Black-Box Unlearning through Controlled Behavioral Divergence","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"DGL-codes/CBD","path":"uld/model/utils.py","file_url":"https://github.com/DGL-codes/CBD/blob/HEAD/uld/model/utils.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":"c2cfa4061fa42997","code_sha256_prefix":"c2cfa4061fa42997","mcp_get_code":{"code_sha256":"c2cfa4061fa42997"}},{"arxiv_id":"2606.03391","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03391","title":"When Model Merging Breaks Routing: Training-Free Calibration for MoE","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"huangcb01/HARC","path":"src/file/lazy_unpickle.py","file_url":"https://github.com/huangcb01/HARC/blob/HEAD/src/file/lazy_unpickle.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, huangcb01/HARC when it was checked","code_sha256":"e4fa22a326c775ac","code_sha256_prefix":"e4fa22a326c775ac","mcp_get_code":{"code_sha256":"e4fa22a326c775ac"}},{"arxiv_id":"2605.11884","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-11884","title":"Sobolev Regularized MMD Gradient Flow","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FerdTian/SrMMD","path":"src/generative/student_teacher/trainer.py","file_url":"https://github.com/FerdTian/SrMMD/blob/HEAD/src/generative/student_teacher/trainer.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, FerdTian/SrMMD when it was checked","code_sha256":"d02ffd6f6f0458af","code_sha256_prefix":"d02ffd6f6f0458af","mcp_get_code":{"code_sha256":"d02ffd6f6f0458af"}},{"arxiv_id":"2604.15959","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15959","title":"Multi-Objective Bayesian Optimization via Adaptive ε-Constraints Decomposition","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"csdlpsu/qpots","path":"qpots/config.py","file_url":"https://github.com/csdlpsu/qpots/blob/HEAD/qpots/config.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, csdlpsu/qpots, is not in the permissive set Syntology serves inline","code_sha256":"28b050e23a6e56cd","code_sha256_prefix":"28b050e23a6e56cd","mcp_get_code":{"code_sha256":"28b050e23a6e56cd"}},{"arxiv_id":"2503.08311","arxiv_id_is_arxiv":true,"paper":"/paper/mind-the-memory-gap-unveiling-gpu-bottlenecks","title":"Mind the Memory Gap: Unveiling GPU Bottlenecks in Large-Batch LLM Inference","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FerranAgulloLopez/vLLMBatchingMemoryGap","path":"benchmarks_simple/decoding_offline_profiler.py","file_url":"https://github.com/FerranAgulloLopez/vLLMBatchingMemoryGap/blob/HEAD/benchmarks_simple/decoding_offline_profiler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cdbdf66080f993f0","code_sha256_prefix":"cdbdf66080f993f0","mcp_get_code":{"code_sha256":"cdbdf66080f993f0"}},{"arxiv_id":"2409.14980","arxiv_id_is_arxiv":true,"paper":"/paper/de-regularized-maximum-mean-discrepancy","title":"(De)-regularized Maximum Mean Discrepancy Gradient Flow","date":"2024-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hudsonchen/drmmd","path":"student_teacher/trainer.py","file_url":"https://github.com/hudsonchen/drmmd/blob/HEAD/student_teacher/trainer.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, hudsonchen/drmmd when it was checked","code_sha256":"d02ffd6f6f0458af","code_sha256_prefix":"d02ffd6f6f0458af","mcp_get_code":{"code_sha256":"d02ffd6f6f0458af"}},{"arxiv_id":"2406.17808","arxiv_id_is_arxiv":true,"paper":"/paper/training-free-exponential-extension-of","title":"Training-Free Exponential Context Extension via Cascading KV Cache","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeffwillette/cascading_kv_cache","path":"cascade/main/llama_eval.py","file_url":"https://github.com/jeffwillette/cascading_kv_cache/blob/HEAD/cascade/main/llama_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jeffwillette/cascading_kv_cache when it was checked","code_sha256":"9e03ad45c2155fe6","code_sha256_prefix":"9e03ad45c2155fe6","mcp_get_code":{"code_sha256":"9e03ad45c2155fe6"}},{"arxiv_id":"2310.16355","arxiv_id_is_arxiv":true,"paper":"/paper/redco-a-lightweight-tool-to-automate","title":"RedCoast: A Lightweight Tool to Automate Distributed Training of LLMs on Any GPU/TPUs","date":"2023-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tanyuqian/redco","path":"redco/deployers/ckpt_utils.py","file_url":"https://github.com/tanyuqian/redco/blob/HEAD/redco/deployers/ckpt_utils.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":"10a72bd31f42a074","code_sha256_prefix":"10a72bd31f42a074","mcp_get_code":{"code_sha256":"10a72bd31f42a074"}},{"arxiv_id":"2212.04356","arxiv_id_is_arxiv":true,"paper":"/paper/robust-speech-recognition-via-large-scale-1","title":"Robust Speech Recognition via Large-Scale Weak Supervision","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"robflynnyh/long-context-asr","path":"exp/train_utterance_meta_loss_pred.py","file_url":"https://github.com/robflynnyh/long-context-asr/blob/HEAD/exp/train_utterance_meta_loss_pred.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":"ad63708b6da385d5","code_sha256_prefix":"ad63708b6da385d5","mcp_get_code":{"code_sha256":"ad63708b6da385d5"}},{"arxiv_id":"2212.00133","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-learning-of-sinkhorn","title":"Universal Neural Optimal Transport","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gregorkornhardt/unot","path":"scripts/main_neural_operator.py","file_url":"https://github.com/gregorkornhardt/unot/blob/HEAD/scripts/main_neural_operator.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ee3fdbef6881a440","code_sha256_prefix":"ee3fdbef6881a440","mcp_get_code":{"code_sha256":"ee3fdbef6881a440"}},{"arxiv_id":"2211.06550","arxiv_id_is_arxiv":true,"paper":"/paper/tapas-a-toolbox-for-adversarial-privacy","title":"TAPAS: a Toolbox for Adversarial Privacy Auditing of Synthetic Data","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alan-turing-institute/privacy-sdg-toolbox","path":"tapas/generators/generator.py","file_url":"https://github.com/alan-turing-institute/privacy-sdg-toolbox/blob/HEAD/tapas/generators/generator.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":"b2cf082cafac2d9b","code_sha256_prefix":"b2cf082cafac2d9b","mcp_get_code":{"code_sha256":"b2cf082cafac2d9b"}},{"arxiv_id":"2106.09685","arxiv_id_is_arxiv":true,"paper":"/paper/lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ikergarcia1996/sequence-labeling-llms","path":"seq2seq.py","file_url":"https://github.com/ikergarcia1996/sequence-labeling-llms/blob/HEAD/seq2seq.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":"db50388eace49466","code_sha256_prefix":"db50388eace49466","mcp_get_code":{"code_sha256":"db50388eace49466"}},{"arxiv_id":"1910.09652","arxiv_id_is_arxiv":true,"paper":"/paper/kernelized-wasserstein-natural-gradient-1","title":"Kernelized Wasserstein Natural Gradient","date":"2019-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/KWNG","path":"trainer.py","file_url":"https://github.com/MichaelArbel/KWNG/blob/HEAD/trainer.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":"df18f76dfe8b50e9","code_sha256_prefix":"df18f76dfe8b50e9","mcp_get_code":{"code_sha256":"df18f76dfe8b50e9"}},{"arxiv_id":"1906.04370","arxiv_id_is_arxiv":true,"paper":"/paper/maximum-mean-discrepancy-gradient-flow","title":"Maximum Mean Discrepancy Gradient Flow","date":"2019-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/MMD-gradient-flow","path":"trainer.py","file_url":"https://github.com/MichaelArbel/MMD-gradient-flow/blob/HEAD/trainer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from FerdTian/SrMMD, and GitHub detected no licence in that repository when it was checked","code_sha256":"d02ffd6f6f0458af","code_sha256_prefix":"d02ffd6f6f0458af","mcp_get_code":{"code_sha256":"d02ffd6f6f0458af"}}],"record_sha256":"f32613a1203319be45f6456f94ee40ea47a972720f3a2c0224440e63e8fbad31","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}