{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TWR5U6B66T2M4MI4FU2YWKFE75","short_pith_number":"pith:TWR5U6B6","canonical_record":{"source":{"id":"1710.10583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T09:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e43953060db4c4affc4f3ae29b6a02f3f7926e8fa1c64a9f514fe79469f6e461","abstract_canon_sha256":"1f83b7cb06027adddc853e7916515de5648bca512c1a970567ac747d163b514b"},"schema_version":"1.0"},"canonical_sha256":"9da3da783ef4f4ce311c2d358b28a4ff5f31d6012538e292a30d79ca079b1836","source":{"kind":"arxiv","id":"1710.10583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10583","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10583v1","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10583","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"pith_short_12","alias_value":"TWR5U6B66T2M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TWR5U6B66T2M4MI4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TWR5U6B6","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TWR5U6B66T2M4MI4FU2YWKFE75","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T09:14:26Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e43953060db4c4affc4f3ae29b6a02f3f7926e8fa1c64a9f514fe79469f6e461","abstract_canon_sha256":"1f83b7cb06027adddc853e7916515de5648bca512c1a970567ac747d163b514b"},"schema_version":"1.0"},"canonical_sha256":"9da3da783ef4f4ce311c2d358b28a4ff5f31d6012538e292a30d79ca079b1836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:47.043168Z","signature_b64":"oNs88imSiWqPaETkOWGPwLz7iKS+71JMczGNP8XfBByVP0730SPqmJ3RaUacMvj/IOC8EG+vvpkDIxCRvFEtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da3da783ef4f4ce311c2d358b28a4ff5f31d6012538e292a30d79ca079b1836","last_reissued_at":"2026-05-18T00:31:47.042610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:47.042610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10583","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-18T00:31:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eESHP7wVH3V9MoESEAOGIAdDMQJrIjSKv8kKLsi0xM2E5y4OYKaUMDV2R3067YRe+ws3vmNNztwm82cvPFdwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:30.654409Z"},"content_sha256":"40ba2ba7d9727adcaa1306f8cb444f8448c8d82f2569f9bc08588525d6fbc4b7","schema_version":"1.0","event_id":"sha256:40ba2ba7d9727adcaa1306f8cb444f8448c8d82f2569f9bc08588525d6fbc4b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TWR5U6B66T2M4MI4FU2YWKFE75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secrecy Rate Maximization with Outage Constraint in Multihop Relaying Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jianping Yao, Yuan Liu","submitted_at":"2017-10-29T09:14:26Z","abstract_excerpt":"In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford algorithm. Simu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10583","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-18T00:31:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfZiia6ObbhEI+hXfSG3hYKiV0Bs/NCWrYr1dvQHo/74ZxEUkfA+FBklyvrLHFIhKIvokkyZLv30IpZfiElADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T02:47:30.655136Z"},"content_sha256":"550367d368300e8ca2f9bcf065234a0e516a34da533750f7ec17e29ab9834d53","schema_version":"1.0","event_id":"sha256:550367d368300e8ca2f9bcf065234a0e516a34da533750f7ec17e29ab9834d53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWR5U6B66T2M4MI4FU2YWKFE75/bundle.json","state_url":"https://pith.science/pith/TWR5U6B66T2M4MI4FU2YWKFE75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWR5U6B66T2M4MI4FU2YWKFE75/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-10T02:47:30Z","links":{"resolver":"https://pith.science/pith/TWR5U6B66T2M4MI4FU2YWKFE75","bundle":"https://pith.science/pith/TWR5U6B66T2M4MI4FU2YWKFE75/bundle.json","state":"https://pith.science/pith/TWR5U6B66T2M4MI4FU2YWKFE75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWR5U6B66T2M4MI4FU2YWKFE75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TWR5U6B66T2M4MI4FU2YWKFE75","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":"1f83b7cb06027adddc853e7916515de5648bca512c1a970567ac747d163b514b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T09:14:26Z","title_canon_sha256":"e43953060db4c4affc4f3ae29b6a02f3f7926e8fa1c64a9f514fe79469f6e461"},"schema_version":"1.0","source":{"id":"1710.10583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10583","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10583v1","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10583","created_at":"2026-05-18T00:31:47Z"},{"alias_kind":"pith_short_12","alias_value":"TWR5U6B66T2M","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TWR5U6B66T2M4MI4","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TWR5U6B6","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:550367d368300e8ca2f9bcf065234a0e516a34da533750f7ec17e29ab9834d53","target":"graph","created_at":"2026-05-18T00:31:47Z","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":"In this paper, we study the secure transmission in multihop wireless networks with randomize-and-forward (RaF) relaying, in the presence of randomly distributed eavesdroppers. By considering adaptive encoder with on-off transmission (OFT) scheme, we investigate the optimal design of the wiretap code and routing strategies to maximize the secrecy rate while satisfying the secrecy outage probability (SOP) constraint. We derive the exact expressions for the optimal rate parameters of the wiretap code. Then the secure routing problem is solved by revising the classical Bellman-Ford algorithm. Simu","authors_text":"Jianping Yao, Yuan Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T09:14:26Z","title":"Secrecy Rate Maximization with Outage Constraint in Multihop Relaying Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10583","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:40ba2ba7d9727adcaa1306f8cb444f8448c8d82f2569f9bc08588525d6fbc4b7","target":"record","created_at":"2026-05-18T00:31:47Z","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":"1f83b7cb06027adddc853e7916515de5648bca512c1a970567ac747d163b514b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-29T09:14:26Z","title_canon_sha256":"e43953060db4c4affc4f3ae29b6a02f3f7926e8fa1c64a9f514fe79469f6e461"},"schema_version":"1.0","source":{"id":"1710.10583","kind":"arxiv","version":1}},"canonical_sha256":"9da3da783ef4f4ce311c2d358b28a4ff5f31d6012538e292a30d79ca079b1836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9da3da783ef4f4ce311c2d358b28a4ff5f31d6012538e292a30d79ca079b1836","first_computed_at":"2026-05-18T00:31:47.042610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:47.042610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNs88imSiWqPaETkOWGPwLz7iKS+71JMczGNP8XfBByVP0730SPqmJ3RaUacMvj/IOC8EG+vvpkDIxCRvFEtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:47.043168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40ba2ba7d9727adcaa1306f8cb444f8448c8d82f2569f9bc08588525d6fbc4b7","sha256:550367d368300e8ca2f9bcf065234a0e516a34da533750f7ec17e29ab9834d53"],"state_sha256":"1b9accbec91f51541d21252d92588d2a7f4e71eeee893ce22c1af13a1c6dcc32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ts0JwLYwBsXV8WNwmey3KvHv2xuK2/feCXERaOTMFYKkHH1lJdNhVI5Kfnw//A4B5euT2/ymc6AozjLXSXbfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T02:47:30.659431Z","bundle_sha256":"c6529b2f60eebe7204ac89b875d736bcf7142f4ccac566b2589590c41a2c1324"}}