{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O3OR4WYBK54ZLHGSMKBFR4YDW6","short_pith_number":"pith:O3OR4WYB","canonical_record":{"source":{"id":"1608.05810","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-20T11:25:08Z","cross_cats_sorted":["stat.OT","stat.TH"],"title_canon_sha256":"45a94d38932be8ab1a8ad9bade42f7fac29feb7d18cf148c6b661430967136dd","abstract_canon_sha256":"e4e35f6b497ab3c50a521afb5345c9bb37c26190ec32a1c1876b31eb916f2058"},"schema_version":"1.0"},"canonical_sha256":"76dd1e5b015779959cd2628258f303b78b2f371b0dd01e2d128a6a8669ba4d98","source":{"kind":"arxiv","id":"1608.05810","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05810","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05810v4","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05810","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"O3OR4WYBK54Z","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O3OR4WYBK54ZLHGS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O3OR4WYB","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O3OR4WYBK54ZLHGSMKBFR4YDW6","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05810","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-20T11:25:08Z","cross_cats_sorted":["stat.OT","stat.TH"],"title_canon_sha256":"45a94d38932be8ab1a8ad9bade42f7fac29feb7d18cf148c6b661430967136dd","abstract_canon_sha256":"e4e35f6b497ab3c50a521afb5345c9bb37c26190ec32a1c1876b31eb916f2058"},"schema_version":"1.0"},"canonical_sha256":"76dd1e5b015779959cd2628258f303b78b2f371b0dd01e2d128a6a8669ba4d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:33.447571Z","signature_b64":"/h6GBecNa6cbWCF+ps53NFGshqAWeWHQpaGofHnRfatL7YDt0Sedpd+DQRpLbgNQWNrQbGK9qMyd7tsJngy9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76dd1e5b015779959cd2628258f303b78b2f371b0dd01e2d128a6a8669ba4d98","last_reissued_at":"2026-05-18T00:40:33.446789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:33.446789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05810","source_version":4,"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:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hRTY4MUrY2zV7gs0VzwQEcOYC8rGEaFV8TfT32U1PHFg8gaMhcru15y93rAXiGT1YlLauWs5DsB8s9Wd38mXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:57:28.558658Z"},"content_sha256":"c19a866600098c35da73bdf692f1eac7869069678a8299524c76626aef2acf1a","schema_version":"1.0","event_id":"sha256:c19a866600098c35da73bdf692f1eac7869069678a8299524c76626aef2acf1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O3OR4WYBK54ZLHGSMKBFR4YDW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unifying Markov Properties for Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.OT","stat.TH"],"primary_cat":"math.ST","authors_text":"Kayvan Sadeghi, Steffen Lauritzen","submitted_at":"2016-08-20T11:25:08Z","abstract_excerpt":"Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class of graphs with four types of edges --- lines, arrows, arcs, and dotted lines --- and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05810","kind":"arxiv","version":4},"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:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaSNYwjaegNbxL9E4WXa9eVteHs6egx3gzyA7GrBQAnr8wIXk8sTLJ2yUluDQoRGvLeSCl/l1sC2vOzxeNUYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:57:28.559291Z"},"content_sha256":"632601b21fdf9e6dbb376691e8d7b1533eeec29c2b2b95cd6dc29b13a6511696","schema_version":"1.0","event_id":"sha256:632601b21fdf9e6dbb376691e8d7b1533eeec29c2b2b95cd6dc29b13a6511696"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/bundle.json","state_url":"https://pith.science/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/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-31T03:57:28Z","links":{"resolver":"https://pith.science/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6","bundle":"https://pith.science/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/bundle.json","state":"https://pith.science/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3OR4WYBK54ZLHGSMKBFR4YDW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O3OR4WYBK54ZLHGSMKBFR4YDW6","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":"e4e35f6b497ab3c50a521afb5345c9bb37c26190ec32a1c1876b31eb916f2058","cross_cats_sorted":["stat.OT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-20T11:25:08Z","title_canon_sha256":"45a94d38932be8ab1a8ad9bade42f7fac29feb7d18cf148c6b661430967136dd"},"schema_version":"1.0","source":{"id":"1608.05810","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05810","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05810v4","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05810","created_at":"2026-05-18T00:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"O3OR4WYBK54Z","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"O3OR4WYBK54ZLHGS","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"O3OR4WYB","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:632601b21fdf9e6dbb376691e8d7b1533eeec29c2b2b95cd6dc29b13a6511696","target":"graph","created_at":"2026-05-18T00:40:33Z","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":"Several types of graphs with different conditional independence interpretations --- also known as Markov properties --- have been proposed and used in graphical models. In this paper we unify these Markov properties by introducing a class of graphs with four types of edges --- lines, arrows, arcs, and dotted lines --- and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed g","authors_text":"Kayvan Sadeghi, Steffen Lauritzen","cross_cats":["stat.OT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-20T11:25:08Z","title":"Unifying Markov Properties for Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05810","kind":"arxiv","version":4},"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:c19a866600098c35da73bdf692f1eac7869069678a8299524c76626aef2acf1a","target":"record","created_at":"2026-05-18T00:40:33Z","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":"e4e35f6b497ab3c50a521afb5345c9bb37c26190ec32a1c1876b31eb916f2058","cross_cats_sorted":["stat.OT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-08-20T11:25:08Z","title_canon_sha256":"45a94d38932be8ab1a8ad9bade42f7fac29feb7d18cf148c6b661430967136dd"},"schema_version":"1.0","source":{"id":"1608.05810","kind":"arxiv","version":4}},"canonical_sha256":"76dd1e5b015779959cd2628258f303b78b2f371b0dd01e2d128a6a8669ba4d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76dd1e5b015779959cd2628258f303b78b2f371b0dd01e2d128a6a8669ba4d98","first_computed_at":"2026-05-18T00:40:33.446789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:33.446789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/h6GBecNa6cbWCF+ps53NFGshqAWeWHQpaGofHnRfatL7YDt0Sedpd+DQRpLbgNQWNrQbGK9qMyd7tsJngy9Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:33.447571Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05810","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c19a866600098c35da73bdf692f1eac7869069678a8299524c76626aef2acf1a","sha256:632601b21fdf9e6dbb376691e8d7b1533eeec29c2b2b95cd6dc29b13a6511696"],"state_sha256":"2ed7be5b22c3fc265fddf718de37c373031b08b4a4e8c5dbd81a6d818a0a4392"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQHEVHwe/hhS6Lr+F1C+YaxmWkdIjnV/bD8fO2ZFpKyTniJQkZcNlkV2cshXP72AT+4y5VKE4Ki098HGquctAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:57:28.562492Z","bundle_sha256":"ff84bca644ad5a90733000bded45410e9b323ead16fdf8a85f9d838d17f61642"}}