{"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/tanh","entry":"tanh","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":21,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":8,"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":15,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":4,"n_samples_unverified":4,"n_samples_fingerprinted":10,"n_places":21,"n_places_pointer_only":8,"n_places_pointer_only_link_open":2,"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":3,"ran_violates":1,"ran_draft_wrong":4,"ran_fixture":0,"ran":3,"unverified":4},"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":"2607.16761","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-16761","title":"Dropout and Random Gradient Masking Are Asymptotically Equivalent in Large ResNets","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"xavimaass/dropout_and_ram_2026","path":"src/jax_resnet/activations.py","file_url":"https://github.com/xavimaass/dropout_and_ram_2026/blob/HEAD/src/jax_resnet/activations.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, xavimaass/dropout_and_ram_2026 when it was checked","code_sha256":"d3fcb3822b7cde96","code_sha256_prefix":"d3fcb3822b7cde96","mcp_get_code":{"code_sha256":"d3fcb3822b7cde96"}},{"arxiv_id":"2602.03264","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03264","title":"HypCBC: Domain-Invariant Hyperbolic Cross-Branch Consistency for Generalizable Medical Image Analysis","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"francescodisalvo05/hyperbolic-cross-branch-consistency","path":"hypcbc/model/model.py","file_url":"https://github.com/francescodisalvo05/hyperbolic-cross-branch-consistency/blob/HEAD/hypcbc/model/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5af45dd86c2cc1","code_sha256_prefix":"be5af45dd86c2cc1","mcp_get_code":{"code_sha256":"be5af45dd86c2cc1"}},{"arxiv_id":"2410.17980","arxiv_id_is_arxiv":true,"paper":"/paper/stick-breaking-attention","title":"Scaling Stick-Breaking Attention: An Efficient Implementation and In-depth Study","date":"2024-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/dolomite-engine","path":"lm_engine/kernels/torch_utils.py","file_url":"https://github.com/ibm/dolomite-engine/blob/HEAD/lm_engine/kernels/torch_utils.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":"821f34b1af2cadb2","code_sha256_prefix":"821f34b1af2cadb2","mcp_get_code":{"code_sha256":"821f34b1af2cadb2"}},{"arxiv_id":"2410.14787","arxiv_id_is_arxiv":true,"paper":"/paper/privacy-for-free-in-the-over-parameterized","title":"Privacy for Free in the Overparameterized Regime","date":"2024-10-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simone-bombari/privacy-for-free","path":"main_RF.py","file_url":"https://github.com/simone-bombari/privacy-for-free/blob/HEAD/main_RF.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, simone-bombari/privacy-for-free when it was checked","code_sha256":"85adc5760af572a0","code_sha256_prefix":"85adc5760af572a0","mcp_get_code":{"code_sha256":"85adc5760af572a0"}},{"arxiv_id":"2404.15523","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-hyperbolic-metric-learning","title":"Understanding Hyperbolic Metric Learning through Hard Negative Sampling","date":"2024-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunyuny/hypmix","path":"hyptorch/pmath.py","file_url":"https://github.com/yunyuny/hypmix/blob/HEAD/hyptorch/pmath.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5af45dd86c2cc1","code_sha256_prefix":"be5af45dd86c2cc1","mcp_get_code":{"code_sha256":"be5af45dd86c2cc1"}},{"arxiv_id":"2310.10537","arxiv_id_is_arxiv":true,"paper":"/paper/microscaling-data-formats-for-deep-learning","title":"Microscaling Data Formats for Deep Learning","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/microxcaling","path":"mx/activations.py","file_url":"https://github.com/microsoft/microxcaling/blob/HEAD/mx/activations.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":"977b4767b78121d5","code_sha256_prefix":"977b4767b78121d5","mcp_get_code":{"code_sha256":"977b4767b78121d5"}},{"arxiv_id":"2310.10013","arxiv_id_is_arxiv":true,"paper":"/paper/riemannian-residual-neural-networks","title":"Riemannian Residual Neural Networks","date":"2023-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUAI/Riemannian-Residual-Neural-Networks","path":"hgcn/models/encoders.py","file_url":"https://github.com/CUAI/Riemannian-Residual-Neural-Networks/blob/HEAD/hgcn/models/encoders.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, CUAI/Riemannian-Residual-Neural-Networks when it was checked","code_sha256":"189316d1476b8b6b","code_sha256_prefix":"189316d1476b8b6b","mcp_get_code":{"code_sha256":"189316d1476b8b6b"}},{"arxiv_id":"2309.17130","arxiv_id_is_arxiv":true,"paper":"/paper/grande-gradient-based-decision-tree-ensembles","title":"GRANDE: Gradient-Based Decision Tree Ensembles for Tabular Data","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"s-marton/gradtree","path":"experiments_paper_gradtree/utilities/GDT.py","file_url":"https://github.com/s-marton/gradtree/blob/HEAD/experiments_paper_gradtree/utilities/GDT.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":"8ee3af50bfaddadd","code_sha256_prefix":"8ee3af50bfaddadd","mcp_get_code":{"code_sha256":"8ee3af50bfaddadd"}},{"arxiv_id":"2306.01896","arxiv_id_is_arxiv":true,"paper":"/paper/tackling-unbounded-state-spaces-in-continuing","title":"Learning to Stabilize Online Reinforcement Learning in Unbounded State Spaces","date":"2023-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"badger-rl/stop","path":"nmodel.py","file_url":"https://github.com/badger-rl/stop/blob/HEAD/nmodel.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, badger-rl/stop when it was checked","code_sha256":"d51cc2bc73bd04cb","code_sha256_prefix":"d51cc2bc73bd04cb","mcp_get_code":{"code_sha256":"d51cc2bc73bd04cb"}},{"arxiv_id":"2302.01629","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-the-universal-law-of-robustness","title":"Beyond the Universal Law of Robustness: Sharper Laws for Random Features and Neural Tangent Kernels","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simone-bombari/beyond-universal-robustness","path":"utils.py","file_url":"https://github.com/simone-bombari/beyond-universal-robustness/blob/HEAD/utils.py","status":"ran_violates","verification_level":1,"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, simone-bombari/beyond-universal-robustness when it was checked","code_sha256":"27556b18fb77c49c","code_sha256_prefix":"27556b18fb77c49c","mcp_get_code":{"code_sha256":"27556b18fb77c49c"}},{"arxiv_id":"2211.09224","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-certain-it-s-anomalous","title":"Are we certain it's anomalous?","date":"2022-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aleflabo/HypAD","path":"math_.py","file_url":"https://github.com/aleflabo/HypAD/blob/HEAD/math_.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":"c33c4cbe2f422504","code_sha256_prefix":"c33c4cbe2f422504","mcp_get_code":{"code_sha256":"c33c4cbe2f422504"}},{"arxiv_id":"2206.12418","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-interaction-knowledge-graph","title":"Geometry Interaction Knowledge Graph Embeddings","date":"2022-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Lion-ZS/GIE","path":"GIE-master/code/models.py","file_url":"https://github.com/Lion-ZS/GIE/blob/HEAD/GIE-master/code/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, Lion-ZS/GIE when it was checked","code_sha256":"8e0d774d7f2805ff","code_sha256_prefix":"8e0d774d7f2805ff","mcp_get_code":{"code_sha256":"8e0d774d7f2805ff"}},{"arxiv_id":"2108.02390","arxiv_id_is_arxiv":true,"paper":"/paper/fuzzy-logic-based-logical-query-answering-on","title":"Fuzzy Logic Based Logical Query Answering on Knowledge Graphs","date":"2021-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkust-knowcomp/sessioncqa","path":"deduction_model/hype_util.py","file_url":"https://github.com/hkust-knowcomp/sessioncqa/blob/HEAD/deduction_model/hype_util.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5af45dd86c2cc1","code_sha256_prefix":"be5af45dd86c2cc1","mcp_get_code":{"code_sha256":"be5af45dd86c2cc1"}},{"arxiv_id":"2102.10058","arxiv_id_is_arxiv":true,"paper":"/paper/principled-simplicial-neural-networks-for","title":"Principled Simplicial Neural Networks for Trajectory Prediction","date":"2021-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nglaze00/scone_gcn","path":"trajectory_analysis/trajectory_experiments.py","file_url":"https://github.com/nglaze00/scone_gcn/blob/HEAD/trajectory_analysis/trajectory_experiments.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e38fae028966b3a2","code_sha256_prefix":"e38fae028966b3a2","mcp_get_code":{"code_sha256":"e38fae028966b3a2"}},{"arxiv_id":"2007.04154","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"applications/markov/bdd_fun.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/applications/markov/bdd_fun.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from badger-rl/stop, and GitHub detected no licence in that repository when it was checked","code_sha256":"d51cc2bc73bd04cb","code_sha256_prefix":"d51cc2bc73bd04cb","mcp_get_code":{"code_sha256":"d51cc2bc73bd04cb"}},{"arxiv_id":"2003.00335","arxiv_id_is_arxiv":true,"paper":"/paper/differentiating-through-the-frechet-mean","title":"Differentiating through the Fréchet Mean","date":"2020-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUVL/Differentiable-Frechet-Mean","path":"frechetmean/utils.py","file_url":"https://github.com/CUVL/Differentiable-Frechet-Mean/blob/HEAD/frechetmean/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from CUAI/Riemannian-Residual-Neural-Networks, and GitHub detected no licence in that repository when it was checked","code_sha256":"189316d1476b8b6b","code_sha256_prefix":"189316d1476b8b6b","mcp_get_code":{"code_sha256":"189316d1476b8b6b"}},{"arxiv_id":"1906.02390","arxiv_id_is_arxiv":true,"paper":"/paper/multi-view-knowledge-graph-embedding-for","title":"Multi-view Knowledge Graph Embedding for Entity Alignment","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nju-websoft/MultiKE","path":"code/auto_encoder.py","file_url":"https://github.com/nju-websoft/MultiKE/blob/HEAD/code/auto_encoder.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":"d86c86bc668b2175","code_sha256_prefix":"d86c86bc668b2175","mcp_get_code":{"code_sha256":"d86c86bc668b2175"}},{"arxiv_id":"1904.02239","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-image-embeddings","title":"Hyperbolic Image Embeddings","date":"2019-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KhrulkovV/hyperbolic-image-embeddings","path":"hyptorch/pmath.py","file_url":"https://github.com/KhrulkovV/hyperbolic-image-embeddings/blob/HEAD/hyptorch/pmath.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"be5af45dd86c2cc1","code_sha256_prefix":"be5af45dd86c2cc1","mcp_get_code":{"code_sha256":"be5af45dd86c2cc1"}},{"arxiv_id":"1810.04805","arxiv_id_is_arxiv":true,"paper":"/paper/bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icewing1996/bert_dep","path":"linalg.py","file_url":"https://github.com/icewing1996/bert_dep/blob/HEAD/linalg.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":"00edc2dc619cd019","code_sha256_prefix":"00edc2dc619cd019","mcp_get_code":{"code_sha256":"00edc2dc619cd019"}},{"arxiv_id":"1803.06585","arxiv_id_is_arxiv":true,"paper":"/paper/learning-long-term-dependencies-via-fourier","title":"Learning Long Term Dependencies via Fourier Recurrent Units","date":"2018-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limbo018/FRU","path":"code/tflearn/tflearn/activations.py","file_url":"https://github.com/limbo018/FRU/blob/HEAD/code/tflearn/tflearn/activations.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":"7b5b30a975b938f3","code_sha256_prefix":"7b5b30a975b938f3","mcp_get_code":{"code_sha256":"7b5b30a975b938f3"}},{"arxiv_id":"1611.01734","arxiv_id_is_arxiv":true,"paper":"/paper/deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdozat/Parser","path":"lib/linalg.py","file_url":"https://github.com/tdozat/Parser/blob/HEAD/lib/linalg.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":"00edc2dc619cd019","code_sha256_prefix":"00edc2dc619cd019","mcp_get_code":{"code_sha256":"00edc2dc619cd019"}}],"record_sha256":"513781c6b0daaffc74862c53b690d73b42e98ef970ccd9c9a44b232cda1da4ed","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}