{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:G6K636PSJGIQTVHGVPRHH2S4MO","short_pith_number":"pith:G6K636PS","schema_version":"1.0","canonical_sha256":"3795edf9f2499109d4e6abe273ea5c63b707dc8c30156cfdb99cb606d2b262be","source":{"kind":"arxiv","id":"2506.23053","version":3},"attestation_state":"computed","paper":{"title":"Double-Diffusion: Balancing Speed, Accuracy, and Uncertainty in Probabilistic Forecasting for Urban Sensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ao Shuang, Arian Prabowo, Flora D. Salim, Hanlin Dong, Hao Xue, Tianyi Zhou, Yuxuan Liang","submitted_at":"2025-06-29T01:45:47Z","abstract_excerpt":"Urban sensor networks need forecasts that are accurate, carry useful uncertainty, and refresh fast enough to act on as new readings arrive. These goals conflict: deterministic models give no distribution, while diffusion forecasters model uncertainty but denoise from pure noise over many steps. We present Double-Diffusion, which integrates a closed-form graph-heat prior into a denoising diffusion model. The prior is a parameter-free low-pass forecast over the sensor graph, and it serves two roles: it is the residual target the model generates, and it conditions the denoiser. The reverse proces"},"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":"2506.23053","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-29T01:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"c558d3b2eeaddf8b2a5ece513a91e9ecdb489f4a02c2983ca94d18bb7e032046","abstract_canon_sha256":"f4d3a42b3e21340b825e1b5bcbe64010138835e8b67938e62e24a0c577522337"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:15.734862Z","signature_b64":"DmG0Wg6UwJemH2KG7NM0/quLesEoA2I1rsPOBCO4mlIRzohrcWDmNYP/YJ9mcelWaQ9sl8RCeBmoALy8V3DaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3795edf9f2499109d4e6abe273ea5c63b707dc8c30156cfdb99cb606d2b262be","last_reissued_at":"2026-06-23T02:13:15.734438Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:15.734438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double-Diffusion: Balancing Speed, Accuracy, and Uncertainty in Probabilistic Forecasting for Urban Sensor Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Ao Shuang, Arian Prabowo, Flora D. Salim, Hanlin Dong, Hao Xue, Tianyi Zhou, Yuxuan Liang","submitted_at":"2025-06-29T01:45:47Z","abstract_excerpt":"Urban sensor networks need forecasts that are accurate, carry useful uncertainty, and refresh fast enough to act on as new readings arrive. These goals conflict: deterministic models give no distribution, while diffusion forecasters model uncertainty but denoise from pure noise over many steps. We present Double-Diffusion, which integrates a closed-form graph-heat prior into a denoising diffusion model. The prior is a parameter-free low-pass forecast over the sensor graph, and it serves two roles: it is the residual target the model generates, and it conditions the denoiser. The reverse proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23053","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/2506.23053/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":"2506.23053","created_at":"2026-06-23T02:13:15.734496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23053v3","created_at":"2026-06-23T02:13:15.734496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23053","created_at":"2026-06-23T02:13:15.734496+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6K636PSJGIQ","created_at":"2026-06-23T02:13:15.734496+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6K636PSJGIQTVHG","created_at":"2026-06-23T02:13:15.734496+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6K636PS","created_at":"2026-06-23T02:13:15.734496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.10328","citing_title":"A Diffusion-Contrastive Graph Neural Network with Virtual Nodes for Wind Nowcasting in Unobserved Regions","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO","json":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO.json","graph_json":"https://pith.science/api/pith-number/G6K636PSJGIQTVHGVPRHH2S4MO/graph.json","events_json":"https://pith.science/api/pith-number/G6K636PSJGIQTVHGVPRHH2S4MO/events.json","paper":"https://pith.science/paper/G6K636PS"},"agent_actions":{"view_html":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO","download_json":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO.json","view_paper":"https://pith.science/paper/G6K636PS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23053&json=true","fetch_graph":"https://pith.science/api/pith-number/G6K636PSJGIQTVHGVPRHH2S4MO/graph.json","fetch_events":"https://pith.science/api/pith-number/G6K636PSJGIQTVHGVPRHH2S4MO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO/action/storage_attestation","attest_author":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO/action/author_attestation","sign_citation":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO/action/citation_signature","submit_replication":"https://pith.science/pith/G6K636PSJGIQTVHGVPRHH2S4MO/action/replication_record"}},"created_at":"2026-06-23T02:13:15.734496+00:00","updated_at":"2026-06-23T02:13:15.734496+00:00"}