{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UCHKHUKYTOQO2U7C6IOOB3A6QL","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":"f9748fa964660e2540bd3aabbcb2a0d7f6ff448f26bfa76d823dceb18f47759a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:11:19Z","title_canon_sha256":"1cd57d2e804947b9109c830f6b051f631b017c817c8f0295ca1b483fce9cb4dc"},"schema_version":"1.0","source":{"id":"1302.3549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3549","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3549v1","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3549","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"UCHKHUKYTOQO","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UCHKHUKYTOQO2U7C","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UCHKHUKY","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:9424249239f5354a4ebae976fdab90ee16c55c46fc95d00776abd0245f538b2c","target":"graph","created_at":"2026-05-18T03:33:37Z","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":"The criterion commonly used in directed acyclic graphs (dags) for testing graphical independence is the well-known d-separation criterion.  It allows us to build graphical representations of dependency models (usually probabilistic dependency models) in the form of belief networks, which make easy interpretation and management of independence relationships possible, without reference to numerical parameters (conditional probabilities).  In this paper, we study the following combinatorial problem: finding the minimum d-separating set for two nodes in a dag.  This set would represent the minimum","authors_text":"Luis M. de Campos, Silvia Acid","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:11:19Z","title":"An Algorithm for Finding Minimum d-Separating Sets in Belief Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3549","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:a6535c0b69d26c52e3dda685e26a30caba421cb5dd3ee09fe34190cb65ef7143","target":"record","created_at":"2026-05-18T03:33:37Z","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":"f9748fa964660e2540bd3aabbcb2a0d7f6ff448f26bfa76d823dceb18f47759a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:11:19Z","title_canon_sha256":"1cd57d2e804947b9109c830f6b051f631b017c817c8f0295ca1b483fce9cb4dc"},"schema_version":"1.0","source":{"id":"1302.3549","kind":"arxiv","version":1}},"canonical_sha256":"a08ea3d1589ba0ed53e2f21ce0ec1e82f4d84db7d0f1298d486f53e7878bc764","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a08ea3d1589ba0ed53e2f21ce0ec1e82f4d84db7d0f1298d486f53e7878bc764","first_computed_at":"2026-05-18T03:33:37.020019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.020019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rCGAT4Oyj/53JGtqVOrhwNmGVsLtluOGtPq1zRnIMzzfCEGSeR0SXbu/2eHZF10kFD3IDcDPpIH0BfMmdjCCDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.020739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6535c0b69d26c52e3dda685e26a30caba421cb5dd3ee09fe34190cb65ef7143","sha256:9424249239f5354a4ebae976fdab90ee16c55c46fc95d00776abd0245f538b2c"],"state_sha256":"6807eb7412361482daaca71e68889bccd5cd99ff3d8b2698956fa3aed8660fdc"}