{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:F5SWXPK25QPD6LWNBVOY5F6NWC","short_pith_number":"pith:F5SWXPK2","canonical_record":{"source":{"id":"1212.4649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-19T13:09:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56f75d0a8c47ec2dab63290c536852629d01c2ee4912a92cd20445405a47ba98","abstract_canon_sha256":"16dbce88f96ce71b0977922c199a93db85652cc56d4b84e271cecfef2874dd27"},"schema_version":"1.0"},"canonical_sha256":"2f656bbd5aec1e3f2ecd0d5d8e97cdb0bba1f545f0d2d21c67ab4a8cf23ac52e","source":{"kind":"arxiv","id":"1212.4649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4649","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4649v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4649","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"F5SWXPK25QPD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F5SWXPK25QPD6LWN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F5SWXPK2","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:F5SWXPK25QPD6LWNBVOY5F6NWC","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-19T13:09:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"56f75d0a8c47ec2dab63290c536852629d01c2ee4912a92cd20445405a47ba98","abstract_canon_sha256":"16dbce88f96ce71b0977922c199a93db85652cc56d4b84e271cecfef2874dd27"},"schema_version":"1.0"},"canonical_sha256":"2f656bbd5aec1e3f2ecd0d5d8e97cdb0bba1f545f0d2d21c67ab4a8cf23ac52e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.699351Z","signature_b64":"/6IedXblY9pmBRkHDOoOufc1P6RIJj+AP+F/kRICNLwRI6Enb3LfB+kYCwH9grumgLiU+yla32tVcZmmw4b4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f656bbd5aec1e3f2ecd0d5d8e97cdb0bba1f545f0d2d21c67ab4a8cf23ac52e","last_reissued_at":"2026-05-18T00:58:42.698956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.698956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4649","source_version":1,"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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4MpnSaBiIqPJWuGPeNBSONZX7+8hYKVwvF308U8b1ejEEJdNbKygTaSkU6FXJIiCBj3vyxEg5Egi4MayoVNLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:48:34.198582Z"},"content_sha256":"30a54cee07b2c844b87be083221327c8f302241297662d059ebba14ad3aa3322","schema_version":"1.0","event_id":"sha256:30a54cee07b2c844b87be083221327c8f302241297662d059ebba14ad3aa3322"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:F5SWXPK25QPD6LWNBVOY5F6NWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential error bounds on parameter modulation-estimation for discrete memoryless channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2012-12-19T13:09:48Z","abstract_excerpt":"We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, $\\bE|\\hat{U}-U|^\\rho$, $\\rho\\ge 0$, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be intimately related to error exponents of channel coding and to channel capacity. While in general, there is some gap between the upper and the lower bound, they asymptotically coincide b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4649","kind":"arxiv","version":1},"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:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/GnjCPUn3z13T5uq9RAyT6zsVy7ogcDzzj9q3/gws+sh1uhpVbJc2gU2wGpNzs1QhNL0I1P85ZGew3lpbnHICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:48:34.199219Z"},"content_sha256":"8dbc3dc11d5e1eb198ff7d73e2f2a364bbd963fa6c9371df19be9f3ac0389244","schema_version":"1.0","event_id":"sha256:8dbc3dc11d5e1eb198ff7d73e2f2a364bbd963fa6c9371df19be9f3ac0389244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/bundle.json","state_url":"https://pith.science/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/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-27T08:48:34Z","links":{"resolver":"https://pith.science/pith/F5SWXPK25QPD6LWNBVOY5F6NWC","bundle":"https://pith.science/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/bundle.json","state":"https://pith.science/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5SWXPK25QPD6LWNBVOY5F6NWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:F5SWXPK25QPD6LWNBVOY5F6NWC","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":"16dbce88f96ce71b0977922c199a93db85652cc56d4b84e271cecfef2874dd27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-19T13:09:48Z","title_canon_sha256":"56f75d0a8c47ec2dab63290c536852629d01c2ee4912a92cd20445405a47ba98"},"schema_version":"1.0","source":{"id":"1212.4649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4649","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4649v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4649","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"F5SWXPK25QPD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"F5SWXPK25QPD6LWN","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"F5SWXPK2","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:8dbc3dc11d5e1eb198ff7d73e2f2a364bbd963fa6c9371df19be9f3ac0389244","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"We consider the problem of modulation and estimation of a random parameter $U$ to be conveyed across a discrete memoryless channel. Upper and lower bounds are derived for the best achievable exponential decay rate of a general moment of the estimation error, $\\bE|\\hat{U}-U|^\\rho$, $\\rho\\ge 0$, when both the modulator and the estimator are subjected to optimization. These exponential error bounds turn out to be intimately related to error exponents of channel coding and to channel capacity. While in general, there is some gap between the upper and the lower bound, they asymptotically coincide b","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-19T13:09:48Z","title":"Exponential error bounds on parameter modulation-estimation for discrete memoryless channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4649","kind":"arxiv","version":1},"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:30a54cee07b2c844b87be083221327c8f302241297662d059ebba14ad3aa3322","target":"record","created_at":"2026-05-18T00:58:42Z","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":"16dbce88f96ce71b0977922c199a93db85652cc56d4b84e271cecfef2874dd27","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-19T13:09:48Z","title_canon_sha256":"56f75d0a8c47ec2dab63290c536852629d01c2ee4912a92cd20445405a47ba98"},"schema_version":"1.0","source":{"id":"1212.4649","kind":"arxiv","version":1}},"canonical_sha256":"2f656bbd5aec1e3f2ecd0d5d8e97cdb0bba1f545f0d2d21c67ab4a8cf23ac52e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f656bbd5aec1e3f2ecd0d5d8e97cdb0bba1f545f0d2d21c67ab4a8cf23ac52e","first_computed_at":"2026-05-18T00:58:42.698956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.698956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/6IedXblY9pmBRkHDOoOufc1P6RIJj+AP+F/kRICNLwRI6Enb3LfB+kYCwH9grumgLiU+yla32tVcZmmw4b4CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.699351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30a54cee07b2c844b87be083221327c8f302241297662d059ebba14ad3aa3322","sha256:8dbc3dc11d5e1eb198ff7d73e2f2a364bbd963fa6c9371df19be9f3ac0389244"],"state_sha256":"ac744f940826e0be4ab90551da8f174739b89aad2741302ec16056e206efbc33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM/EXQWcJcI1tJWyYfEGcu96xVoJsn0lSokCfyMkgQ+bOwL4FFh2/rzuxT+z+x5cDayLFj1WaJhDrtGSn2fuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:48:34.201656Z","bundle_sha256":"4a2dcafdff68e2ae8818b9eeabc71fa4510424a159d511fdb0ed63ad79d01229"}}