{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DNWXIRKXB3GMRKLUD64NRJTL53","short_pith_number":"pith:DNWXIRKX","schema_version":"1.0","canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","source":{"kind":"arxiv","id":"1203.0924","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm to Calculate BICM Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Fabian Altenbach, Georg B\\\"ocherer, Rudolf Mathar, Steven Corroy","submitted_at":"2012-03-05T14:08:02Z","abstract_excerpt":"Bit-interleaved coded modulation (BICM) is a practical approach for reliable communication over the AWGN channel in the bandwidth limited regime. For a signal point constellation with 2^m points, BICM labels the signal points with bit strings of length m and then treats these m bits separately both at the transmitter and the receiver. BICM capacity is defined as the maximum of a certain achievable rate. Maximization has to be done over the probability mass functions (pmf) of the bits. This is a non-convex optimization problem. So far, the optimal bit pmfs were determined via exhaustive search,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1203.0924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-05T14:08:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"daca99d786ea803aa8ee5f2a307e021533a74e887731ee04eec88d495acd1354","abstract_canon_sha256":"3adcfc3fd532ec980ee852b5b98d593d45b84af416bda4d2ec6bc5b343f702bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:27.423904Z","signature_b64":"mOYWu7nDpjhMSQVKdNK3PbKgeO/XNVyoK1Fetf3ps1aqo2+0eDUYJC2JKXDbhoA8woRxgSs/V5r+In4cWmg2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","last_reissued_at":"2026-05-18T03:54:27.423243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:27.423243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm to Calculate BICM Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Alvarado, Fabian Altenbach, Georg B\\\"ocherer, Rudolf Mathar, Steven Corroy","submitted_at":"2012-03-05T14:08:02Z","abstract_excerpt":"Bit-interleaved coded modulation (BICM) is a practical approach for reliable communication over the AWGN channel in the bandwidth limited regime. For a signal point constellation with 2^m points, BICM labels the signal points with bit strings of length m and then treats these m bits separately both at the transmitter and the receiver. BICM capacity is defined as the maximum of a certain achievable rate. Maximization has to be done over the probability mass functions (pmf) of the bits. This is a non-convex optimization problem. So far, the optimal bit pmfs were determined via exhaustive search,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0924","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.0924","created_at":"2026-05-18T03:54:27.423354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.0924v2","created_at":"2026-05-18T03:54:27.423354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0924","created_at":"2026-05-18T03:54:27.423354+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNWXIRKXB3GM","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNWXIRKXB3GMRKLU","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNWXIRKX","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53","json":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53.json","graph_json":"https://pith.science/api/pith-number/DNWXIRKXB3GMRKLUD64NRJTL53/graph.json","events_json":"https://pith.science/api/pith-number/DNWXIRKXB3GMRKLUD64NRJTL53/events.json","paper":"https://pith.science/paper/DNWXIRKX"},"agent_actions":{"view_html":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53","download_json":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53.json","view_paper":"https://pith.science/paper/DNWXIRKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.0924&json=true","fetch_graph":"https://pith.science/api/pith-number/DNWXIRKXB3GMRKLUD64NRJTL53/graph.json","fetch_events":"https://pith.science/api/pith-number/DNWXIRKXB3GMRKLUD64NRJTL53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/action/storage_attestation","attest_author":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/action/author_attestation","sign_citation":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/action/citation_signature","submit_replication":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/action/replication_record"}},"created_at":"2026-05-18T03:54:27.423354+00:00","updated_at":"2026-05-18T03:54:27.423354+00:00"}