{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AAJT6BO4QG6M5WGGKRCNWLX2TI","short_pith_number":"pith:AAJT6BO4","schema_version":"1.0","canonical_sha256":"00133f05dc81bcced8c65444db2efa9a25aa0051d693344240f64808145ddfa5","source":{"kind":"arxiv","id":"2111.13684","version":3},"attestation_state":"computed","paper":{"title":"Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cheng Wang, Chuanpan Zheng, Haibing Jin, Philip S. Yu, Shirui Pan, Xiaoliang Fan, Zhaopeng Peng, Zonghan Wu","submitted_at":"2021-11-25T08:45:14Z","abstract_excerpt":"Recent studies have shifted their focus towards formulating traffic forecasting as a spatio-temporal graph modeling problem. Typically, they constructed a static spatial graph at each time step and then connected each node with itself between adjacent time steps to create a spatio-temporal graph. However, this approach failed to explicitly reflect the correlations between different nodes at different time steps, thus limiting the learning capability of graph neural networks. Additionally, those models overlooked the dynamic spatio-temporal correlations among nodes by using the same adjacency 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":"2111.13684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-25T08:45:14Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"fa6bab2519ae0e6d2718e506cc9cf87667bc34e0bcb39a7b02b5a9c9ac07b746","abstract_canon_sha256":"e1d7ffed9cddfefea97efa86e51b6c35c5e5e051ed38f03b7cfa40af6087c635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:19:51.134462Z","signature_b64":"dB6Fq5jZwA+FyvmWNS1Ob4pC8mTW2RMBAPzergSOVqc45Oye7sF9S4ujVMz/O9gVVRccA8rQnXNP14s5xW7uCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00133f05dc81bcced8c65444db2efa9a25aa0051d693344240f64808145ddfa5","last_reissued_at":"2026-07-05T06:19:51.134009Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:19:51.134009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Cheng Wang, Chuanpan Zheng, Haibing Jin, Philip S. Yu, Shirui Pan, Xiaoliang Fan, Zhaopeng Peng, Zonghan Wu","submitted_at":"2021-11-25T08:45:14Z","abstract_excerpt":"Recent studies have shifted their focus towards formulating traffic forecasting as a spatio-temporal graph modeling problem. Typically, they constructed a static spatial graph at each time step and then connected each node with itself between adjacent time steps to create a spatio-temporal graph. However, this approach failed to explicitly reflect the correlations between different nodes at different time steps, thus limiting the learning capability of graph neural networks. Additionally, those models overlooked the dynamic spatio-temporal correlations among nodes by using the same adjacency m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.13684","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/2111.13684/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":"2111.13684","created_at":"2026-07-05T06:19:51.134067+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.13684v3","created_at":"2026-07-05T06:19:51.134067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.13684","created_at":"2026-07-05T06:19:51.134067+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAJT6BO4QG6M","created_at":"2026-07-05T06:19:51.134067+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAJT6BO4QG6M5WGG","created_at":"2026-07-05T06:19:51.134067+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAJT6BO4","created_at":"2026-07-05T06:19:51.134067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06918","citing_title":"Generalising Travel Time Prediction To Varying Route Choices In Urban Networks","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI","json":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI.json","graph_json":"https://pith.science/api/pith-number/AAJT6BO4QG6M5WGGKRCNWLX2TI/graph.json","events_json":"https://pith.science/api/pith-number/AAJT6BO4QG6M5WGGKRCNWLX2TI/events.json","paper":"https://pith.science/paper/AAJT6BO4"},"agent_actions":{"view_html":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI","download_json":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI.json","view_paper":"https://pith.science/paper/AAJT6BO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.13684&json=true","fetch_graph":"https://pith.science/api/pith-number/AAJT6BO4QG6M5WGGKRCNWLX2TI/graph.json","fetch_events":"https://pith.science/api/pith-number/AAJT6BO4QG6M5WGGKRCNWLX2TI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI/action/storage_attestation","attest_author":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI/action/author_attestation","sign_citation":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI/action/citation_signature","submit_replication":"https://pith.science/pith/AAJT6BO4QG6M5WGGKRCNWLX2TI/action/replication_record"}},"created_at":"2026-07-05T06:19:51.134067+00:00","updated_at":"2026-07-05T06:19:51.134067+00:00"}