{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_5d55a76a5efaae47ff793dab336a95cd10075240a42c6f7f2e7c57b548ce10b0","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_5d55a76a5efaae47ff793dab336a95cd10075240a42c6f7f2e7c57b548ce10b0","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"08691e11b77f1673bb11a25e4b7ccd2cecca14d0d04a6ac1c26296483b2461f4","published":"Thu, 09 Jul 2026 00:00:00 -0400","receipt_hash":"08691e11b77f1673bb11a25e4b7ccd2cecca14d0d04a6ac1c26296483b2461f4","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"08691e11b77f1673bb11a25e4b7ccd2cecca14d0d04a6ac1c26296483b2461f4","observed_at":"2026-07-09T04:43:38.345231Z","parent_run_hash":"3e22c7c40abc4d94232acf1766a43492b8b8d51d10a58f1109535988a16554e6","published":"Thu, 09 Jul 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2607.06796v1 Announce Type: cross \nAbstract: Deep learning has achieved remarkable success in various domains including time series analysis, computer vision and natural language processing. However, high computational and memory demands of state-of-the-art architectures pose challenges for deployment in resource-limited environments. Knowledge Distillation (KD) addresses this by transferring knowledge from a large teacher model to a smaller, more efficient student model while maintaining competitive performance. In this work, we investigate the effectiveness of KD for Time Series Classification (TSC) across three architectures: the classical Fully Convolutional Network (FCN), the convolutional Inception model and the transformer-based ConvTran model. We evaluate our approach on UCR Archive, the largest benchmark repository of time series datasets, by modifying architectural components such as convolutional filters, Inception modules and attention heads across the three architect","title":"Enhancing deep learning models for time series classification via knowledge distillation","url":"https://arxiv.org/abs/2607.06796","vendor":"arxiv_cs_ai"},"summary":"arXiv:2607.06796v1 Announce Type: cross \nAbstract: Deep learning has achieved remarkable success in various domains including time series analysis, computer vision and natural language processing. However, high computational and memory demands of state-of-the-art architectures pose challenges for deployment in resource-limited environments. Knowledge Distillation (KD) addresses this by transferring knowledge from a large teacher model to a smaller, more efficient student model while maintaining competitive performance. In this work, we investigate the effectiveness of KD for Time Series Classification (TSC) across three architectures: the classical Fully Convolutional Network (FCN), the convolutional Inception model and the transformer-based ConvTran model. We evaluate our approach on UCR Archive, the largest benchmark repository of time series datasets, by modifying architectural components such as convolutional filters, Inception modules and attention heads across the three architect","title":"Enhancing deep learning models for time series classification via knowledge distillation","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-07-09T04:43:38Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2607.06796"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:89e7e58ddce06014ea4548dcc83b2fb0f504aea8f0ce24f0bb2273e584b079cd1f3e62cb1ff8b2c1e932b4342e413b8f16c42508b08cba0cef84be028ca80500","signer":"crovia.substrate","subject":{"observed_at":"2026-07-09T04:43:38Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2607.06796"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"780fb8e5f5eaaa8750f5a19d77f1732ae920a8693ded7952a23b00a9667b06e3","leaf_index":296076,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"6c5c25e0fe564b8f5cc5cc5932ef4548de15b75ca8661a70aa9803a3114e2013","side":"right"},{"sibling":"230f5aad952d9bf4a8ae9af3282a571118075d694c8566fbdaf758402d041767","side":"right"},{"sibling":"0ed94f51af4766c58f27fac48c2004c0b40f8b526887f53639cdf4d3d0d743a8","side":"left"},{"sibling":"9ec59ac534846d1bd151b13edf6cd6df1d1418bf42b60823daa992f31a13f64d","side":"left"},{"sibling":"53fda50ccf020315ac72796f79c4fd428193761dda8f69b1d0042d1dc23d81db","side":"right"},{"sibling":"283005c20026acb13d616599e4790a32f791d2cb73de3d6b876c68697f7d72dd","side":"right"},{"sibling":"6c45b7ac79d3163d45e1d56cd7db0b01778b873ed657ef89d1d09b6352b1b91e","side":"right"},{"sibling":"6e8f2e16cb75beb661e7f7b63be19804b6f6474dfbf899f8e417b19695f2fba4","side":"left"},{"sibling":"47a94dfb6e50a020e68582e6af2e6a8cf5a4c7efe9fed3deaedbc51f53d75367","side":"right"},{"sibling":"92bb57de69c78fd32ac7108b10d81676c184265a5a53de3c4b22d8cf3b54b499","side":"right"},{"sibling":"85a226efd14acc17835b04bc26706fa44595edbd531f194faf59f60ab72d4bb8","side":"left"},{"sibling":"da38b05536b12aee196b6ac988739211c257d32da790faccf5ac4b0cbc1bb15c","side":"right"},{"sibling":"d438dc3eddb0b14dc8b97cd021a4f44545ce5a8e827f3ea4044fd32b1877475e","side":"right"},{"sibling":"f73ad10346837ae47f59f0647f79b9416e1d499bf2b90af44448e7f09372200a","side":"right"},{"sibling":"bdc09902fcd434c0f7d3e680bf550e560777228c0b085ce80c637ce97fc4104c","side":"right"},{"sibling":"d8b9143917b539c543cf4448cec00131f8b807bd8004979c54ebe09798748c66","side":"left"},{"sibling":"ba603dffe985ef518e3a72793a3eaca83a7f1a79e5491fd0f62f421339f2d137","side":"right"},{"sibling":"be20b90931f0a14e3558ea4387537200fcbd14e019b3c5ed07a2ae4c62fc7c42","side":"right"},{"sibling":"1cecb7f447febd025aac272837c80de218aecc6485d2395a509b2a1f1b9c746e","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":296360,"merkle_root":"64af62f723a5bc02adfa98b77e2006fc634de4ebf68626694f052342a200bea2","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260709T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-07-09T05:38:18Z","sig_algorithm":"ed25519","signature":"92ece7411e0d82898aac164e7d6573a6d0f7a595aad0780d710d873e548a061d2a8678cef4d237d3bf0eabe0a5f766b41cbc0b4bada2801e7532026291b4a309","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_5d55a76a5efaae47ff793dab336a95cd10075240a42c6f7f2e7c57b548ce10b0"}}