{"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/stable-softmax","entry":"stable_softmax","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":5,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":7,"n_places_pointer_only":1,"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":2,"ran_fixture":0,"ran":5,"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":"2410.08804","arxiv_id_is_arxiv":true,"paper":"/paper/batched-energy-entropy-acquisition-for","title":"Batched Energy-Entropy acquisition for Bayesian Optimization","date":"2024-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"novonordisk-research/bee-bo","path":"beebo/acquisition.py","file_url":"https://github.com/novonordisk-research/bee-bo/blob/HEAD/beebo/acquisition.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7b003e18bd5feea4","code_sha256_prefix":"7b003e18bd5feea4","mcp_get_code":{"code_sha256":"7b003e18bd5feea4"}},{"arxiv_id":"2406.04801","arxiv_id_is_arxiv":true,"paper":"/paper/moe-jetpack-from-dense-checkpoints-to","title":"MoE Jetpack: From Dense Checkpoints to Adaptive Mixture of Experts for Vision Tasks","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"adlith/moe-jetpack","path":"moejet/models/soft_moe.py","file_url":"https://github.com/adlith/moe-jetpack/blob/HEAD/moejet/models/soft_moe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0d57361257879cc","code_sha256_prefix":"b0d57361257879cc","mcp_get_code":{"code_sha256":"b0d57361257879cc"}},{"arxiv_id":"2405.17476","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-leverage-diverse-demonstrations-in","title":"How to Leverage Diverse Demonstrations in Offline Imitation Learning","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liziniu/ISWBC","path":"atari/experiments/agents/iswbc_agent.py","file_url":"https://github.com/liziniu/ISWBC/blob/HEAD/atari/experiments/agents/iswbc_agent.py","status":"ran","verification_level":1,"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, liziniu/ISWBC when it was checked","code_sha256":"2de1ae4938d1cdca","code_sha256_prefix":"2de1ae4938d1cdca","mcp_get_code":{"code_sha256":"2de1ae4938d1cdca"}},{"arxiv_id":"2211.09233","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-tuning-for-parameter-efficient-medical","title":"Prompt Tuning for Parameter-efficient Medical Image Segmentation","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcdcfischer/punetr","path":"src/utils/stable_softmax.py","file_url":"https://github.com/marcdcfischer/punetr/blob/HEAD/src/utils/stable_softmax.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":"e38ff7174bf4d914","code_sha256_prefix":"e38ff7174bf4d914","mcp_get_code":{"code_sha256":"e38ff7174bf4d914"}},{"arxiv_id":"2203.15488","arxiv_id_is_arxiv":true,"paper":"/paper/over-the-air-federated-learning-via-second","title":"Over-the-Air Federated Learning via Second-Order Optimization","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Golden-Slumber/AirFL-2nd","path":"Utils/CrossEntropy.py","file_url":"https://github.com/Golden-Slumber/AirFL-2nd/blob/HEAD/Utils/CrossEntropy.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":"dd326f5698315c6d","code_sha256_prefix":"dd326f5698315c6d","mcp_get_code":{"code_sha256":"dd326f5698315c6d"}},{"arxiv_id":"1902.00981","arxiv_id_is_arxiv":true,"paper":"/paper/learning-counterfactual-representations-for","title":"Learning Counterfactual Representations for Estimating Individual Dose-Response Curves","date":"2019-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/drnet","path":"drnet/apps/util.py","file_url":"https://github.com/d909b/drnet/blob/HEAD/drnet/apps/util.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":"37b5be9829d978ce","code_sha256_prefix":"37b5be9829d978ce","mcp_get_code":{"code_sha256":"37b5be9829d978ce"}},{"arxiv_id":"1308.0850","arxiv_id_is_arxiv":true,"paper":"/paper/generating-sequences-with-recurrent-neural","title":"Generating Sequences With Recurrent Neural Networks","date":"2013-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swechhachoudhary/Handwriting-synthesis","path":"utils/model_utils.py","file_url":"https://github.com/swechhachoudhary/Handwriting-synthesis/blob/HEAD/utils/model_utils.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":"40eb6d67a6e160c6","code_sha256_prefix":"40eb6d67a6e160c6","mcp_get_code":{"code_sha256":"40eb6d67a6e160c6"}}],"record_sha256":"fa9116a7292747e1f1d44fe46d2dcb077484f5adb34aab0fc2d336d0866e4bc6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}