{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:A2LQ527WA2CPHXXILDJF2DNDUM","short_pith_number":"pith:A2LQ527W","canonical_record":{"source":{"id":"1203.4206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T19:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"02f80892665edda9420d1f2f45074e833e74cb89bb134fc35754440e2db79992","abstract_canon_sha256":"09355f9ff3ac8bdac67e1add720a4e07984f55c3e43ce513ac22aeb7a40bbb70"},"schema_version":"1.0"},"canonical_sha256":"06970eebf60684f3dee858d25d0da3a33cfac357d8c8a7f02ced4e59ee09940f","source":{"kind":"arxiv","id":"1203.4206","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4206","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4206v1","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4206","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"A2LQ527WA2CP","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2LQ527WA2CPHXXI","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2LQ527W","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:A2LQ527WA2CPHXXILDJF2DNDUM","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T19:18:41Z","cross_cats_sorted":[],"title_canon_sha256":"02f80892665edda9420d1f2f45074e833e74cb89bb134fc35754440e2db79992","abstract_canon_sha256":"09355f9ff3ac8bdac67e1add720a4e07984f55c3e43ce513ac22aeb7a40bbb70"},"schema_version":"1.0"},"canonical_sha256":"06970eebf60684f3dee858d25d0da3a33cfac357d8c8a7f02ced4e59ee09940f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.759756Z","signature_b64":"S80KFvxccG6FZUWD3ETSQ/nGwIALrw5UT2tBL0Yw3JOat0I3uqss2Rzx6r4SeqBOdS35XMxNuNMIFf96ciNEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06970eebf60684f3dee858d25d0da3a33cfac357d8c8a7f02ced4e59ee09940f","last_reissued_at":"2026-05-18T00:59:09.759049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.759049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4206","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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOPjsZaERay8zCOpJ0HAxUrxmlCDkWLRDR/D3xnk3rE348X++0WUIZALr42kIhJRNqyelWE3MTiniLn8tV+eBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:49:40.265427Z"},"content_sha256":"d2b0b767ca2fd318f88b548b3173b89f6f6caff4a20c2bd50543b37250abc10d","schema_version":"1.0","event_id":"sha256:d2b0b767ca2fd318f88b548b3173b89f6f6caff4a20c2bd50543b37250abc10d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:A2LQ527WA2CPHXXILDJF2DNDUM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Turbo-Equalization: A Clustering Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Andrew C. Singer, Jun Won Choi, Kyeongyeon Kim, Suleyman S. Kozat","submitted_at":"2012-03-19T19:18:41Z","abstract_excerpt":"We introduce a low complexity approach to iterative equalization and decoding, or \"turbo equalization\", that uses clustered models to better match the nonlinear relationship that exists between likelihood information from a channel decoder and the symbol estimates that arise in soft-input channel equalization. The introduced clustered turbo equalizer uses piecewise linear models to capture the nonlinear dependency of the linear minimum mean square error (MMSE) symbol estimate on the symbol likelihoods produced by the channel decoder and maintains a computational complexity that is only linear "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4206","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-18T00:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMEfZFzuK3h3rKFmOtxjR5ie9S9MtBC8SsotRczkD4m/h5SYTwpP5vRVhWCrU60lGlbOSYcx1V2H04r9e1D6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T16:49:40.265783Z"},"content_sha256":"be1c3fcab9df4701ed381933b145f93bb9f99af1244121230c0ef3afadd7c052","schema_version":"1.0","event_id":"sha256:be1c3fcab9df4701ed381933b145f93bb9f99af1244121230c0ef3afadd7c052"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2LQ527WA2CPHXXILDJF2DNDUM/bundle.json","state_url":"https://pith.science/pith/A2LQ527WA2CPHXXILDJF2DNDUM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2LQ527WA2CPHXXILDJF2DNDUM/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-28T16:49:40Z","links":{"resolver":"https://pith.science/pith/A2LQ527WA2CPHXXILDJF2DNDUM","bundle":"https://pith.science/pith/A2LQ527WA2CPHXXILDJF2DNDUM/bundle.json","state":"https://pith.science/pith/A2LQ527WA2CPHXXILDJF2DNDUM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2LQ527WA2CPHXXILDJF2DNDUM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:A2LQ527WA2CPHXXILDJF2DNDUM","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":"09355f9ff3ac8bdac67e1add720a4e07984f55c3e43ce513ac22aeb7a40bbb70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T19:18:41Z","title_canon_sha256":"02f80892665edda9420d1f2f45074e833e74cb89bb134fc35754440e2db79992"},"schema_version":"1.0","source":{"id":"1203.4206","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4206","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4206v1","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4206","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"A2LQ527WA2CP","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"A2LQ527WA2CPHXXI","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"A2LQ527W","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:be1c3fcab9df4701ed381933b145f93bb9f99af1244121230c0ef3afadd7c052","target":"graph","created_at":"2026-05-18T00:59:09Z","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":"We introduce a low complexity approach to iterative equalization and decoding, or \"turbo equalization\", that uses clustered models to better match the nonlinear relationship that exists between likelihood information from a channel decoder and the symbol estimates that arise in soft-input channel equalization. The introduced clustered turbo equalizer uses piecewise linear models to capture the nonlinear dependency of the linear minimum mean square error (MMSE) symbol estimate on the symbol likelihoods produced by the channel decoder and maintains a computational complexity that is only linear ","authors_text":"Andrew C. Singer, Jun Won Choi, Kyeongyeon Kim, Suleyman S. Kozat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T19:18:41Z","title":"Low Complexity Turbo-Equalization: A Clustering Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4206","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:d2b0b767ca2fd318f88b548b3173b89f6f6caff4a20c2bd50543b37250abc10d","target":"record","created_at":"2026-05-18T00:59:09Z","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":"09355f9ff3ac8bdac67e1add720a4e07984f55c3e43ce513ac22aeb7a40bbb70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-03-19T19:18:41Z","title_canon_sha256":"02f80892665edda9420d1f2f45074e833e74cb89bb134fc35754440e2db79992"},"schema_version":"1.0","source":{"id":"1203.4206","kind":"arxiv","version":1}},"canonical_sha256":"06970eebf60684f3dee858d25d0da3a33cfac357d8c8a7f02ced4e59ee09940f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06970eebf60684f3dee858d25d0da3a33cfac357d8c8a7f02ced4e59ee09940f","first_computed_at":"2026-05-18T00:59:09.759049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:09.759049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S80KFvxccG6FZUWD3ETSQ/nGwIALrw5UT2tBL0Yw3JOat0I3uqss2Rzx6r4SeqBOdS35XMxNuNMIFf96ciNEBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:09.759756Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4206","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d2b0b767ca2fd318f88b548b3173b89f6f6caff4a20c2bd50543b37250abc10d","sha256:be1c3fcab9df4701ed381933b145f93bb9f99af1244121230c0ef3afadd7c052"],"state_sha256":"1250cdc451058c2c02f80801b9114a06633a1d17339c91d04ec98345921bfd96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OghNLgyCskH+BDXryWiykMVbc6TFjrYI/+y23o3r8M3TBrbApFhKdniMX2V5xzlHpIuy93VCrJ6jH4ktAlMxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T16:49:40.267733Z","bundle_sha256":"87ed3ed88f7b5cf4ffefab4c910804503cecf7d8a1708fd6b0ac23f2913f0015"}}