{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TVDQVOZ3WQUT4AE2AXFXFYLXAD","short_pith_number":"pith:TVDQVOZ3","schema_version":"1.0","canonical_sha256":"9d470abb3bb4293e009a05cb72e17700cbd0d7d8f485fea03b009c0a6730276b","source":{"kind":"arxiv","id":"2402.10634","version":3},"attestation_state":"computed","paper":{"title":"Graph-based Forecasting with Missing Data through Spatiotemporal Downsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cesare Alippi, Filippo Maria Bianchi, Ivan Marisca","submitted_at":"2024-02-16T12:33:31Z","abstract_excerpt":"Given a set of synchronous time series, each associated with a sensor-point in space and characterized by inter-series relationships, the problem of spatiotemporal forecasting consists of predicting future observations for each point. Spatiotemporal graph neural networks achieve striking results by representing the relationships across time series as a graph. Nonetheless, most existing methods rely on the often unrealistic assumption that inputs are always available and fail to capture hidden spatiotemporal dynamics when part of the data is missing. In this work, we tackle this problem through"},"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.10634","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-16T12:33:31Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"20f27f3bc3c3ba205f7777adb1fc4f3dc966e046ab54f44460c5035d51ac9eaf","abstract_canon_sha256":"a1aa0300fb9e3015afc9afea2d56c3ec77057915c6fa722c74d774c578a3a419"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:28:59.577547Z","signature_b64":"V6TfCKXxMKCPY4JkOQWrgXlORuDZTaLRqPlpmN2q27kGv+4ItK5tRFzv1aei+JdkxUPuhwsOALSM/QaluvwFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d470abb3bb4293e009a05cb72e17700cbd0d7d8f485fea03b009c0a6730276b","last_reissued_at":"2026-07-05T08:28:59.577069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:28:59.577069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-based Forecasting with Missing Data through Spatiotemporal Downsampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cesare Alippi, Filippo Maria Bianchi, Ivan Marisca","submitted_at":"2024-02-16T12:33:31Z","abstract_excerpt":"Given a set of synchronous time series, each associated with a sensor-point in space and characterized by inter-series relationships, the problem of spatiotemporal forecasting consists of predicting future observations for each point. Spatiotemporal graph neural networks achieve striking results by representing the relationships across time series as a graph. Nonetheless, most existing methods rely on the often unrealistic assumption that inputs are always available and fail to capture hidden spatiotemporal dynamics when part of the data is missing. In this work, we tackle this problem through"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.10634","kind":"arxiv","version":3},"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.10634/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.10634","created_at":"2026-07-05T08:28:59.577126+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.10634v3","created_at":"2026-07-05T08:28:59.577126+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.10634","created_at":"2026-07-05T08:28:59.577126+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVDQVOZ3WQUT","created_at":"2026-07-05T08:28:59.577126+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVDQVOZ3WQUT4AE2","created_at":"2026-07-05T08:28:59.577126+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVDQVOZ3","created_at":"2026-07-05T08:28:59.577126+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08005","citing_title":"STEPS: A Temporal Smooth Error Propagation Solver on the Manifolds for Test-Time Adaptation in Time Series Forecasting","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD","json":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD.json","graph_json":"https://pith.science/api/pith-number/TVDQVOZ3WQUT4AE2AXFXFYLXAD/graph.json","events_json":"https://pith.science/api/pith-number/TVDQVOZ3WQUT4AE2AXFXFYLXAD/events.json","paper":"https://pith.science/paper/TVDQVOZ3"},"agent_actions":{"view_html":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD","download_json":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD.json","view_paper":"https://pith.science/paper/TVDQVOZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.10634&json=true","fetch_graph":"https://pith.science/api/pith-number/TVDQVOZ3WQUT4AE2AXFXFYLXAD/graph.json","fetch_events":"https://pith.science/api/pith-number/TVDQVOZ3WQUT4AE2AXFXFYLXAD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD/action/storage_attestation","attest_author":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD/action/author_attestation","sign_citation":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD/action/citation_signature","submit_replication":"https://pith.science/pith/TVDQVOZ3WQUT4AE2AXFXFYLXAD/action/replication_record"}},"created_at":"2026-07-05T08:28:59.577126+00:00","updated_at":"2026-07-05T08:28:59.577126+00:00"}