{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:J77EZERGLGAN7AWGLHA7LUJUZX","short_pith_number":"pith:J77EZERG","canonical_record":{"source":{"id":"1009.2111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3fcfdcad7510d89d705bf855b6738b919581776fde95688d9b84f258d7430eac","abstract_canon_sha256":"311d522c84bf8da5b71459be68184d31b5d561931b0e5e07cecb7ab51fc0f211"},"schema_version":"1.0"},"canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","source":{"kind":"arxiv","id":"1009.2111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2111","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2111v2","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2111","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"J77EZERGLGAN","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J77EZERGLGAN7AWG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J77EZERG","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:J77EZERGLGAN7AWGLHA7LUJUZX","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"3fcfdcad7510d89d705bf855b6738b919581776fde95688d9b84f258d7430eac","abstract_canon_sha256":"311d522c84bf8da5b71459be68184d31b5d561931b0e5e07cecb7ab51fc0f211"},"schema_version":"1.0"},"canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:33.819157Z","signature_b64":"bh7qHa2nvLzG3Db4o8TwCcpeFgcUy9ZSyFeBD6Y8gxSos9mP7Livdt3uF7w06Tl/seYafbjsJXP/hdNTJKsEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","last_reissued_at":"2026-05-18T04:40:33.818647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:33.818647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2111","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-18T04:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSrGAWD4AG80/OcKuYit2PjOb1ALtRCitTP8LjVekdjAzRsX6MdZr8qxb9iyovg/esqr7OnVRmM8zIZw9kxVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:56:22.648389Z"},"content_sha256":"c78195c77db4fc9261475930f3dc915cad7b33ccac25a28950f750cdebd3d1d9","schema_version":"1.0","event_id":"sha256:c78195c77db4fc9261475930f3dc915cad7b33ccac25a28950f750cdebd3d1d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:J77EZERGLGAN7AWGLHA7LUJUZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Many Iterations are Sufficient for Semiparametric Estimation?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Guang Cheng","submitted_at":"2010-09-10T22:04:20Z","abstract_excerpt":"A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose of this paper is to provide a formula in calculating the minimal number of iterations $k^\\ast$ needed to produce an efficient estimate $\\hat\\theta_n^{(k^\\ast)}$ from a theoretical point of view. We discover that (a) $k^\\ast$ depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than $k^\\ast$ iterations, i.e., $k$, will only "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2111","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-18T04:40:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hMgAI0ekveMIBX5lDbK55FP7cnBN8Ld6LhOUDYCgOfROnoTLQHGY737KNU9+2Z83LasZA71Paob7pTfTZCt0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:56:22.648809Z"},"content_sha256":"c8ade1aea54f09d0656875dbb7f1395ffb1d478b0908a1827b84cd4c25a180d1","schema_version":"1.0","event_id":"sha256:c8ade1aea54f09d0656875dbb7f1395ffb1d478b0908a1827b84cd4c25a180d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/bundle.json","state_url":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J77EZERGLGAN7AWGLHA7LUJUZX/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-05-25T17:56:22Z","links":{"resolver":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX","bundle":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/bundle.json","state":"https://pith.science/pith/J77EZERGLGAN7AWGLHA7LUJUZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J77EZERGLGAN7AWGLHA7LUJUZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:J77EZERGLGAN7AWGLHA7LUJUZX","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":"311d522c84bf8da5b71459be68184d31b5d561931b0e5e07cecb7ab51fc0f211","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","title_canon_sha256":"3fcfdcad7510d89d705bf855b6738b919581776fde95688d9b84f258d7430eac"},"schema_version":"1.0","source":{"id":"1009.2111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2111","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2111v2","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2111","created_at":"2026-05-18T04:40:33Z"},{"alias_kind":"pith_short_12","alias_value":"J77EZERGLGAN","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J77EZERGLGAN7AWG","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J77EZERG","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:c8ade1aea54f09d0656875dbb7f1395ffb1d478b0908a1827b84cd4c25a180d1","target":"graph","created_at":"2026-05-18T04:40:33Z","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":"A common practice in obtaining a semiparametric efficient estimate is through iteratively maximizing the (penalized) log-likelihood w.r.t. its Euclidean parameter and functional nuisance parameter via Newton-Raphson algorithm. The purpose of this paper is to provide a formula in calculating the minimal number of iterations $k^\\ast$ needed to produce an efficient estimate $\\hat\\theta_n^{(k^\\ast)}$ from a theoretical point of view. We discover that (a) $k^\\ast$ depends on the convergence rates of the initial estimate and nuisance estimate; (b) more than $k^\\ast$ iterations, i.e., $k$, will only ","authors_text":"Guang Cheng","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","title":"How Many Iterations are Sufficient for Semiparametric Estimation?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2111","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:c78195c77db4fc9261475930f3dc915cad7b33ccac25a28950f750cdebd3d1d9","target":"record","created_at":"2026-05-18T04:40:33Z","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":"311d522c84bf8da5b71459be68184d31b5d561931b0e5e07cecb7ab51fc0f211","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-09-10T22:04:20Z","title_canon_sha256":"3fcfdcad7510d89d705bf855b6738b919581776fde95688d9b84f258d7430eac"},"schema_version":"1.0","source":{"id":"1009.2111","kind":"arxiv","version":2}},"canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ffe4c92265980df82c659c1f5d134cdd796a2e346a6865bda51e224ab3d5007","first_computed_at":"2026-05-18T04:40:33.818647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:33.818647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bh7qHa2nvLzG3Db4o8TwCcpeFgcUy9ZSyFeBD6Y8gxSos9mP7Livdt3uF7w06Tl/seYafbjsJXP/hdNTJKsEAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:33.819157Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c78195c77db4fc9261475930f3dc915cad7b33ccac25a28950f750cdebd3d1d9","sha256:c8ade1aea54f09d0656875dbb7f1395ffb1d478b0908a1827b84cd4c25a180d1"],"state_sha256":"8542b16dc158f0e65842b0b766b80df444cfda2064536aa9c717ffb5f0de2629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vi0/dyAIYbRW4OZTx/RJ1GBR9CTQ21CnBeSaqQ2sGt3U651yeB1/Uuo3cdBlcyDcmdzTEZU5jyjko85I7I2CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:56:22.651738Z","bundle_sha256":"5fa81a8b3b02c8e13fd0f4129a52e6164284b858c0f5d95059ce377ddbc6ed2e"}}