{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7SI44X7ONVKHAAJDAO2KWOFFJ6","short_pith_number":"pith:7SI44X7O","schema_version":"1.0","canonical_sha256":"fc91ce5fee6d5470012303b4ab38a54f8c99cba2c2c226b412840ab5e1c18164","source":{"kind":"arxiv","id":"1206.6830","version":1},"attestation_state":"computed","paper":{"title":"The AI&M Procedure for Learning from Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ME","authors_text":"Manfred Jaeger","submitted_at":"2012-06-27T16:15:42Z","abstract_excerpt":"We investigate methods for parameter learning from incomplete data that is not missing at random. Likelihood-based methods then require the optimization of a profile likelihood that takes all possible missingness mechanisms into account. Optimzing this profile likelihood poses two main difficulties: multiple (local) maxima, and its very high-dimensional parameter space. In this paper a new method is presented for optimizing the profile likelihood that addresses the second difficulty: in the proposed AI&M (adjusting imputation and mazimization) procedure the optimization is performed by operati"},"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":"1206.6830","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2012-06-27T16:15:42Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"235994b2f471de1b415b783bd316c836c176a5dc846c421e51a1f9224273a749","abstract_canon_sha256":"1eafbffdd8fd982adbcdada330021c95ce5596e3465445296c073551fd4d3410"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.740525Z","signature_b64":"o0HTIfGdh44zCas9amdtEr2uTmb67JJ1J+YMmALTJWtF6qaQnJ4JWK7xXFKsAir8cQxiv4emGv+rpO5q1L8KCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc91ce5fee6d5470012303b4ab38a54f8c99cba2c2c226b412840ab5e1c18164","last_reissued_at":"2026-05-18T03:52:15.739914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.739914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The AI&M Procedure for Learning from Incomplete Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ME","authors_text":"Manfred Jaeger","submitted_at":"2012-06-27T16:15:42Z","abstract_excerpt":"We investigate methods for parameter learning from incomplete data that is not missing at random. Likelihood-based methods then require the optimization of a profile likelihood that takes all possible missingness mechanisms into account. Optimzing this profile likelihood poses two main difficulties: multiple (local) maxima, and its very high-dimensional parameter space. In this paper a new method is presented for optimizing the profile likelihood that addresses the second difficulty: in the proposed AI&M (adjusting imputation and mazimization) procedure the optimization is performed by operati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6830","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":"1206.6830","created_at":"2026-05-18T03:52:15.740005+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.6830v1","created_at":"2026-05-18T03:52:15.740005+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6830","created_at":"2026-05-18T03:52:15.740005+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SI44X7ONVKH","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SI44X7ONVKHAAJD","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SI44X7O","created_at":"2026-05-18T12:26:58.693483+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/7SI44X7ONVKHAAJDAO2KWOFFJ6","json":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6.json","graph_json":"https://pith.science/api/pith-number/7SI44X7ONVKHAAJDAO2KWOFFJ6/graph.json","events_json":"https://pith.science/api/pith-number/7SI44X7ONVKHAAJDAO2KWOFFJ6/events.json","paper":"https://pith.science/paper/7SI44X7O"},"agent_actions":{"view_html":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6","download_json":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6.json","view_paper":"https://pith.science/paper/7SI44X7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.6830&json=true","fetch_graph":"https://pith.science/api/pith-number/7SI44X7ONVKHAAJDAO2KWOFFJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/7SI44X7ONVKHAAJDAO2KWOFFJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6/action/storage_attestation","attest_author":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6/action/author_attestation","sign_citation":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6/action/citation_signature","submit_replication":"https://pith.science/pith/7SI44X7ONVKHAAJDAO2KWOFFJ6/action/replication_record"}},"created_at":"2026-05-18T03:52:15.740005+00:00","updated_at":"2026-05-18T03:52:15.740005+00:00"}