{"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/entmax-bisect","entry":"entmax_bisect","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":5,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"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":3,"ran_fixture":2,"ran":0,"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.21825","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"864bceb632ac52d1","code_sha256_prefix":"864bceb632ac52d1","mcp_get_code":{"code_sha256":"864bceb632ac52d1"}},{"arxiv_id":"2604.19547","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, CoCoSphere/SCALE when it was checked","code_sha256":"3be9765827387f91","code_sha256_prefix":"3be9765827387f91","mcp_get_code":{"code_sha256":"3be9765827387f91"}},{"arxiv_id":"2404.03830","arxiv_id_is_arxiv":true,"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a831c817bcc79a3e","code_sha256_prefix":"a831c817bcc79a3e","mcp_get_code":{"code_sha256":"a831c817bcc79a3e"}},{"arxiv_id":"2404.03828","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d3be2464ee960b7","code_sha256_prefix":"2d3be2464ee960b7","mcp_get_code":{"code_sha256":"2d3be2464ee960b7"}},{"arxiv_id":"2312.17346","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d3be2464ee960b7","code_sha256_prefix":"2d3be2464ee960b7","mcp_get_code":{"code_sha256":"2d3be2464ee960b7"}},{"arxiv_id":"1909.00015","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e929f00b60fd451","code_sha256_prefix":"8e929f00b60fd451","mcp_get_code":{"code_sha256":"8e929f00b60fd451"}}],"record_sha256":"571cbf6e0b58e53a125573b377cd338934e9cfafc16b0ba1b648c809d1ec7169","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}