{"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/detrend","entry":"detrend","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":4,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"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":"2606.05878","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-05878","title":"TS-ICL: A Flexible Time-Indexed Foundation Model for Time Series via In-Context Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"PriorLabs/tabpfn-time-series","path":"tabpfn_time_series/features/auto_features.py","file_url":"https://github.com/PriorLabs/tabpfn-time-series/blob/HEAD/tabpfn_time_series/features/auto_features.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f84654221eb0299e","code_sha256_prefix":"f84654221eb0299e","mcp_get_code":{"code_sha256":"f84654221eb0299e"}},{"arxiv_id":"2501.02945","arxiv_id_is_arxiv":true,"paper":"/paper/the-tabular-foundation-model-tabpfn","title":"The Tabular Foundation Model TabPFN Outperforms Specialized Time Series Forecasting Models Based on Simple Features","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liam-sbhoo/tabpfn-time-series","path":"tabpfn_time_series/features/auto_features.py","file_url":"https://github.com/liam-sbhoo/tabpfn-time-series/blob/HEAD/tabpfn_time_series/features/auto_features.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f84654221eb0299e","code_sha256_prefix":"f84654221eb0299e","mcp_get_code":{"code_sha256":"f84654221eb0299e"}},{"arxiv_id":"2411.01542","arxiv_id_is_arxiv":true,"paper":"/paper/factorizephys-matrix-factorization-for","title":"FactorizePhys: Matrix Factorization for Multidimensional Attention in Remote Physiological Sensing","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhysiologicAILab/FactorizePhys","path":"unsupervised_methods/utils.py","file_url":"https://github.com/PhysiologicAILab/FactorizePhys/blob/HEAD/unsupervised_methods/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, PhysiologicAILab/FactorizePhys (NOASSERTION)","code_sha256":"36f109f3279e5640","code_sha256_prefix":"36f109f3279e5640","mcp_get_code":{"code_sha256":"36f109f3279e5640"}},{"arxiv_id":"2407.13974","arxiv_id_is_arxiv":true,"paper":"/paper/continual-learning-for-remote-physiological","title":"Continual Learning for Remote Physiological Measurement: Minimize Forgetting and Simplify Inference","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MayYoY/rPPGDIL","path":"evaluate/postprocess.py","file_url":"https://github.com/MayYoY/rPPGDIL/blob/HEAD/evaluate/postprocess.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"74b59eab5b0e9530","code_sha256_prefix":"74b59eab5b0e9530","mcp_get_code":{"code_sha256":"74b59eab5b0e9530"}},{"arxiv_id":"2404.06483","arxiv_id_is_arxiv":true,"paper":"/paper/rhythmmamba-fast-remote-physiological","title":"RhythmMamba: Fast Remote Physiological Measurement with Arbitrary Length Videos","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zizheng-guo/rhythmmamba","path":"unsupervised_methods/utils.py","file_url":"https://github.com/zizheng-guo/rhythmmamba/blob/HEAD/unsupervised_methods/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from PhysiologicAILab/FactorizePhys, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"36f109f3279e5640","code_sha256_prefix":"36f109f3279e5640","mcp_get_code":{"code_sha256":"36f109f3279e5640"}},{"arxiv_id":"2207.02777","arxiv_id_is_arxiv":true,"paper":"/paper/don-t-pay-attention-to-the-noise-learning","title":"Don't Pay Attention to the Noise: Learning Self-supervised Representations of Light Curves with a Denoising Time Series Transformer","date":"2022-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariomorvan/denoising-time-series-transformer","path":"models/models.py","file_url":"https://github.com/mariomorvan/denoising-time-series-transformer/blob/HEAD/models/models.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, mariomorvan/denoising-time-series-transformer, is not in the permissive set Syntology serves inline","code_sha256":"1b6804b7cf69d1b7","code_sha256_prefix":"1b6804b7cf69d1b7","mcp_get_code":{"code_sha256":"1b6804b7cf69d1b7"}},{"arxiv_id":"2006.03790","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-temporal-shift-attention-networks","title":"Multi-Task Temporal Shift Attention Networks for On-Device Contactless Vitals Measurement","date":"2020-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xin71/MTTS-CAN","path":"code/inference_preprocess.py","file_url":"https://github.com/xin71/MTTS-CAN/blob/HEAD/code/inference_preprocess.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":"9f063d3ca0da3fcd","code_sha256_prefix":"9f063d3ca0da3fcd","mcp_get_code":{"code_sha256":"9f063d3ca0da3fcd"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"colaprograms/speechify","path":"util/spectrogram_generator.py","file_url":"https://github.com/colaprograms/speechify/blob/HEAD/util/spectrogram_generator.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, colaprograms/speechify when it was checked","code_sha256":"4e5663ad841caf95","code_sha256_prefix":"4e5663ad841caf95","mcp_get_code":{"code_sha256":"4e5663ad841caf95"}}],"record_sha256":"16c42c282bda5b0085331a63ab64abf8d3127410f04090bacfb7de408a943c8a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}