{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DNWXIRKXB3GMRKLUD64NRJTL53","short_pith_number":"pith:DNWXIRKX","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"},"canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","source":{"kind":"arxiv","id":"1203.0924","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0924","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0924v2","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0924","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"DNWXIRKXB3GM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNWXIRKXB3GMRKLU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNWXIRKX","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DNWXIRKXB3GMRKLUD64NRJTL53","target":"record","payload":{"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"},"canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","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"},"source_kind":"arxiv","source_id":"1203.0924","source_version":2,"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:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5DNfdgooIEskS0PGXj/gkxKoA13YqfXSt1RsoUcnY1/oFkd3zqj5JnQ5EWu9TS7R2nXcp2Mb3eqArJQIMsrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:49.373659Z"},"content_sha256":"06af0a6c4e721c16c009033ecd216e3ce779aa0495592fc3ff8f6aa8dd61a873","schema_version":"1.0","event_id":"sha256:06af0a6c4e721c16c009033ecd216e3ce779aa0495592fc3ff8f6aa8dd61a873"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DNWXIRKXB3GMRKLUD64NRJTL53","target":"graph","payload":{"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"},"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:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"87p2PG3WhsuRepoRjUV95xnPUGvp1vIWn9wU82hP7Of0Tyse8cy7F924lqQE76Ok+CAPAzXqKPxRJuHiwtSACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:40:49.373999Z"},"content_sha256":"ff3ede0d45c9d859435f3694a934aa275b510505a3a7e1bef8f2326d61be5148","schema_version":"1.0","event_id":"sha256:ff3ede0d45c9d859435f3694a934aa275b510505a3a7e1bef8f2326d61be5148"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/bundle.json","state_url":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNWXIRKXB3GMRKLUD64NRJTL53/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-02T21:40:49Z","links":{"resolver":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53","bundle":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/bundle.json","state":"https://pith.science/pith/DNWXIRKXB3GMRKLUD64NRJTL53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNWXIRKXB3GMRKLUD64NRJTL53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DNWXIRKXB3GMRKLUD64NRJTL53","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":"3adcfc3fd532ec980ee852b5b98d593d45b84af416bda4d2ec6bc5b343f702bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-05T14:08:02Z","title_canon_sha256":"daca99d786ea803aa8ee5f2a307e021533a74e887731ee04eec88d495acd1354"},"schema_version":"1.0","source":{"id":"1203.0924","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.0924","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1203.0924v2","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.0924","created_at":"2026-05-18T03:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"DNWXIRKXB3GM","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNWXIRKXB3GMRKLU","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNWXIRKX","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:ff3ede0d45c9d859435f3694a934aa275b510505a3a7e1bef8f2326d61be5148","target":"graph","created_at":"2026-05-18T03:54:27Z","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":"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,","authors_text":"Alex Alvarado, Fabian Altenbach, Georg B\\\"ocherer, Rudolf Mathar, Steven Corroy","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-05T14:08:02Z","title":"An Efficient Algorithm to Calculate BICM Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.0924","kind":"arxiv","version":2},"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:06af0a6c4e721c16c009033ecd216e3ce779aa0495592fc3ff8f6aa8dd61a873","target":"record","created_at":"2026-05-18T03:54:27Z","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":"3adcfc3fd532ec980ee852b5b98d593d45b84af416bda4d2ec6bc5b343f702bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-05T14:08:02Z","title_canon_sha256":"daca99d786ea803aa8ee5f2a307e021533a74e887731ee04eec88d495acd1354"},"schema_version":"1.0","source":{"id":"1203.0924","kind":"arxiv","version":2}},"canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b6d7445570eccc8a9741fb8d8a66beed53fa9d08185acc69f0508d1b04280f4","first_computed_at":"2026-05-18T03:54:27.423243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:27.423243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mOYWu7nDpjhMSQVKdNK3PbKgeO/XNVyoK1Fetf3ps1aqo2+0eDUYJC2JKXDbhoA8woRxgSs/V5r+In4cWmg2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:27.423904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.0924","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06af0a6c4e721c16c009033ecd216e3ce779aa0495592fc3ff8f6aa8dd61a873","sha256:ff3ede0d45c9d859435f3694a934aa275b510505a3a7e1bef8f2326d61be5148"],"state_sha256":"bf7aee747f7e8eaf2e53c532f44e06a7000c2957a8849af239a10ccb51b13deb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ff/soMk86SNmBRKrZiIqUGwA18KYNPYLQvlqDPirbZEZskhfjew85VITMM5UhSoKnNjLxmQCMxU2EDSQ34ZfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:40:49.375902Z","bundle_sha256":"e761949501f901e9a63a836f2084d3c9178f11b3a76ea663c691aee221a5d6ed"}}