{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4IEJOFGW7III6CO5EAWUNIJ2BR","short_pith_number":"pith:4IEJOFGW","canonical_record":{"source":{"id":"1705.04514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T11:14:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ce49ce9aa11520f0804de35db22406374d9adfc83b315846ab959f783b1b288","abstract_canon_sha256":"aaa414e2ef22ee3deb87238ff9af08e6b2fb0dc1f252c1968fdec2948bbd1a17"},"schema_version":"1.0"},"canonical_sha256":"e2089714d6fa108f09dd202d46a13a0c5d869fc474bfb0cc693b1195ef847222","source":{"kind":"arxiv","id":"1705.04514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04514","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04514v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04514","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"4IEJOFGW7III","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IEJOFGW7III6CO5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IEJOFGW","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4IEJOFGW7III6CO5EAWUNIJ2BR","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T11:14:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ce49ce9aa11520f0804de35db22406374d9adfc83b315846ab959f783b1b288","abstract_canon_sha256":"aaa414e2ef22ee3deb87238ff9af08e6b2fb0dc1f252c1968fdec2948bbd1a17"},"schema_version":"1.0"},"canonical_sha256":"e2089714d6fa108f09dd202d46a13a0c5d869fc474bfb0cc693b1195ef847222","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.899745Z","signature_b64":"p0XU13b4unYnz4FW88YnbYKQ4CvMwjrkbBTBEx3P6vMozlfx3tSPFh+DiYWBGWuSprnV8tfcTywezb4TaY+IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2089714d6fa108f09dd202d46a13a0c5d869fc474bfb0cc693b1195ef847222","last_reissued_at":"2026-05-18T00:44:37.899304Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.899304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04514","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbu+TUBFhmdCv6/7ZJoawPNjA2MKHGK6zvY/RG6rPhUfR867E/zDinAgzFENUEIqbN8C/I+tda2IYHWRxuTJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:51:23.237979Z"},"content_sha256":"cd2fa1ab7dd7d489debdb1a2223c18218dbe433f1789d1c342aec4553e1b2af0","schema_version":"1.0","event_id":"sha256:cd2fa1ab7dd7d489debdb1a2223c18218dbe433f1789d1c342aec4553e1b2af0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4IEJOFGW7III6CO5EAWUNIJ2BR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Multiuser Gain and the Constant-Gap Sum Capacity of the Gaussian Interfering Multiple Access Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gerhard Wunder, Rick Fritschek","submitted_at":"2017-05-12T11:14:15Z","abstract_excerpt":"Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of interference-limited multi-user channels, for example, the Gaussian interfering multiple access channel (G-IMAC). Networks with interference usually require the use of interference alignment (IA) as a technique to achieve the upper bounds of a network. A promising approach in view of constant-gap capacity results is a special form of IA called signal-scale a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04514","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:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxxOo+lMTffHYdp5lQDtwDA7PK3BVDKRVJS4jfHOqEffB9EfzzHoMZdb0+xSX5aqJMD6Bd2tIsbVQBkTqbrFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:51:23.238346Z"},"content_sha256":"04396baa87a5ca895f5de39895dc5c66d87158ac2093f1c6a77564cf1ab4013c","schema_version":"1.0","event_id":"sha256:04396baa87a5ca895f5de39895dc5c66d87158ac2093f1c6a77564cf1ab4013c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/bundle.json","state_url":"https://pith.science/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/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-01T04:51:23Z","links":{"resolver":"https://pith.science/pith/4IEJOFGW7III6CO5EAWUNIJ2BR","bundle":"https://pith.science/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/bundle.json","state":"https://pith.science/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IEJOFGW7III6CO5EAWUNIJ2BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4IEJOFGW7III6CO5EAWUNIJ2BR","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":"aaa414e2ef22ee3deb87238ff9af08e6b2fb0dc1f252c1968fdec2948bbd1a17","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T11:14:15Z","title_canon_sha256":"0ce49ce9aa11520f0804de35db22406374d9adfc83b315846ab959f783b1b288"},"schema_version":"1.0","source":{"id":"1705.04514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04514","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04514v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04514","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"4IEJOFGW7III","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4IEJOFGW7III6CO5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4IEJOFGW","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:04396baa87a5ca895f5de39895dc5c66d87158ac2093f1c6a77564cf1ab4013c","target":"graph","created_at":"2026-05-18T00:44:37Z","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":"Recent investigations have shown sum capacity results within a constant bit-gap for several channel models, e.g. the two-user Gaussian interference channel (G-IC), k-user G-IC or the Gaussian X-channel. This has motivated investigations of interference-limited multi-user channels, for example, the Gaussian interfering multiple access channel (G-IMAC). Networks with interference usually require the use of interference alignment (IA) as a technique to achieve the upper bounds of a network. A promising approach in view of constant-gap capacity results is a special form of IA called signal-scale a","authors_text":"Gerhard Wunder, Rick Fritschek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T11:14:15Z","title":"On Multiuser Gain and the Constant-Gap Sum Capacity of the Gaussian Interfering Multiple Access Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04514","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:cd2fa1ab7dd7d489debdb1a2223c18218dbe433f1789d1c342aec4553e1b2af0","target":"record","created_at":"2026-05-18T00:44:37Z","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":"aaa414e2ef22ee3deb87238ff9af08e6b2fb0dc1f252c1968fdec2948bbd1a17","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T11:14:15Z","title_canon_sha256":"0ce49ce9aa11520f0804de35db22406374d9adfc83b315846ab959f783b1b288"},"schema_version":"1.0","source":{"id":"1705.04514","kind":"arxiv","version":1}},"canonical_sha256":"e2089714d6fa108f09dd202d46a13a0c5d869fc474bfb0cc693b1195ef847222","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2089714d6fa108f09dd202d46a13a0c5d869fc474bfb0cc693b1195ef847222","first_computed_at":"2026-05-18T00:44:37.899304Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.899304Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0XU13b4unYnz4FW88YnbYKQ4CvMwjrkbBTBEx3P6vMozlfx3tSPFh+DiYWBGWuSprnV8tfcTywezb4TaY+IDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.899745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd2fa1ab7dd7d489debdb1a2223c18218dbe433f1789d1c342aec4553e1b2af0","sha256:04396baa87a5ca895f5de39895dc5c66d87158ac2093f1c6a77564cf1ab4013c"],"state_sha256":"ce52bbfc412106a5c1ed956ebc89434d551aa38e814afc893b908fd39de13d3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v1u/UVSdpUnrNPUfHSH1RGd7qtYrRyL27NdfnK+RE/EkaALxVrWbqTsoitWC6NetBYnpPVAryQT4VmgVzKFbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:51:23.240526Z","bundle_sha256":"b90a2d6624b655441fc634f2a43110e8c81fe1a3427c4c7249c7b21b7470bfd6"}}