{"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-diag","entry":"binary_operator_diag","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":4,"n_papers_ran_instrument_only":2,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":3,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"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":"2405.21064","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-neural-networks-vanishing-and","title":"Recurrent neural networks: vanishing and exploding gradients are not the end of the story","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"0212f0ba3cfe6d69","code_sha256_prefix":"0212f0ba3cfe6d69","mcp_get_code":{"code_sha256":"0212f0ba3cfe6d69"}},{"arxiv_id":"2402.09900","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-recurrent-reinforcement-learning","title":"Recurrent Reinforcement Learning with Memoroids","date":"2024-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"0212f0ba3cfe6d69","code_sha256_prefix":"0212f0ba3cfe6d69","mcp_get_code":{"code_sha256":"0212f0ba3cfe6d69"}},{"arxiv_id":"2312.01538","arxiv_id_is_arxiv":true,"paper":"/paper/recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skeletondyh/gred","path":"model.py","file_url":"https://github.com/skeletondyh/gred/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, skeletondyh/gred when it was checked","code_sha256":"ba8e9577ac8dfb73","code_sha256_prefix":"ba8e9577ac8dfb73","mcp_get_code":{"code_sha256":"ba8e9577ac8dfb73"}},{"arxiv_id":"2305.15947","arxiv_id_is_arxiv":true,"paper":"/paper/online-learning-of-long-range-dependencies","title":"Online learning of long-range dependencies","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nicolaszucchet/online-learning-lr-dependencies","path":"online_lru/rec.py","file_url":"https://github.com/nicolaszucchet/online-learning-lr-dependencies/blob/HEAD/online_lru/rec.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0212f0ba3cfe6d69","code_sha256_prefix":"0212f0ba3cfe6d69","mcp_get_code":{"code_sha256":"0212f0ba3cfe6d69"}},{"arxiv_id":"2303.06349","arxiv_id_is_arxiv":true,"paper":"/paper/resurrecting-recurrent-neural-networks-for","title":"Resurrecting Recurrent Neural Networks for Long Sequences","date":"2023-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LuCeHe/lru_unofficial","path":"src/lruun/tf/linear_recurrent_unit.py","file_url":"https://github.com/LuCeHe/lru_unofficial/blob/HEAD/src/lruun/tf/linear_recurrent_unit.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":"016b28379d1ddb1c","code_sha256_prefix":"016b28379d1ddb1c","mcp_get_code":{"code_sha256":"016b28379d1ddb1c"}},{"arxiv_id":"2111.00396","arxiv_id_is_arxiv":true,"paper":"/paper/efficiently-modeling-long-sequences-with-1","title":"Efficiently Modeling Long Sequences with Structured State Spaces","date":"2021-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"forgi86/lru-reduction","path":"lru/linear.py","file_url":"https://github.com/forgi86/lru-reduction/blob/HEAD/lru/linear.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6aaaac22e971146","code_sha256_prefix":"a6aaaac22e971146","mcp_get_code":{"code_sha256":"a6aaaac22e971146"}}],"record_sha256":"f5ae56132873cce34e3c5e121ba1bf6e0c95a6274fcfa56c8373105c3325d5f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}