{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EZ6EG7FYWPI6Q6F6W7XBX2E7NW","short_pith_number":"pith:EZ6EG7FY","canonical_record":{"source":{"id":"1208.2205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T15:35:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23aacdc8f0c84fad2f8571584da721e1a7fca9bccd8f8203847ea75067091cfa","abstract_canon_sha256":"87d3880836221965a3775464d2ec4e54ea8a8638c79fe75c856c476b154b7661"},"schema_version":"1.0"},"canonical_sha256":"267c437cb8b3d1e878beb7ee1be89f6da0706492ef94006138ae9884dc441806","source":{"kind":"arxiv","id":"1208.2205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2205","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2205v1","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2205","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"EZ6EG7FYWPI6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EZ6EG7FYWPI6Q6F6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EZ6EG7FY","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EZ6EG7FYWPI6Q6F6W7XBX2E7NW","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T15:35:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"23aacdc8f0c84fad2f8571584da721e1a7fca9bccd8f8203847ea75067091cfa","abstract_canon_sha256":"87d3880836221965a3775464d2ec4e54ea8a8638c79fe75c856c476b154b7661"},"schema_version":"1.0"},"canonical_sha256":"267c437cb8b3d1e878beb7ee1be89f6da0706492ef94006138ae9884dc441806","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:59.884549Z","signature_b64":"qo3JgGWftvUqRBR4kQHeFvt/zr1MlDRHx58YejuknyAYyLjLgUj6LtvRZkLvIkDYeKTaJDx8N1irlP9sOo0yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"267c437cb8b3d1e878beb7ee1be89f6da0706492ef94006138ae9884dc441806","last_reissued_at":"2026-05-18T03:48:59.883832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:59.883832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2205","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:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itrY1mzvK2GLZPwi+K5rKYKhbhyoENuXhzN3qNqM/i8ktJI3eJRlGZREpnqxGi/XhRFowB5TFNNO+XVFbVMmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:44:14.391187Z"},"content_sha256":"3a46d4ab3d002237464817643463147a4020665d41c2617207d0c82435da746b","schema_version":"1.0","event_id":"sha256:3a46d4ab3d002237464817643463147a4020665d41c2617207d0c82435da746b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EZ6EG7FYWPI6Q6F6W7XBX2E7NW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind Channel Equalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mohammad Havaei, Sanaz Moshirian, Soheil Ghadami","submitted_at":"2012-08-10T15:35:01Z","abstract_excerpt":"Future services demand high data rate and quality. Thus, it is necessary to define new and robust algorithms to equalize channels and reduce noise in communications. Nowadays, new equalization algorithms are being developed to optimize the channel bandwidth and reduce noise, namely, Blind Channel Equalization. Conventional equalizations minimizing mean-square error generally require a training sequence accompanying the data sequence. In this study, the result of Least Mean Square (LMS) algorithm applied on two given communication channels is analyzed. Considering the fact that blind equalizers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2205","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:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0hUMxO9/A/IChIX4vh8dCWzY6wlEO00eMTc9AbJsW72yGuEmd7WaCFGdKV8l3m/3gdScgFvwkT4RdTm/3WiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:44:14.391852Z"},"content_sha256":"40546b3e36e5d052544523a0dd4549bd9a5c1899e0336c838ad394d7e0ccef10","schema_version":"1.0","event_id":"sha256:40546b3e36e5d052544523a0dd4549bd9a5c1899e0336c838ad394d7e0ccef10"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/bundle.json","state_url":"https://pith.science/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/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-09T05:44:14Z","links":{"resolver":"https://pith.science/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW","bundle":"https://pith.science/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/bundle.json","state":"https://pith.science/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EZ6EG7FYWPI6Q6F6W7XBX2E7NW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EZ6EG7FYWPI6Q6F6W7XBX2E7NW","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":"87d3880836221965a3775464d2ec4e54ea8a8638c79fe75c856c476b154b7661","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T15:35:01Z","title_canon_sha256":"23aacdc8f0c84fad2f8571584da721e1a7fca9bccd8f8203847ea75067091cfa"},"schema_version":"1.0","source":{"id":"1208.2205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2205","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2205v1","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2205","created_at":"2026-05-18T03:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"EZ6EG7FYWPI6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EZ6EG7FYWPI6Q6F6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EZ6EG7FY","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:40546b3e36e5d052544523a0dd4549bd9a5c1899e0336c838ad394d7e0ccef10","target":"graph","created_at":"2026-05-18T03:48:59Z","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":"Future services demand high data rate and quality. Thus, it is necessary to define new and robust algorithms to equalize channels and reduce noise in communications. Nowadays, new equalization algorithms are being developed to optimize the channel bandwidth and reduce noise, namely, Blind Channel Equalization. Conventional equalizations minimizing mean-square error generally require a training sequence accompanying the data sequence. In this study, the result of Least Mean Square (LMS) algorithm applied on two given communication channels is analyzed. Considering the fact that blind equalizers","authors_text":"Mohammad Havaei, Sanaz Moshirian, Soheil Ghadami","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T15:35:01Z","title":"Blind Channel Equalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2205","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:3a46d4ab3d002237464817643463147a4020665d41c2617207d0c82435da746b","target":"record","created_at":"2026-05-18T03:48:59Z","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":"87d3880836221965a3775464d2ec4e54ea8a8638c79fe75c856c476b154b7661","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-10T15:35:01Z","title_canon_sha256":"23aacdc8f0c84fad2f8571584da721e1a7fca9bccd8f8203847ea75067091cfa"},"schema_version":"1.0","source":{"id":"1208.2205","kind":"arxiv","version":1}},"canonical_sha256":"267c437cb8b3d1e878beb7ee1be89f6da0706492ef94006138ae9884dc441806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"267c437cb8b3d1e878beb7ee1be89f6da0706492ef94006138ae9884dc441806","first_computed_at":"2026-05-18T03:48:59.883832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:59.883832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qo3JgGWftvUqRBR4kQHeFvt/zr1MlDRHx58YejuknyAYyLjLgUj6LtvRZkLvIkDYeKTaJDx8N1irlP9sOo0yAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:59.884549Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a46d4ab3d002237464817643463147a4020665d41c2617207d0c82435da746b","sha256:40546b3e36e5d052544523a0dd4549bd9a5c1899e0336c838ad394d7e0ccef10"],"state_sha256":"0011d5309c15d2cd3e442da46dcac5417ae1e195f28d8eabcfa7048d7715b9d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnmbIGThPc3bm62+XNTXDKQQ0Bp78Ra2ucnyoyiJd/Zii47dGZj1gym+UPnRu1wHvoo1xPQ6h0SrdJGdwZTfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:44:14.395972Z","bundle_sha256":"06f9bf443d09f38008ee74095cd2fd6bcc2348c256b2fd7d26cf47cd6d7c7782"}}