{"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/flatten-head","entry":"Flatten_Head","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":6,"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":6,"n_samples_ran":6,"n_samples_constructed":6,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_fixture":0,"ran":6,"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":"2602.18473","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-18473","title":"Decentralized Attention Fails Centralized Signals: Rethinking Transformers for Medical Time Series","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"networkslab/MTST","path":"layers/MTST_backbone.py","file_url":"https://github.com/networkslab/MTST/blob/HEAD/layers/MTST_backbone.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, networkslab/MTST when it was checked","code_sha256":"a9bc67a6671e9566","code_sha256_prefix":"a9bc67a6671e9566","mcp_get_code":{"code_sha256":"a9bc67a6671e9566"}},{"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":"46ee27553f379523","code_sha256_prefix":"46ee27553f379523","mcp_get_code":{"code_sha256":"46ee27553f379523"}},{"arxiv_id":"2502.16284","arxiv_id_is_arxiv":true,"paper":"/paper/molspectra-pre-training-3d-molecular","title":"MolSpectra: Pre-training 3D Molecular Representation with Multi-modal Energy Spectra","date":"2025-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"azureleon1/molspectra","path":"torchmdnet/models/Sp.py","file_url":"https://github.com/azureleon1/molspectra/blob/HEAD/torchmdnet/models/Sp.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, azureleon1/molspectra when it was checked","code_sha256":"246f52c6484b0599","code_sha256_prefix":"246f52c6484b0599","mcp_get_code":{"code_sha256":"246f52c6484b0599"}},{"arxiv_id":"2410.12261","arxiv_id_is_arxiv":true,"paper":"/paper/catch-channel-aware-multivariate-time-series","title":"CATCH: Channel-Aware multivariate Time Series Anomaly Detection via Frequency Patching","date":"2024-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"decisionintelligence/catch","path":"ts_benchmark/baselines/catch/CATCH.py","file_url":"https://github.com/decisionintelligence/catch/blob/HEAD/ts_benchmark/baselines/catch/CATCH.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, decisionintelligence/catch when it was checked","code_sha256":"fce9a4ebde3e8479","code_sha256_prefix":"fce9a4ebde3e8479","mcp_get_code":{"code_sha256":"fce9a4ebde3e8479"}},{"arxiv_id":"2401.02236","arxiv_id_is_arxiv":true,"paper":"/paper/u-mixer-an-unet-mixer-architecture-with","title":"U-Mixer: An Unet-Mixer Architecture with Stationarity Correction for Time Series Forecasting","date":"2024-01-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiangMa-Shaun/U-Mixer","path":"models/UMixer.py","file_url":"https://github.com/XiangMa-Shaun/U-Mixer/blob/HEAD/models/UMixer.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, XiangMa-Shaun/U-Mixer when it was checked","code_sha256":"bb074f981fdd7960","code_sha256_prefix":"bb074f981fdd7960","mcp_get_code":{"code_sha256":"bb074f981fdd7960"}},{"arxiv_id":"2211.14730","arxiv_id_is_arxiv":true,"paper":"/paper/a-time-series-is-worth-64-words-long-term","title":"A Time Series is Worth 64 Words: Long-term Forecasting with Transformers","date":"2022-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuqinie98/patchtst","path":"PatchTST_supervised/layers/PatchTST_backbone.py","file_url":"https://github.com/yuqinie98/patchtst/blob/HEAD/PatchTST_supervised/layers/PatchTST_backbone.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":"924854bdeb316b83","code_sha256_prefix":"924854bdeb316b83","mcp_get_code":{"code_sha256":"924854bdeb316b83"}}],"record_sha256":"2ab850c1eb2ea78635b1ce842186479e9d2b04a032a5a2e32b11e60f0f05465f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}