{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SE6FPUPVEXLCNUTNR4D6KEXL4M","short_pith_number":"pith:SE6FPUPV","schema_version":"1.0","canonical_sha256":"913c57d1f525d626d26d8f07e512ebe33382d1819b7f984e49db50bb553450c1","source":{"kind":"arxiv","id":"2407.17880","version":1},"attestation_state":"computed","paper":{"title":"DAM: Towards A Foundation Model for Time Series Forecasting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Barker, Ahmed Hassan, Amos Storkey, Artjom Joosen, Luke Darlow, Martin Asenov, Qiwen Deng, Rajkarn Singh","submitted_at":"2024-07-25T08:48:07Z","abstract_excerpt":"It is challenging to scale time series forecasting models such that they forecast accurately for multiple distinct domains and datasets, all with potentially different underlying collection procedures (e.g., sample resolution), patterns (e.g., periodicity), and prediction requirements (e.g., reconstruction vs. forecasting). We call this general task universal forecasting. Existing methods usually assume that input data is regularly sampled, and they forecast to pre-determined horizons, resulting in failure to generalise outside of the scope of their training. We propose the DAM - a neural mode"},"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":"2407.17880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-25T08:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"c3d2dcd42f0a3739705165d36735397ce0ba65c95fcaf6fd9ff83a657f734d2b","abstract_canon_sha256":"59271a5d2930699154eb0afbe0f78674c64c6898c6bc57ff5bde6b611d924b0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:22.997028Z","signature_b64":"FXO7Ls4X3mDpZMrpXBHhL8oNi6NJSf0mbxPx2vwTBIRj7ROL7j304WxC1AyHFA3/4JMSEf7/zfaw37/0js+BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"913c57d1f525d626d26d8f07e512ebe33382d1819b7f984e49db50bb553450c1","last_reissued_at":"2026-07-05T08:48:22.996352Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:22.996352Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DAM: Towards A Foundation Model for Time Series Forecasting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adam Barker, Ahmed Hassan, Amos Storkey, Artjom Joosen, Luke Darlow, Martin Asenov, Qiwen Deng, Rajkarn Singh","submitted_at":"2024-07-25T08:48:07Z","abstract_excerpt":"It is challenging to scale time series forecasting models such that they forecast accurately for multiple distinct domains and datasets, all with potentially different underlying collection procedures (e.g., sample resolution), patterns (e.g., periodicity), and prediction requirements (e.g., reconstruction vs. forecasting). We call this general task universal forecasting. Existing methods usually assume that input data is regularly sampled, and they forecast to pre-determined horizons, resulting in failure to generalise outside of the scope of their training. We propose the DAM - a neural mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17880","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/2407.17880/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":"2407.17880","created_at":"2026-07-05T08:48:22.996465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17880v1","created_at":"2026-07-05T08:48:22.996465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17880","created_at":"2026-07-05T08:48:22.996465+00:00"},{"alias_kind":"pith_short_12","alias_value":"SE6FPUPVEXLC","created_at":"2026-07-05T08:48:22.996465+00:00"},{"alias_kind":"pith_short_16","alias_value":"SE6FPUPVEXLCNUTN","created_at":"2026-07-05T08:48:22.996465+00:00"},{"alias_kind":"pith_short_8","alias_value":"SE6FPUPV","created_at":"2026-07-05T08:48:22.996465+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13513","citing_title":"CloudCons: A Comprehensive End-to-End Benchmark for Cloud Resource Consolidation","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M","json":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M.json","graph_json":"https://pith.science/api/pith-number/SE6FPUPVEXLCNUTNR4D6KEXL4M/graph.json","events_json":"https://pith.science/api/pith-number/SE6FPUPVEXLCNUTNR4D6KEXL4M/events.json","paper":"https://pith.science/paper/SE6FPUPV"},"agent_actions":{"view_html":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M","download_json":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M.json","view_paper":"https://pith.science/paper/SE6FPUPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17880&json=true","fetch_graph":"https://pith.science/api/pith-number/SE6FPUPVEXLCNUTNR4D6KEXL4M/graph.json","fetch_events":"https://pith.science/api/pith-number/SE6FPUPVEXLCNUTNR4D6KEXL4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M/action/storage_attestation","attest_author":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M/action/author_attestation","sign_citation":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M/action/citation_signature","submit_replication":"https://pith.science/pith/SE6FPUPVEXLCNUTNR4D6KEXL4M/action/replication_record"}},"created_at":"2026-07-05T08:48:22.996465+00:00","updated_at":"2026-07-05T08:48:22.996465+00:00"}