{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3TWFCSQKSDGMWMA3JYGNWBVHB6","short_pith_number":"pith:3TWFCSQK","schema_version":"1.0","canonical_sha256":"dcec514a0a90cccb301b4e0cdb06a70faf1683d3491a583cab3b5460d511febf","source":{"kind":"arxiv","id":"1203.3479","version":1},"attestation_state":"computed","paper":{"title":"Maximum likelihood fitting of acyclic directed mixed graphs to binary data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"stat.ME","authors_text":"Robin J. Evans, Thomas S. Richardson","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation."},"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":"1203.3479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-03-15T11:17:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"00e4f460748d22e38a9907063df7766a1989663ed7fccf8af07ebabd06035b85","abstract_canon_sha256":"da41ad27cd9d393bb254280308379ced8f79f2fcd15b547f63b1240f1787e27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:00.409697Z","signature_b64":"c4DZYPYv7GpokNdl2fbMBmMxQBMGAGtFcPpDsYDYB1z2MX2bWhKWFGJZE8WWy7wobp8ob9RC+C/FMPTnpf1mCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcec514a0a90cccb301b4e0cdb06a70faf1683d3491a583cab3b5460d511febf","last_reissued_at":"2026-05-18T04:00:00.409059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:00.409059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum likelihood fitting of acyclic directed mixed graphs to binary data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"stat.ME","authors_text":"Robin J. Evans, Thomas S. Richardson","submitted_at":"2012-03-15T11:17:56Z","abstract_excerpt":"Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3479","kind":"arxiv","version":1},"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":"1203.3479","created_at":"2026-05-18T04:00:00.409159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3479v1","created_at":"2026-05-18T04:00:00.409159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3479","created_at":"2026-05-18T04:00:00.409159+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TWFCSQKSDGM","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TWFCSQKSDGMWMA3","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TWFCSQK","created_at":"2026-05-18T12:26:53.410803+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/3TWFCSQKSDGMWMA3JYGNWBVHB6","json":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6.json","graph_json":"https://pith.science/api/pith-number/3TWFCSQKSDGMWMA3JYGNWBVHB6/graph.json","events_json":"https://pith.science/api/pith-number/3TWFCSQKSDGMWMA3JYGNWBVHB6/events.json","paper":"https://pith.science/paper/3TWFCSQK"},"agent_actions":{"view_html":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6","download_json":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6.json","view_paper":"https://pith.science/paper/3TWFCSQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3479&json=true","fetch_graph":"https://pith.science/api/pith-number/3TWFCSQKSDGMWMA3JYGNWBVHB6/graph.json","fetch_events":"https://pith.science/api/pith-number/3TWFCSQKSDGMWMA3JYGNWBVHB6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6/action/storage_attestation","attest_author":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6/action/author_attestation","sign_citation":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6/action/citation_signature","submit_replication":"https://pith.science/pith/3TWFCSQKSDGMWMA3JYGNWBVHB6/action/replication_record"}},"created_at":"2026-05-18T04:00:00.409159+00:00","updated_at":"2026-05-18T04:00:00.409159+00:00"}