{"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/dataembedding","entry":"DataEmbedding","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":8,"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":13,"n_samples_ran":11,"n_samples_constructed":10,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":6,"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":11,"unverified":2},"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":"2605.24523","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-24523","title":"MindAlign: Bridging EEG, Vision, and Language for Zero-Shot Visual Decoding","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"anon-eeg/eeg_image_decoding","path":"eeg_encoders.py","file_url":"https://github.com/anon-eeg/eeg_image_decoding/blob/HEAD/eeg_encoders.py","status":"unverified","verification_level":0,"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, anon-eeg/eeg_image_decoding when it was checked","code_sha256":"de3a521327a94430","code_sha256_prefix":"de3a521327a94430","mcp_get_code":{"code_sha256":"de3a521327a94430"}},{"arxiv_id":"2605.21550","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-21550","title":"PeakFocus: Bridging Peak Localization and Intensity Regression via a Unified Multi-Scale Framework for Electricity Load Forecasting","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"TongjiFinLab/PeakFocus","path":"models/proposed_model.py","file_url":"https://github.com/TongjiFinLab/PeakFocus/blob/HEAD/models/proposed_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c33c8191c5dcdf84","code_sha256_prefix":"c33c8191c5dcdf84","mcp_get_code":{"code_sha256":"c33c8191c5dcdf84"}},{"arxiv_id":"2510.22655","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22655","title":"Learning Without Augmenting: Unsupervised Time Series Representation Learning via Frame Projections","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"thuml/SimMTM","path":"SimMTM_Forecasting/models/SimMTM.py","file_url":"https://github.com/thuml/SimMTM/blob/HEAD/SimMTM_Forecasting/models/SimMTM.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thuml/SimMTM when it was checked","code_sha256":"13e6a08aa0002a5f","code_sha256_prefix":"13e6a08aa0002a5f","mcp_get_code":{"code_sha256":"13e6a08aa0002a5f"}},{"arxiv_id":"2506.03964","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.03964","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"kimanki/CAROTS","path":"models/carots/modeling_carots.py","file_url":"https://github.com/kimanki/CAROTS/blob/HEAD/models/carots/modeling_carots.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, kimanki/CAROTS (NOASSERTION)","code_sha256":"a57a3fdfd950fb4d","code_sha256_prefix":"a57a3fdfd950fb4d","mcp_get_code":{"code_sha256":"a57a3fdfd950fb4d"}},{"arxiv_id":"2406.14399","arxiv_id_is_arxiv":true,"paper":"/paper/weather-5k-a-large-scale-global-station","title":"How far are today's time-series models from real-world weather forecasting applications?","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taohan10200/weather-5k","path":"models/Corrformer.py","file_url":"https://github.com/taohan10200/weather-5k/blob/HEAD/models/Corrformer.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":"c4a745f5f73145a0","code_sha256_prefix":"c4a745f5f73145a0","mcp_get_code":{"code_sha256":"c4a745f5f73145a0"}},{"arxiv_id":"2403.05406","arxiv_id_is_arxiv":true,"paper":"/paper/considering-nonstationary-within-multivariate","title":"Considering Nonstationary within Multivariate Time Series with Variational Hierarchical Transformer for Forecasting","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flare200020/HTV_Trans","path":"HTV-Trans/models.py","file_url":"https://github.com/flare200020/HTV_Trans/blob/HEAD/HTV-Trans/models.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, flare200020/HTV_Trans when it was checked","code_sha256":"a3fa5fe34f49177a","code_sha256_prefix":"a3fa5fe34f49177a","mcp_get_code":{"code_sha256":"a3fa5fe34f49177a"}},{"arxiv_id":"2301.07945","arxiv_id_is_arxiv":true,"paper":"/paper/pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BUAABIGSCity/PDFormer","path":"libcity/model/traffic_flow_prediction/PDFormer.py","file_url":"https://github.com/BUAABIGSCity/PDFormer/blob/HEAD/libcity/model/traffic_flow_prediction/PDFormer.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":"6f259d5e72269ce1","code_sha256_prefix":"6f259d5e72269ce1","mcp_get_code":{"code_sha256":"6f259d5e72269ce1"}},{"arxiv_id":"2212.08151","arxiv_id_is_arxiv":true,"paper":"/paper/first-de-trend-then-attend-rethinking","title":"First De-Trend then Attend: Rethinking Attention for Time-Series Forecasting","date":"2022-12-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BeBeYourLove/TDformer","path":"model/TDformer.py","file_url":"https://github.com/BeBeYourLove/TDformer/blob/HEAD/model/TDformer.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, BeBeYourLove/TDformer when it was checked","code_sha256":"68aca50b866b5c44","code_sha256_prefix":"68aca50b866b5c44","mcp_get_code":{"code_sha256":"68aca50b866b5c44"}},{"arxiv_id":"2012.07436","arxiv_id_is_arxiv":true,"paper":"/paper/informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martinwhl/Informer-PyTorch-Lightning","path":"models/informer/model.py","file_url":"https://github.com/martinwhl/Informer-PyTorch-Lightning/blob/HEAD/models/informer/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb33a7664fc29bcd","code_sha256_prefix":"cb33a7664fc29bcd","mcp_get_code":{"code_sha256":"cb33a7664fc29bcd"}},{"arxiv_id":"2012.07436","arxiv_id_is_arxiv":true,"paper":"/paper/informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"larsbentsen/fftransformer","path":"models/Informer.py","file_url":"https://github.com/larsbentsen/fftransformer/blob/HEAD/models/Informer.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, larsbentsen/fftransformer when it was checked","code_sha256":"3103f383ce197db7","code_sha256_prefix":"3103f383ce197db7","mcp_get_code":{"code_sha256":"3103f383ce197db7"}},{"arxiv_id":"2012.07436","arxiv_id_is_arxiv":true,"paper":"/paper/informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndrzejMiskow/TradeAI","path":"prediction_service/transformers/models.py","file_url":"https://github.com/AndrzejMiskow/TradeAI/blob/HEAD/prediction_service/transformers/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3585c641aefa6f6a","code_sha256_prefix":"3585c641aefa6f6a","mcp_get_code":{"code_sha256":"3585c641aefa6f6a"}},{"arxiv_id":"2012.07436","arxiv_id_is_arxiv":true,"paper":"/paper/informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tianhai123/Informer-Tensorflow","path":"models/model.py","file_url":"https://github.com/tianhai123/Informer-Tensorflow/blob/HEAD/models/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":"e430cc85d15ea52c","code_sha256_prefix":"e430cc85d15ea52c","mcp_get_code":{"code_sha256":"e430cc85d15ea52c"}},{"arxiv_id":"2012.07436","arxiv_id_is_arxiv":true,"paper":"/paper/informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhouhaoyi/Informer2020","path":"models/model.py","file_url":"https://github.com/zhouhaoyi/Informer2020/blob/HEAD/models/model.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":"f9aee011366d797d","code_sha256_prefix":"f9aee011366d797d","mcp_get_code":{"code_sha256":"f9aee011366d797d"}}],"record_sha256":"55f96f3bbd7b8fa9d10dae156dc5324406bc6ceeaee7960af54d426b9e4b12a1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}