{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PGUSMJZBQ2TGS5GDUFV4ZX4NRT","short_pith_number":"pith:PGUSMJZB","schema_version":"1.0","canonical_sha256":"79a926272186a66974c3a16bccdf8d8cdeb858b0932c58ab3793154249819811","source":{"kind":"arxiv","id":"1611.05015","version":1},"attestation_state":"computed","paper":{"title":"Linear Precoder Design for a MIMO Gaussian Wiretap Channel with Full-Duplex Source and Destination Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. P. Petropulu, Jun Fang, Lingxiang Li, Zhi Chen","submitted_at":"2016-11-15T20:19:55Z","abstract_excerpt":"We consider linear precoder design for a multiple-input multiple-output (MIMO) Gaussian wiretap channel, which comprises two legitimate nodes, i.e., Alice and Bob, operating in Full-Duplex (FD) mode and exchanging confidential messages in the presence of a passive eavesdropper. Using the sum secrecy degrees of freedoms (sum S.D.o.F.) as reliability measure, we formulate an optimization problem with respect to the precoding matrices. In order to solve this problem, we first propose a cooperative secrecy transmission scheme, and prove that its feasible set is sufficient to achieve the maximum su"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.05015","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-11-15T20:19:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"06edbfbf8c39308fc55052acaae5619d27bdb65e1ca45eb3303c4e69c99b3bdf","abstract_canon_sha256":"d2f1bb0b9a7777f488ce00013eac21c6dd3cd96a7475ac93825bb4e503ac8aaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:49.233032Z","signature_b64":"DjL6WXvn3i/8RQzn0g6gRiwnoMJh2bw1LXWq3b6TFy38Gk3ci8HsnzdBp1IyDjtEql7XL1jaAw5Q1uhGvXBqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a926272186a66974c3a16bccdf8d8cdeb858b0932c58ab3793154249819811","last_reissued_at":"2026-05-18T00:58:49.232499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:49.232499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Precoder Design for a MIMO Gaussian Wiretap Channel with Full-Duplex Source and Destination Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. P. Petropulu, Jun Fang, Lingxiang Li, Zhi Chen","submitted_at":"2016-11-15T20:19:55Z","abstract_excerpt":"We consider linear precoder design for a multiple-input multiple-output (MIMO) Gaussian wiretap channel, which comprises two legitimate nodes, i.e., Alice and Bob, operating in Full-Duplex (FD) mode and exchanging confidential messages in the presence of a passive eavesdropper. Using the sum secrecy degrees of freedoms (sum S.D.o.F.) as reliability measure, we formulate an optimization problem with respect to the precoding matrices. In order to solve this problem, we first propose a cooperative secrecy transmission scheme, and prove that its feasible set is sufficient to achieve the maximum su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05015","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05015","created_at":"2026-05-18T00:58:49.232580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05015v1","created_at":"2026-05-18T00:58:49.232580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05015","created_at":"2026-05-18T00:58:49.232580+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGUSMJZBQ2TG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGUSMJZBQ2TGS5GD","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGUSMJZB","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT","json":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT.json","graph_json":"https://pith.science/api/pith-number/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/graph.json","events_json":"https://pith.science/api/pith-number/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/events.json","paper":"https://pith.science/paper/PGUSMJZB"},"agent_actions":{"view_html":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT","download_json":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT.json","view_paper":"https://pith.science/paper/PGUSMJZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05015&json=true","fetch_graph":"https://pith.science/api/pith-number/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/graph.json","fetch_events":"https://pith.science/api/pith-number/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/action/storage_attestation","attest_author":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/action/author_attestation","sign_citation":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/action/citation_signature","submit_replication":"https://pith.science/pith/PGUSMJZBQ2TGS5GDUFV4ZX4NRT/action/replication_record"}},"created_at":"2026-05-18T00:58:49.232580+00:00","updated_at":"2026-05-18T00:58:49.232580+00:00"}