{"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":"/method/inceptiontime","slug":"inceptiontime","name":"InceptionTime","full_name":"InceptionTime","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"InceptionTime: Finding AlexNet for Time Series Classification","paper":"/paper/dreamtime-finding-alexnet-for-time-series","first_author":"Hassan Ismail Fawaz","n_authors":10,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/dreamtime-finding-alexnet-for-time-series"},"source":{"url":"https://arxiv.org/abs/1909.04939v3","title":"InceptionTime: Finding AlexNet for Time Series Classification","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Sequential","area_id":"sequential","collection":"Time Series Analysis","url":"/methods/category/time-series-analysis","pwc_aliases":[]}],"n_papers_tagged":19,"archive_num_papers":19,"papers_newest_first":[{"paper":null,"slug":"few-shot-learning-for-industrial-time-series","title":"Few-Shot Learning for Industrial Time Series: A Comparative Analysis Using the Example of Screw-Fastening Process Monitoring","date":"2025-06-16","arxiv_id":"2506.13909","n_code_links":0,"syntology":null},{"paper":null,"slug":"breast-lump-detection-and-localization-with-a","title":"Breast Lump Detection and Localization with a Tactile Glove Using Deep Learning","date":"2025-02-15","arxiv_id":"2502.15767","n_code_links":0,"syntology":null},{"paper":"/paper/look-into-the-lite-in-deep-learning-for-time","slug":"look-into-the-lite-in-deep-learning-for-time","title":"Look Into the LITE in Deep Learning for Time Series Classification","date":"2024-09-04","arxiv_id":"2409.02869","n_code_links":1,"syntology":null},{"paper":null,"slug":"ecrtime-ensemble-integration-of","title":"ECRTime: Ensemble Integration of Classification and Retrieval for Time Series Classification","date":"2024-07-20","arxiv_id":"2407.14735","n_code_links":0,"syntology":null},{"paper":null,"slug":"data-augmentation-for-multivariate-time","title":"Data Augmentation for Multivariate Time Series Classification: An Experimental Study","date":"2024-06-10","arxiv_id":"2406.06518","n_code_links":0,"syntology":null},{"paper":null,"slug":"inceptiontime-vs-wavelet-a-comparison-for","title":"InceptionTime vs. Wavelet -- A comparison for time series classification","date":"2024-03-27","arxiv_id":"2403.18687","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-learning-for-time-series-classification-3","title":"Deep Learning for Time Series Classification of Parkinson's Disease Eye Tracking Data","date":"2023-11-28","arxiv_id":"2311.16381","n_code_links":0,"syntology":null},{"paper":null,"slug":"time-series-classification-in-smart","title":"Time-Series Classification in Smart Manufacturing Systems: An Experimental Evaluation of State-of-the-Art Machine Learning Algorithms","date":"2023-10-04","arxiv_id":"2310.02812","n_code_links":0,"syntology":null},{"paper":"/paper/detach-rocket-sequential-feature-selection","slug":"detach-rocket-sequential-feature-selection","title":"Detach-ROCKET: Sequential feature selection for time series classification with random convolutional kernels","date":"2023-09-25","arxiv_id":"2309.14518","n_code_links":1,"syntology":null},{"paper":null,"slug":"an-automated-machine-learning-approach-for","title":"An Automated Machine Learning Approach for Detecting Anomalous Peak Patterns in Time Series Data from a Research Watershed in the Northeastern United States Critical Zone","date":"2023-09-14","arxiv_id":"2309.07992","n_code_links":0,"syntology":null},{"paper":"/paper/unsupervised-feature-based-algorithms-for","slug":"unsupervised-feature-based-algorithms-for","title":"Unsupervised Feature Based Algorithms for Time Series Extrinsic Regression","date":"2023-05-02","arxiv_id":"2305.01429","n_code_links":1,"syntology":null},{"paper":"/paper/time-series-classification-for-detecting","slug":"time-series-classification-for-detecting","title":"Time Series Classification for Detecting Parkinson's Disease from Wrist Motions","date":"2023-04-21","arxiv_id":"2304.11265","n_code_links":1,"syntology":null},{"paper":"/paper/deep-learning-architectures-for-fscv-a","slug":"deep-learning-architectures-for-fscv-a","title":"Deep Learning Architectures for FSCV, a Comparison","date":"2022-12-05","arxiv_id":"2212.01960","n_code_links":1,"syntology":null},{"paper":null,"slug":"quantifying-quality-of-class-conditional","title":"Quantifying Quality of Class-Conditional Generative Models in Time-Series Domain","date":"2022-10-14","arxiv_id":"2210.07617","n_code_links":0,"syntology":null},{"paper":null,"slug":"benchmarking-online-sequence-to-sequence-and","title":"Benchmarking Online Sequence-to-Sequence and Character-based Handwriting Recognition from IMU-Enhanced Pens","date":"2022-02-14","arxiv_id":"2202.07036","n_code_links":0,"syntology":null},{"paper":null,"slug":"robust-augmentation-for-multivariate-time","title":"Robust Augmentation for Multivariate Time Series Classification","date":"2022-01-27","arxiv_id":"2201.11739","n_code_links":0,"syntology":null},{"paper":null,"slug":"kdctime-knowledge-distillation-with","title":"KDCTime: Knowledge Distillation with Calibration on InceptionTime for Time-series Classification","date":"2021-12-04","arxiv_id":"2112.02291","n_code_links":0,"syntology":null},{"paper":"/paper/atcn-agile-temporal-convolutional-networks","slug":"atcn-agile-temporal-convolutional-networks","title":"ATCN: Resource-Efficient Processing of Time Series on Edge","date":"2020-11-10","arxiv_id":"2011.05260","n_code_links":1,"syntology":null},{"paper":"/paper/dreamtime-finding-alexnet-for-time-series","slug":"dreamtime-finding-alexnet-for-time-series","title":"InceptionTime: Finding AlexNet for Time Series Classification","date":"2019-09-11","arxiv_id":"1909.04939","n_code_links":10,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["hfawaz/InceptionTime"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}}],"papers_shown":19,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":19,"with_a_code_link":7,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":19,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/method/inceptiontime/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/inceptiontime/papers/ran/1","json":"/method/inceptiontime/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/time-series-1","name":"Time Series","papers":17},{"task":"/task/time-series-classification","name":"Time Series Classification","papers":13},{"task":"/task/time-series","name":"Time Series Analysis","papers":8},{"task":"/task/classification-1","name":"Classification","papers":3},{"task":"/task/deep-learning","name":"Deep Learning","papers":3},{"task":"/task/anomaly-detection","name":"Anomaly Detection","papers":2},{"task":"/task/benchmarking","name":"Benchmarking","papers":2},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":1},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":1},{"task":"/task/fault-detection","name":"Fault Detection","papers":1},{"task":"/task/feature-importance","name":"Feature Importance","papers":1},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":1},{"task":"/task/handwriting-recognition","name":"Handwriting Recognition","papers":1},{"task":"/task/heartbeat-classification","name":"Heartbeat Classification","papers":1},{"task":"/task/hyperparameter-optimization","name":"Hyperparameter Optimization","papers":1},{"task":"/task/knowledge-distillation","name":"Knowledge Distillation","papers":1},{"task":"/task/meta-learning","name":"Meta-Learning","papers":1},{"task":"/task/metric-learning","name":"Metric Learning","papers":1},{"task":"/task/retrieval","name":"Retrieval","papers":1}],"tasks_shown":20,"n_tasks":25,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":4},{"year":"2023","papers":6},{"year":"2024","papers":4},{"year":"2025","papers":2}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/inceptiontime"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=InceptionTime","read_at":"2026-10-05T00:58:01+00:00","query":"InceptionTime","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1909.04939"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"1909.04939","repositories":{"listed":10,"in_graph":10,"list_truncated":false,"strongest_link":"official"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1909.04939')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1909.04939","citations":1750},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'InceptionTime'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"1909.04939","page":"/paper/dreamtime-finding-alexnet-for-time-series","syntology_url":"https://syntology.ai/paper/1909.04939","in_graph_layer":true,"samples":3,"ran":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 10 listed of 10 in the graph, strongest link: official. The lookup matched a paper by its title, arXiv:1909.04939, not a method entry. This answer is about arXiv:1909.04939, the paper the archive credits with this method.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"b359f6f7bdf7fc115195e5751012c6418be936f833822a7207958f81bf011072","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}