{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N2LFO7XNDRB6VU7OS4VLOCCCLX","short_pith_number":"pith:N2LFO7XN","schema_version":"1.0","canonical_sha256":"6e96577eed1c43ead3ee972ab708425df9b4d326f95dd5fa9fa1405a1ae84df9","source":{"kind":"arxiv","id":"1701.06686","version":6},"attestation_state":"computed","paper":{"title":"Nested Markov Properties for Acyclic Directed Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ilya Shpitser, James M. Robins, Robin J. Evans, Thomas S. Richardson","submitted_at":"2017-01-23T23:56:09Z","abstract_excerpt":"Conditional independence models associated with directed acyclic graphs (DAGs) may be characterized in at least three different ways: via a factorization, the global Markov property (given by the d-separation criterion), and the local Markov property. Marginals of DAG models also imply equality constraints that are not conditional independences; the well-known ``Verma constraint'' is an example. Constraints of this type are used for testing edges, and in a computationally efficient marginalization scheme via variable elimination.\n  We show that equality constraints like the ``Verma constraint'"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1701.06686","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-23T23:56:09Z","cross_cats_sorted":[],"title_canon_sha256":"9a29d0f836a2f0987331c5a8fa605659e466c0916e3e59a35df942790350f7bd","abstract_canon_sha256":"d9d6415c6868d886a82dfffa08a38e26b35634f814c7cfdbd944d4cc1b596cf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:10.055288Z","signature_b64":"Q+x69uP0FOz259xN9KIk2fKLpWCXCImW3d+V4d3LjfJ0LyttHEPCJmOmfLBSQVpXqr9y8VnL5x8oIw3KPq5TDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e96577eed1c43ead3ee972ab708425df9b4d326f95dd5fa9fa1405a1ae84df9","last_reissued_at":"2026-07-05T06:54:10.054816Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:10.054816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested Markov Properties for Acyclic Directed Mixed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ilya Shpitser, James M. Robins, Robin J. Evans, Thomas S. Richardson","submitted_at":"2017-01-23T23:56:09Z","abstract_excerpt":"Conditional independence models associated with directed acyclic graphs (DAGs) may be characterized in at least three different ways: via a factorization, the global Markov property (given by the d-separation criterion), and the local Markov property. Marginals of DAG models also imply equality constraints that are not conditional independences; the well-known ``Verma constraint'' is an example. Constraints of this type are used for testing edges, and in a computationally efficient marginalization scheme via variable elimination.\n  We show that equality constraints like the ``Verma constraint'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06686","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1701.06686/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06686","created_at":"2026-07-05T06:54:10.054875+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06686v6","created_at":"2026-07-05T06:54:10.054875+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06686","created_at":"2026-07-05T06:54:10.054875+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2LFO7XNDRB6","created_at":"2026-07-05T06:54:10.054875+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2LFO7XNDRB6VU7O","created_at":"2026-07-05T06:54:10.054875+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2LFO7XN","created_at":"2026-07-05T06:54:10.054875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.09537","citing_title":"Algebraic Statistics in Practice: Applications to Networks","ref_index":99,"is_internal_anchor":false},{"citing_arxiv_id":"1907.00241","citing_title":"Identification In Missing Data Models Represented By Directed Acyclic Graphs","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2312.10234","citing_title":"Flexible Nonparametric Inference for Causal Effects under the Front-Door Model","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX","json":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX.json","graph_json":"https://pith.science/api/pith-number/N2LFO7XNDRB6VU7OS4VLOCCCLX/graph.json","events_json":"https://pith.science/api/pith-number/N2LFO7XNDRB6VU7OS4VLOCCCLX/events.json","paper":"https://pith.science/paper/N2LFO7XN"},"agent_actions":{"view_html":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX","download_json":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX.json","view_paper":"https://pith.science/paper/N2LFO7XN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06686&json=true","fetch_graph":"https://pith.science/api/pith-number/N2LFO7XNDRB6VU7OS4VLOCCCLX/graph.json","fetch_events":"https://pith.science/api/pith-number/N2LFO7XNDRB6VU7OS4VLOCCCLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX/action/storage_attestation","attest_author":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX/action/author_attestation","sign_citation":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX/action/citation_signature","submit_replication":"https://pith.science/pith/N2LFO7XNDRB6VU7OS4VLOCCCLX/action/replication_record"}},"created_at":"2026-07-05T06:54:10.054875+00:00","updated_at":"2026-07-05T06:54:10.054875+00:00"}