{"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/entmax-bisect","entry":"entmax_bisect","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":6,"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":5,"n_samples_ran":5,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":2,"ran":1,"unverified":0},"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"864bceb632ac52d1","mcp_get_code":{"code_sha256":"864bceb632ac52d1"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3be9765827387f91","mcp_get_code":{"code_sha256":"3be9765827387f91"}},{"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":"a831c817bcc79a3e","mcp_get_code":{"code_sha256":"a831c817bcc79a3e"}},{"arxiv_id":"2404.03828","paper":"/paper/outlier-efficient-hopfield-layers-for-large","title":"Outlier-Efficient Hopfield Layers for Large Transformer-Based Models","date":"2024-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magics-lab/outeffhop","path":"STanHop_time_seeries/cross_models/hopfield.py","file_url":"https://github.com/magics-lab/outeffhop/blob/HEAD/STanHop_time_seeries/cross_models/hopfield.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d3be2464ee960b7","mcp_get_code":{"code_sha256":"2d3be2464ee960b7"}},{"arxiv_id":"2312.17346","paper":"/paper/stanhop-sparse-tandem-hopfield-model-for","title":"STanHop: Sparse Tandem Hopfield Model for Memory-Enhanced Time Series Prediction","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"magics-lab/stanhop","path":"code_models/entmax.py","file_url":"https://github.com/magics-lab/stanhop/blob/HEAD/code_models/entmax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2d3be2464ee960b7","mcp_get_code":{"code_sha256":"2d3be2464ee960b7"}},{"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":"prajjwal1/fluence","path":"fluence/adaptive/entmax.py","file_url":"https://github.com/prajjwal1/fluence/blob/HEAD/fluence/adaptive/entmax.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8e929f00b60fd451","mcp_get_code":{"code_sha256":"8e929f00b60fd451"}}]}