{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:K7I3Z3ZQF7P75QJ7V2RMQQC5JY","short_pith_number":"pith:K7I3Z3ZQ","canonical_record":{"source":{"id":"1805.05069","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T08:55:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f1c43b0f9e43009997404183b05451ed4f8c5092641eeac0fe9e734db806e5b","abstract_canon_sha256":"722fd6b13117adc7cb82f7de428fb61b0395ca9e63d2734ed4538d0da53f7ab9"},"schema_version":"1.0"},"canonical_sha256":"57d1bcef302fdffec13faea2c8405d4e14cce9cb7c08a113c8770fd52187c470","source":{"kind":"arxiv","id":"1805.05069","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05069","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05069v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05069","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"K7I3Z3ZQF7P7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7I3Z3ZQF7P75QJ7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7I3Z3ZQ","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:K7I3Z3ZQF7P75QJ7V2RMQQC5JY","target":"record","payload":{"canonical_record":{"source":{"id":"1805.05069","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T08:55:41Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2f1c43b0f9e43009997404183b05451ed4f8c5092641eeac0fe9e734db806e5b","abstract_canon_sha256":"722fd6b13117adc7cb82f7de428fb61b0395ca9e63d2734ed4538d0da53f7ab9"},"schema_version":"1.0"},"canonical_sha256":"57d1bcef302fdffec13faea2c8405d4e14cce9cb7c08a113c8770fd52187c470","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.199017Z","signature_b64":"9BPSQ6LWP34NtvbOMNP8ctfT2RcoZ79FsbfiWA862qhb7bBrItz/NvHPd56CqPVi0OEluZx24QPvkScUhLEvBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d1bcef302fdffec13faea2c8405d4e14cce9cb7c08a113c8770fd52187c470","last_reissued_at":"2026-05-18T00:00:13.198384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.198384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.05069","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-05-18T00:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJlR9BNd+KRx+eh+pNeKeQfjzNkzMsQWApSJloAxI6uBdrm7d6xbKahtwJ2sOT/hlRw3jzkh1N14McpK4fPMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:25:40.299226Z"},"content_sha256":"23ab8b13ba9f6afeda64976cf6d4b965933ad1000bc9a7a96d5f861d733cbe15","schema_version":"1.0","event_id":"sha256:23ab8b13ba9f6afeda64976cf6d4b965933ad1000bc9a7a96d5f861d733cbe15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:K7I3Z3ZQF7P75QJ7V2RMQQC5JY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Two-stage Approach to Estimate CFO and Channel with One-bit ADCs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hangting Cao, Jiang Zhu, Zhiwei Xu","submitted_at":"2018-05-14T08:55:41Z","abstract_excerpt":"In this letter, we propose a two-stage approach to estimate the carrier frequency offset (CFO) and channel with one-bit analog-to-digital converters (ADCs). Firstly, a simple metric which is only a function of the CFO is proposed, and the CFO is estimated via solving the one-dimensional optimization problem. Secondly, the generalized approximate message passing (GAMP) algorithm combined with expectation maximization (EM) method is utilized to estimate the channel. In order to provide a benchmark of our proposed algorithm in terms of the CFO estimation, the corresponding Cram\\'er-Rao bound (CRB"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05069","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":""},"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:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGEzwp5RzsfM3a0p514/ZHScSHmTsXs+Mb/eV3jtxNWBQzmY39qSHi10fFmj0J4OVid6L75SZlCEnHqdhmU6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:25:40.299613Z"},"content_sha256":"9037aee34f1277839d26918cb0b39722b8f79c47f00a4f842ace280c39d08ca2","schema_version":"1.0","event_id":"sha256:9037aee34f1277839d26918cb0b39722b8f79c47f00a4f842ace280c39d08ca2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/bundle.json","state_url":"https://pith.science/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/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-06-04T14:25:40Z","links":{"resolver":"https://pith.science/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY","bundle":"https://pith.science/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/bundle.json","state":"https://pith.science/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K7I3Z3ZQF7P75QJ7V2RMQQC5JY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:K7I3Z3ZQF7P75QJ7V2RMQQC5JY","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":"722fd6b13117adc7cb82f7de428fb61b0395ca9e63d2734ed4538d0da53f7ab9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T08:55:41Z","title_canon_sha256":"2f1c43b0f9e43009997404183b05451ed4f8c5092641eeac0fe9e734db806e5b"},"schema_version":"1.0","source":{"id":"1805.05069","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.05069","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1805.05069v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.05069","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"K7I3Z3ZQF7P7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"K7I3Z3ZQF7P75QJ7","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"K7I3Z3ZQ","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9037aee34f1277839d26918cb0b39722b8f79c47f00a4f842ace280c39d08ca2","target":"graph","created_at":"2026-05-18T00:00:13Z","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 letter, we propose a two-stage approach to estimate the carrier frequency offset (CFO) and channel with one-bit analog-to-digital converters (ADCs). Firstly, a simple metric which is only a function of the CFO is proposed, and the CFO is estimated via solving the one-dimensional optimization problem. Secondly, the generalized approximate message passing (GAMP) algorithm combined with expectation maximization (EM) method is utilized to estimate the channel. In order to provide a benchmark of our proposed algorithm in terms of the CFO estimation, the corresponding Cram\\'er-Rao bound (CRB","authors_text":"Hangting Cao, Jiang Zhu, Zhiwei Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T08:55:41Z","title":"A Two-stage Approach to Estimate CFO and Channel with One-bit ADCs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.05069","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:23ab8b13ba9f6afeda64976cf6d4b965933ad1000bc9a7a96d5f861d733cbe15","target":"record","created_at":"2026-05-18T00:00:13Z","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":"722fd6b13117adc7cb82f7de428fb61b0395ca9e63d2734ed4538d0da53f7ab9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-05-14T08:55:41Z","title_canon_sha256":"2f1c43b0f9e43009997404183b05451ed4f8c5092641eeac0fe9e734db806e5b"},"schema_version":"1.0","source":{"id":"1805.05069","kind":"arxiv","version":2}},"canonical_sha256":"57d1bcef302fdffec13faea2c8405d4e14cce9cb7c08a113c8770fd52187c470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57d1bcef302fdffec13faea2c8405d4e14cce9cb7c08a113c8770fd52187c470","first_computed_at":"2026-05-18T00:00:13.198384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:13.198384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9BPSQ6LWP34NtvbOMNP8ctfT2RcoZ79FsbfiWA862qhb7bBrItz/NvHPd56CqPVi0OEluZx24QPvkScUhLEvBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:13.199017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.05069","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ab8b13ba9f6afeda64976cf6d4b965933ad1000bc9a7a96d5f861d733cbe15","sha256:9037aee34f1277839d26918cb0b39722b8f79c47f00a4f842ace280c39d08ca2"],"state_sha256":"897c9aca02b606879c110579d846cebd86d82f90602ad4208ce5039897bbb887"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qW4tC9DmQmMkIo045RxUJP7PmFdd/JtAMwuLeOO5PjJWfsHGzbpyJennqNJWlMyGtgWdYpJdcHJqI2+p32iFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:25:40.301794Z","bundle_sha256":"aae2c4fc34a857f514fbdbb4fb32b937ef1ed73d39aeb6517f1ef4231cfd7683"}}