{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MS3H4PFEJVMYICRQQWQJ76XEI7","short_pith_number":"pith:MS3H4PFE","canonical_record":{"source":{"id":"1701.08366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T11:49:54Z","cross_cats_sorted":["stat.OT","stat.TH"],"title_canon_sha256":"680435e9979944c642c111b7efa130100e324fdb62daf516a780b6d470f2a16e","abstract_canon_sha256":"5943f4dd353a8acd19d18a5107db82cedc16286d4a625759bd0f52ecf4f22a7e"},"schema_version":"1.0"},"canonical_sha256":"64b67e3ca44d59840a3085a09ffae447d994ec9e1698d3d612e35444ab754ef7","source":{"kind":"arxiv","id":"1701.08366","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08366","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08366v2","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08366","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"MS3H4PFEJVMY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MS3H4PFEJVMYICRQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MS3H4PFE","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MS3H4PFEJVMYICRQQWQJ76XEI7","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T11:49:54Z","cross_cats_sorted":["stat.OT","stat.TH"],"title_canon_sha256":"680435e9979944c642c111b7efa130100e324fdb62daf516a780b6d470f2a16e","abstract_canon_sha256":"5943f4dd353a8acd19d18a5107db82cedc16286d4a625759bd0f52ecf4f22a7e"},"schema_version":"1.0"},"canonical_sha256":"64b67e3ca44d59840a3085a09ffae447d994ec9e1698d3d612e35444ab754ef7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:02.007522Z","signature_b64":"AwblRaRRdIrLBdLBtXYXo2/vmklPtutICXa4NlVlGMJDHQ5UnM1NncdH40jw1SIHDJPHEa+kYmH+OKhkWSRQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64b67e3ca44d59840a3085a09ffae447d994ec9e1698d3d612e35444ab754ef7","last_reissued_at":"2026-05-18T00:25:02.007070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:02.007070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08366","source_version":2,"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0kDxFeUBkn4GsQqElW4EKnN0MxDIALXJcV52UZerP+pIyy7HFIJDDGhiMYmUksA5xb46GVxIY1C7bzmCxdBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:11:35.882655Z"},"content_sha256":"38e9b68ed714eb1213ab0f38ada6e078bb92462fed484de155fe42bb99f52e88","schema_version":"1.0","event_id":"sha256:38e9b68ed714eb1213ab0f38ada6e078bb92462fed484de155fe42bb99f52e88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MS3H4PFEJVMYICRQQWQJ76XEI7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faithfulness of Probability Distributions and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.OT","stat.TH"],"primary_cat":"math.ST","authors_text":"Kayvan Sadeghi","submitted_at":"2017-01-29T11:49:54Z","abstract_excerpt":"A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this paper is to provide a theoretical answer to this problem. We work with general independence models, which contain probabilistic independence models as a special case. We exploit a generalization of ordering, called preordering, of the nodes of (mixed) graphs. This allows us to provide sufficient conditions for a given independence model to be Markov to a graph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08366","kind":"arxiv","version":2},"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:25:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BPvcCukMm23JGwXFbj8/g+o60lOX53f0uDVJht6PVLJO9pURKH+3ALf4P4ORTQMfCbxwszRgnnivlnzvApNWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:11:35.882995Z"},"content_sha256":"31c4baf054a66bc7fcab583fd2f2b41c59e0a0d1d6186b7f9043a116a7505d32","schema_version":"1.0","event_id":"sha256:31c4baf054a66bc7fcab583fd2f2b41c59e0a0d1d6186b7f9043a116a7505d32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/bundle.json","state_url":"https://pith.science/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/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-31T02:11:35Z","links":{"resolver":"https://pith.science/pith/MS3H4PFEJVMYICRQQWQJ76XEI7","bundle":"https://pith.science/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/bundle.json","state":"https://pith.science/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MS3H4PFEJVMYICRQQWQJ76XEI7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MS3H4PFEJVMYICRQQWQJ76XEI7","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":"5943f4dd353a8acd19d18a5107db82cedc16286d4a625759bd0f52ecf4f22a7e","cross_cats_sorted":["stat.OT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T11:49:54Z","title_canon_sha256":"680435e9979944c642c111b7efa130100e324fdb62daf516a780b6d470f2a16e"},"schema_version":"1.0","source":{"id":"1701.08366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08366","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08366v2","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08366","created_at":"2026-05-18T00:25:02Z"},{"alias_kind":"pith_short_12","alias_value":"MS3H4PFEJVMY","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MS3H4PFEJVMYICRQ","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MS3H4PFE","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:31c4baf054a66bc7fcab583fd2f2b41c59e0a0d1d6186b7f9043a116a7505d32","target":"graph","created_at":"2026-05-18T00:25:02Z","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":"A main question in graphical models and causal inference is whether, given a probability distribution $P$ (which is usually an underlying distribution of data), there is a graph (or graphs) to which $P$ is faithful. The main goal of this paper is to provide a theoretical answer to this problem. We work with general independence models, which contain probabilistic independence models as a special case. We exploit a generalization of ordering, called preordering, of the nodes of (mixed) graphs. This allows us to provide sufficient conditions for a given independence model to be Markov to a graph","authors_text":"Kayvan Sadeghi","cross_cats":["stat.OT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T11:49:54Z","title":"Faithfulness of Probability Distributions and Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08366","kind":"arxiv","version":2},"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:38e9b68ed714eb1213ab0f38ada6e078bb92462fed484de155fe42bb99f52e88","target":"record","created_at":"2026-05-18T00:25:02Z","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":"5943f4dd353a8acd19d18a5107db82cedc16286d4a625759bd0f52ecf4f22a7e","cross_cats_sorted":["stat.OT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-01-29T11:49:54Z","title_canon_sha256":"680435e9979944c642c111b7efa130100e324fdb62daf516a780b6d470f2a16e"},"schema_version":"1.0","source":{"id":"1701.08366","kind":"arxiv","version":2}},"canonical_sha256":"64b67e3ca44d59840a3085a09ffae447d994ec9e1698d3d612e35444ab754ef7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64b67e3ca44d59840a3085a09ffae447d994ec9e1698d3d612e35444ab754ef7","first_computed_at":"2026-05-18T00:25:02.007070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:02.007070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AwblRaRRdIrLBdLBtXYXo2/vmklPtutICXa4NlVlGMJDHQ5UnM1NncdH40jw1SIHDJPHEa+kYmH+OKhkWSRQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:02.007522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38e9b68ed714eb1213ab0f38ada6e078bb92462fed484de155fe42bb99f52e88","sha256:31c4baf054a66bc7fcab583fd2f2b41c59e0a0d1d6186b7f9043a116a7505d32"],"state_sha256":"c7d8b12cda2b23ecac7281b4e223572168df09c0bc37eb32c81d19c696340524"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KY+iXg9fIqchIox33eceAXkL8ubVmnC5iYluKZjKTjwWuvrTCvsjSKSk4+zqZqz03MGMbkUK5j0Dptxw3kPOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:11:35.884881Z","bundle_sha256":"59b90f407fdcf330cf13f408715c77df9960c1eeeaae5b0f4023557941d9da36"}}