{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4KIGCFAKJ5YXCRIV5MN7ABTQQ7","short_pith_number":"pith:4KIGCFAK","schema_version":"1.0","canonical_sha256":"e29061140a4f71714515eb1bf0067087cb0a3fa0f6c288abc7d9141d3865b3f9","source":{"kind":"arxiv","id":"1302.3599","version":1},"attestation_state":"computed","paper":{"title":"A Discovery Algorithm for Directed Cyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Thomas S. Richardson","submitted_at":"2013-02-13T14:16:12Z","abstract_excerpt":"Directed acyclic graphs have been used fruitfully to represent causal strucures (Pearl 1988).  However, in the social sciences and elsewhere models are often used which correspond both causally and statistically to directed graphs with directed cycles (Spirtes 1995).  Pearl (1993) discussed predicting the effects of intervention in models of this kind, so-called linear non-recursive structural equation models.  This raises the question of whether it is possible to make inferences about causal structure with cycles, form sample data.  In particular do there exist general, informative, feasible "},"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":"1302.3599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:12Z","cross_cats_sorted":[],"title_canon_sha256":"11ce42fc2eba416d79ce18d6d9f427e393753b030859c86b10215a736e82b0bc","abstract_canon_sha256":"07d798a195222cf728b29bb02254294553217bbf05f92f5ac043fa82b4b34fb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:18.093637Z","signature_b64":"5e0v6qPCzpNLj4CO1K/1wHUeUr50KoOck94olHzJQFZpAC4CffFrzcH5D008sEcbQZHuwNMmgqmmAr8AdwX7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e29061140a4f71714515eb1bf0067087cb0a3fa0f6c288abc7d9141d3865b3f9","last_reissued_at":"2026-07-05T01:45:18.093263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:18.093263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Discovery Algorithm for Directed Cyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Thomas S. Richardson","submitted_at":"2013-02-13T14:16:12Z","abstract_excerpt":"Directed acyclic graphs have been used fruitfully to represent causal strucures (Pearl 1988).  However, in the social sciences and elsewhere models are often used which correspond both causally and statistically to directed graphs with directed cycles (Spirtes 1995).  Pearl (1993) discussed predicting the effects of intervention in models of this kind, so-called linear non-recursive structural equation models.  This raises the question of whether it is possible to make inferences about causal structure with cycles, form sample data.  In particular do there exist general, informative, feasible "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3599","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/1302.3599/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":"1302.3599","created_at":"2026-07-05T01:45:18.093321+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3599v1","created_at":"2026-07-05T01:45:18.093321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3599","created_at":"2026-07-05T01:45:18.093321+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KIGCFAKJ5YX","created_at":"2026-07-05T01:45:18.093321+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KIGCFAKJ5YXCRIV","created_at":"2026-07-05T01:45:18.093321+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KIGCFAK","created_at":"2026-07-05T01:45:18.093321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01057","citing_title":"Characterizing and Identifying Separable Graphical Models","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7","json":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7.json","graph_json":"https://pith.science/api/pith-number/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/graph.json","events_json":"https://pith.science/api/pith-number/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/events.json","paper":"https://pith.science/paper/4KIGCFAK"},"agent_actions":{"view_html":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7","download_json":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7.json","view_paper":"https://pith.science/paper/4KIGCFAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3599&json=true","fetch_graph":"https://pith.science/api/pith-number/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/action/storage_attestation","attest_author":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/action/author_attestation","sign_citation":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/action/citation_signature","submit_replication":"https://pith.science/pith/4KIGCFAKJ5YXCRIV5MN7ABTQQ7/action/replication_record"}},"created_at":"2026-07-05T01:45:18.093321+00:00","updated_at":"2026-07-05T01:45:18.093321+00:00"}