{"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/lstm","entry":"LSTM","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":1,"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":9,"n_samples_ran":8,"n_samples_constructed":6,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":5,"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":1,"ran_fixture":0,"ran":7,"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.02763","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-02763","title":"Exposing Vulnerabilities in Explanation for Time Series Classifiers via Dual-Target Attacks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Bohan7/TSEF","path":"experiments/evaluation/tsef_attack.py","file_url":"https://github.com/Bohan7/TSEF/blob/HEAD/experiments/evaluation/tsef_attack.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":"97a59fb232f0fc1d","code_sha256_prefix":"97a59fb232f0fc1d","mcp_get_code":{"code_sha256":"97a59fb232f0fc1d"}},{"arxiv_id":"2511.10859","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-10859","title":"Private Zeroth-Order Optimization with Public Data","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"xuchengong/pazo","path":"experiments/pazo-p.py","file_url":"https://github.com/xuchengong/pazo/blob/HEAD/experiments/pazo-p.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":"812de59c5613a862","code_sha256_prefix":"812de59c5613a862","mcp_get_code":{"code_sha256":"812de59c5613a862"}},{"arxiv_id":"2510.07664","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-07664","title":"FedQS: Optimizing Gradient and Model Aggregation for Semi-Asynchronous Federated Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"bkjod/FedQS_","path":"utils/afl_avg_our.py","file_url":"https://github.com/bkjod/FedQS_/blob/HEAD/utils/afl_avg_our.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, bkjod/FedQS_ when it was checked","code_sha256":"caf82715df0587d8","code_sha256_prefix":"caf82715df0587d8","mcp_get_code":{"code_sha256":"caf82715df0587d8"}},{"arxiv_id":"2410.15731","arxiv_id_is_arxiv":true,"paper":"/paper/ipm-lstm-a-learning-based-interior-point","title":"IPM-LSTM: A Learning-Based Interior Point Method for Solving Nonlinear Programs","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"NetSysOpt/IPM-LSTM","path":"models/LSTM.py","file_url":"https://github.com/NetSysOpt/IPM-LSTM/blob/HEAD/models/LSTM.py","status":"ran","verification_level":1,"contract_check":null,"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, NetSysOpt/IPM-LSTM when it was checked","code_sha256":"a7fdb994579008cb","code_sha256_prefix":"a7fdb994579008cb","mcp_get_code":{"code_sha256":"a7fdb994579008cb"}},{"arxiv_id":"2306.02109","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2306.02109","date":null,"month_inferred_from_arxiv_id":"2023-06","title_source":null,"repo":"mims-harvard/TimeX","path":"txai/models/bc_model.py","file_url":"https://github.com/mims-harvard/TimeX/blob/HEAD/txai/models/bc_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, mims-harvard/TimeX when it was checked","code_sha256":"7e2ec9bb82c35921","code_sha256_prefix":"7e2ec9bb82c35921","mcp_get_code":{"code_sha256":"7e2ec9bb82c35921"}},{"arxiv_id":"2006.16336","arxiv_id_is_arxiv":true,"paper":"/paper/learning-sparse-prototypes-for-text","title":"Learning Sparse Prototypes for Text Generation","date":"2020-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxhe/sparse-text-prototype","path":"sparse_prototype/sp_model.py","file_url":"https://github.com/jxhe/sparse-text-prototype/blob/HEAD/sparse_prototype/sp_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":"718c5ada347d1b35","code_sha256_prefix":"718c5ada347d1b35","mcp_get_code":{"code_sha256":"718c5ada347d1b35"}},{"arxiv_id":"1902.01069","arxiv_id_is_arxiv":true,"paper":"/paper/a-comprehensive-exploration-on-wikisql-with","title":"A Comprehensive Exploration on WikiSQL with Table-Aware Word Contextualization","date":"2019-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qjay612/meta_learning_NL2SQL","path":"src/models/model_wikisql.py","file_url":"https://github.com/qjay612/meta_learning_NL2SQL/blob/HEAD/src/models/model_wikisql.py","status":"ran","verification_level":1,"contract_check":null,"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, qjay612/meta_learning_NL2SQL when it was checked","code_sha256":"ac5d84fb34186021","code_sha256_prefix":"ac5d84fb34186021","mcp_get_code":{"code_sha256":"ac5d84fb34186021"}},{"arxiv_id":"Koo_PartGlot_Learning_Shape_Part_Segmentation_From_Language_Reference_Games_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Koo_PartGlot_Learning_Shape_Part_Segmentation_From_Language_Reference_Games_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"63days/PartGlot","path":"partglot/models/pn_agnostic.py","file_url":"https://github.com/63days/PartGlot/blob/HEAD/partglot/models/pn_agnostic.py","status":"ran","verification_level":1,"contract_check":null,"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, 63days/PartGlot when it was checked","code_sha256":"bfb393be22823eaa","code_sha256_prefix":"bfb393be22823eaa","mcp_get_code":{"code_sha256":"bfb393be22823eaa"}},{"arxiv_id":"2022.acl-long.35","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.acl-long.35","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tjunlp-lab/KaFSP","path":"utils.py","file_url":"https://github.com/tjunlp-lab/KaFSP/blob/HEAD/utils.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":"051b262c77cbb924","code_sha256_prefix":"051b262c77cbb924","mcp_get_code":{"code_sha256":"051b262c77cbb924"}}],"record_sha256":"0e7d8550169c6eb0f180596c3561b1cafef79ea085cf0a8f7e9dbc34034a8af8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}