{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PF3XJQ7SFXKBLTOTNEUTOZ2CMD","short_pith_number":"pith:PF3XJQ7S","schema_version":"1.0","canonical_sha256":"797774c3f22dd415cdd3692937674260e0e7f3168f4f452660e02f46efc4d541","source":{"kind":"arxiv","id":"2411.16142","version":1},"attestation_state":"computed","paper":{"title":"Causal Adjacency Learning for Spatiotemporal Prediction Over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baohua Yan, Longxiang Zhang, Qingyuan Liu, Xuan Di, Zhaobin Mo","submitted_at":"2024-11-25T07:05:27Z","abstract_excerpt":"Spatiotemporal prediction over graphs (STPG) is crucial for transportation systems. In existing STPG models, an adjacency matrix is an important component that captures the relations among nodes over graphs. However, most studies calculate the adjacency matrix by directly memorizing the data, such as distance- and correlation-based matrices. These adjacency matrices do not consider potential pattern shift for the test data, and may result in suboptimal performance if the test data has a different distribution from the training one. This issue is known as the Out-of-Distribution generalization "},"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":"2411.16142","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-11-25T07:05:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d5584980c0d61273e779817e38204fafd9afb9f3649379a0eda71e99c53678aa","abstract_canon_sha256":"d3d79c0f6bc81be056e0abf8c395f5eb3b2e4d818282d5cb52f04ac642883c08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:05.057219Z","signature_b64":"MfipELtX2DqW2skp34lV/CnEQJBXWpGw38gMBV/HHy//XC1vb/XJa9HJpXE33gzPbQG/nAdNDJtP2T6NWEsYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797774c3f22dd415cdd3692937674260e0e7f3168f4f452660e02f46efc4d541","last_reissued_at":"2026-07-05T09:40:05.056837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:05.056837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Causal Adjacency Learning for Spatiotemporal Prediction Over Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Baohua Yan, Longxiang Zhang, Qingyuan Liu, Xuan Di, Zhaobin Mo","submitted_at":"2024-11-25T07:05:27Z","abstract_excerpt":"Spatiotemporal prediction over graphs (STPG) is crucial for transportation systems. In existing STPG models, an adjacency matrix is an important component that captures the relations among nodes over graphs. However, most studies calculate the adjacency matrix by directly memorizing the data, such as distance- and correlation-based matrices. These adjacency matrices do not consider potential pattern shift for the test data, and may result in suboptimal performance if the test data has a different distribution from the training one. This issue is known as the Out-of-Distribution generalization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16142","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/2411.16142/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":"2411.16142","created_at":"2026-07-05T09:40:05.056892+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16142v1","created_at":"2026-07-05T09:40:05.056892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16142","created_at":"2026-07-05T09:40:05.056892+00:00"},{"alias_kind":"pith_short_12","alias_value":"PF3XJQ7SFXKB","created_at":"2026-07-05T09:40:05.056892+00:00"},{"alias_kind":"pith_short_16","alias_value":"PF3XJQ7SFXKBLTOT","created_at":"2026-07-05T09:40:05.056892+00:00"},{"alias_kind":"pith_short_8","alias_value":"PF3XJQ7S","created_at":"2026-07-05T09:40:05.056892+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11622","citing_title":"Causal Learning for Heterogeneous Subgroups Based on Nonlinear Causal Kernel Clustering","ref_index":46,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD","json":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD.json","graph_json":"https://pith.science/api/pith-number/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/graph.json","events_json":"https://pith.science/api/pith-number/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/events.json","paper":"https://pith.science/paper/PF3XJQ7S"},"agent_actions":{"view_html":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD","download_json":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD.json","view_paper":"https://pith.science/paper/PF3XJQ7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16142&json=true","fetch_graph":"https://pith.science/api/pith-number/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/graph.json","fetch_events":"https://pith.science/api/pith-number/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/action/storage_attestation","attest_author":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/action/author_attestation","sign_citation":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/action/citation_signature","submit_replication":"https://pith.science/pith/PF3XJQ7SFXKBLTOTNEUTOZ2CMD/action/replication_record"}},"created_at":"2026-07-05T09:40:05.056892+00:00","updated_at":"2026-07-05T09:40:05.056892+00:00"}