{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZCVCJYMFEBSFKOUJHM4FL2BB5R","short_pith_number":"pith:ZCVCJYMF","canonical_record":{"source":{"id":"1905.03808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-09T18:27:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e67d42dd242552ec0307ec0b86ed7b25b7aeb161b459f98933472320a92662a2","abstract_canon_sha256":"c01f36104c1b866e84fb27d70b07c32c7b6de7cd1f4ed82de4be83f69f67c84a"},"schema_version":"1.0"},"canonical_sha256":"c8aa24e1852064553a893b3855e821ec7b3145eb93380a7df2ced2d5cbe505ab","source":{"kind":"arxiv","id":"1905.03808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03808","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03808v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03808","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZCVCJYMFEBSF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCVCJYMFEBSFKOUJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCVCJYMF","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZCVCJYMFEBSFKOUJHM4FL2BB5R","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-09T18:27:43Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e67d42dd242552ec0307ec0b86ed7b25b7aeb161b459f98933472320a92662a2","abstract_canon_sha256":"c01f36104c1b866e84fb27d70b07c32c7b6de7cd1f4ed82de4be83f69f67c84a"},"schema_version":"1.0"},"canonical_sha256":"c8aa24e1852064553a893b3855e821ec7b3145eb93380a7df2ced2d5cbe505ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:35.572743Z","signature_b64":"g8WqWrfnp5B2hQTcdKmVTympzOYCWSjAWco5O3TuRHAKYeWhdW2G1T5FRIFe7Qy3FKfHdgBdNquJHIeMeTXwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8aa24e1852064553a893b3855e821ec7b3145eb93380a7df2ced2d5cbe505ab","last_reissued_at":"2026-05-17T23:46:35.572023Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:35.572023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03808","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-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b3XM5/nw10X12z7UToy5JgOJYks/NZFJnAmFk1Dw7zRJH79MzUubbgo4N+5t3czWGiATft0nRVa7/H1vxouvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:18:50.453239Z"},"content_sha256":"93ab2534d6cad03efc68071a1ae7e6a1f7a0c50111c4bb3341fc62630bff0991","schema_version":"1.0","event_id":"sha256:93ab2534d6cad03efc68071a1ae7e6a1f7a0c50111c4bb3341fc62630bff0991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZCVCJYMFEBSFKOUJHM4FL2BB5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum A Posteriori Probability (MAP) Joint Fine Frequency Offset and Channel Estimation for MIMO Systems with Channels of Arbitrary Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Mingda Zhou, Xinming Huang, Youjian (Eugene) Liu, Zhe Feng","submitted_at":"2019-05-09T18:27:43Z","abstract_excerpt":"Channel and frequency offset estimation is a classic topic with a large body of prior work using mainly maximum likelihood (ML) approach together with Cram\\'er-Rao Lower bounds (CRLB) analysis. We provide the maximum a posteriori (MAP) estimation solution which is particularly useful for for tracking where previous estimation can be used as prior knowledge. Unlike the ML cases, the corresponding Bayesian Cram\\'er-Rao Lower bound (BCRLB) shows clear relation with parameters and a low complexity algorithm achieves the BCRLB in almost all SNR range. We allow the time invariant channel within a pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03808","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-17T23:46:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"apDz65RE62rbutrCUOCMDZyiLMB0hoBa4s3JYbqgxONgDP0K9ruF8jyurns8X4SX3JaYMFdRZcIR9/qbr4CoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T13:18:50.454055Z"},"content_sha256":"789709d42377f476f4a7851aecddcca7051846163df9475c9ccf193275090d55","schema_version":"1.0","event_id":"sha256:789709d42377f476f4a7851aecddcca7051846163df9475c9ccf193275090d55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/bundle.json","state_url":"https://pith.science/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/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-31T13:18:50Z","links":{"resolver":"https://pith.science/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R","bundle":"https://pith.science/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/bundle.json","state":"https://pith.science/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCVCJYMFEBSFKOUJHM4FL2BB5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZCVCJYMFEBSFKOUJHM4FL2BB5R","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":"c01f36104c1b866e84fb27d70b07c32c7b6de7cd1f4ed82de4be83f69f67c84a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-09T18:27:43Z","title_canon_sha256":"e67d42dd242552ec0307ec0b86ed7b25b7aeb161b459f98933472320a92662a2"},"schema_version":"1.0","source":{"id":"1905.03808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03808","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03808v1","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03808","created_at":"2026-05-17T23:46:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZCVCJYMFEBSF","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZCVCJYMFEBSFKOUJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZCVCJYMF","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:789709d42377f476f4a7851aecddcca7051846163df9475c9ccf193275090d55","target":"graph","created_at":"2026-05-17T23:46:35Z","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":"Channel and frequency offset estimation is a classic topic with a large body of prior work using mainly maximum likelihood (ML) approach together with Cram\\'er-Rao Lower bounds (CRLB) analysis. We provide the maximum a posteriori (MAP) estimation solution which is particularly useful for for tracking where previous estimation can be used as prior knowledge. Unlike the ML cases, the corresponding Bayesian Cram\\'er-Rao Lower bound (BCRLB) shows clear relation with parameters and a low complexity algorithm achieves the BCRLB in almost all SNR range. We allow the time invariant channel within a pa","authors_text":"Mingda Zhou, Xinming Huang, Youjian (Eugene) Liu, Zhe Feng","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-09T18:27:43Z","title":"Maximum A Posteriori Probability (MAP) Joint Fine Frequency Offset and Channel Estimation for MIMO Systems with Channels of Arbitrary Correlation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03808","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:93ab2534d6cad03efc68071a1ae7e6a1f7a0c50111c4bb3341fc62630bff0991","target":"record","created_at":"2026-05-17T23:46:35Z","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":"c01f36104c1b866e84fb27d70b07c32c7b6de7cd1f4ed82de4be83f69f67c84a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-05-09T18:27:43Z","title_canon_sha256":"e67d42dd242552ec0307ec0b86ed7b25b7aeb161b459f98933472320a92662a2"},"schema_version":"1.0","source":{"id":"1905.03808","kind":"arxiv","version":1}},"canonical_sha256":"c8aa24e1852064553a893b3855e821ec7b3145eb93380a7df2ced2d5cbe505ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8aa24e1852064553a893b3855e821ec7b3145eb93380a7df2ced2d5cbe505ab","first_computed_at":"2026-05-17T23:46:35.572023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:35.572023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g8WqWrfnp5B2hQTcdKmVTympzOYCWSjAWco5O3TuRHAKYeWhdW2G1T5FRIFe7Qy3FKfHdgBdNquJHIeMeTXwDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:35.572743Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93ab2534d6cad03efc68071a1ae7e6a1f7a0c50111c4bb3341fc62630bff0991","sha256:789709d42377f476f4a7851aecddcca7051846163df9475c9ccf193275090d55"],"state_sha256":"6105cd4065ed0993ce9eb91277000e832937d08a06237057bb97549f291300fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AjSFAEi7hb/oGpSyK3x16zTFGObmBFoEx42/2vCSy1tBhoRSuT4Svn3EcX+RrrqWE/AK7pJz848CyYnWrZgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T13:18:50.458153Z","bundle_sha256":"16a77104ea708aa579631e745438fd962cce8ecb5f0ce60150fb6aa2deb54d22"}}