{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KJX6JWWP2P4CYRQQLGU35EZ36I","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":"f2fd569c3004db11a2809b088d6825a41e0d7ec53a76afb1d96560a1cc06e1f1","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-14T21:51:18Z","title_canon_sha256":"31db57bc91706dd6dc82778ed6f38f9b303611dc2395394f984f8f4b1497f3af"},"schema_version":"1.0","source":{"id":"1902.05616","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05616","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05616v2","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05616","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"KJX6JWWP2P4C","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"KJX6JWWP2P4CYRQQ","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"KJX6JWWP","created_at":"2026-07-05T02:04:02Z"}],"graph_snapshots":[{"event_id":"sha256:715a584ec4b283c271138b6d2f4aa9ea483820c9df2aa0dcc2ee5d70bc7a411f","target":"graph","created_at":"2026-07-05T02:04:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1902.05616/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Le Cam's method (or the two-point method) is a commonly used tool for obtaining statistical lower bound and especially popular for functional estimation problems. This work aims to explain and give conditions for the tightness of Le Cam's lower bound in functional estimation from the perspective of convex duality. Under a variety of settings it is shown that the maximization problem that searches for the best two-point lower bound, upon dualizing, becomes a minimization problem that optimizes the bias-variance tradeoff among a family of estimators.\n  For estimating linear functionals of a dist","authors_text":"Yihong Wu, Yury Polyanskiy","cross_cats":["cs.IT","math.IT","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-14T21:51:18Z","title":"Dualizing Le Cam's method for functional estimation, with applications to estimating the unseens"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05616","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:f0c1cf97d43632960b4958c762b8dcf6454f4c30b392e55c0f69c4bfb191999f","target":"record","created_at":"2026-07-05T02:04:02Z","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":"f2fd569c3004db11a2809b088d6825a41e0d7ec53a76afb1d96560a1cc06e1f1","cross_cats_sorted":["cs.IT","math.IT","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-02-14T21:51:18Z","title_canon_sha256":"31db57bc91706dd6dc82778ed6f38f9b303611dc2395394f984f8f4b1497f3af"},"schema_version":"1.0","source":{"id":"1902.05616","kind":"arxiv","version":2}},"canonical_sha256":"526fe4dacfd3f82c461059a9be933bf23f62c3a79e33085e4667344362f05552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"526fe4dacfd3f82c461059a9be933bf23f62c3a79e33085e4667344362f05552","first_computed_at":"2026-07-05T02:04:02.875427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:02.875427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2Y5McdM37I/KCsA1pgYUHwGuInQ6OvFRMEbNfqrgxW1a85b5UrUJwo51DnpW+h0riOn3XNBrt5DxomrqDl5DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:02.875840Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05616","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0c1cf97d43632960b4958c762b8dcf6454f4c30b392e55c0f69c4bfb191999f","sha256:715a584ec4b283c271138b6d2f4aa9ea483820c9df2aa0dcc2ee5d70bc7a411f"],"state_sha256":"d4c1b621eb1cd03bd6b32bccbf43bf5443b3dae0920c8d721ccdbcc6003f30d6"}