{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:O4HNPJVV5KEFZHFR6CMN24LQZR","short_pith_number":"pith:O4HNPJVV","schema_version":"1.0","canonical_sha256":"770ed7a6b5ea885c9cb1f098dd7170cc5ac5f67cedcc5dfcd8706b892f086594","source":{"kind":"arxiv","id":"2304.07638","version":1},"attestation_state":"computed","paper":{"title":"Causal models in string diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CT"],"primary_cat":"cs.LO","authors_text":"Robin Lorenz, Sean Tull","submitted_at":"2023-04-15T21:54:48Z","abstract_excerpt":"The framework of causal models provides a principled approach to causal reasoning, applied today across many scientific domains. Here we present this framework in the language of string diagrams, interpreted formally using category theory. A class of string diagrams, called network diagrams, are in 1-to-1 correspondence with directed acyclic graphs. A causal model is given by such a diagram with its components interpreted as stochastic maps, functions, or general channels in a symmetric monoidal category with a 'copy-discard' structure (cd-category), turning a model into a single mathematical "},"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":"2304.07638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2023-04-15T21:54:48Z","cross_cats_sorted":["cs.LG","math.CT"],"title_canon_sha256":"9c36c8d36e0c0bc32405a178a6dd3434b92480a6adc65337ce0ef44e350fe3af","abstract_canon_sha256":"117dfb707041427c65993268926d137f3b4d807953ce5fad002ae2e92efc3e21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:23.713795Z","signature_b64":"AginKCoIq+WiaW3EPf1QSkq2i8KtoNJiN1iltnaeu0V3AdsFquQ5BjqwH4rAP4dfUiQomXbFvXweuw13/HZPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770ed7a6b5ea885c9cb1f098dd7170cc5ac5f67cedcc5dfcd8706b892f086594","last_reissued_at":"2026-07-05T06:01:23.713358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:23.713358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Causal models in string diagrams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CT"],"primary_cat":"cs.LO","authors_text":"Robin Lorenz, Sean Tull","submitted_at":"2023-04-15T21:54:48Z","abstract_excerpt":"The framework of causal models provides a principled approach to causal reasoning, applied today across many scientific domains. Here we present this framework in the language of string diagrams, interpreted formally using category theory. A class of string diagrams, called network diagrams, are in 1-to-1 correspondence with directed acyclic graphs. A causal model is given by such a diagram with its components interpreted as stochastic maps, functions, or general channels in a symmetric monoidal category with a 'copy-discard' structure (cd-category), turning a model into a single mathematical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.07638","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/2304.07638/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":"2304.07638","created_at":"2026-07-05T06:01:23.713416+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.07638v1","created_at":"2026-07-05T06:01:23.713416+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.07638","created_at":"2026-07-05T06:01:23.713416+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4HNPJVV5KEF","created_at":"2026-07-05T06:01:23.713416+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4HNPJVV5KEFZHFR","created_at":"2026-07-05T06:01:23.713416+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4HNPJVV","created_at":"2026-07-05T06:01:23.713416+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11417","citing_title":"String Diagrams for Quantum Foundations, Computing and Natural Language Processing","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08934","citing_title":"From Mechanistic to Compositional Interpretability","ref_index":143,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08604","citing_title":"Quantum-like Cognition in Process Theories: An Analysis","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR","json":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR.json","graph_json":"https://pith.science/api/pith-number/O4HNPJVV5KEFZHFR6CMN24LQZR/graph.json","events_json":"https://pith.science/api/pith-number/O4HNPJVV5KEFZHFR6CMN24LQZR/events.json","paper":"https://pith.science/paper/O4HNPJVV"},"agent_actions":{"view_html":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR","download_json":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR.json","view_paper":"https://pith.science/paper/O4HNPJVV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.07638&json=true","fetch_graph":"https://pith.science/api/pith-number/O4HNPJVV5KEFZHFR6CMN24LQZR/graph.json","fetch_events":"https://pith.science/api/pith-number/O4HNPJVV5KEFZHFR6CMN24LQZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR/action/storage_attestation","attest_author":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR/action/author_attestation","sign_citation":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR/action/citation_signature","submit_replication":"https://pith.science/pith/O4HNPJVV5KEFZHFR6CMN24LQZR/action/replication_record"}},"created_at":"2026-07-05T06:01:23.713416+00:00","updated_at":"2026-07-05T06:01:23.713416+00:00"}