{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/encoderlstm","entry":"EncoderLSTM","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2601.11190","paper":"/paper/arxiv-2601-11190","title":"DOREMI: Optimizing Long Tail Predictions in Document-Level Relation Extraction ⋆","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"mntlra/DOREMI","path":"src/models/ContextAware.py","file_url":"https://github.com/mntlra/DOREMI/blob/HEAD/src/models/ContextAware.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a6a0cf6edd2f4cdb","mcp_get_code":{"code_sha256":"a6a0cf6edd2f4cdb"}},{"arxiv_id":"2203.14936","paper":"/paper/fedvln-privacy-preserving-federated-vision","title":"FedVLN: Privacy-preserving Federated Vision-and-Language Navigation","date":"2022-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eric-ai-lab/FedVLN","path":"r2r_src/agent.py","file_url":"https://github.com/eric-ai-lab/FedVLN/blob/HEAD/r2r_src/agent.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d01ddaeb112df7d8","mcp_get_code":{"code_sha256":"d01ddaeb112df7d8"}},{"arxiv_id":"2106.01793","paper":"/paper/three-sentences-are-all-you-need-local-path","title":"Three Sentences Are All You Need: Local Path Enhanced Document Relation Extraction","date":"2021-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndrewZhe/Three-Sentences-Are-All-You-Need","path":"src/model/localEncoder.py","file_url":"https://github.com/AndrewZhe/Three-Sentences-Are-All-You-Need/blob/HEAD/src/model/localEncoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3d13789b159908dc","mcp_get_code":{"code_sha256":"3d13789b159908dc"}},{"arxiv_id":"2103.07854","paper":"/paper/three-steps-to-multimodal-trajectory","title":"Three Steps to Multimodal Trajectory Prediction: Modality Clustering, Classification and Synthesis","date":"2021-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ApeironY/PCCSNet","path":"PCCSNet/models/components.py","file_url":"https://github.com/ApeironY/PCCSNet/blob/HEAD/PCCSNet/models/components.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8cfa5370af11cd9b","mcp_get_code":{"code_sha256":"8cfa5370af11cd9b"}},{"arxiv_id":"1809.10341","paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sean-Bin-Yang/Path-InfoMax","path":"models/pim.py","file_url":"https://github.com/Sean-Bin-Yang/Path-InfoMax/blob/HEAD/models/pim.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a35f79723ddacf3","mcp_get_code":{"code_sha256":"9a35f79723ddacf3"}}]}