{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZXMXHOFSKKH5IH3KWZ2CDQJWP3","short_pith_number":"pith:ZXMXHOFS","canonical_record":{"source":{"id":"1601.00815","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-05T12:50:05Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"bf1307f22d8bc919288b0f7f6c95c040e4b7ec470d21da0380c792ec24f1508a","abstract_canon_sha256":"e11faf9207be443d076dedbd822dfd3fe671caacb312226463a2d94a9624c9b6"},"schema_version":"1.0"},"canonical_sha256":"cdd973b8b2528fd41f6ab67421c1367edad4aa8895e7353da3ba4bb6b6eeb401","source":{"kind":"arxiv","id":"1601.00815","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00815","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00815v4","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00815","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZXMXHOFSKKH5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXMXHOFSKKH5IH3K","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXMXHOFS","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZXMXHOFSKKH5IH3KWZ2CDQJWP3","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00815","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-05T12:50:05Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"bf1307f22d8bc919288b0f7f6c95c040e4b7ec470d21da0380c792ec24f1508a","abstract_canon_sha256":"e11faf9207be443d076dedbd822dfd3fe671caacb312226463a2d94a9624c9b6"},"schema_version":"1.0"},"canonical_sha256":"cdd973b8b2528fd41f6ab67421c1367edad4aa8895e7353da3ba4bb6b6eeb401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.238112Z","signature_b64":"zB0cvoRq5rhOdUr1ijU8Xq/4TnZWqhu7we89F6abw93PFvJCa1EO4UZjuASMWTgyJtx4kFyxbmY1gkByAEcFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdd973b8b2528fd41f6ab67421c1367edad4aa8895e7353da3ba4bb6b6eeb401","last_reissued_at":"2026-05-18T00:33:00.237245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.237245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00815","source_version":4,"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-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1tjvSMZBCA9oGLnz6NuFrlqmiNADmJyrfY6fnFpa20WOIxMQSz23TLyI9S5okaF6kvXg8dYvHRQNQp9dQouBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:21.098128Z"},"content_sha256":"11972af3db4cdb381bc5ec260b75e78aa77157bebd8d7d8748d6f158b75a73a5","schema_version":"1.0","event_id":"sha256:11972af3db4cdb381bc5ec260b75e78aa77157bebd8d7d8748d6f158b75a73a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZXMXHOFSKKH5IH3KWZ2CDQJWP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-parametric efficiency bounds for high-dimensional models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Jana Jankova, Sara van de Geer","submitted_at":"2016-01-05T12:50:05Z","abstract_excerpt":"Asymptotic lower bounds for estimation play a fundamental role in assessing the quality of statistical procedures. In this paper we propose a framework for obtaining semi-parametric efficiency bounds for sparse high-dimensional models, where the dimension of the parameter is larger than the sample size. We adopt a semi-parametric point of view: we concentrate on one dimensional functions of a high-dimensional parameter. We follow two different approaches to reach the lower bounds: asymptotic Cram\\'er-Rao bounds and Le Cam's type of analysis. Both these approaches allow us to define a class of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00815","kind":"arxiv","version":4},"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-18T00:33:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+r+/t30uh6Cez9JJEFdVW/UHcVBMNulsWFlYgyJRKoOvqVsUmyHbjfsZnr+3Yfr+qYGcGIrqQKloBebaOUTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:21.098491Z"},"content_sha256":"962d4300149596e802b07caba4d0b0baab579bab61813ec36352568b2929287d","schema_version":"1.0","event_id":"sha256:962d4300149596e802b07caba4d0b0baab579bab61813ec36352568b2929287d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/bundle.json","state_url":"https://pith.science/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/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-02T05:03:21Z","links":{"resolver":"https://pith.science/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3","bundle":"https://pith.science/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/bundle.json","state":"https://pith.science/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZXMXHOFSKKH5IH3KWZ2CDQJWP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZXMXHOFSKKH5IH3KWZ2CDQJWP3","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":"e11faf9207be443d076dedbd822dfd3fe671caacb312226463a2d94a9624c9b6","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-05T12:50:05Z","title_canon_sha256":"bf1307f22d8bc919288b0f7f6c95c040e4b7ec470d21da0380c792ec24f1508a"},"schema_version":"1.0","source":{"id":"1601.00815","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00815","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00815v4","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00815","created_at":"2026-05-18T00:33:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZXMXHOFSKKH5","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZXMXHOFSKKH5IH3K","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZXMXHOFS","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:962d4300149596e802b07caba4d0b0baab579bab61813ec36352568b2929287d","target":"graph","created_at":"2026-05-18T00:33:00Z","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":"Asymptotic lower bounds for estimation play a fundamental role in assessing the quality of statistical procedures. In this paper we propose a framework for obtaining semi-parametric efficiency bounds for sparse high-dimensional models, where the dimension of the parameter is larger than the sample size. We adopt a semi-parametric point of view: we concentrate on one dimensional functions of a high-dimensional parameter. We follow two different approaches to reach the lower bounds: asymptotic Cram\\'er-Rao bounds and Le Cam's type of analysis. Both these approaches allow us to define a class of ","authors_text":"Jana Jankova, Sara van de Geer","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-05T12:50:05Z","title":"Semi-parametric efficiency bounds for high-dimensional models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00815","kind":"arxiv","version":4},"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:11972af3db4cdb381bc5ec260b75e78aa77157bebd8d7d8748d6f158b75a73a5","target":"record","created_at":"2026-05-18T00:33:00Z","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":"e11faf9207be443d076dedbd822dfd3fe671caacb312226463a2d94a9624c9b6","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-01-05T12:50:05Z","title_canon_sha256":"bf1307f22d8bc919288b0f7f6c95c040e4b7ec470d21da0380c792ec24f1508a"},"schema_version":"1.0","source":{"id":"1601.00815","kind":"arxiv","version":4}},"canonical_sha256":"cdd973b8b2528fd41f6ab67421c1367edad4aa8895e7353da3ba4bb6b6eeb401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdd973b8b2528fd41f6ab67421c1367edad4aa8895e7353da3ba4bb6b6eeb401","first_computed_at":"2026-05-18T00:33:00.237245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:00.237245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zB0cvoRq5rhOdUr1ijU8Xq/4TnZWqhu7we89F6abw93PFvJCa1EO4UZjuASMWTgyJtx4kFyxbmY1gkByAEcFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:00.238112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00815","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11972af3db4cdb381bc5ec260b75e78aa77157bebd8d7d8748d6f158b75a73a5","sha256:962d4300149596e802b07caba4d0b0baab579bab61813ec36352568b2929287d"],"state_sha256":"709fa05cf9a4ed8ccb28881abeb81ff0ed761cc81e3cfd78c384d8f068559a6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"70l1IJPfCBgI+IL1KQ9zvDKgpLj6u+0IiI0sygK07TermfIgEIrgv1eT1HHn3Mh+ZP/Q7UKOH2mUw6a1YqoPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:03:21.100521Z","bundle_sha256":"d670f11797171758013ef3fec2cf2a144dee96a135ec92f1c8fc6e28ecda5ddd"}}