{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PQQPDUJIH7AWMBTX7OIPHG2XIG","short_pith_number":"pith:PQQPDUJI","schema_version":"1.0","canonical_sha256":"7c20f1d1283fc1660677fb90f39b57419d99b1780445b8ba11f47c1f03a76d99","source":{"kind":"arxiv","id":"1705.09717","version":2},"attestation_state":"computed","paper":{"title":"On sampling graphical Markov models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Megan Bernstein, Prasad Tetali","submitted_at":"2017-05-26T20:56:26Z","abstract_excerpt":"We consider sampling and enumeration problems for Markov equivalence classes. We create and analyze a Markov chain for uniform random sampling on the DAGs inside a Markov equivalence class. Though the worst case is exponentially slow mixing, we find a condition on the Markov equivalence class for polynomial time mixing. We also investigate the ratio of Markov equivalence classes to DAGs and a Markov chain of He, Jia, and Yu for random sampling of sparse Markov equivalence classes."},"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":"1705.09717","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-05-26T20:56:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7e11c380a0a54ffa72b2ba128f4b9154a9df3526cc13141e7bb62fe79d7c7a2b","abstract_canon_sha256":"c91e4a5a4a4eb3e71ba12be2600152fdf8aadbd07623e55883d1bb070f096162"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:02.413498Z","signature_b64":"U7aMhlOn5Ehw61rem8zm4fgYEfgZGcrW0ND8KsuJZlKziJcd9NgGSsjrWjf9GHoztZRhxBfAHnQRQZsodP6dAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c20f1d1283fc1660677fb90f39b57419d99b1780445b8ba11f47c1f03a76d99","last_reissued_at":"2026-05-18T00:38:02.412831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:02.412831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sampling graphical Markov models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Megan Bernstein, Prasad Tetali","submitted_at":"2017-05-26T20:56:26Z","abstract_excerpt":"We consider sampling and enumeration problems for Markov equivalence classes. We create and analyze a Markov chain for uniform random sampling on the DAGs inside a Markov equivalence class. Though the worst case is exponentially slow mixing, we find a condition on the Markov equivalence class for polynomial time mixing. We also investigate the ratio of Markov equivalence classes to DAGs and a Markov chain of He, Jia, and Yu for random sampling of sparse Markov equivalence classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09717","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.09717","created_at":"2026-05-18T00:38:02.412934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09717v2","created_at":"2026-05-18T00:38:02.412934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09717","created_at":"2026-05-18T00:38:02.412934+00:00"},{"alias_kind":"pith_short_12","alias_value":"PQQPDUJIH7AW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PQQPDUJIH7AWMBTX","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PQQPDUJI","created_at":"2026-05-18T12:31:37.085036+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/PQQPDUJIH7AWMBTX7OIPHG2XIG","json":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG.json","graph_json":"https://pith.science/api/pith-number/PQQPDUJIH7AWMBTX7OIPHG2XIG/graph.json","events_json":"https://pith.science/api/pith-number/PQQPDUJIH7AWMBTX7OIPHG2XIG/events.json","paper":"https://pith.science/paper/PQQPDUJI"},"agent_actions":{"view_html":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG","download_json":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG.json","view_paper":"https://pith.science/paper/PQQPDUJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09717&json=true","fetch_graph":"https://pith.science/api/pith-number/PQQPDUJIH7AWMBTX7OIPHG2XIG/graph.json","fetch_events":"https://pith.science/api/pith-number/PQQPDUJIH7AWMBTX7OIPHG2XIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG/action/storage_attestation","attest_author":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG/action/author_attestation","sign_citation":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG/action/citation_signature","submit_replication":"https://pith.science/pith/PQQPDUJIH7AWMBTX7OIPHG2XIG/action/replication_record"}},"created_at":"2026-05-18T00:38:02.412934+00:00","updated_at":"2026-05-18T00:38:02.412934+00:00"}