{"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/glu","entry":"GLU","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":0,"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":14,"n_samples_ran":13,"n_samples_constructed":5,"n_samples_ran_checked":13,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":11,"n_places":14,"n_places_pointer_only":2,"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":0,"ran_fixture":0,"ran":13,"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":"2607.27106","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-27106","title":"Hierarchical Spatio-Temporal Transformer for Coherent Emergency Department Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"FilipaLino/HierSTT","path":"common/hierarchical_model.py","file_url":"https://github.com/FilipaLino/HierSTT/blob/HEAD/common/hierarchical_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"38e93d651e929d27","code_sha256_prefix":"38e93d651e929d27","mcp_get_code":{"code_sha256":"38e93d651e929d27"}},{"arxiv_id":"2605.09742","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09742","title":"TIDES: Implicit Time-Awareness in Selective State Space Models","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TaylanSoydan/TIDES","path":"tides/tides.py","file_url":"https://github.com/TaylanSoydan/TIDES/blob/HEAD/tides/tides.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc872c49688e5003","code_sha256_prefix":"bc872c49688e5003","mcp_get_code":{"code_sha256":"bc872c49688e5003"}},{"arxiv_id":"2604.10169","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-10169","title":"MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"duanwenchang/MAVEN-T","path":"Teacher/teacher_model.py","file_url":"https://github.com/duanwenchang/MAVEN-T/blob/HEAD/Teacher/teacher_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, duanwenchang/MAVEN-T when it was checked","code_sha256":"d3e4890c66ff6867","code_sha256_prefix":"d3e4890c66ff6867","mcp_get_code":{"code_sha256":"d3e4890c66ff6867"}},{"arxiv_id":"2503.12295","arxiv_id_is_arxiv":true,"paper":"/paper/towards-learning-high-precision-least-squares","title":"Towards Learning High-Precision Least Squares Algorithms with Sequence Models","date":"2025-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HazyResearch/precision-ls","path":"src/models/gpt2.py","file_url":"https://github.com/HazyResearch/precision-ls/blob/HEAD/src/models/gpt2.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":"9e9cb8d5e05b5a61","code_sha256_prefix":"9e9cb8d5e05b5a61","mcp_get_code":{"code_sha256":"9e9cb8d5e05b5a61"}},{"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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb21c6dcd5f470d8","code_sha256_prefix":"eb21c6dcd5f470d8","mcp_get_code":{"code_sha256":"eb21c6dcd5f470d8"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"upskyy/Squeezeformer","path":"squeezeformer/model.py","file_url":"https://github.com/upskyy/Squeezeformer/blob/HEAD/squeezeformer/model.py","status":"ran","verification_level":1,"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":"46a7b3e64f094c31","code_sha256_prefix":"46a7b3e64f094c31","mcp_get_code":{"code_sha256":"46a7b3e64f094c31"}},{"arxiv_id":"2206.00888","arxiv_id_is_arxiv":true,"paper":"/paper/squeezeformer-an-efficient-transformer-for","title":"Squeezeformer: An Efficient Transformer for Automatic Speech Recognition","date":"2022-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kssteven418/squeezeformer","path":"src/models/conformer_encoder.py","file_url":"https://github.com/kssteven418/squeezeformer/blob/HEAD/src/models/conformer_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"35285e7d41e8ab62","code_sha256_prefix":"35285e7d41e8ab62","mcp_get_code":{"code_sha256":"35285e7d41e8ab62"}},{"arxiv_id":"2111.01007","arxiv_id_is_arxiv":true,"paper":"/paper/projected-gans-converge-faster","title":"Projected GANs Converge Faster","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dome272/ProjectedGAN-pytorch","path":"projected_gan.py","file_url":"https://github.com/dome272/ProjectedGAN-pytorch/blob/HEAD/projected_gan.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"daa6b7ac4d6d0dfe","code_sha256_prefix":"daa6b7ac4d6d0dfe","mcp_get_code":{"code_sha256":"daa6b7ac4d6d0dfe"}},{"arxiv_id":"2110.13985","arxiv_id_is_arxiv":true,"paper":"/paper/combining-recurrent-convolutional-and","title":"Combining Recurrent, Convolutional, and Continuous-time Models with Linear State-Space Layers","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazyresearch/state-spaces","path":"src/models/sequence/modules/lssl.py","file_url":"https://github.com/hazyresearch/state-spaces/blob/HEAD/src/models/sequence/modules/lssl.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"593ca2707277f71e","code_sha256_prefix":"593ca2707277f71e","mcp_get_code":{"code_sha256":"593ca2707277f71e"}},{"arxiv_id":"2103.09420","arxiv_id_is_arxiv":true,"paper":"/paper/improving-zero-shot-voice-style-transfer-via-1","title":"Improving Zero-shot Voice Style Transfer via Disentangled Representation Learning","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jackaduma/CycleGAN-VC2","path":"model_tf.py","file_url":"https://github.com/jackaduma/CycleGAN-VC2/blob/HEAD/model_tf.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cae1876ac552d841","code_sha256_prefix":"cae1876ac552d841","mcp_get_code":{"code_sha256":"cae1876ac552d841"}},{"arxiv_id":"2103.07719","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-temporal-graph-neural-network-for-1","title":"Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting","date":"2021-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abdulmajid-murad/deep_probabilistic_forecast","path":"probabilistic_forecast/utils/gnn_utils.py","file_url":"https://github.com/abdulmajid-murad/deep_probabilistic_forecast/blob/HEAD/probabilistic_forecast/utils/gnn_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b2565ba72dc20edd","code_sha256_prefix":"b2565ba72dc20edd","mcp_get_code":{"code_sha256":"b2565ba72dc20edd"}},{"arxiv_id":"2103.07719","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-temporal-graph-neural-network-for-1","title":"Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting","date":"2021-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WenjieDu/PyPOTS","path":"pypots/nn/modules/stemgnn/backbone.py","file_url":"https://github.com/WenjieDu/PyPOTS/blob/HEAD/pypots/nn/modules/stemgnn/backbone.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"95172885d816bacd","code_sha256_prefix":"95172885d816bacd","mcp_get_code":{"code_sha256":"95172885d816bacd"}},{"arxiv_id":"2010.12136","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-generative-adversarial-networks","title":"Lightweight Generative Adversarial Networks for Text-Guided Image Manipulation","date":"2020-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrlibw/Lightweight-Manipulation","path":"code/model.py","file_url":"https://github.com/mrlibw/Lightweight-Manipulation/blob/HEAD/code/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, mrlibw/Lightweight-Manipulation when it was checked","code_sha256":"13397a8c9e722b98","code_sha256_prefix":"13397a8c9e722b98","mcp_get_code":{"code_sha256":"13397a8c9e722b98"}},{"arxiv_id":"1511.06434","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-representation-learning-with-1","title":"Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks","date":"2015-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pioneerAlpha/BanglaText2ImageGeneration","path":"code/model.py","file_url":"https://github.com/pioneerAlpha/BanglaText2ImageGeneration/blob/HEAD/code/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92ca15416853f3da","code_sha256_prefix":"92ca15416853f3da","mcp_get_code":{"code_sha256":"92ca15416853f3da"}}],"record_sha256":"5d154fd6b9e79674da0138c6d040082949d4cc2ae339951555a37953b77d76f9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}