{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LVIASKFRNNT3B56HJYIVJI4ZI2","short_pith_number":"pith:LVIASKFR","schema_version":"1.0","canonical_sha256":"5d500928b16b67b0f7c74e1154a399469e6b9dca8485de7bd2edb681158d39fc","source":{"kind":"arxiv","id":"1910.13051","version":1},"attestation_state":"computed","paper":{"title":"ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Angus Dempster, Fran\\c{c}ois Petitjean, Geoffrey I. Webb","submitted_at":"2019-10-29T02:48:56Z","abstract_excerpt":"Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many existing methods focus on a single type of feature such as shape or frequency. Building on the recent success of convolutional neural networks for time series classification, we show that simple linear classifiers using random convolutional kernels achieve state-of-the-art accuracy with a fraction of the computational expense of existing methods."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1910.13051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-10-29T02:48:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"bb07923333f06cb84404c47c13bd2188dfef0dbb52ba274868bdb165980030e9","abstract_canon_sha256":"ec2a04ce0ca958799c716304bd938d926445baadb989d17d912489d449dc209a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:57:48.978332Z","signature_b64":"hDcCQJOf6AAOh7mpwWW6Og5AJ6pqNjGo4Mm6wlNioeAuOe0P2vcn0EAc2GsxsgILpZA//edolp2dBYXyPuZWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d500928b16b67b0f7c74e1154a399469e6b9dca8485de7bd2edb681158d39fc","last_reissued_at":"2026-07-05T02:57:48.977927Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:57:48.977927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Angus Dempster, Fran\\c{c}ois Petitjean, Geoffrey I. Webb","submitted_at":"2019-10-29T02:48:56Z","abstract_excerpt":"Most methods for time series classification that attain state-of-the-art accuracy have high computational complexity, requiring significant training time even for smaller datasets, and are intractable for larger datasets. Additionally, many existing methods focus on a single type of feature such as shape or frequency. Building on the recent success of convolutional neural networks for time series classification, we show that simple linear classifiers using random convolutional kernels achieve state-of-the-art accuracy with a fraction of the computational expense of existing methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.13051","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.13051/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1910.13051","created_at":"2026-07-05T02:57:48.977984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.13051v1","created_at":"2026-07-05T02:57:48.977984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.13051","created_at":"2026-07-05T02:57:48.977984+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVIASKFRNNT3","created_at":"2026-07-05T02:57:48.977984+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVIASKFRNNT3B56H","created_at":"2026-07-05T02:57:48.977984+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVIASKFR","created_at":"2026-07-05T02:57:48.977984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07500","citing_title":"TimEE: End-to-end Time Series Classification via In-Context Learning","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30410","citing_title":"Beyond IID: How General Are Tabular Foundation Models, Really?","ref_index":153,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21070","citing_title":"Towards Understanding Self-Pretraining for Sequence Classification","ref_index":204,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2","json":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2.json","graph_json":"https://pith.science/api/pith-number/LVIASKFRNNT3B56HJYIVJI4ZI2/graph.json","events_json":"https://pith.science/api/pith-number/LVIASKFRNNT3B56HJYIVJI4ZI2/events.json","paper":"https://pith.science/paper/LVIASKFR"},"agent_actions":{"view_html":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2","download_json":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2.json","view_paper":"https://pith.science/paper/LVIASKFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.13051&json=true","fetch_graph":"https://pith.science/api/pith-number/LVIASKFRNNT3B56HJYIVJI4ZI2/graph.json","fetch_events":"https://pith.science/api/pith-number/LVIASKFRNNT3B56HJYIVJI4ZI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2/action/storage_attestation","attest_author":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2/action/author_attestation","sign_citation":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2/action/citation_signature","submit_replication":"https://pith.science/pith/LVIASKFRNNT3B56HJYIVJI4ZI2/action/replication_record"}},"created_at":"2026-07-05T02:57:48.977984+00:00","updated_at":"2026-07-05T02:57:48.977984+00:00"}