{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KEFX4CXJSS2WW6WUYANMWVWUZL","short_pith_number":"pith:KEFX4CXJ","canonical_record":{"source":{"id":"1302.3600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"124b1f29167a2c345a2c7a2e31f42dcc301003751cd859491c5487aa1da7732d","abstract_canon_sha256":"6c9200ddf8ad50680d6402ebf64367cee95e265536b8cfea98f5febcdc306049"},"schema_version":"1.0"},"canonical_sha256":"510b7e0ae994b56b7ad4c01acb56d4cade08a9320a889a9e3ca5ea963d1d340e","source":{"kind":"arxiv","id":"1302.3600","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3600","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3600v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3600","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"KEFX4CXJSS2W","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEFX4CXJSS2WW6WU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEFX4CXJ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KEFX4CXJSS2WW6WUYANMWVWUZL","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3600","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"124b1f29167a2c345a2c7a2e31f42dcc301003751cd859491c5487aa1da7732d","abstract_canon_sha256":"6c9200ddf8ad50680d6402ebf64367cee95e265536b8cfea98f5febcdc306049"},"schema_version":"1.0"},"canonical_sha256":"510b7e0ae994b56b7ad4c01acb56d4cade08a9320a889a9e3ca5ea963d1d340e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.529264Z","signature_b64":"sFMAQk72WwjtQqlW3imKPyLsdfHyWExbgm906Eq1aQF6S3z7xxxg1GdU0kI9lCFYhUPfIP6ZhSUv5svkScXuAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"510b7e0ae994b56b7ad4c01acb56d4cade08a9320a889a9e3ca5ea963d1d340e","last_reissued_at":"2026-05-18T03:33:36.528683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.528683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3600","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyXBYj0u9/HHHPQVUo9jFs/n2X5mKGmmQZbddSj96QDbWp2P8dhWhTTR2agA7/mbvVhpw3e/IWGvYi+bU2n5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:31:03.513544Z"},"content_sha256":"d8964532cde66dec05df363c91b2153577c9c3d51357092c9a2035b8641b4d67","schema_version":"1.0","event_id":"sha256:d8964532cde66dec05df363c91b2153577c9c3d51357092c9a2035b8641b4d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KEFX4CXJSS2WW6WUYANMWVWUZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-Time Algorithm for Deciding Markov Equivalence of Directed Cyclic Graphical Models","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:18Z","abstract_excerpt":"Although the concept of d-separation was originally defined for directed acyclic graphs (see Pearl 1988), there is a natural extension of he concept to directed cyclic graphs.  When exactly the same set of d-separation relations hold in two directed graphs, no matter whether respectively cyclic or acyclic, we say that they are Markov equivalent.  In other words, when two directed cyclic graphs are Markov equivalent, the set of distributions that satisfy a natural extension of the Global Directed Markov condition (Lauritzen et al. 1990) is exactly the same for each graph.  There is an obvious e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3600","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-18T03:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g7ygEYoxB7NpSZzkggKG11C9p8glujXmmHLYRsSwYIgVBBYiFVATLt3kpBnYtl8DJf0LHqPERb0E+G8ObmToDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:31:03.514387Z"},"content_sha256":"3662a021d1856b532ebafdd4eb1b72e4d83624c5e1261b313e1d89ce6a31cee9","schema_version":"1.0","event_id":"sha256:3662a021d1856b532ebafdd4eb1b72e4d83624c5e1261b313e1d89ce6a31cee9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/bundle.json","state_url":"https://pith.science/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/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-31T17:31:03Z","links":{"resolver":"https://pith.science/pith/KEFX4CXJSS2WW6WUYANMWVWUZL","bundle":"https://pith.science/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/bundle.json","state":"https://pith.science/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEFX4CXJSS2WW6WUYANMWVWUZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KEFX4CXJSS2WW6WUYANMWVWUZL","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":"6c9200ddf8ad50680d6402ebf64367cee95e265536b8cfea98f5febcdc306049","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:18Z","title_canon_sha256":"124b1f29167a2c345a2c7a2e31f42dcc301003751cd859491c5487aa1da7732d"},"schema_version":"1.0","source":{"id":"1302.3600","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3600","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3600v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3600","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"KEFX4CXJSS2W","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEFX4CXJSS2WW6WU","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEFX4CXJ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:3662a021d1856b532ebafdd4eb1b72e4d83624c5e1261b313e1d89ce6a31cee9","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"Although the concept of d-separation was originally defined for directed acyclic graphs (see Pearl 1988), there is a natural extension of he concept to directed cyclic graphs.  When exactly the same set of d-separation relations hold in two directed graphs, no matter whether respectively cyclic or acyclic, we say that they are Markov equivalent.  In other words, when two directed cyclic graphs are Markov equivalent, the set of distributions that satisfy a natural extension of the Global Directed Markov condition (Lauritzen et al. 1990) is exactly the same for each graph.  There is an obvious e","authors_text":"Thomas S. Richardson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:18Z","title":"A Polynomial-Time Algorithm for Deciding Markov Equivalence of Directed Cyclic Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3600","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:d8964532cde66dec05df363c91b2153577c9c3d51357092c9a2035b8641b4d67","target":"record","created_at":"2026-05-18T03:33:36Z","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":"6c9200ddf8ad50680d6402ebf64367cee95e265536b8cfea98f5febcdc306049","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:16:18Z","title_canon_sha256":"124b1f29167a2c345a2c7a2e31f42dcc301003751cd859491c5487aa1da7732d"},"schema_version":"1.0","source":{"id":"1302.3600","kind":"arxiv","version":1}},"canonical_sha256":"510b7e0ae994b56b7ad4c01acb56d4cade08a9320a889a9e3ca5ea963d1d340e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"510b7e0ae994b56b7ad4c01acb56d4cade08a9320a889a9e3ca5ea963d1d340e","first_computed_at":"2026-05-18T03:33:36.528683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.528683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sFMAQk72WwjtQqlW3imKPyLsdfHyWExbgm906Eq1aQF6S3z7xxxg1GdU0kI9lCFYhUPfIP6ZhSUv5svkScXuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.529264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3600","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8964532cde66dec05df363c91b2153577c9c3d51357092c9a2035b8641b4d67","sha256:3662a021d1856b532ebafdd4eb1b72e4d83624c5e1261b313e1d89ce6a31cee9"],"state_sha256":"b2aa8289565f01e6812b2115dd70ec19b1b98b56d01e6b09e9e0de1b5d1e43ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZoD2GOPfX7vLk4pukFPKOzAYJpskZU1qKJgxgjEqZmKxEtUoFltPV/uUwVVCN01s3Gcbn9h0D8C1qmD37dtCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:31:03.519622Z","bundle_sha256":"e0b88ad593b9d6cd38331bb48ec8ed2c21211d34c21187e20d9e37ddfda19af1"}}