{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:74W5TWHV7EC5KSGA4MVYZEFIZA","short_pith_number":"pith:74W5TWHV","schema_version":"1.0","canonical_sha256":"ff2dd9d8f5f905d548c0e32b8c90a8c8065e7cd2a4ecdb5860ddff9cd45b2407","source":{"kind":"arxiv","id":"2402.01999","version":1},"attestation_state":"computed","paper":{"title":"A Novel Hyperdimensional Computing Framework for Online Time Series Forecasting on the Edge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abhijit Chatterjee, Chandramouli Amarnath, Mohamed Mejri","submitted_at":"2024-02-03T02:42:53Z","abstract_excerpt":"In recent years, both online and offline deep learning models have been developed for time series forecasting. However, offline deep forecasting models fail to adapt effectively to changes in time-series data, while online deep forecasting models are often expensive and have complex training procedures. In this paper, we reframe the online nonlinear time-series forecasting problem as one of linear hyperdimensional time-series forecasting. Nonlinear low-dimensional time-series data is mapped to high-dimensional (hyperdimensional) spaces for linear hyperdimensional prediction, allowing fast, eff"},"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":"2402.01999","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-03T02:42:53Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"7de5fd28258b0407c296ecd157ab0cc090eb9698045ba57578abc59a704bf193","abstract_canon_sha256":"b95c03de77fdb8499110e6863821c5221ac18c3dece45cc137557ba2bf5d44a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:09.507030Z","signature_b64":"X7Im4Y//NSyqVk0qoeM6lPnl7+uHoTcGYKG9fU2OZ0wT5Y13omRHyKC0h4D3jg+Ia8J3Y1PGS5nHXHf7fJCxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2dd9d8f5f905d548c0e32b8c90a8c8065e7cd2a4ecdb5860ddff9cd45b2407","last_reissued_at":"2026-07-05T07:41:09.506571Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:09.506571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Hyperdimensional Computing Framework for Online Time Series Forecasting on the Edge","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Abhijit Chatterjee, Chandramouli Amarnath, Mohamed Mejri","submitted_at":"2024-02-03T02:42:53Z","abstract_excerpt":"In recent years, both online and offline deep learning models have been developed for time series forecasting. However, offline deep forecasting models fail to adapt effectively to changes in time-series data, while online deep forecasting models are often expensive and have complex training procedures. In this paper, we reframe the online nonlinear time-series forecasting problem as one of linear hyperdimensional time-series forecasting. Nonlinear low-dimensional time-series data is mapped to high-dimensional (hyperdimensional) spaces for linear hyperdimensional prediction, allowing fast, eff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01999","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/2402.01999/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":"2402.01999","created_at":"2026-07-05T07:41:09.506626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.01999v1","created_at":"2026-07-05T07:41:09.506626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01999","created_at":"2026-07-05T07:41:09.506626+00:00"},{"alias_kind":"pith_short_12","alias_value":"74W5TWHV7EC5","created_at":"2026-07-05T07:41:09.506626+00:00"},{"alias_kind":"pith_short_16","alias_value":"74W5TWHV7EC5KSGA","created_at":"2026-07-05T07:41:09.506626+00:00"},{"alias_kind":"pith_short_8","alias_value":"74W5TWHV","created_at":"2026-07-05T07:41:09.506626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08290","citing_title":"RESOLVE: Relational Reasoning with Symbolic and Object-Level Features Using Vector Symbolic Processing","ref_index":2018,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA","json":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA.json","graph_json":"https://pith.science/api/pith-number/74W5TWHV7EC5KSGA4MVYZEFIZA/graph.json","events_json":"https://pith.science/api/pith-number/74W5TWHV7EC5KSGA4MVYZEFIZA/events.json","paper":"https://pith.science/paper/74W5TWHV"},"agent_actions":{"view_html":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA","download_json":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA.json","view_paper":"https://pith.science/paper/74W5TWHV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.01999&json=true","fetch_graph":"https://pith.science/api/pith-number/74W5TWHV7EC5KSGA4MVYZEFIZA/graph.json","fetch_events":"https://pith.science/api/pith-number/74W5TWHV7EC5KSGA4MVYZEFIZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA/action/storage_attestation","attest_author":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA/action/author_attestation","sign_citation":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA/action/citation_signature","submit_replication":"https://pith.science/pith/74W5TWHV7EC5KSGA4MVYZEFIZA/action/replication_record"}},"created_at":"2026-07-05T07:41:09.506626+00:00","updated_at":"2026-07-05T07:41:09.506626+00:00"}