{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ME5F6S2DP4HHCQLVRUDPYSMTNC","short_pith_number":"pith:ME5F6S2D","schema_version":"1.0","canonical_sha256":"613a5f4b437f0e7141758d06fc49936892c26eab0c8ea62ffa0e1f2b91525450","source":{"kind":"arxiv","id":"2303.16549","version":1},"attestation_state":"computed","paper":{"title":"A scalable approach for short-term disease forecasting in high spatial resolution areal data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"A. Adin, A. Riebler, E. Orozco-Acosta, M. D. Ugarte","submitted_at":"2023-03-29T09:14:41Z","abstract_excerpt":"Short-term disease forecasting at specific discrete spatial resolutions has become a high-impact decision-support tool in health planning. However, when the number of areas is very large obtaining predictions can be computationally intensive or even unfeasible using standard spatio-temporal models. The purpose of this paper is to provide a method for short-term predictions in high-dimensional areal data based on a newly proposed ``divide-and-conquer\" approach. We assess the predictive performance of this method and other classical spatio-temporal models in a validation study that uses cancer m"},"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":"2303.16549","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2023-03-29T09:14:41Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"b41b46a837a7565a30341c475c4ac07ff0f906954e29b12e20cf20d1935117ce","abstract_canon_sha256":"173caf145ad3f34f294cba8276399e3135b07d7fc5412e12e2014806cb20d9a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:07:08.219797Z","signature_b64":"My57IYboXnJxrbu4RXTgGXZampzHksGE9mT3YJxSnrlXh6nSgxGs4Uy4l4LawlI6znTNbtkplLtoR4w4FSTXAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613a5f4b437f0e7141758d06fc49936892c26eab0c8ea62ffa0e1f2b91525450","last_reissued_at":"2026-07-05T07:07:08.219278Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:07:08.219278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A scalable approach for short-term disease forecasting in high spatial resolution areal data","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"A. Adin, A. Riebler, E. Orozco-Acosta, M. D. Ugarte","submitted_at":"2023-03-29T09:14:41Z","abstract_excerpt":"Short-term disease forecasting at specific discrete spatial resolutions has become a high-impact decision-support tool in health planning. However, when the number of areas is very large obtaining predictions can be computationally intensive or even unfeasible using standard spatio-temporal models. The purpose of this paper is to provide a method for short-term predictions in high-dimensional areal data based on a newly proposed ``divide-and-conquer\" approach. We assess the predictive performance of this method and other classical spatio-temporal models in a validation study that uses cancer m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.16549","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/2303.16549/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":"2303.16549","created_at":"2026-07-05T07:07:08.219362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.16549v1","created_at":"2026-07-05T07:07:08.219362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.16549","created_at":"2026-07-05T07:07:08.219362+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME5F6S2DP4HH","created_at":"2026-07-05T07:07:08.219362+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME5F6S2DP4HHCQLV","created_at":"2026-07-05T07:07:08.219362+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME5F6S2D","created_at":"2026-07-05T07:07:08.219362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19405","citing_title":"CoTGuard: Using Chain-of-Thought Triggering for Copyright Protection in Multi-Agent LLM Systems","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC","json":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC.json","graph_json":"https://pith.science/api/pith-number/ME5F6S2DP4HHCQLVRUDPYSMTNC/graph.json","events_json":"https://pith.science/api/pith-number/ME5F6S2DP4HHCQLVRUDPYSMTNC/events.json","paper":"https://pith.science/paper/ME5F6S2D"},"agent_actions":{"view_html":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC","download_json":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC.json","view_paper":"https://pith.science/paper/ME5F6S2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.16549&json=true","fetch_graph":"https://pith.science/api/pith-number/ME5F6S2DP4HHCQLVRUDPYSMTNC/graph.json","fetch_events":"https://pith.science/api/pith-number/ME5F6S2DP4HHCQLVRUDPYSMTNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC/action/storage_attestation","attest_author":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC/action/author_attestation","sign_citation":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC/action/citation_signature","submit_replication":"https://pith.science/pith/ME5F6S2DP4HHCQLVRUDPYSMTNC/action/replication_record"}},"created_at":"2026-07-05T07:07:08.219362+00:00","updated_at":"2026-07-05T07:07:08.219362+00:00"}