{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZYBHYZCMFMNZGJ22LRADAH4LVO","short_pith_number":"pith:ZYBHYZCM","schema_version":"1.0","canonical_sha256":"ce027c644c2b1b93275a5c40301f8bab952fa9f4708f560316dff35b5773db99","source":{"kind":"arxiv","id":"1401.8206","version":1},"attestation_state":"computed","paper":{"title":"Decode-and-Forward Relay Beamforming with Secret and Non-Secret Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chockalingam, Sanjay Vishwakarma","submitted_at":"2014-01-31T16:09:45Z","abstract_excerpt":"In this paper, we study beamforming in decode-and-forward (DF) relaying using multiple relays, where the source node sends a secret message as well as a non-secret message to the destination node in the presence of multiple non-colluding eavesdroppers. The non-secret message is transmitted at a fixed rate $R_{0}$ and requires no protection from the eavesdroppers, whereas the secret message needs to be protected from the eavesdroppers. The source and relays operate under a total power constraint. We find the optimum source powers and weights of the relays for both secret and non-secret messages"},"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":"1401.8206","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-31T16:09:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9f1676ab2427f1a753fb14e4fc98967138787bd704060dabde7667da24c4520a","abstract_canon_sha256":"15080218917e7503ad34f37b7b74c93fe114a5cf2226efdf3dcbdd156fec01e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:27.920475Z","signature_b64":"A0ym3Ax0Kuw3OpoIZEgJ85+2GgUTtneaRbC3q1rh01sNUAQq5zG7H+G7hgVY3NRE4eskAnG9ibE5P2gA+jiKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce027c644c2b1b93275a5c40301f8bab952fa9f4708f560316dff35b5773db99","last_reissued_at":"2026-05-18T03:00:27.919721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:27.919721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decode-and-Forward Relay Beamforming with Secret and Non-Secret Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Chockalingam, Sanjay Vishwakarma","submitted_at":"2014-01-31T16:09:45Z","abstract_excerpt":"In this paper, we study beamforming in decode-and-forward (DF) relaying using multiple relays, where the source node sends a secret message as well as a non-secret message to the destination node in the presence of multiple non-colluding eavesdroppers. The non-secret message is transmitted at a fixed rate $R_{0}$ and requires no protection from the eavesdroppers, whereas the secret message needs to be protected from the eavesdroppers. The source and relays operate under a total power constraint. We find the optimum source powers and weights of the relays for both secret and non-secret messages"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.8206","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":"1401.8206","created_at":"2026-05-18T03:00:27.919828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.8206v1","created_at":"2026-05-18T03:00:27.919828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.8206","created_at":"2026-05-18T03:00:27.919828+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYBHYZCMFMNZ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYBHYZCMFMNZGJ22","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYBHYZCM","created_at":"2026-05-18T12:28:59.999130+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/ZYBHYZCMFMNZGJ22LRADAH4LVO","json":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO.json","graph_json":"https://pith.science/api/pith-number/ZYBHYZCMFMNZGJ22LRADAH4LVO/graph.json","events_json":"https://pith.science/api/pith-number/ZYBHYZCMFMNZGJ22LRADAH4LVO/events.json","paper":"https://pith.science/paper/ZYBHYZCM"},"agent_actions":{"view_html":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO","download_json":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO.json","view_paper":"https://pith.science/paper/ZYBHYZCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.8206&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYBHYZCMFMNZGJ22LRADAH4LVO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYBHYZCMFMNZGJ22LRADAH4LVO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO/action/storage_attestation","attest_author":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO/action/author_attestation","sign_citation":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO/action/citation_signature","submit_replication":"https://pith.science/pith/ZYBHYZCMFMNZGJ22LRADAH4LVO/action/replication_record"}},"created_at":"2026-05-18T03:00:27.919828+00:00","updated_at":"2026-05-18T03:00:27.919828+00:00"}