{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:TBHBKCJYTREBIEG5QOSVVJVSW2","short_pith_number":"pith:TBHBKCJY","canonical_record":{"source":{"id":"2011.09047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-18T02:43:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60a3234bd491cd884dcdab16f2a035095b0337a4edba51c608af1508690e3fdc","abstract_canon_sha256":"1cfc84b93e92ea4cb98b31569d7368cedc5fea1015a18b4d88fae59ecb2449d8"},"schema_version":"1.0"},"canonical_sha256":"984e1509389c481410dd83a55aa6b2b68b9194b45bd61e5246651d107ac3794a","source":{"kind":"arxiv","id":"2011.09047","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09047","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09047v1","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09047","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"TBHBKCJYTREB","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"TBHBKCJYTREBIEG5","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"TBHBKCJY","created_at":"2026-07-05T01:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:TBHBKCJYTREBIEG5QOSVVJVSW2","target":"record","payload":{"canonical_record":{"source":{"id":"2011.09047","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-18T02:43:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60a3234bd491cd884dcdab16f2a035095b0337a4edba51c608af1508690e3fdc","abstract_canon_sha256":"1cfc84b93e92ea4cb98b31569d7368cedc5fea1015a18b4d88fae59ecb2449d8"},"schema_version":"1.0"},"canonical_sha256":"984e1509389c481410dd83a55aa6b2b68b9194b45bd61e5246651d107ac3794a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:39.992645Z","signature_b64":"P3dregYgdqGQogP/q1h6aimWuEOGU+LD79b52U0GBcg8xF4jZsE3R66Y8B7xk4/QgJXdWRF9bdjc2dU4BO1aCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"984e1509389c481410dd83a55aa6b2b68b9194b45bd61e5246651d107ac3794a","last_reissued_at":"2026-07-05T01:52:39.992171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:39.992171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.09047","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-07-05T01:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBWNJ0Pyyr6ccNzD559jQaYYJXw3gcZ6XakD6AzuhBcA6wk4NhqoGWzeqEQweMwovHq/31Zdl6Jlujq1Dx8MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:05:29.306273Z"},"content_sha256":"0817b30a0daa886071a98f052437fd6489320cffba3848eff2649242039472dc","schema_version":"1.0","event_id":"sha256:0817b30a0daa886071a98f052437fd6489320cffba3848eff2649242039472dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:TBHBKCJYTREBIEG5QOSVVJVSW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Study of Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Buffer-Aided Relay Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"R. C. de Lamare, X. Lu","submitted_at":"2020-11-18T02:43:26Z","abstract_excerpt":"In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate of relay systems that does not require the channel state information (CSI) of the eavesdroppers. We also devise relaying and jamming function selection (RJFS) algorithms to select multiple relay nodes as well as multiple jamming nodes to assist the transmission. In the proposed RJFS algorithms inter-relay interference cancellation (IC) is taken into account"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09047","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.09047/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"osTJFB0Bkz9EwW3y5kHlcybkRIWwfamMpM0aYbx0jyH8VDR/+5B+QZxs3RqQYl7zr5jYXKcKZp6I5WPOaH/YAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T15:05:29.306816Z"},"content_sha256":"211d5b89ddac16dc1a0935d896c3e178cd2df5f2a4bb1eff7208c0134a841474","schema_version":"1.0","event_id":"sha256:211d5b89ddac16dc1a0935d896c3e178cd2df5f2a4bb1eff7208c0134a841474"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/bundle.json","state_url":"https://pith.science/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/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-08-06T15:05:29Z","links":{"resolver":"https://pith.science/pith/TBHBKCJYTREBIEG5QOSVVJVSW2","bundle":"https://pith.science/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/bundle.json","state":"https://pith.science/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBHBKCJYTREBIEG5QOSVVJVSW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:TBHBKCJYTREBIEG5QOSVVJVSW2","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":"1cfc84b93e92ea4cb98b31569d7368cedc5fea1015a18b4d88fae59ecb2449d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-18T02:43:26Z","title_canon_sha256":"60a3234bd491cd884dcdab16f2a035095b0337a4edba51c608af1508690e3fdc"},"schema_version":"1.0","source":{"id":"2011.09047","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09047","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09047v1","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09047","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"TBHBKCJYTREB","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"TBHBKCJYTREBIEG5","created_at":"2026-07-05T01:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"TBHBKCJY","created_at":"2026-07-05T01:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:211d5b89ddac16dc1a0935d896c3e178cd2df5f2a4bb1eff7208c0134a841474","target":"graph","created_at":"2026-07-05T01:52:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.09047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate opportunistic relaying and jamming techniques and develop relay selection algorithms that maximize the secrecy rate for multiuser buffer-aided relay networks. We develop an approach to maximize the secrecy rate of relay systems that does not require the channel state information (CSI) of the eavesdroppers. We also devise relaying and jamming function selection (RJFS) algorithms to select multiple relay nodes as well as multiple jamming nodes to assist the transmission. In the proposed RJFS algorithms inter-relay interference cancellation (IC) is taken into account","authors_text":"R. C. de Lamare, X. Lu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-18T02:43:26Z","title":"Study of Opportunistic Relaying and Jamming Based on Secrecy-Rate Maximization for Buffer-Aided Relay Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09047","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:0817b30a0daa886071a98f052437fd6489320cffba3848eff2649242039472dc","target":"record","created_at":"2026-07-05T01:52:39Z","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":"1cfc84b93e92ea4cb98b31569d7368cedc5fea1015a18b4d88fae59ecb2449d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-11-18T02:43:26Z","title_canon_sha256":"60a3234bd491cd884dcdab16f2a035095b0337a4edba51c608af1508690e3fdc"},"schema_version":"1.0","source":{"id":"2011.09047","kind":"arxiv","version":1}},"canonical_sha256":"984e1509389c481410dd83a55aa6b2b68b9194b45bd61e5246651d107ac3794a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"984e1509389c481410dd83a55aa6b2b68b9194b45bd61e5246651d107ac3794a","first_computed_at":"2026-07-05T01:52:39.992171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:39.992171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3dregYgdqGQogP/q1h6aimWuEOGU+LD79b52U0GBcg8xF4jZsE3R66Y8B7xk4/QgJXdWRF9bdjc2dU4BO1aCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:39.992645Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09047","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0817b30a0daa886071a98f052437fd6489320cffba3848eff2649242039472dc","sha256:211d5b89ddac16dc1a0935d896c3e178cd2df5f2a4bb1eff7208c0134a841474"],"state_sha256":"7176195e5453794a34fdd5cf1134cfacca3c7ab14486cee3fae9d09371a4b143"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIMU/xylvCcadqgQV04VPiMu0u0VOfJQFA0iCl/fPx3IiQyazLNnnw34lEFOpRCEywx67jfKSFZLeFLcWmDnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T15:05:29.310875Z","bundle_sha256":"f857dc600474c48f9f2f133994f4840acc807a06da0a77791afbe30a7d993217"}}