{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BVKLEZNY7XXTZ3OMPXCWVQJTSX","short_pith_number":"pith:BVKLEZNY","schema_version":"1.0","canonical_sha256":"0d54b265b8fdef3cedcc7dc56ac13395cedce0ec4bdec1a88af49283c55cb575","source":{"kind":"arxiv","id":"2203.00521","version":3},"attestation_state":"computed","paper":{"title":"A Transformational Characterization of Unconditionally Equivalent Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alex Markham, Danai Deligeorgaki, Liam Solus, Pratik Misra","submitted_at":"2022-03-01T15:04:49Z","abstract_excerpt":"We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i.e., when directed acyclic graphs (DAGs) have the same set of unconditional $d$-separation statements. Each unconditional equivalence class (UEC) is uniquely represented with an undirected graph whose clique structure encodes the members of the class. Via this structure, we provide a transformational characterization of unconditional equivalence; i.e., we show that two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of specified moves. We also extend"},"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":"2203.00521","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-03-01T15:04:49Z","cross_cats_sorted":["cs.LG","math.CO","math.ST","stat.TH"],"title_canon_sha256":"42a98740176e962725fb05ba87184285d84d2e9762527a6210947e1e1028f782","abstract_canon_sha256":"311c0e020d55a368edf18498fcb3b67e14f30475af7017d534f58a42026dbc16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:47:26.814101Z","signature_b64":"Ydym15TJr3ZYLlyn1Z11aVbQsMBmJwLE/I0SXK6nSum4LEelV7i4A6HGYc2iHFKZguN71cEQwkrGGjOOx4qJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d54b265b8fdef3cedcc7dc56ac13395cedce0ec4bdec1a88af49283c55cb575","last_reissued_at":"2026-07-05T04:47:26.813696Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:47:26.813696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Transformational Characterization of Unconditionally Equivalent Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.CO","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Alex Markham, Danai Deligeorgaki, Liam Solus, Pratik Misra","submitted_at":"2022-03-01T15:04:49Z","abstract_excerpt":"We consider the problem of characterizing Bayesian networks up to unconditional equivalence, i.e., when directed acyclic graphs (DAGs) have the same set of unconditional $d$-separation statements. Each unconditional equivalence class (UEC) is uniquely represented with an undirected graph whose clique structure encodes the members of the class. Via this structure, we provide a transformational characterization of unconditional equivalence; i.e., we show that two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of specified moves. We also extend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.00521","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.00521/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":"2203.00521","created_at":"2026-07-05T04:47:26.813754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.00521v3","created_at":"2026-07-05T04:47:26.813754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.00521","created_at":"2026-07-05T04:47:26.813754+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVKLEZNY7XXT","created_at":"2026-07-05T04:47:26.813754+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVKLEZNY7XXTZ3OM","created_at":"2026-07-05T04:47:26.813754+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVKLEZNY","created_at":"2026-07-05T04:47:26.813754+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/BVKLEZNY7XXTZ3OMPXCWVQJTSX","json":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX.json","graph_json":"https://pith.science/api/pith-number/BVKLEZNY7XXTZ3OMPXCWVQJTSX/graph.json","events_json":"https://pith.science/api/pith-number/BVKLEZNY7XXTZ3OMPXCWVQJTSX/events.json","paper":"https://pith.science/paper/BVKLEZNY"},"agent_actions":{"view_html":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX","download_json":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX.json","view_paper":"https://pith.science/paper/BVKLEZNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.00521&json=true","fetch_graph":"https://pith.science/api/pith-number/BVKLEZNY7XXTZ3OMPXCWVQJTSX/graph.json","fetch_events":"https://pith.science/api/pith-number/BVKLEZNY7XXTZ3OMPXCWVQJTSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX/action/storage_attestation","attest_author":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX/action/author_attestation","sign_citation":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX/action/citation_signature","submit_replication":"https://pith.science/pith/BVKLEZNY7XXTZ3OMPXCWVQJTSX/action/replication_record"}},"created_at":"2026-07-05T04:47:26.813754+00:00","updated_at":"2026-07-05T04:47:26.813754+00:00"}