{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UAOXWQK6XG45QLIDX5ASV2QXFM","short_pith_number":"pith:UAOXWQK6","schema_version":"1.0","canonical_sha256":"a01d7b415eb9b9d82d03bf412aea172b3264ba6bf44f654fea043894a1b7dcf9","source":{"kind":"arxiv","id":"1509.04075","version":1},"attestation_state":"computed","paper":{"title":"Secure Transmission on the Two-hop Relay Channel with Scaled Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jasper Goseling, Jos H. Weber, Michael Gastpar, Zhijie Ren","submitted_at":"2015-09-14T13:07:29Z","abstract_excerpt":"In this paper, we consider communication on a two-hop channel, in which a source wants to send information reliably and securely to the destination via a relay. We consider both the untrusted relay case and the external eavesdropper case. In the untrusted relay case, the relay behaves as an eavesdropper and there is a cooperative node which sends a jamming signal to confuse the relay when the it is receiving from the source. We propose two secure transmission schemes using the scaled compute-and-forward technique. One of the schemes is based on a random binning code and the other one is based "},"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":"1509.04075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-14T13:07:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"65dddcf19d3d7a74434f0f165e59ab242c71761505c44fc0056aecd8e3370176","abstract_canon_sha256":"7aa2dc694823e686d8b063549079bc1f59a333087eee9dd3a2fae9da9ba892c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:08.359425Z","signature_b64":"rJ5iybq2KBVJq1AViTLPF0ghs5E7pD9ajJ8Hz/gXOKUX518cu9cSZgtQY/8TZt7GH9/e2CiXwkOMcH4CCddGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a01d7b415eb9b9d82d03bf412aea172b3264ba6bf44f654fea043894a1b7dcf9","last_reissued_at":"2026-05-18T01:33:08.358865Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:08.358865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Transmission on the Two-hop Relay Channel with Scaled Compute-and-Forward","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jasper Goseling, Jos H. Weber, Michael Gastpar, Zhijie Ren","submitted_at":"2015-09-14T13:07:29Z","abstract_excerpt":"In this paper, we consider communication on a two-hop channel, in which a source wants to send information reliably and securely to the destination via a relay. We consider both the untrusted relay case and the external eavesdropper case. In the untrusted relay case, the relay behaves as an eavesdropper and there is a cooperative node which sends a jamming signal to confuse the relay when the it is receiving from the source. We propose two secure transmission schemes using the scaled compute-and-forward technique. One of the schemes is based on a random binning code and the other one is based "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04075","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":"1509.04075","created_at":"2026-05-18T01:33:08.358950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04075v1","created_at":"2026-05-18T01:33:08.358950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04075","created_at":"2026-05-18T01:33:08.358950+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAOXWQK6XG45","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAOXWQK6XG45QLID","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAOXWQK6","created_at":"2026-05-18T12:29:44.643036+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/UAOXWQK6XG45QLIDX5ASV2QXFM","json":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM.json","graph_json":"https://pith.science/api/pith-number/UAOXWQK6XG45QLIDX5ASV2QXFM/graph.json","events_json":"https://pith.science/api/pith-number/UAOXWQK6XG45QLIDX5ASV2QXFM/events.json","paper":"https://pith.science/paper/UAOXWQK6"},"agent_actions":{"view_html":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM","download_json":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM.json","view_paper":"https://pith.science/paper/UAOXWQK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04075&json=true","fetch_graph":"https://pith.science/api/pith-number/UAOXWQK6XG45QLIDX5ASV2QXFM/graph.json","fetch_events":"https://pith.science/api/pith-number/UAOXWQK6XG45QLIDX5ASV2QXFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM/action/storage_attestation","attest_author":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM/action/author_attestation","sign_citation":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM/action/citation_signature","submit_replication":"https://pith.science/pith/UAOXWQK6XG45QLIDX5ASV2QXFM/action/replication_record"}},"created_at":"2026-05-18T01:33:08.358950+00:00","updated_at":"2026-05-18T01:33:08.358950+00:00"}