{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TG2XSHHZIK5WCBLA2OCM644GHE","short_pith_number":"pith:TG2XSHHZ","canonical_record":{"source":{"id":"1210.4459","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T15:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5493af3e65a53ef25ce9017161eccb81b877606df4274bb816318c0af93c906","abstract_canon_sha256":"85b4beaf68842edf87af103173da6118e77bcd43618e7313066aa4397e0c17f1"},"schema_version":"1.0"},"canonical_sha256":"99b5791cf942bb610560d384cf738639035e703cbe42f4976e9a619547e5b5bc","source":{"kind":"arxiv","id":"1210.4459","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4459","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4459v3","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4459","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"TG2XSHHZIK5W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TG2XSHHZIK5WCBLA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TG2XSHHZ","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TG2XSHHZIK5WCBLA2OCM644GHE","target":"record","payload":{"canonical_record":{"source":{"id":"1210.4459","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T15:52:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b5493af3e65a53ef25ce9017161eccb81b877606df4274bb816318c0af93c906","abstract_canon_sha256":"85b4beaf68842edf87af103173da6118e77bcd43618e7313066aa4397e0c17f1"},"schema_version":"1.0"},"canonical_sha256":"99b5791cf942bb610560d384cf738639035e703cbe42f4976e9a619547e5b5bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:54.243527Z","signature_b64":"53QaLSNZRdpV1sBrxHT6GnahCfjMSTylPfDSXY7+GU1jXTl/DY5z7iC8PXRQk58EY82BzuoOnY2OYUnjp6IrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b5791cf942bb610560d384cf738639035e703cbe42f4976e9a619547e5b5bc","last_reissued_at":"2026-05-18T01:53:54.242797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:54.242797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.4459","source_version":3,"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-18T01:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfD1BXTbYKiN41g0k8DZ86blMePPjHfF5eGG0Ydv/bidOoq3xZxSscsSFpVWOEg6sixrMpj/zSMBTNUQUBxWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:14.155488Z"},"content_sha256":"877a1569347f5e6ca5519bc97834984969d0bec538b1bc29952752466e1db1a6","schema_version":"1.0","event_id":"sha256:877a1569347f5e6ca5519bc97834984969d0bec538b1bc29952752466e1db1a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TG2XSHHZIK5WCBLA2OCM644GHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computation of Pareto Optimal Beamforming Vectors for the MISO Interference Channel with Successive Interference Cancellation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eleftherios Karipidis, Erik G. Larsson, Johannes Lindblom","submitted_at":"2012-10-16T15:52:48Z","abstract_excerpt":"We study the two-user multiple-input single-output (MISO) Gaussian interference channel where the transmitters have perfect channel state information and employ single-stream beamforming. The receivers are capable of performing successive interference cancellation, so when the interfering signal is strong enough, it can be decoded, treating the desired signal as noise, and subtracted from the received signal, before the desired signal is decoded. We propose efficient methods to compute the Pareto-optimal rate points and corresponding beamforming vector pairs, by maximizing the rate of one link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4459","kind":"arxiv","version":3},"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-18T01:53:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5ghDwH4B/UeKKkx1n0unILFub1PsFoPmiwzTFIo4nHzQJIs1CoazQlvP8+4mne8qFRs3NMshi46Ebq9kt7zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:13:14.155845Z"},"content_sha256":"024170028eb2cf92b17f6c09ae5f9f5e9eb23f1718d2778649b26b099810fd1c","schema_version":"1.0","event_id":"sha256:024170028eb2cf92b17f6c09ae5f9f5e9eb23f1718d2778649b26b099810fd1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TG2XSHHZIK5WCBLA2OCM644GHE/bundle.json","state_url":"https://pith.science/pith/TG2XSHHZIK5WCBLA2OCM644GHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TG2XSHHZIK5WCBLA2OCM644GHE/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-05-29T16:13:14Z","links":{"resolver":"https://pith.science/pith/TG2XSHHZIK5WCBLA2OCM644GHE","bundle":"https://pith.science/pith/TG2XSHHZIK5WCBLA2OCM644GHE/bundle.json","state":"https://pith.science/pith/TG2XSHHZIK5WCBLA2OCM644GHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TG2XSHHZIK5WCBLA2OCM644GHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TG2XSHHZIK5WCBLA2OCM644GHE","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":"85b4beaf68842edf87af103173da6118e77bcd43618e7313066aa4397e0c17f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T15:52:48Z","title_canon_sha256":"b5493af3e65a53ef25ce9017161eccb81b877606df4274bb816318c0af93c906"},"schema_version":"1.0","source":{"id":"1210.4459","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4459","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4459v3","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4459","created_at":"2026-05-18T01:53:54Z"},{"alias_kind":"pith_short_12","alias_value":"TG2XSHHZIK5W","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TG2XSHHZIK5WCBLA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TG2XSHHZ","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:024170028eb2cf92b17f6c09ae5f9f5e9eb23f1718d2778649b26b099810fd1c","target":"graph","created_at":"2026-05-18T01:53:54Z","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":"We study the two-user multiple-input single-output (MISO) Gaussian interference channel where the transmitters have perfect channel state information and employ single-stream beamforming. The receivers are capable of performing successive interference cancellation, so when the interfering signal is strong enough, it can be decoded, treating the desired signal as noise, and subtracted from the received signal, before the desired signal is decoded. We propose efficient methods to compute the Pareto-optimal rate points and corresponding beamforming vector pairs, by maximizing the rate of one link","authors_text":"Eleftherios Karipidis, Erik G. Larsson, Johannes Lindblom","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T15:52:48Z","title":"Efficient Computation of Pareto Optimal Beamforming Vectors for the MISO Interference Channel with Successive Interference Cancellation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4459","kind":"arxiv","version":3},"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:877a1569347f5e6ca5519bc97834984969d0bec538b1bc29952752466e1db1a6","target":"record","created_at":"2026-05-18T01:53:54Z","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":"85b4beaf68842edf87af103173da6118e77bcd43618e7313066aa4397e0c17f1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-16T15:52:48Z","title_canon_sha256":"b5493af3e65a53ef25ce9017161eccb81b877606df4274bb816318c0af93c906"},"schema_version":"1.0","source":{"id":"1210.4459","kind":"arxiv","version":3}},"canonical_sha256":"99b5791cf942bb610560d384cf738639035e703cbe42f4976e9a619547e5b5bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99b5791cf942bb610560d384cf738639035e703cbe42f4976e9a619547e5b5bc","first_computed_at":"2026-05-18T01:53:54.242797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:54.242797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"53QaLSNZRdpV1sBrxHT6GnahCfjMSTylPfDSXY7+GU1jXTl/DY5z7iC8PXRQk58EY82BzuoOnY2OYUnjp6IrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:54.243527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4459","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:877a1569347f5e6ca5519bc97834984969d0bec538b1bc29952752466e1db1a6","sha256:024170028eb2cf92b17f6c09ae5f9f5e9eb23f1718d2778649b26b099810fd1c"],"state_sha256":"e5c249a45bb80fdfd2be8dd5774d84c74a8bd560041ef2ec23dc2590e1735dcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwBv1Uy+1djnJ4oxNoHkzY9TPd9Egp3hcuTXAsFAs11Dzyfe6E3R0k47Y1Hc0WwzPu/s5X5M901nJqeAkrN9AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:13:14.158369Z","bundle_sha256":"5249ee41a53dda0719a962e7ac96c35e5a0c3447fedf9d5f2544a0ab806fe86c"}}