{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2SBFJU2HVEJDJGYRYCA4EO5YM6","short_pith_number":"pith:2SBFJU2H","canonical_record":{"source":{"id":"1805.02087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-05T17:12:10Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"b0c3ef76ba99eb82504b4ea1855589233e9427aff69577ce00e34653308a4e2c","abstract_canon_sha256":"ef06804ac65c171bee83dac94be4c91c21388ae445a3d5b64afc2e8753adcda7"},"schema_version":"1.0"},"canonical_sha256":"d48254d347a912349b11c081c23bb86782067c882ca009a98fc9f628b48030a5","source":{"kind":"arxiv","id":"1805.02087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02087","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02087v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02087","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"2SBFJU2HVEJD","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SBFJU2HVEJDJGYR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SBFJU2H","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2SBFJU2HVEJDJGYRYCA4EO5YM6","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-05T17:12:10Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"b0c3ef76ba99eb82504b4ea1855589233e9427aff69577ce00e34653308a4e2c","abstract_canon_sha256":"ef06804ac65c171bee83dac94be4c91c21388ae445a3d5b64afc2e8753adcda7"},"schema_version":"1.0"},"canonical_sha256":"d48254d347a912349b11c081c23bb86782067c882ca009a98fc9f628b48030a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:40.997489Z","signature_b64":"1FBxYssjZhzbhcQIc2rr2kBK8LYTTJG3IvJSL/mpILiFqnIVHrTqqTlwum1BTf4MCQvlVy9qDFqBnMJkerD3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d48254d347a912349b11c081c23bb86782067c882ca009a98fc9f628b48030a5","last_reissued_at":"2026-05-18T00:16:40.996902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:40.996902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02087","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWsVzBdegvjXFrpQa8O/zGAG1HiBrNiuGi84bVdnubVqVw/3/NL6yyVQmOSS0NW4A83NAS5gLw7+N3HbFp7lCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:43:47.406585Z"},"content_sha256":"2222c3858c19e5d07a6547c114a1dc3325cd4097dcda67051c7668382918811c","schema_version":"1.0","event_id":"sha256:2222c3858c19e5d07a6547c114a1dc3325cd4097dcda67051c7668382918811c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2SBFJU2HVEJDJGYRYCA4EO5YM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Constraint-Based Algorithm For Causal Discovery with Cycles, Latent Variables and Selection Bias","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Eric V. Strobl","submitted_at":"2018-05-05T17:12:10Z","abstract_excerpt":"Causal processes in nature may contain cycles, and real datasets may violate causal sufficiency as well as contain selection bias. No constraint-based causal discovery algorithm can currently handle cycles, latent variables and selection bias (CLS) simultaneously. I therefore introduce an algorithm called Cyclic Causal Inference (CCI) that makes sound inferences with a conditional independence oracle under CLS, provided that we can represent the cyclic causal process as a non-recursive linear structural equation model with independent errors. Empirical results show that CCI outperforms CCD in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02087","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3Cu00pDfnxh913tNuThyADkzb0n7iXv+Y5VCRF/zVW8YbfQoFf/SXdwBPSViBykVRAxqBNw3jOOQadpLTrABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:43:47.406934Z"},"content_sha256":"50f75f74d2aedd5ed922efe3df5bfbf22de4224aec27211d3bd0e187872ccc04","schema_version":"1.0","event_id":"sha256:50f75f74d2aedd5ed922efe3df5bfbf22de4224aec27211d3bd0e187872ccc04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/bundle.json","state_url":"https://pith.science/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T08:43:47Z","links":{"resolver":"https://pith.science/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6","bundle":"https://pith.science/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/bundle.json","state":"https://pith.science/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2SBFJU2HVEJDJGYRYCA4EO5YM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2SBFJU2HVEJDJGYRYCA4EO5YM6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ef06804ac65c171bee83dac94be4c91c21388ae445a3d5b64afc2e8753adcda7","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-05T17:12:10Z","title_canon_sha256":"b0c3ef76ba99eb82504b4ea1855589233e9427aff69577ce00e34653308a4e2c"},"schema_version":"1.0","source":{"id":"1805.02087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02087","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02087v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02087","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"2SBFJU2HVEJD","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2SBFJU2HVEJDJGYR","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2SBFJU2H","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:50f75f74d2aedd5ed922efe3df5bfbf22de4224aec27211d3bd0e187872ccc04","target":"graph","created_at":"2026-05-18T00:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Causal processes in nature may contain cycles, and real datasets may violate causal sufficiency as well as contain selection bias. No constraint-based causal discovery algorithm can currently handle cycles, latent variables and selection bias (CLS) simultaneously. I therefore introduce an algorithm called Cyclic Causal Inference (CCI) that makes sound inferences with a conditional independence oracle under CLS, provided that we can represent the cyclic causal process as a non-recursive linear structural equation model with independent errors. Empirical results show that CCI outperforms CCD in ","authors_text":"Eric V. Strobl","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-05T17:12:10Z","title":"A Constraint-Based Algorithm For Causal Discovery with Cycles, Latent Variables and Selection Bias"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02087","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2222c3858c19e5d07a6547c114a1dc3325cd4097dcda67051c7668382918811c","target":"record","created_at":"2026-05-18T00:16:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ef06804ac65c171bee83dac94be4c91c21388ae445a3d5b64afc2e8753adcda7","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-05-05T17:12:10Z","title_canon_sha256":"b0c3ef76ba99eb82504b4ea1855589233e9427aff69577ce00e34653308a4e2c"},"schema_version":"1.0","source":{"id":"1805.02087","kind":"arxiv","version":1}},"canonical_sha256":"d48254d347a912349b11c081c23bb86782067c882ca009a98fc9f628b48030a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d48254d347a912349b11c081c23bb86782067c882ca009a98fc9f628b48030a5","first_computed_at":"2026-05-18T00:16:40.996902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:40.996902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1FBxYssjZhzbhcQIc2rr2kBK8LYTTJG3IvJSL/mpILiFqnIVHrTqqTlwum1BTf4MCQvlVy9qDFqBnMJkerD3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:40.997489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2222c3858c19e5d07a6547c114a1dc3325cd4097dcda67051c7668382918811c","sha256:50f75f74d2aedd5ed922efe3df5bfbf22de4224aec27211d3bd0e187872ccc04"],"state_sha256":"7c6daa1c13f832ba90c9159e41f9e48bbe9969566cc96f60a940ea4754683c09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"um45j+Zl5YtT1Wuz0YgE0xybnHKijZ1X6qc3hJE9JEU+Aygem2ry6fNwhfW8EYmpzB1tyqcNVT9agvyqGpvSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:43:47.408990Z","bundle_sha256":"ed224d4cec712638c95b7462f57a3564f5d738d5273c8d8bdeeddd8a09794885"}}