{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QIWUTSH5GGLROY64MO4C53ISGO","short_pith_number":"pith:QIWUTSH5","canonical_record":{"source":{"id":"1202.2412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-11T04:59:51Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ea6e08688094ae43a47dd68087f6b819c703d0b088b85cbd0c61dfc83819a66a","abstract_canon_sha256":"079a2b3221905376b385a021378d9133c96aab927f0e229dcb27aef4407b389d"},"schema_version":"1.0"},"canonical_sha256":"822d49c8fd31971763dc63b82eed123390b142f46e8eb124d2c7b5aebba08726","source":{"kind":"arxiv","id":"1202.2412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2412","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2412v1","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2412","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"QIWUTSH5GGLR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIWUTSH5GGLROY64","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIWUTSH5","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QIWUTSH5GGLROY64MO4C53ISGO","target":"record","payload":{"canonical_record":{"source":{"id":"1202.2412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-11T04:59:51Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"ea6e08688094ae43a47dd68087f6b819c703d0b088b85cbd0c61dfc83819a66a","abstract_canon_sha256":"079a2b3221905376b385a021378d9133c96aab927f0e229dcb27aef4407b389d"},"schema_version":"1.0"},"canonical_sha256":"822d49c8fd31971763dc63b82eed123390b142f46e8eb124d2c7b5aebba08726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:58:31.066553Z","signature_b64":"mFBZswtI/0yJMKxyV+TR6s19P9KTDI0nAIrB9vF/vVGJaDctitJT8IrlJf08w7Gn0IRd47R/A7GB9BIGrfTTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"822d49c8fd31971763dc63b82eed123390b142f46e8eb124d2c7b5aebba08726","last_reissued_at":"2026-05-18T01:58:31.065989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:58:31.065989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.2412","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-18T01:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTvNOjtZ0KT7gHcBHt7tiIQo1UbdOhD3Kw124nfakgF0PJfwjMn4/Iku3+Po1YfGeOmc+TgkeZ2NAY1FhO/FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:38:48.355106Z"},"content_sha256":"3b2f808a79aeddf40df5ee68fc6fa8306c572660ff729494e880659e2b0a9600","schema_version":"1.0","event_id":"sha256:3b2f808a79aeddf40df5ee68fc6fa8306c572660ff729494e880659e2b0a9600"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QIWUTSH5GGLROY64MO4C53ISGO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Arash Khabbazibasmenj, Florian Roemer, Martin Haardt, Sergiy A. Vorobyov","submitted_at":"2012-02-11T04:59:51Z","abstract_excerpt":"Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2412","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-18T01:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubs4JOvw+9sdKH7ct5yy99Yo+CbSzLls7G0usxjaw1V0JVSyB7AaZftNaDx16tZxHYxT12vSOlVN9xzYkxMPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:38:48.355795Z"},"content_sha256":"2b38367cf016e9d9a919e1d640e29a5e48183e398a3a7f443863cf95127b6eb2","schema_version":"1.0","event_id":"sha256:2b38367cf016e9d9a919e1d640e29a5e48183e398a3a7f443863cf95127b6eb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIWUTSH5GGLROY64MO4C53ISGO/bundle.json","state_url":"https://pith.science/pith/QIWUTSH5GGLROY64MO4C53ISGO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIWUTSH5GGLROY64MO4C53ISGO/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-09T07:38:48Z","links":{"resolver":"https://pith.science/pith/QIWUTSH5GGLROY64MO4C53ISGO","bundle":"https://pith.science/pith/QIWUTSH5GGLROY64MO4C53ISGO/bundle.json","state":"https://pith.science/pith/QIWUTSH5GGLROY64MO4C53ISGO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIWUTSH5GGLROY64MO4C53ISGO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QIWUTSH5GGLROY64MO4C53ISGO","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":"079a2b3221905376b385a021378d9133c96aab927f0e229dcb27aef4407b389d","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-11T04:59:51Z","title_canon_sha256":"ea6e08688094ae43a47dd68087f6b819c703d0b088b85cbd0c61dfc83819a66a"},"schema_version":"1.0","source":{"id":"1202.2412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2412","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2412v1","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2412","created_at":"2026-05-18T01:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"QIWUTSH5GGLR","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QIWUTSH5GGLROY64","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QIWUTSH5","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:2b38367cf016e9d9a919e1d640e29a5e48183e398a3a7f443863cf95127b6eb2","target":"graph","created_at":"2026-05-18T01:58:31Z","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":"Sum-rate maximization in two-way amplify-and-forward (AF) multiple-input multiple-output (MIMO) relaying belongs to the class of difference-of-convex functions (DC) programming problems. DC programming problems occur as well in other signal processing applications and are typically solved using different modifications of the branch-and-bound method. This method, however, does not have any polynomial time complexity guarantees. In this paper, we show that a class of DC programming problems, to which the sum-rate maximization in two-way MIMO relaying belongs, can be solved very efficiently in po","authors_text":"Arash Khabbazibasmenj, Florian Roemer, Martin Haardt, Sergiy A. Vorobyov","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-11T04:59:51Z","title":"Sum-Rate Maximization in Two-Way AF MIMO Relaying: Polynomial Time Solutions to a Class of DC Programming Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2412","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:3b2f808a79aeddf40df5ee68fc6fa8306c572660ff729494e880659e2b0a9600","target":"record","created_at":"2026-05-18T01:58:31Z","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":"079a2b3221905376b385a021378d9133c96aab927f0e229dcb27aef4407b389d","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-11T04:59:51Z","title_canon_sha256":"ea6e08688094ae43a47dd68087f6b819c703d0b088b85cbd0c61dfc83819a66a"},"schema_version":"1.0","source":{"id":"1202.2412","kind":"arxiv","version":1}},"canonical_sha256":"822d49c8fd31971763dc63b82eed123390b142f46e8eb124d2c7b5aebba08726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"822d49c8fd31971763dc63b82eed123390b142f46e8eb124d2c7b5aebba08726","first_computed_at":"2026-05-18T01:58:31.065989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:58:31.065989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mFBZswtI/0yJMKxyV+TR6s19P9KTDI0nAIrB9vF/vVGJaDctitJT8IrlJf08w7Gn0IRd47R/A7GB9BIGrfTTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:58:31.066553Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b2f808a79aeddf40df5ee68fc6fa8306c572660ff729494e880659e2b0a9600","sha256:2b38367cf016e9d9a919e1d640e29a5e48183e398a3a7f443863cf95127b6eb2"],"state_sha256":"b008978dc8e58687dc3879122a47c71f452cd860bc068f33999bbaf1f8bdf62b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIcAe+CsLUpWSafWKrGCIqejsvwn6e/ximAmOBFmtEYiYXfTF84Um3UXX1+NmlaK+ScHFe18+vlqPQvyyJX7BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:38:48.359860Z","bundle_sha256":"13dc0ce9d27b1201c80dc45eccec057f05f7aec729a8c3633afa543b12e42a5a"}}