{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CZABE5XW5E2LYGAPPQWQZZBNZ2","short_pith_number":"pith:CZABE5XW","canonical_record":{"source":{"id":"1301.7271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-01-30T16:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"c5d9561e73ea6305ac772338994f2f8be5652337bd8ab7a5272e7aa0cd458990","abstract_canon_sha256":"89121ba9dfcf511d58fb03fba922629dcba2b9586016d505324af127c9d603b6"},"schema_version":"1.0"},"canonical_sha256":"16401276f6e934bc180f7c2d0ce42dcebacf10fb5a418c6d9fce5c6d2351d956","source":{"kind":"arxiv","id":"1301.7271","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7271","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7271v2","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7271","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"CZABE5XW5E2L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CZABE5XW5E2LYGAP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CZABE5XW","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CZABE5XW5E2LYGAPPQWQZZBNZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7271","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-01-30T16:19:07Z","cross_cats_sorted":[],"title_canon_sha256":"c5d9561e73ea6305ac772338994f2f8be5652337bd8ab7a5272e7aa0cd458990","abstract_canon_sha256":"89121ba9dfcf511d58fb03fba922629dcba2b9586016d505324af127c9d603b6"},"schema_version":"1.0"},"canonical_sha256":"16401276f6e934bc180f7c2d0ce42dcebacf10fb5a418c6d9fce5c6d2351d956","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:08.373777Z","signature_b64":"t7560VX67LMjWv/CcspDx4Mauig4FGMZ2eAB40uy1IxUUwtNA8fHG2kHOHrIlVRnpSBEDnkrmBd6leGPINgbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16401276f6e934bc180f7c2d0ce42dcebacf10fb5a418c6d9fce5c6d2351d956","last_reissued_at":"2026-05-18T01:27:08.373080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:08.373080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7271","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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7w1BPQUo2l4yXqdGT6/rzySQdtBQs64trtH1RM4276Y0TTCn7Pr1RScU2Wb9SwBM9kohsh9pLoRYVt+kpio9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:56.980133Z"},"content_sha256":"af14b71b8283dc43eed5966b81dd439786ee0afe8921299790496b7b35965492","schema_version":"1.0","event_id":"sha256:af14b71b8283dc43eed5966b81dd439786ee0afe8921299790496b7b35965492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CZABE5XW5E2LYGAPPQWQZZBNZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient Fisher-scoring algorithm for fitting latent class models with individual covariates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Antonio Forcina","submitted_at":"2013-01-30T16:19:07Z","abstract_excerpt":"For latent class models where the class weights depend on individual covariates, we derive a simple expression for computing the score vector and a convenient hybrid between the observed and the expected information matrices which is always positive defnite. These ingredients, combined with a maximization algorithm based on line search, provides an efficient tool for maximum likelihood estimation. In particular, the proposed algorithm is such that the log-likelihood never decreases from one step to the next and the choice of starting values is not crucial for reaching a local maximum. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7271","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-18T01:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRKg9rpAkOa7fY3piOisYa56dEKwY4xZnOJluSHunbnTjhD315xA4wVQP/C+rWf4wMm3d9WcM2+gsnyEZMfHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:56.980528Z"},"content_sha256":"954f101707a97b589974f1e4518421051327d00a7029be8546c1583e2d363baa","schema_version":"1.0","event_id":"sha256:954f101707a97b589974f1e4518421051327d00a7029be8546c1583e2d363baa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/bundle.json","state_url":"https://pith.science/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/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-06-09T09:28:56Z","links":{"resolver":"https://pith.science/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2","bundle":"https://pith.science/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/bundle.json","state":"https://pith.science/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZABE5XW5E2LYGAPPQWQZZBNZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CZABE5XW5E2LYGAPPQWQZZBNZ2","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":"89121ba9dfcf511d58fb03fba922629dcba2b9586016d505324af127c9d603b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-01-30T16:19:07Z","title_canon_sha256":"c5d9561e73ea6305ac772338994f2f8be5652337bd8ab7a5272e7aa0cd458990"},"schema_version":"1.0","source":{"id":"1301.7271","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7271","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7271v2","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7271","created_at":"2026-05-18T01:27:08Z"},{"alias_kind":"pith_short_12","alias_value":"CZABE5XW5E2L","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CZABE5XW5E2LYGAP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CZABE5XW","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:954f101707a97b589974f1e4518421051327d00a7029be8546c1583e2d363baa","target":"graph","created_at":"2026-05-18T01:27:08Z","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":"For latent class models where the class weights depend on individual covariates, we derive a simple expression for computing the score vector and a convenient hybrid between the observed and the expected information matrices which is always positive defnite. These ingredients, combined with a maximization algorithm based on line search, provides an efficient tool for maximum likelihood estimation. In particular, the proposed algorithm is such that the log-likelihood never decreases from one step to the next and the choice of starting values is not crucial for reaching a local maximum. We show ","authors_text":"Antonio Forcina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-01-30T16:19:07Z","title":"An efficient Fisher-scoring algorithm for fitting latent class models with individual covariates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7271","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:af14b71b8283dc43eed5966b81dd439786ee0afe8921299790496b7b35965492","target":"record","created_at":"2026-05-18T01:27:08Z","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":"89121ba9dfcf511d58fb03fba922629dcba2b9586016d505324af127c9d603b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-01-30T16:19:07Z","title_canon_sha256":"c5d9561e73ea6305ac772338994f2f8be5652337bd8ab7a5272e7aa0cd458990"},"schema_version":"1.0","source":{"id":"1301.7271","kind":"arxiv","version":2}},"canonical_sha256":"16401276f6e934bc180f7c2d0ce42dcebacf10fb5a418c6d9fce5c6d2351d956","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16401276f6e934bc180f7c2d0ce42dcebacf10fb5a418c6d9fce5c6d2351d956","first_computed_at":"2026-05-18T01:27:08.373080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:08.373080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t7560VX67LMjWv/CcspDx4Mauig4FGMZ2eAB40uy1IxUUwtNA8fHG2kHOHrIlVRnpSBEDnkrmBd6leGPINgbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:08.373777Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7271","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af14b71b8283dc43eed5966b81dd439786ee0afe8921299790496b7b35965492","sha256:954f101707a97b589974f1e4518421051327d00a7029be8546c1583e2d363baa"],"state_sha256":"e1cad79eaff64dc6eff22b7e3f81ba649c1857cd4e5e41f2e15f8c3032673ebc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CJu1otOEQ+LA2b7vy2hOrsulwFM8Kxpr7IG9kbDEiKSNsN2yrN1zEOwtvOg96RsojlLHBfvRLKELzoHX/kSVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:28:56.983468Z","bundle_sha256":"7bff18ba457c11385338fd26178af111c687ec107a48e407b462657059d022ea"}}