{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:L2NMVBEXYBYQ3SDSFXGABHJMM3","short_pith_number":"pith:L2NMVBEX","schema_version":"1.0","canonical_sha256":"5e9aca8497c0710dc8722dcc009d2c66e75c6be3d5ed896a27ecf4f9bd195355","source":{"kind":"arxiv","id":"2303.09634","version":1},"attestation_state":"computed","paper":{"title":"Causal Temporal Graph Convolutional Neural Networks (CTGCN)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abigail Langbridge, Amadou Ba, Christopher Lohse, Fabio Lorenzi, Fearghal O'Donncha, Joern Ploennigs","submitted_at":"2023-03-16T20:28:36Z","abstract_excerpt":"Many large-scale applications can be elegantly represented using graph structures. Their scalability, however, is often limited by the domain knowledge required to apply them. To address this problem, we propose a novel Causal Temporal Graph Convolutional Neural Network (CTGCN). Our CTGCN architecture is based on a causal discovery mechanism, and is capable of discovering the underlying causal processes. The major advantages of our approach stem from its ability to overcome computational scalability problems with a divide and conquer technique, and from the greater explainability of prediction"},"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.09634","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-16T20:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"d4e9bf9b28fdb13a56545578d8ff5b3924c4314adae79797c1661d431cd2b509","abstract_canon_sha256":"b8238127e556062fb3fed5f5a14b01c912b4f2b9b1865d7f8c495f0d1635d4a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:59.104060Z","signature_b64":"LViP6I4RE3DYFAe2f0TNgvgMZr4vwOaobJXjLS8Qdo/Z8CUrDfytCXwzvC0fTXDZBdWMNVIWmFJcX0UX5ZSjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e9aca8497c0710dc8722dcc009d2c66e75c6be3d5ed896a27ecf4f9bd195355","last_reissued_at":"2026-07-05T05:51:59.103703Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:59.103703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Causal Temporal Graph Convolutional Neural Networks (CTGCN)","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abigail Langbridge, Amadou Ba, Christopher Lohse, Fabio Lorenzi, Fearghal O'Donncha, Joern Ploennigs","submitted_at":"2023-03-16T20:28:36Z","abstract_excerpt":"Many large-scale applications can be elegantly represented using graph structures. Their scalability, however, is often limited by the domain knowledge required to apply them. To address this problem, we propose a novel Causal Temporal Graph Convolutional Neural Network (CTGCN). Our CTGCN architecture is based on a causal discovery mechanism, and is capable of discovering the underlying causal processes. The major advantages of our approach stem from its ability to overcome computational scalability problems with a divide and conquer technique, and from the greater explainability of prediction"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.09634","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.09634/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.09634","created_at":"2026-07-05T05:51:59.103767+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.09634v1","created_at":"2026-07-05T05:51:59.103767+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.09634","created_at":"2026-07-05T05:51:59.103767+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2NMVBEXYBYQ","created_at":"2026-07-05T05:51:59.103767+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2NMVBEXYBYQ3SDS","created_at":"2026-07-05T05:51:59.103767+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2NMVBEX","created_at":"2026-07-05T05:51:59.103767+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28225","citing_title":"Estimation-Prediction Tradeoff in Causal Probabilistic Temporal Graphs","ref_index":152,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3","json":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3.json","graph_json":"https://pith.science/api/pith-number/L2NMVBEXYBYQ3SDSFXGABHJMM3/graph.json","events_json":"https://pith.science/api/pith-number/L2NMVBEXYBYQ3SDSFXGABHJMM3/events.json","paper":"https://pith.science/paper/L2NMVBEX"},"agent_actions":{"view_html":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3","download_json":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3.json","view_paper":"https://pith.science/paper/L2NMVBEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.09634&json=true","fetch_graph":"https://pith.science/api/pith-number/L2NMVBEXYBYQ3SDSFXGABHJMM3/graph.json","fetch_events":"https://pith.science/api/pith-number/L2NMVBEXYBYQ3SDSFXGABHJMM3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3/action/storage_attestation","attest_author":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3/action/author_attestation","sign_citation":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3/action/citation_signature","submit_replication":"https://pith.science/pith/L2NMVBEXYBYQ3SDSFXGABHJMM3/action/replication_record"}},"created_at":"2026-07-05T05:51:59.103767+00:00","updated_at":"2026-07-05T05:51:59.103767+00:00"}