{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:5DGDYABLSXSYPWFFXGGPKKIKPQ","short_pith_number":"pith:5DGDYABL","canonical_record":{"source":{"id":"0804.4391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-28T14:24:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcee9b7ed4dbb5f09600cb018dbd5309d6317209e3fbbebcf2a6e68759f5f029","abstract_canon_sha256":"e1452b06576a93692a75c43d81a6994134187913c58d30d010310ab578648ff2"},"schema_version":"1.0"},"canonical_sha256":"e8cc3c002b95e587d8a5b98cf5290a7c3f9ccd2baa201beac68b1bacce4e0de0","source":{"kind":"arxiv","id":"0804.4391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4391","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4391v2","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4391","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"5DGDYABLSXSY","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_16","alias_value":"5DGDYABLSXSYPWFF","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_8","alias_value":"5DGDYABL","created_at":"2026-07-04T15:42:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:5DGDYABLSXSYPWFFXGGPKKIKPQ","target":"record","payload":{"canonical_record":{"source":{"id":"0804.4391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-28T14:24:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcee9b7ed4dbb5f09600cb018dbd5309d6317209e3fbbebcf2a6e68759f5f029","abstract_canon_sha256":"e1452b06576a93692a75c43d81a6994134187913c58d30d010310ab578648ff2"},"schema_version":"1.0"},"canonical_sha256":"e8cc3c002b95e587d8a5b98cf5290a7c3f9ccd2baa201beac68b1bacce4e0de0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:42:54.315262Z","signature_b64":"uuSN6SwyE/NsK+3UuUcQKXVnZ5KsxgAicldUB6TXxUnfIch++XSpjQeOcYDBk3gaQRfW11Nfs6INVhYb3M5rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8cc3c002b95e587d8a5b98cf5290a7c3f9ccd2baa201beac68b1bacce4e0de0","last_reissued_at":"2026-07-04T15:42:54.314802Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:42:54.314802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.4391","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-07-04T15:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZPCzh0/U5RORQmP8Vj70etD8PXWxRMPHdaFpiqQMXDb6DOCF1LDwizjMZTBaj9e+KC//1cQbBacC/yxhlRzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:43:50.341870Z"},"content_sha256":"288cacc403443b274e7b13e6d88cd1f1ebe77ece2cfc17d93958ee2d3aa57368","schema_version":"1.0","event_id":"sha256:288cacc403443b274e7b13e6d88cd1f1ebe77ece2cfc17d93958ee2d3aa57368"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:5DGDYABLSXSYPWFFXGGPKKIKPQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Yonina C. Eldar, Zvika Ben-Haim","submitted_at":"2008-04-28T14:24:44Z","abstract_excerpt":"A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias function which minimizes the Cramer-Rao bound can be determined, resulting in a lower bound on the Bayesian MSE. The bound is developed for the general case of a vector parameter with an arbitrary probability distribution, and is shown to be asymptotically tight in both the high and low signal-to-noise ratio regimes. A numerical study demonstrates several case"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4391","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0804.4391/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ5QjvBrhw7QtWCHLFjF+RMAuVkH0ivF73hqz21WEFYrnSlUhF6ctojRDp64vq2ZVNBmFYL9f8axve4z0si7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T10:43:50.342246Z"},"content_sha256":"fed83e42f20a89e978ff4c8bc4e67fa9b63cc5e5335867ffd2c30d1da9eae598","schema_version":"1.0","event_id":"sha256:fed83e42f20a89e978ff4c8bc4e67fa9b63cc5e5335867ffd2c30d1da9eae598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/bundle.json","state_url":"https://pith.science/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/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-07-06T10:43:50Z","links":{"resolver":"https://pith.science/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ","bundle":"https://pith.science/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/bundle.json","state":"https://pith.science/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DGDYABLSXSYPWFFXGGPKKIKPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:5DGDYABLSXSYPWFFXGGPKKIKPQ","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":"e1452b06576a93692a75c43d81a6994134187913c58d30d010310ab578648ff2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-28T14:24:44Z","title_canon_sha256":"fcee9b7ed4dbb5f09600cb018dbd5309d6317209e3fbbebcf2a6e68759f5f029"},"schema_version":"1.0","source":{"id":"0804.4391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4391","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4391v2","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4391","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"5DGDYABLSXSY","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_16","alias_value":"5DGDYABLSXSYPWFF","created_at":"2026-07-04T15:42:54Z"},{"alias_kind":"pith_short_8","alias_value":"5DGDYABL","created_at":"2026-07-04T15:42:54Z"}],"graph_snapshots":[{"event_id":"sha256:fed83e42f20a89e978ff4c8bc4e67fa9b63cc5e5335867ffd2c30d1da9eae598","target":"graph","created_at":"2026-07-04T15:42:54Z","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/0804.4391/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias function which minimizes the Cramer-Rao bound can be determined, resulting in a lower bound on the Bayesian MSE. The bound is developed for the general case of a vector parameter with an arbitrary probability distribution, and is shown to be asymptotically tight in both the high and low signal-to-noise ratio regimes. A numerical study demonstrates several case","authors_text":"Yonina C. Eldar, Zvika Ben-Haim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-28T14:24:44Z","title":"A Lower Bound on the Bayesian MSE Based on the Optimal Bias Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4391","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:288cacc403443b274e7b13e6d88cd1f1ebe77ece2cfc17d93958ee2d3aa57368","target":"record","created_at":"2026-07-04T15:42:54Z","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":"e1452b06576a93692a75c43d81a6994134187913c58d30d010310ab578648ff2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2008-04-28T14:24:44Z","title_canon_sha256":"fcee9b7ed4dbb5f09600cb018dbd5309d6317209e3fbbebcf2a6e68759f5f029"},"schema_version":"1.0","source":{"id":"0804.4391","kind":"arxiv","version":2}},"canonical_sha256":"e8cc3c002b95e587d8a5b98cf5290a7c3f9ccd2baa201beac68b1bacce4e0de0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8cc3c002b95e587d8a5b98cf5290a7c3f9ccd2baa201beac68b1bacce4e0de0","first_computed_at":"2026-07-04T15:42:54.314802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:42:54.314802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uuSN6SwyE/NsK+3UuUcQKXVnZ5KsxgAicldUB6TXxUnfIch++XSpjQeOcYDBk3gaQRfW11Nfs6INVhYb3M5rDg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:42:54.315262Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.4391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:288cacc403443b274e7b13e6d88cd1f1ebe77ece2cfc17d93958ee2d3aa57368","sha256:fed83e42f20a89e978ff4c8bc4e67fa9b63cc5e5335867ffd2c30d1da9eae598"],"state_sha256":"7c25bbda92e97a4e5a5386130165db3994f831e137c8e51239ac771dd2822a78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULAOq//1kkZZKSf610Sszbc2ERR5z62+KPZsSjUjXmu5X70OxNQQgDdxEr4xX+f7rn30YB86kDFd87hDH+CoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T10:43:50.344181Z","bundle_sha256":"787039c80a03dab68ac39c4e79357906859701dfe22d586e774176d62e6f07b5"}}