{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WAIKG6XT47HX2EKGWC62DHH42T","short_pith_number":"pith:WAIKG6XT","canonical_record":{"source":{"id":"1705.03242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T09:19:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c037a4ca4eefee9c601b941b71c03b69fbdd64b138272fc473fe9fa449d013a","abstract_canon_sha256":"dcbc0fb91326563bb369950de46ecaec946b33f4f90ceeb61349f5041f09bb6b"},"schema_version":"1.0"},"canonical_sha256":"b010a37af3e7cf7d1146b0bda19cfcd4c3bb499f724b70fe9be412927c36ba3f","source":{"kind":"arxiv","id":"1705.03242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03242","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03242v1","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03242","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"WAIKG6XT47HX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAIKG6XT47HX2EKG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAIKG6XT","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WAIKG6XT47HX2EKGWC62DHH42T","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T09:19:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c037a4ca4eefee9c601b941b71c03b69fbdd64b138272fc473fe9fa449d013a","abstract_canon_sha256":"dcbc0fb91326563bb369950de46ecaec946b33f4f90ceeb61349f5041f09bb6b"},"schema_version":"1.0"},"canonical_sha256":"b010a37af3e7cf7d1146b0bda19cfcd4c3bb499f724b70fe9be412927c36ba3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:48.500161Z","signature_b64":"86E20CkslmF+Q7GTeIVUipY2J/ftZnm8GeGTHhoite0cElLpKiuU/mNv5AezSkwW50H2rIeYn/8pQS6LhpU5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b010a37af3e7cf7d1146b0bda19cfcd4c3bb499f724b70fe9be412927c36ba3f","last_reissued_at":"2026-05-18T00:44:48.499615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:48.499615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03242","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvaoWf+/EQvdAtETrgDRz75Fze72kuSkdTSdYja45bRB0Y/iGAiLJcENQTUtGFgHkXYFBk+uQdo93W1uHGI4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:33:10.834745Z"},"content_sha256":"bbcddf7f9706d6f5f9bee08281b641a0d32d3337be7d0f980149f22f03ab43c0","schema_version":"1.0","event_id":"sha256:bbcddf7f9706d6f5f9bee08281b641a0d32d3337be7d0f980149f22f03ab43c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WAIKG6XT47HX2EKGWC62DHH42T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low Complexity Two-Stage Soft/Hard Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Farbod Kayhan, Guido Montorsi","submitted_at":"2017-05-09T09:19:58Z","abstract_excerpt":"Next generation wireless systems will need higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having high flexibility and low complexity requirements at transmitter and receiver. In this paper, we point out some of the limitations of the Bit Interleaved Code Modulation (BICM) technique which is the state of the art adopted in several standards and then propose some new lower complexity alternatives. These low complexity alt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03242","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:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"319XKXABw8gqd5ET87Vm29ZNuBFXIITLieoLVZwaDAklamVCFbIzd5fSKhc7oQmjlfEWrKQz05BH7SOV5tOjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:33:10.835093Z"},"content_sha256":"75c28201bce04178de7b951077b6d26dcb2c1222aef57a74c73befb8aaad92cc","schema_version":"1.0","event_id":"sha256:75c28201bce04178de7b951077b6d26dcb2c1222aef57a74c73befb8aaad92cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WAIKG6XT47HX2EKGWC62DHH42T/bundle.json","state_url":"https://pith.science/pith/WAIKG6XT47HX2EKGWC62DHH42T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WAIKG6XT47HX2EKGWC62DHH42T/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-03T21:33:10Z","links":{"resolver":"https://pith.science/pith/WAIKG6XT47HX2EKGWC62DHH42T","bundle":"https://pith.science/pith/WAIKG6XT47HX2EKGWC62DHH42T/bundle.json","state":"https://pith.science/pith/WAIKG6XT47HX2EKGWC62DHH42T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WAIKG6XT47HX2EKGWC62DHH42T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WAIKG6XT47HX2EKGWC62DHH42T","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":"dcbc0fb91326563bb369950de46ecaec946b33f4f90ceeb61349f5041f09bb6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T09:19:58Z","title_canon_sha256":"4c037a4ca4eefee9c601b941b71c03b69fbdd64b138272fc473fe9fa449d013a"},"schema_version":"1.0","source":{"id":"1705.03242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03242","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03242v1","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03242","created_at":"2026-05-18T00:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"WAIKG6XT47HX","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WAIKG6XT47HX2EKG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WAIKG6XT","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:75c28201bce04178de7b951077b6d26dcb2c1222aef57a74c73befb8aaad92cc","target":"graph","created_at":"2026-05-18T00:44:48Z","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":"Next generation wireless systems will need higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having high flexibility and low complexity requirements at transmitter and receiver. In this paper, we point out some of the limitations of the Bit Interleaved Code Modulation (BICM) technique which is the state of the art adopted in several standards and then propose some new lower complexity alternatives. These low complexity alt","authors_text":"Farbod Kayhan, Guido Montorsi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T09:19:58Z","title":"Low Complexity Two-Stage Soft/Hard Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03242","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:bbcddf7f9706d6f5f9bee08281b641a0d32d3337be7d0f980149f22f03ab43c0","target":"record","created_at":"2026-05-18T00:44:48Z","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":"dcbc0fb91326563bb369950de46ecaec946b33f4f90ceeb61349f5041f09bb6b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-09T09:19:58Z","title_canon_sha256":"4c037a4ca4eefee9c601b941b71c03b69fbdd64b138272fc473fe9fa449d013a"},"schema_version":"1.0","source":{"id":"1705.03242","kind":"arxiv","version":1}},"canonical_sha256":"b010a37af3e7cf7d1146b0bda19cfcd4c3bb499f724b70fe9be412927c36ba3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b010a37af3e7cf7d1146b0bda19cfcd4c3bb499f724b70fe9be412927c36ba3f","first_computed_at":"2026-05-18T00:44:48.499615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:48.499615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"86E20CkslmF+Q7GTeIVUipY2J/ftZnm8GeGTHhoite0cElLpKiuU/mNv5AezSkwW50H2rIeYn/8pQS6LhpU5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:48.500161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbcddf7f9706d6f5f9bee08281b641a0d32d3337be7d0f980149f22f03ab43c0","sha256:75c28201bce04178de7b951077b6d26dcb2c1222aef57a74c73befb8aaad92cc"],"state_sha256":"52b3505298e85892df1fb89cf4816d866b04d88a0a956b190f9bbfa0c0388d5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QlRGScthgwpYEUMYtB1JOj0SBgEKkbWOGq6NTzz6UTGM064tbFAx41WzbF6BtVkv4vg8XstIUm7/1/eg748bCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:33:10.837049Z","bundle_sha256":"7d77149cc1c75341ff67b141fadaa9b456fb3403493b9340e4c17e1fb4fe5bae"}}