{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/sparsemax","entry":"sparsemax","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":6,"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":10,"n_samples_ran":5,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":4,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":1,"unverified":5},"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.21825","paper":"/paper/arxiv-2608-21825","title":"VisAdj: Learning Adjacency Matrices from Node-Link Images","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Jiahao-Xie-86/VisAdj","path":"VisAdj/model/asns.py","file_url":"https://github.com/Jiahao-Xie-86/VisAdj/blob/HEAD/VisAdj/model/asns.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5201834bbdcc26ce","mcp_get_code":{"code_sha256":"5201834bbdcc26ce"}},{"arxiv_id":"2604.19547","paper":"/paper/arxiv-2604-19547","title":"Emotion-Cause Pair Extraction in Conversations via Semantic Decoupling and Graph Alignment","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"CoCoSphere/SCALE","path":"alignment/fgw_torch.py","file_url":"https://github.com/CoCoSphere/SCALE/blob/HEAD/alignment/fgw_torch.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e28671814ba29648","mcp_get_code":{"code_sha256":"e28671814ba29648"}},{"arxiv_id":"2601.22990","paper":"/paper/arxiv-2601-22990","title":"Self-Supervised Slice-to-Volume Reconstruction with Gaussian Representations for Fetal MRI","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Yinsong0510/GaussianSVR-Self-Supervised-Slice-to-Volume-Reconstruction-with-Gaussian-Representations","path":"src/models/attention.py","file_url":"https://github.com/Yinsong0510/GaussianSVR-Self-Supervised-Slice-to-Volume-Reconstruction-with-Gaussian-Representations/blob/HEAD/src/models/attention.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4ba7b234afc0c74f","mcp_get_code":{"code_sha256":"4ba7b234afc0c74f"}},{"arxiv_id":"2510.25094","paper":"/paper/arxiv-2510-25094","title":"Visual Diversity and Region-aware Prompt Learning for Zero-shot HOI Detection","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mlvlab/VDRP","path":"upt_tip_cache_model_free_finetune_distill3.py","file_url":"https://github.com/mlvlab/VDRP/blob/HEAD/upt_tip_cache_model_free_finetune_distill3.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6cd404dc879a8ae6","mcp_get_code":{"code_sha256":"6cd404dc879a8ae6"}},{"arxiv_id":"2404.03830","paper":"/paper/bishop-bi-directional-cellular-learning-for","title":"BiSHop: Bi-Directional Cellular Learning for Tabular Data with Generalized Sparse Modern Hopfield Model","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magics-lab/bishop","path":"models/entmax.py","file_url":"https://github.com/magics-lab/bishop/blob/HEAD/models/entmax.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"7f8f6f031c817a96","mcp_get_code":{"code_sha256":"7f8f6f031c817a96"}},{"arxiv_id":"2209.07400","paper":"/paper/private-synthetic-data-for-multitask-learning","title":"Private Synthetic Data for Multitask Learning and Marginal Queries","date":"2022-09-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/relaxed-adaptive-projection","path":"mechanisms/rap_pp.py","file_url":"https://github.com/amazon-research/relaxed-adaptive-projection/blob/HEAD/mechanisms/rap_pp.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"bc4cc560bd7663fc","mcp_get_code":{"code_sha256":"bc4cc560bd7663fc"}},{"arxiv_id":"2207.08548","paper":"/paper/gate-gated-additive-tree-ensemble-for-tabular","title":"GANDALF: Gated Adaptive Network for Deep Automated Learning of Features","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manujosephv/GATE","path":"gate/utils.py","file_url":"https://github.com/manujosephv/GATE/blob/HEAD/gate/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"38c2864dcf0e7de3","mcp_get_code":{"code_sha256":"38c2864dcf0e7de3"}},{"arxiv_id":"2009.14148","paper":"/paper/unbalanced-sobolev-descent","title":"Unbalanced Sobolev Descent","date":"2020-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ibm/usd","path":"modules.py","file_url":"https://github.com/ibm/usd/blob/HEAD/modules.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8ae5e6dfcb32482c","mcp_get_code":{"code_sha256":"8ae5e6dfcb32482c"}},{"arxiv_id":"1909.00015","paper":"/paper/adaptively-sparse-transformers","title":"Adaptively Sparse Transformers","date":"2019-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/entmax","path":"entmax/activations.py","file_url":"https://github.com/deep-spin/entmax/blob/HEAD/entmax/activations.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"df0db81c189b01e7","mcp_get_code":{"code_sha256":"df0db81c189b01e7"}},{"arxiv_id":"1908.07442","paper":"/paper/tabnet-attentive-interpretable-tabular","title":"TabNet: Attentive Interpretable Tabular Learning","date":"2019-08-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"titu1994/tf-TabNet","path":"tabnet/custom_objects.py","file_url":"https://github.com/titu1994/tf-TabNet/blob/HEAD/tabnet/custom_objects.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"475e548a481445a8","mcp_get_code":{"code_sha256":"475e548a481445a8"}},{"arxiv_id":"1602.02068","paper":"/paper/from-softmax-to-sparsemax-a-sparse-model-of","title":"From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification","date":"2016-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"df0db81c189b01e7","mcp_get_code":{"code_sha256":"df0db81c189b01e7"}}]}