{"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/binary-operator","entry":"binary_operator","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":10,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":1,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":5,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":4,"ran":1,"unverified":1},"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":"2602.03858","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03858","title":"PENGUIN: General Vital Sign Reconstruction from PPG with Flow Matching State Space Model","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Neurogica/PENGUIN","path":"src/models/PENGUIN.py","file_url":"https://github.com/Neurogica/PENGUIN/blob/HEAD/src/models/PENGUIN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause-Clear","inline_ok":false,"inline_ok_link":false,"withheld_clause":"BSD-3-Clause-Clear, as GitHub detects it on this paper's repository, Neurogica/PENGUIN, is not in the permissive set Syntology serves inline","code_sha256":"d74ba9222592f02b","code_sha256_prefix":"d74ba9222592f02b","mcp_get_code":{"code_sha256":"d74ba9222592f02b"}},{"arxiv_id":"2602.00534","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-00534","title":"AIRE-Prune: Asymptotic Impulse-Response Energy for State Pruning in State Space Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"falcon-arrow/AIRE-Prune","path":"s5/ssm.py","file_url":"https://github.com/falcon-arrow/AIRE-Prune/blob/HEAD/s5/ssm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from msgwak/last, and GitHub detected no licence in that repository when it was checked","code_sha256":"b4fc72406d2ff673","code_sha256_prefix":"b4fc72406d2ff673","mcp_get_code":{"code_sha256":"b4fc72406d2ff673"}},{"arxiv_id":"2411.02824","arxiv_id_is_arxiv":true,"paper":"/paper/layer-adaptive-state-pruning-for-deep-state","title":"Layer-Adaptive State Pruning for Deep State Space Models","date":"2024-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"msgwak/last","path":"s5/ssm.py","file_url":"https://github.com/msgwak/last/blob/HEAD/s5/ssm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, msgwak/last when it was checked","code_sha256":"b4fc72406d2ff673","code_sha256_prefix":"b4fc72406d2ff673","mcp_get_code":{"code_sha256":"b4fc72406d2ff673"}},{"arxiv_id":"2410.03943","arxiv_id_is_arxiv":true,"paper":"/paper/oscillatory-state-space-models","title":"Oscillatory State-Space Models","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tk-rusch/linoss","path":"models/LinOSS.py","file_url":"https://github.com/tk-rusch/linoss/blob/HEAD/models/LinOSS.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"11738ec367aede4b","code_sha256_prefix":"11738ec367aede4b","mcp_get_code":{"code_sha256":"11738ec367aede4b"}},{"arxiv_id":"2407.19115","arxiv_id_is_arxiv":true,"paper":"/paper/towards-scalable-and-stable-parallelization","title":"Towards Scalable and Stable Parallelization of Nonlinear RNNs","date":"2024-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lindermanlab/elk","path":"elk/models/ssm.py","file_url":"https://github.com/lindermanlab/elk/blob/HEAD/elk/models/ssm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cc57db8369c5d5df","code_sha256_prefix":"cc57db8369c5d5df","mcp_get_code":{"code_sha256":"cc57db8369c5d5df"}},{"arxiv_id":"2402.15584","arxiv_id_is_arxiv":true,"paper":"/paper/state-space-models-for-event-cameras","title":"State Space Models for Event Cameras","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lindermanlab/S5","path":"s5/ssm.py","file_url":"https://github.com/lindermanlab/S5/blob/HEAD/s5/ssm.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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 msgwak/last, and GitHub detected no licence in that repository when it was checked","code_sha256":"b4fc72406d2ff673","code_sha256_prefix":"b4fc72406d2ff673","mcp_get_code":{"code_sha256":"b4fc72406d2ff673"}},{"arxiv_id":"2311.01927","arxiv_id_is_arxiv":true,"paper":"/paper/gateloop-fully-data-controlled-linear","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","date":"2023-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiaskatsch/GateLoop","path":"flax_gated_linear_rnn/gated_linear_rnn.py","file_url":"https://github.com/tobiaskatsch/GateLoop/blob/HEAD/flax_gated_linear_rnn/gated_linear_rnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"96947480ac813c76","code_sha256_prefix":"96947480ac813c76","mcp_get_code":{"code_sha256":"96947480ac813c76"}},{"arxiv_id":"2310.15719","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-linear-transformers","title":"AGaLiTe: Approximate Gated Linear Transformers for Online Reinforcement Learning","date":"2023-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"subho406/agalite","path":"src/models/agalite/agalite.py","file_url":"https://github.com/subho406/agalite/blob/HEAD/src/models/agalite/agalite.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed42d985a78a9d09","code_sha256_prefix":"ed42d985a78a9d09","mcp_get_code":{"code_sha256":"ed42d985a78a9d09"}},{"arxiv_id":"2310.05167","arxiv_id_is_arxiv":true,"paper":"/paper/hieros-hierarchical-imagination-on-structured","title":"Hieros: Hierarchical Imagination on Structured State Space Sequence World Models","date":"2023-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Snagnar/Hieros","path":"resettable_s5/s5_model.py","file_url":"https://github.com/Snagnar/Hieros/blob/HEAD/resettable_s5/s5_model.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":"a044c344102c93c6","code_sha256_prefix":"a044c344102c93c6","mcp_get_code":{"code_sha256":"a044c344102c93c6"}},{"arxiv_id":"2208.04933","arxiv_id_is_arxiv":true,"paper":"/paper/simplified-state-space-layers-for-sequence","title":"Simplified State Space Layers for Sequence Modeling","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"b4fc72406d2ff673","code_sha256_prefix":"b4fc72406d2ff673","mcp_get_code":{"code_sha256":"b4fc72406d2ff673"}}],"record_sha256":"be1d2f002b008fee6f4747b89ea38559ab110f39cb37c9fad6548db010239e60","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}