{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7WVPW6UDC5USOBCZWDQY4CJ7IO","short_pith_number":"pith:7WVPW6UD","schema_version":"1.0","canonical_sha256":"fdaafb7a831769270459b0e18e093f43904884511c27bc7996c3d022c40a33f8","source":{"kind":"arxiv","id":"1612.00099","version":3},"attestation_state":"computed","paper":{"title":"PAG2ADMG: An Algorithm for the Complete Causal Enumeration of a Markov Equivalence Class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.ML","authors_text":"Nishant Subramani","submitted_at":"2016-12-01T01:08:27Z","abstract_excerpt":"Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single causal graph consistent with the independencies and dependencies (the Markov equivalence class $M$) estimated from the data. This is problematic and insufficient because many distinct graphs may be consistent with $M$. A data modeler may wish to select among these numerous consisten"},"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":"1612.00099","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-12-01T01:08:27Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"cd5ca21ac615e99821a82e95cfb2c439599f37e388c6f8bad4623b05b9959eab","abstract_canon_sha256":"b9c6da2b26bb412f0beaa9802647b7302fd5e1c2d25d772e6b1969a2b25d4636"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:39.707237Z","signature_b64":"N5j6MfMQ4cwOE7iVw95wAedNxi0SlX1mHf10Imf83Lg5opBUaxDOm/h+J/lFbC92XVrpFADXy2Wi92Gh7zzZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdaafb7a831769270459b0e18e093f43904884511c27bc7996c3d022c40a33f8","last_reissued_at":"2026-05-18T00:25:39.706587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:39.706587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PAG2ADMG: An Algorithm for the Complete Causal Enumeration of a Markov Equivalence Class","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.ML","authors_text":"Nishant Subramani","submitted_at":"2016-12-01T01:08:27Z","abstract_excerpt":"Causal graphs, such as directed acyclic graphs (DAGs) and partial ancestral graphs (PAGs), represent causal relationships among variables in a model. Methods exist for learning DAGs and PAGs from data and for converting DAGs to PAGs. However, these methods are significantly limited in that they only output a single causal graph consistent with the independencies and dependencies (the Markov equivalence class $M$) estimated from the data. This is problematic and insufficient because many distinct graphs may be consistent with $M$. A data modeler may wish to select among these numerous consisten"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00099","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.00099","created_at":"2026-05-18T00:25:39.706682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00099v3","created_at":"2026-05-18T00:25:39.706682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00099","created_at":"2026-05-18T00:25:39.706682+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WVPW6UDC5US","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WVPW6UDC5USOBCZ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WVPW6UD","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO","json":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO.json","graph_json":"https://pith.science/api/pith-number/7WVPW6UDC5USOBCZWDQY4CJ7IO/graph.json","events_json":"https://pith.science/api/pith-number/7WVPW6UDC5USOBCZWDQY4CJ7IO/events.json","paper":"https://pith.science/paper/7WVPW6UD"},"agent_actions":{"view_html":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO","download_json":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO.json","view_paper":"https://pith.science/paper/7WVPW6UD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00099&json=true","fetch_graph":"https://pith.science/api/pith-number/7WVPW6UDC5USOBCZWDQY4CJ7IO/graph.json","fetch_events":"https://pith.science/api/pith-number/7WVPW6UDC5USOBCZWDQY4CJ7IO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO/action/storage_attestation","attest_author":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO/action/author_attestation","sign_citation":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO/action/citation_signature","submit_replication":"https://pith.science/pith/7WVPW6UDC5USOBCZWDQY4CJ7IO/action/replication_record"}},"created_at":"2026-05-18T00:25:39.706682+00:00","updated_at":"2026-05-18T00:25:39.706682+00:00"}