{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JSIQNK4DDILGSUGBJYYERZTM36","short_pith_number":"pith:JSIQNK4D","canonical_record":{"source":{"id":"1207.2546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T06:29:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"35e490cb4962283c592145d398a40c7924bf811a393e5dc426251f79e0e81fe5","abstract_canon_sha256":"ca7b178ff4b3f8e9f71d5d7dd125e95804c8ee5a5a69b7cabe27d989646eb064"},"schema_version":"1.0"},"canonical_sha256":"4c9106ab831a166950c14e3048e66cdf8b1e0238fdcdd9e7212bebdc851d5f11","source":{"kind":"arxiv","id":"1207.2546","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2546","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2546v1","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2546","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"JSIQNK4DDILG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSIQNK4DDILGSUGB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSIQNK4D","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JSIQNK4DDILGSUGBJYYERZTM36","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2546","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T06:29:11Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"35e490cb4962283c592145d398a40c7924bf811a393e5dc426251f79e0e81fe5","abstract_canon_sha256":"ca7b178ff4b3f8e9f71d5d7dd125e95804c8ee5a5a69b7cabe27d989646eb064"},"schema_version":"1.0"},"canonical_sha256":"4c9106ab831a166950c14e3048e66cdf8b1e0238fdcdd9e7212bebdc851d5f11","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:56:25.479629Z","signature_b64":"K0v5FPsNoko4v//kiU1hGbS+PCSd5kjoJOnJlnZ/3LttQGDMrP6bQgZrJGZw92mOQ3ZXgDARaxKxQ4638Wg0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9106ab831a166950c14e3048e66cdf8b1e0238fdcdd9e7212bebdc851d5f11","last_reissued_at":"2026-05-18T01:56:25.478864Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:56:25.478864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2546","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-18T01:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/pzm3lhHui3CPPaq3z9NHxGRWtYyOq8t0KFQnpzinOlNqw5J2VXm5FATWKrf0Fy6hEGOOUe26sBDmIlqrOzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:07:24.484293Z"},"content_sha256":"7c764b17fb7769e9205745f6a0e81ce323bc8d5bc1a417ce2079d568a83e9990","schema_version":"1.0","event_id":"sha256:7c764b17fb7769e9205745f6a0e81ce323bc8d5bc1a417ce2079d568a83e9990"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JSIQNK4DDILGSUGBJYYERZTM36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Blind Equalization for OFDM Systems with General Constellations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ala Dahman, Babak Hassibi, Muhammad S. Sohail, Tareq Y. Al-Naffouri, Weiyu Xu","submitted_at":"2012-07-11T06:29:11Z","abstract_excerpt":"This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2546","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-18T01:56:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzupnqUvWftMGNwb/mHI2aFLfdpybQENVJmPn34iVoK9agiz5UTOx+GuxAgxCg2kw7gJJBi2FQE+zlLN8phPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T19:07:24.484673Z"},"content_sha256":"85b637c2b8d02f970c530972e6d961054543d160769ca09830627c510ef06fe1","schema_version":"1.0","event_id":"sha256:85b637c2b8d02f970c530972e6d961054543d160769ca09830627c510ef06fe1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSIQNK4DDILGSUGBJYYERZTM36/bundle.json","state_url":"https://pith.science/pith/JSIQNK4DDILGSUGBJYYERZTM36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSIQNK4DDILGSUGBJYYERZTM36/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-23T19:07:24Z","links":{"resolver":"https://pith.science/pith/JSIQNK4DDILGSUGBJYYERZTM36","bundle":"https://pith.science/pith/JSIQNK4DDILGSUGBJYYERZTM36/bundle.json","state":"https://pith.science/pith/JSIQNK4DDILGSUGBJYYERZTM36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSIQNK4DDILGSUGBJYYERZTM36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JSIQNK4DDILGSUGBJYYERZTM36","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":"ca7b178ff4b3f8e9f71d5d7dd125e95804c8ee5a5a69b7cabe27d989646eb064","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T06:29:11Z","title_canon_sha256":"35e490cb4962283c592145d398a40c7924bf811a393e5dc426251f79e0e81fe5"},"schema_version":"1.0","source":{"id":"1207.2546","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2546","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2546v1","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2546","created_at":"2026-05-18T01:56:25Z"},{"alias_kind":"pith_short_12","alias_value":"JSIQNK4DDILG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JSIQNK4DDILGSUGB","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JSIQNK4D","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:85b637c2b8d02f970c530972e6d961054543d160769ca09830627c510ef06fe1","target":"graph","created_at":"2026-05-18T01:56:25Z","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":"This paper proposes a low-complexity algorithm for blind equalization of data in OFDM-based wireless systems with general constellations. The proposed algorithm is able to recover data even when the channel changes on a symbol-by-symbol basis, making it suitable for fast fading channels. The proposed algorithm does not require any statistical information of the channel and thus does not suffer from latency normally associated with blind methods. We also demonstrate how to reduce the complexity of the algorithm, which becomes especially low at high SNR. Specifically, we show that in the high SN","authors_text":"Ala Dahman, Babak Hassibi, Muhammad S. Sohail, Tareq Y. Al-Naffouri, Weiyu Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T06:29:11Z","title":"Low Complexity Blind Equalization for OFDM Systems with General Constellations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2546","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:7c764b17fb7769e9205745f6a0e81ce323bc8d5bc1a417ce2079d568a83e9990","target":"record","created_at":"2026-05-18T01:56:25Z","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":"ca7b178ff4b3f8e9f71d5d7dd125e95804c8ee5a5a69b7cabe27d989646eb064","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-07-11T06:29:11Z","title_canon_sha256":"35e490cb4962283c592145d398a40c7924bf811a393e5dc426251f79e0e81fe5"},"schema_version":"1.0","source":{"id":"1207.2546","kind":"arxiv","version":1}},"canonical_sha256":"4c9106ab831a166950c14e3048e66cdf8b1e0238fdcdd9e7212bebdc851d5f11","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c9106ab831a166950c14e3048e66cdf8b1e0238fdcdd9e7212bebdc851d5f11","first_computed_at":"2026-05-18T01:56:25.478864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:56:25.478864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K0v5FPsNoko4v//kiU1hGbS+PCSd5kjoJOnJlnZ/3LttQGDMrP6bQgZrJGZw92mOQ3ZXgDARaxKxQ4638Wg0BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:56:25.479629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2546","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c764b17fb7769e9205745f6a0e81ce323bc8d5bc1a417ce2079d568a83e9990","sha256:85b637c2b8d02f970c530972e6d961054543d160769ca09830627c510ef06fe1"],"state_sha256":"54a1b54ffce3816b06f350f904b9c95f368eb8e98cc2f79e065e88847a266fa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QLNAog1M2i6P6kRTCXeEg0WEukma24SeH5hKl5HOFDtU3hSM5JYc5X5TJMrMTuNRLvgaKYkiSB6yFJleKI7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T19:07:24.486627Z","bundle_sha256":"b2622b5c6f61cf2fc394f2003c457fa5f43311d5d46577711ba97f5cfac3db31"}}