{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CYPTMB6MD2MEIU2DBRH3UW4K6E","short_pith_number":"pith:CYPTMB6M","schema_version":"1.0","canonical_sha256":"161f3607cc1e984453430c4fba5b8af101f28922fb19f1258759ddb26f65dd95","source":{"kind":"arxiv","id":"2309.08499","version":4},"attestation_state":"computed","paper":{"title":"POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Deepu John, Lei Huang, Qingyuan Wang, Shaowu Chen, Weize Sun, Xiaopeng Li","submitted_at":"2023-09-15T16:03:23Z","abstract_excerpt":"In recent years, two competitive time series classification models, namely, ROCKET and MINIROCKET, have garnered considerable attention due to their low training cost and high accuracy. However, they rely on a large number of random 1-D convolutional kernels to comprehensively capture features, which is incompatible with resource-constrained devices. Despite the development of heuristic algorithms designed to recognize and prune redundant kernels, the inherent time-consuming nature of evolutionary algorithms hinders efficient evaluation. To efficiently prune models, this paper eliminates featu"},"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":"2309.08499","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-15T16:03:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3eea1cbc7362049bc1788b689fbbbace0c06c581e18eb2343fae63fde4b94a13","abstract_canon_sha256":"67880f44c85e0bbd2a4c9dba8acb224b4fb34372289b380a409542d14b4986a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:11.016203Z","signature_b64":"Cbhss4oNXG2pnv2J6vk82l74mmY3jrNB0UYBvBiKY5Znp2Wt049m3MSncjvJzLuMa1Qs9LmSfOznki13ty8kBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161f3607cc1e984453430c4fba5b8af101f28922fb19f1258759ddb26f65dd95","last_reissued_at":"2026-07-05T08:48:11.015732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:11.015732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"POCKET: Pruning Random Convolution Kernels for Time Series Classification from a Feature Selection Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Deepu John, Lei Huang, Qingyuan Wang, Shaowu Chen, Weize Sun, Xiaopeng Li","submitted_at":"2023-09-15T16:03:23Z","abstract_excerpt":"In recent years, two competitive time series classification models, namely, ROCKET and MINIROCKET, have garnered considerable attention due to their low training cost and high accuracy. However, they rely on a large number of random 1-D convolutional kernels to comprehensively capture features, which is incompatible with resource-constrained devices. Despite the development of heuristic algorithms designed to recognize and prune redundant kernels, the inherent time-consuming nature of evolutionary algorithms hinders efficient evaluation. To efficiently prune models, this paper eliminates featu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.08499","kind":"arxiv","version":4},"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/2309.08499/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":"2309.08499","created_at":"2026-07-05T08:48:11.015790+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.08499v4","created_at":"2026-07-05T08:48:11.015790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.08499","created_at":"2026-07-05T08:48:11.015790+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYPTMB6MD2ME","created_at":"2026-07-05T08:48:11.015790+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYPTMB6MD2MEIU2D","created_at":"2026-07-05T08:48:11.015790+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYPTMB6M","created_at":"2026-07-05T08:48:11.015790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.01115","citing_title":"Time series classification with random convolution kernels: pooling operators and input representations matter","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E","json":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E.json","graph_json":"https://pith.science/api/pith-number/CYPTMB6MD2MEIU2DBRH3UW4K6E/graph.json","events_json":"https://pith.science/api/pith-number/CYPTMB6MD2MEIU2DBRH3UW4K6E/events.json","paper":"https://pith.science/paper/CYPTMB6M"},"agent_actions":{"view_html":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E","download_json":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E.json","view_paper":"https://pith.science/paper/CYPTMB6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.08499&json=true","fetch_graph":"https://pith.science/api/pith-number/CYPTMB6MD2MEIU2DBRH3UW4K6E/graph.json","fetch_events":"https://pith.science/api/pith-number/CYPTMB6MD2MEIU2DBRH3UW4K6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E/action/storage_attestation","attest_author":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E/action/author_attestation","sign_citation":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E/action/citation_signature","submit_replication":"https://pith.science/pith/CYPTMB6MD2MEIU2DBRH3UW4K6E/action/replication_record"}},"created_at":"2026-07-05T08:48:11.015790+00:00","updated_at":"2026-07-05T08:48:11.015790+00:00"}