{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:RFFWYO26QZ3R4QRTIDVSS7Z3AF","short_pith_number":"pith:RFFWYO26","canonical_record":{"source":{"id":"1008.3035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-18T07:09:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5518c0255905323009cb607256dec4758e371007a4c87b3bf0c2a9894138aa54","abstract_canon_sha256":"064f7ed10906be408e2f3552ca77c96233729e27822b8ac0d2d13e134ffe93b9"},"schema_version":"1.0"},"canonical_sha256":"894b6c3b5e86771e423340eb297f3b015aa3a738e5f3a37ced33d7b8ddd63c36","source":{"kind":"arxiv","id":"1008.3035","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3035","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3035v1","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3035","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"RFFWYO26QZ3R","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RFFWYO26QZ3R4QRT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RFFWYO26","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:RFFWYO26QZ3R4QRTIDVSS7Z3AF","target":"record","payload":{"canonical_record":{"source":{"id":"1008.3035","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-18T07:09:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5518c0255905323009cb607256dec4758e371007a4c87b3bf0c2a9894138aa54","abstract_canon_sha256":"064f7ed10906be408e2f3552ca77c96233729e27822b8ac0d2d13e134ffe93b9"},"schema_version":"1.0"},"canonical_sha256":"894b6c3b5e86771e423340eb297f3b015aa3a738e5f3a37ced33d7b8ddd63c36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:07.259234Z","signature_b64":"2QXOUOGVNkwYkDPF+zTuM7QPTIPwtUtOr1wTo2NTR/L2r2IZWNLEYF1pTfT/i9x4CUj43KkHSFAX/sN4cMB4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"894b6c3b5e86771e423340eb297f3b015aa3a738e5f3a37ced33d7b8ddd63c36","last_reissued_at":"2026-05-18T03:53:07.258654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:07.258654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.3035","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:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KCO2hZTiH2plTbPZIZW6ZYa3vUsRWpUJRDX9TOOjzoZIGmepxoYaJZSPbEsolB4ajepYGFuRaEC6Nl8nR77tDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:08.275296Z"},"content_sha256":"478e2a8be8daecc7ea0c4f42ba8c5ee6b84328317111632d8a580005734c98b3","schema_version":"1.0","event_id":"sha256:478e2a8be8daecc7ea0c4f42ba8c5ee6b84328317111632d8a580005734c98b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:RFFWYO26QZ3R4QRTIDVSS7Z3AF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Achievable Rates in Two-user Interference Channels with Finite Inputs and (Very) Strong Interference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Aydin Sezgin, Frederic Knabe","submitted_at":"2010-08-18T07:09:30Z","abstract_excerpt":"For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all. To achieve this capacity, the channel inputs need to be Gaussian distributed. However, Gaussian signals are continuous and unbounded. Thus, they are not well suited for practical applications. In this paper, we investigate the achievable rates if the channel inputs are restricted to finite constellations. Moreover, we will show by numerical simulations that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3035","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:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdCT6DN+Nnf1I7pFQQ4sjUlHmG6pJGNcpcBDK1/X8J7Xj4NzzRVDenuXi2WGXyI8mYuVMe2SRLY40R3GjE1JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:08.275677Z"},"content_sha256":"d5d018735b10628607a00d4a71d6c921aadee89efba5647475dec80792ea2194","schema_version":"1.0","event_id":"sha256:d5d018735b10628607a00d4a71d6c921aadee89efba5647475dec80792ea2194"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/bundle.json","state_url":"https://pith.science/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/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-03T16:06:08Z","links":{"resolver":"https://pith.science/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF","bundle":"https://pith.science/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/bundle.json","state":"https://pith.science/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFFWYO26QZ3R4QRTIDVSS7Z3AF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:RFFWYO26QZ3R4QRTIDVSS7Z3AF","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":"064f7ed10906be408e2f3552ca77c96233729e27822b8ac0d2d13e134ffe93b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-18T07:09:30Z","title_canon_sha256":"5518c0255905323009cb607256dec4758e371007a4c87b3bf0c2a9894138aa54"},"schema_version":"1.0","source":{"id":"1008.3035","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.3035","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1008.3035v1","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3035","created_at":"2026-05-18T03:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"RFFWYO26QZ3R","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"RFFWYO26QZ3R4QRT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"RFFWYO26","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:d5d018735b10628607a00d4a71d6c921aadee89efba5647475dec80792ea2194","target":"graph","created_at":"2026-05-18T03:53:07Z","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":"For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all. To achieve this capacity, the channel inputs need to be Gaussian distributed. However, Gaussian signals are continuous and unbounded. Thus, they are not well suited for practical applications. In this paper, we investigate the achievable rates if the channel inputs are restricted to finite constellations. Moreover, we will show by numerical simulations that ","authors_text":"Aydin Sezgin, Frederic Knabe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-18T07:09:30Z","title":"Achievable Rates in Two-user Interference Channels with Finite Inputs and (Very) Strong Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3035","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:478e2a8be8daecc7ea0c4f42ba8c5ee6b84328317111632d8a580005734c98b3","target":"record","created_at":"2026-05-18T03:53:07Z","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":"064f7ed10906be408e2f3552ca77c96233729e27822b8ac0d2d13e134ffe93b9","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-18T07:09:30Z","title_canon_sha256":"5518c0255905323009cb607256dec4758e371007a4c87b3bf0c2a9894138aa54"},"schema_version":"1.0","source":{"id":"1008.3035","kind":"arxiv","version":1}},"canonical_sha256":"894b6c3b5e86771e423340eb297f3b015aa3a738e5f3a37ced33d7b8ddd63c36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"894b6c3b5e86771e423340eb297f3b015aa3a738e5f3a37ced33d7b8ddd63c36","first_computed_at":"2026-05-18T03:53:07.258654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:07.258654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2QXOUOGVNkwYkDPF+zTuM7QPTIPwtUtOr1wTo2NTR/L2r2IZWNLEYF1pTfT/i9x4CUj43KkHSFAX/sN4cMB4Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:07.259234Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.3035","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:478e2a8be8daecc7ea0c4f42ba8c5ee6b84328317111632d8a580005734c98b3","sha256:d5d018735b10628607a00d4a71d6c921aadee89efba5647475dec80792ea2194"],"state_sha256":"c702793a1faa904c40e3f547a7d064f592c4ec73fcd681462969cf2abf6aff46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxhg9e/gUcqE32FyoAS5qj1m5SJDh5bWDwV/tLJHR/K4NcKwfyqqGdLkxiIWIUgE22WxMDa5/eTk7FgP1eGuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:06:08.277716Z","bundle_sha256":"e2a9540430dad56087f08ca7e8af0c68f886836e90dec02b8ce201f081a7b8aa"}}