{"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/inv-softplus","entry":"inv_softplus","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":7,"n_places":7,"n_places_pointer_only":3,"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":2,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"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":"2608.21308","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21308","title":"Rethinking Expressivity and Efficiency in Test-Time Training","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"zeyun-zhong/E2-TTT","path":"e2_ttt/baselines/lact/layer.py","file_url":"https://github.com/zeyun-zhong/E2-TTT/blob/HEAD/e2_ttt/baselines/lact/layer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, zeyun-zhong/E2-TTT (NOASSERTION)","code_sha256":"90a1cbe510f829f5","code_sha256_prefix":"90a1cbe510f829f5","mcp_get_code":{"code_sha256":"90a1cbe510f829f5"}},{"arxiv_id":"2606.26421","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-26421","title":"Otter Weather: Skillful and Computationally Efficient Medium-Range Weather Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"cambridge-mlg/otter","path":"otter/models/distributions.py","file_url":"https://github.com/cambridge-mlg/otter/blob/HEAD/otter/models/distributions.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe83f058a0a5c314","code_sha256_prefix":"fe83f058a0a5c314","mcp_get_code":{"code_sha256":"fe83f058a0a5c314"}},{"arxiv_id":"2601.21696","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21696","title":"Independent Component Discovery in Temporal Count Data","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"lindermanlab/ssm","path":"ssm/emissions.py","file_url":"https://github.com/lindermanlab/ssm/blob/HEAD/ssm/emissions.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af569d910bc6c0e0","code_sha256_prefix":"af569d910bc6c0e0","mcp_get_code":{"code_sha256":"af569d910bc6c0e0"}},{"arxiv_id":"2409.18735","arxiv_id_is_arxiv":true,"paper":"/paper/autoregressive-policy-optimization-for","title":"Autoregressive Policy Optimization for Constrained Allocation Tasks","date":"2024-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niklasdbs/paspo","path":"src/action_distributions/truncated_normal.py","file_url":"https://github.com/niklasdbs/paspo/blob/HEAD/src/action_distributions/truncated_normal.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, niklasdbs/paspo when it was checked","code_sha256":"44febc516263958a","code_sha256_prefix":"44febc516263958a","mcp_get_code":{"code_sha256":"44febc516263958a"}},{"arxiv_id":"2305.06242","arxiv_id_is_arxiv":true,"paper":"/paper/think-twice-before-driving-towards-scalable","title":"Think Twice before Driving: Towards Scalable Decoders for End-to-End Autonomous Driving","date":"2023-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opendrivelab/thinktwice","path":"open_loop_training/code/model_code/dense_heads/thinktwice_decoder.py","file_url":"https://github.com/opendrivelab/thinktwice/blob/HEAD/open_loop_training/code/model_code/dense_heads/thinktwice_decoder.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":"2053c1099485dbd8","code_sha256_prefix":"2053c1099485dbd8","mcp_get_code":{"code_sha256":"2053c1099485dbd8"}},{"arxiv_id":"2202.01929","arxiv_id_is_arxiv":true,"paper":"/paper/mathcal-f-ebm-energy-based-learning-of","title":"Energy-Based Models for Functional Data using Path Measure Tilting","date":"2022-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jenninglim/functional-ebm","path":"src/model.py","file_url":"https://github.com/jenninglim/functional-ebm/blob/HEAD/src/model.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":"d3e501cd5ebc3016","code_sha256_prefix":"d3e501cd5ebc3016","mcp_get_code":{"code_sha256":"d3e501cd5ebc3016"}},{"arxiv_id":"2104.09460","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-algorithm-execution-estimating","title":"Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Information","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"willieneis/bayesian-algorithm-execution","path":"examples/dijkstra/bax_grid10_viz_simple_demo.py","file_url":"https://github.com/willieneis/bayesian-algorithm-execution/blob/HEAD/examples/dijkstra/bax_grid10_viz_simple_demo.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, willieneis/bayesian-algorithm-execution when it was checked","code_sha256":"1fee3d4f7884fa26","code_sha256_prefix":"1fee3d4f7884fa26","mcp_get_code":{"code_sha256":"1fee3d4f7884fa26"}}],"record_sha256":"a4021e551c3f7317e972f68cbada8404946129c029af537569860416966e0bf5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}