{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6HS2QBXXWRHU6UKYUKJEPX5M6N","short_pith_number":"pith:6HS2QBXX","canonical_record":{"source":{"id":"1611.07493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"82a12c43bfa16fa4e3c0fbe68b4f5e458135559a754c63737f6c30d930b08fef","abstract_canon_sha256":"5766888624d37322eab6ca04aabbb4bcd59f45371462b034d5aa383284d81a04"},"schema_version":"1.0"},"canonical_sha256":"f1e5a806f7b44f4f5158a29247dfacf37945b213a975ad36d7e911b308b63dc5","source":{"kind":"arxiv","id":"1611.07493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07493","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07493v2","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07493","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"6HS2QBXXWRHU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HS2QBXXWRHU6UKY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HS2QBXX","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6HS2QBXXWRHU6UKYUKJEPX5M6N","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"82a12c43bfa16fa4e3c0fbe68b4f5e458135559a754c63737f6c30d930b08fef","abstract_canon_sha256":"5766888624d37322eab6ca04aabbb4bcd59f45371462b034d5aa383284d81a04"},"schema_version":"1.0"},"canonical_sha256":"f1e5a806f7b44f4f5158a29247dfacf37945b213a975ad36d7e911b308b63dc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:12.650044Z","signature_b64":"yB+CPsgcybxiklszsEp49/eySsEjts1eydpIjzUKLxcvC7Bls+B30rDcradfwBb0BB1ESDVy8VHZWXVsDGzyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1e5a806f7b44f4f5158a29247dfacf37945b213a975ad36d7e911b308b63dc5","last_reissued_at":"2026-05-18T00:42:12.649535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.649535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07493","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:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWtQe1/z/9ecFb/ZtVollEpI5YMDH2lHvZ/Xcz9RoyGZd+2FUcHdwutFVE9bOb7XwG1QNNkQzfxyqUPxxcc4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:16:10.493884Z"},"content_sha256":"1f653062b5e6c006ff516e50640e68d5bc0184a64a36a9be2ae3cfb82f051a8a","schema_version":"1.0","event_id":"sha256:1f653062b5e6c006ff516e50640e68d5bc0184a64a36a9be2ae3cfb82f051a8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6HS2QBXXWRHU6UKYUKJEPX5M6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Markov Equivalence Classes by Number of Immoralities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adityanarayanan Radhakrishnan, Caroline Uhler, Liam Solus","submitted_at":"2016-11-22T20:09:14Z","abstract_excerpt":"Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. Using observational data, a DAG model can only be determined up to Markov equivalence, and so it is desirable to understand the size and number of Markov equivalence classes (MECs) combinatorially. In this paper, we address this enumerative question using a pair of generating functions that encode the number and size of MECs on a skeleton $G$, and in doing so we connect this problem to classical problems in combinatorial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07493","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:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YvHwfm/Y0itO+Vwt3UV4zZSZyo90VaKHRYR+KjfS5YJ5Jl/Vhw9qXrhQcDZnoKYi6LGIAiifgWNLpKzy5jfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:16:10.494603Z"},"content_sha256":"2587f3e77c5e430ea81f5b9bdb978ba60633f3b17c21c6c22cf7f4b29ea2877f","schema_version":"1.0","event_id":"sha256:2587f3e77c5e430ea81f5b9bdb978ba60633f3b17c21c6c22cf7f4b29ea2877f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/bundle.json","state_url":"https://pith.science/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/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-30T12:16:10Z","links":{"resolver":"https://pith.science/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N","bundle":"https://pith.science/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/bundle.json","state":"https://pith.science/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HS2QBXXWRHU6UKYUKJEPX5M6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6HS2QBXXWRHU6UKYUKJEPX5M6N","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":"5766888624d37322eab6ca04aabbb4bcd59f45371462b034d5aa383284d81a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:09:14Z","title_canon_sha256":"82a12c43bfa16fa4e3c0fbe68b4f5e458135559a754c63737f6c30d930b08fef"},"schema_version":"1.0","source":{"id":"1611.07493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07493","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07493v2","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07493","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"6HS2QBXXWRHU","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"6HS2QBXXWRHU6UKY","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"6HS2QBXX","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2587f3e77c5e430ea81f5b9bdb978ba60633f3b17c21c6c22cf7f4b29ea2877f","target":"graph","created_at":"2026-05-18T00:42:12Z","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":"Two directed acyclic graphs (DAGs) are called Markov equivalent if and only if they have the same underlying undirected graph (i.e. skeleton) and the same set of immoralities. Using observational data, a DAG model can only be determined up to Markov equivalence, and so it is desirable to understand the size and number of Markov equivalence classes (MECs) combinatorially. In this paper, we address this enumerative question using a pair of generating functions that encode the number and size of MECs on a skeleton $G$, and in doing so we connect this problem to classical problems in combinatorial","authors_text":"Adityanarayanan Radhakrishnan, Caroline Uhler, Liam Solus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:09:14Z","title":"Counting Markov Equivalence Classes by Number of Immoralities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07493","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:1f653062b5e6c006ff516e50640e68d5bc0184a64a36a9be2ae3cfb82f051a8a","target":"record","created_at":"2026-05-18T00:42:12Z","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":"5766888624d37322eab6ca04aabbb4bcd59f45371462b034d5aa383284d81a04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-22T20:09:14Z","title_canon_sha256":"82a12c43bfa16fa4e3c0fbe68b4f5e458135559a754c63737f6c30d930b08fef"},"schema_version":"1.0","source":{"id":"1611.07493","kind":"arxiv","version":2}},"canonical_sha256":"f1e5a806f7b44f4f5158a29247dfacf37945b213a975ad36d7e911b308b63dc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1e5a806f7b44f4f5158a29247dfacf37945b213a975ad36d7e911b308b63dc5","first_computed_at":"2026-05-18T00:42:12.649535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:12.649535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yB+CPsgcybxiklszsEp49/eySsEjts1eydpIjzUKLxcvC7Bls+B30rDcradfwBb0BB1ESDVy8VHZWXVsDGzyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:12.650044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f653062b5e6c006ff516e50640e68d5bc0184a64a36a9be2ae3cfb82f051a8a","sha256:2587f3e77c5e430ea81f5b9bdb978ba60633f3b17c21c6c22cf7f4b29ea2877f"],"state_sha256":"5372d7053d18980d623189bc36fc50ef15184585adf952e127d4c1b368701422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZHApaDDC7sTT67eJFfGw2hwniAWPK3f64MKA7C27JeMog81cmVyA/hdWlQdFAPV6eVzVYhv29LSdnC2VTruBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:16:10.498387Z","bundle_sha256":"f1dc7cf6c40fe29e0dd211d813b9f64c0d07139e1656c1b44ddbaa401d33dd51"}}