{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OSOVHU5IGAVCNB7MIFJAQGAUZX","short_pith_number":"pith:OSOVHU5I","canonical_record":{"source":{"id":"1311.3613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-14T19:18:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"423ca553a6b4c779e6c97ce519590ea746d13b9eb8c6f3253d058452aa0577ea","abstract_canon_sha256":"f8cd9a5bc53c218e935eb7bf55f0154e2cfe63ce5844912f55301a197222b512"},"schema_version":"1.0"},"canonical_sha256":"749d53d3a8302a2687ec4152081814cdf25e5efcfa82a71171db16d2379aab10","source":{"kind":"arxiv","id":"1311.3613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3613","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3613v1","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3613","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSOVHU5IGAVC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OSOVHU5IGAVCNB7M","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OSOVHU5I","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OSOVHU5IGAVCNB7MIFJAQGAUZX","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3613","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-14T19:18:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"423ca553a6b4c779e6c97ce519590ea746d13b9eb8c6f3253d058452aa0577ea","abstract_canon_sha256":"f8cd9a5bc53c218e935eb7bf55f0154e2cfe63ce5844912f55301a197222b512"},"schema_version":"1.0"},"canonical_sha256":"749d53d3a8302a2687ec4152081814cdf25e5efcfa82a71171db16d2379aab10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:04.355800Z","signature_b64":"XH7HwhpEFQyl7+Bm9e+gu3XtumlYxVswhzj69oOrRoaYxHiVJLmnZMTepbVJxdZa9HhYiGEkOQijtViORO3ADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"749d53d3a8302a2687ec4152081814cdf25e5efcfa82a71171db16d2379aab10","last_reissued_at":"2026-05-18T03:07:04.355271Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:04.355271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3613","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-18T03:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ypvn5NqnTqtJ8HmT3K2dy6OMAZkcgzlJf2hzIfcsgOOjg1OoGr/Llucm3zQZzoWM8l1DL1wHUuE4mYuOKda5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:38.420465Z"},"content_sha256":"f9acf0465095f77515dbcc072acf6a23695714e6d18cb05e6ed0299ac81afa02","schema_version":"1.0","event_id":"sha256:f9acf0465095f77515dbcc072acf6a23695714e6d18cb05e6ed0299ac81afa02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OSOVHU5IGAVCNB7MIFJAQGAUZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bayesian approach to sparse channel estimation in OFDM systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Boris I. Godoy, Juan C. Ag\\\"uero, Rodrigo Carvajal","submitted_at":"2013-11-14T19:18:39Z","abstract_excerpt":"In this work, we address the problem of estimating sparse communication channels in OFDM systems in the presence of carrier frequency offset (CFO) and unknown noise variance. To this end, we consider a convex optimization problem, including a probability function, accounting for the sparse nature of the communication channel. We use the Expectation-Maximization (EM) algorithm to solve the corresponding Maximum A Posteriori (MAP) estimation problem. We show that, by concentrating the cost function in one variable, namely the CFO, the channel estimate can be obtained in closed form within the EM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3613","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-18T03:07:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xF7IfT1BhD2uNxy8rL4haJO8JO0FKfdHSDQdQLilGZ7vGyo7H2FwcXVxFNTH+50dLi9GFu5qXQKcFN4GjHIiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:38.420872Z"},"content_sha256":"6598679a0fc51b0429d19179eeff0b1ae00021ccb68398333c21a5aefb422839","schema_version":"1.0","event_id":"sha256:6598679a0fc51b0429d19179eeff0b1ae00021ccb68398333c21a5aefb422839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/bundle.json","state_url":"https://pith.science/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/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-31T05:08:38Z","links":{"resolver":"https://pith.science/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX","bundle":"https://pith.science/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/bundle.json","state":"https://pith.science/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSOVHU5IGAVCNB7MIFJAQGAUZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OSOVHU5IGAVCNB7MIFJAQGAUZX","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":"f8cd9a5bc53c218e935eb7bf55f0154e2cfe63ce5844912f55301a197222b512","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-14T19:18:39Z","title_canon_sha256":"423ca553a6b4c779e6c97ce519590ea746d13b9eb8c6f3253d058452aa0577ea"},"schema_version":"1.0","source":{"id":"1311.3613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3613","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3613v1","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3613","created_at":"2026-05-18T03:07:04Z"},{"alias_kind":"pith_short_12","alias_value":"OSOVHU5IGAVC","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OSOVHU5IGAVCNB7M","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OSOVHU5I","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:6598679a0fc51b0429d19179eeff0b1ae00021ccb68398333c21a5aefb422839","target":"graph","created_at":"2026-05-18T03:07:04Z","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":"In this work, we address the problem of estimating sparse communication channels in OFDM systems in the presence of carrier frequency offset (CFO) and unknown noise variance. To this end, we consider a convex optimization problem, including a probability function, accounting for the sparse nature of the communication channel. We use the Expectation-Maximization (EM) algorithm to solve the corresponding Maximum A Posteriori (MAP) estimation problem. We show that, by concentrating the cost function in one variable, namely the CFO, the channel estimate can be obtained in closed form within the EM","authors_text":"Boris I. Godoy, Juan C. Ag\\\"uero, Rodrigo Carvajal","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-14T19:18:39Z","title":"A Bayesian approach to sparse channel estimation in OFDM systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3613","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:f9acf0465095f77515dbcc072acf6a23695714e6d18cb05e6ed0299ac81afa02","target":"record","created_at":"2026-05-18T03:07:04Z","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":"f8cd9a5bc53c218e935eb7bf55f0154e2cfe63ce5844912f55301a197222b512","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-11-14T19:18:39Z","title_canon_sha256":"423ca553a6b4c779e6c97ce519590ea746d13b9eb8c6f3253d058452aa0577ea"},"schema_version":"1.0","source":{"id":"1311.3613","kind":"arxiv","version":1}},"canonical_sha256":"749d53d3a8302a2687ec4152081814cdf25e5efcfa82a71171db16d2379aab10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"749d53d3a8302a2687ec4152081814cdf25e5efcfa82a71171db16d2379aab10","first_computed_at":"2026-05-18T03:07:04.355271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:04.355271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XH7HwhpEFQyl7+Bm9e+gu3XtumlYxVswhzj69oOrRoaYxHiVJLmnZMTepbVJxdZa9HhYiGEkOQijtViORO3ADg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:04.355800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9acf0465095f77515dbcc072acf6a23695714e6d18cb05e6ed0299ac81afa02","sha256:6598679a0fc51b0429d19179eeff0b1ae00021ccb68398333c21a5aefb422839"],"state_sha256":"10da11af2ed1af47d893eb7c30153b2b6e35d3b2ce474ea51688356971e262de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUqBHVEIzbdr/4Iyj1TGA9iqkdQ9IPnqwBvNVs4PyB7auVo9tojXjjfXa0Tli0APEA3eoOJ8ow7toxIlmYWTDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:08:38.424120Z","bundle_sha256":"2b091183cdd38ef6f69e3d502f348cff4af5698615655b4371cbf0b61bb36478"}}