{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:KCKSIZTLS66U4QGXZM5WE26TMS","short_pith_number":"pith:KCKSIZTL","canonical_record":{"source":{"id":"1212.0287","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2012-12-03T05:42:01Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"1e7daf8e157bd771c8b9f1fa9b8f5a5917fb338701de41e98d5249e6f177cfb5","abstract_canon_sha256":"1d0d91f8f4f2e6b1dd34dde9f992e5d3bd3d03f5b9fbbf7ec06143d6c2e7b4aa"},"schema_version":"1.0"},"canonical_sha256":"509524666b97bd4e40d7cb3b626bd364bbf828542b8c66e1955d619fa9f92802","source":{"kind":"arxiv","id":"1212.0287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0287","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0287v1","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0287","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"pith_short_12","alias_value":"KCKSIZTLS66U","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KCKSIZTLS66U4QGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KCKSIZTL","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:KCKSIZTLS66U4QGXZM5WE26TMS","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0287","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2012-12-03T05:42:01Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"1e7daf8e157bd771c8b9f1fa9b8f5a5917fb338701de41e98d5249e6f177cfb5","abstract_canon_sha256":"1d0d91f8f4f2e6b1dd34dde9f992e5d3bd3d03f5b9fbbf7ec06143d6c2e7b4aa"},"schema_version":"1.0"},"canonical_sha256":"509524666b97bd4e40d7cb3b626bd364bbf828542b8c66e1955d619fa9f92802","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:26.548198Z","signature_b64":"mJOlBDfQa9mmvHyZbo8weZqOgNyZvjbZRb+78F6jUaw/AWyhQAV0DHUPQsxKQWXtF8JVxl00rf9oSnlwPz+rDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"509524666b97bd4e40d7cb3b626bd364bbf828542b8c66e1955d619fa9f92802","last_reissued_at":"2026-05-18T03:39:26.547380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:26.547380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0287","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-18T03:39:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Apr6f8nFY8k5dyGxdB2XlOoX/2ePPz5wMQrGL7X8Je7jwG9nZox31kifS5/trX3yi5/cqmGQbO9YXfdvUE+sDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:53.664862Z"},"content_sha256":"def8570791907033853e65f9a23fb38e352fd738c049bd5229f31464b192a527","schema_version":"1.0","event_id":"sha256:def8570791907033853e65f9a23fb38e352fd738c049bd5229f31464b192a527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:KCKSIZTLS66U4QGXZM5WE26TMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Relay Cooperation for Secure and Reliable Transmission in Two-Hop Wireless Networks","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"cs.CR","authors_text":"Jianfeng Ma, Weisong Shi, Xiaohong Jiang, Yulong Shen","submitted_at":"2012-12-03T05:42:01Z","abstract_excerpt":"This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerant to ensure desired secrecy and reliability. We first study the scenario where path-loss "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0287","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-18T03:39:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tX+o0Hn3akt5eFQoXZo6KNfrqUU4XsCe8zixOaWyLRTGUSpUGlGVQ7fdps6OYruEOKI2rWHXDJqxvedrbbB6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:57:53.665621Z"},"content_sha256":"0f7591e8619eb193685cbed51f2f18967d709fdddac429fb17bca83e0b09e9b9","schema_version":"1.0","event_id":"sha256:0f7591e8619eb193685cbed51f2f18967d709fdddac429fb17bca83e0b09e9b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCKSIZTLS66U4QGXZM5WE26TMS/bundle.json","state_url":"https://pith.science/pith/KCKSIZTLS66U4QGXZM5WE26TMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCKSIZTLS66U4QGXZM5WE26TMS/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-05-25T18:57:53Z","links":{"resolver":"https://pith.science/pith/KCKSIZTLS66U4QGXZM5WE26TMS","bundle":"https://pith.science/pith/KCKSIZTLS66U4QGXZM5WE26TMS/bundle.json","state":"https://pith.science/pith/KCKSIZTLS66U4QGXZM5WE26TMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCKSIZTLS66U4QGXZM5WE26TMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:KCKSIZTLS66U4QGXZM5WE26TMS","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":"1d0d91f8f4f2e6b1dd34dde9f992e5d3bd3d03f5b9fbbf7ec06143d6c2e7b4aa","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2012-12-03T05:42:01Z","title_canon_sha256":"1e7daf8e157bd771c8b9f1fa9b8f5a5917fb338701de41e98d5249e6f177cfb5"},"schema_version":"1.0","source":{"id":"1212.0287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0287","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0287v1","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0287","created_at":"2026-05-18T03:39:26Z"},{"alias_kind":"pith_short_12","alias_value":"KCKSIZTLS66U","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"KCKSIZTLS66U4QGX","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"KCKSIZTL","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:0f7591e8619eb193685cbed51f2f18967d709fdddac429fb17bca83e0b09e9b9","target":"graph","created_at":"2026-05-18T03:39:26Z","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":"This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this problem mainly studied infinite networks and their asymptotic behavior and scaling law results, this papers focuses on a more practical network with finite number of system nodes and explores the corresponding exact result on the number of eavesdroppers one network can tolerant to ensure desired secrecy and reliability. We first study the scenario where path-loss ","authors_text":"Jianfeng Ma, Weisong Shi, Xiaohong Jiang, Yulong Shen","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2012-12-03T05:42:01Z","title":"Exploring Relay Cooperation for Secure and Reliable Transmission in Two-Hop Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0287","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:def8570791907033853e65f9a23fb38e352fd738c049bd5229f31464b192a527","target":"record","created_at":"2026-05-18T03:39:26Z","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":"1d0d91f8f4f2e6b1dd34dde9f992e5d3bd3d03f5b9fbbf7ec06143d6c2e7b4aa","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CR","submitted_at":"2012-12-03T05:42:01Z","title_canon_sha256":"1e7daf8e157bd771c8b9f1fa9b8f5a5917fb338701de41e98d5249e6f177cfb5"},"schema_version":"1.0","source":{"id":"1212.0287","kind":"arxiv","version":1}},"canonical_sha256":"509524666b97bd4e40d7cb3b626bd364bbf828542b8c66e1955d619fa9f92802","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"509524666b97bd4e40d7cb3b626bd364bbf828542b8c66e1955d619fa9f92802","first_computed_at":"2026-05-18T03:39:26.547380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:26.547380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mJOlBDfQa9mmvHyZbo8weZqOgNyZvjbZRb+78F6jUaw/AWyhQAV0DHUPQsxKQWXtF8JVxl00rf9oSnlwPz+rDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:26.548198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def8570791907033853e65f9a23fb38e352fd738c049bd5229f31464b192a527","sha256:0f7591e8619eb193685cbed51f2f18967d709fdddac429fb17bca83e0b09e9b9"],"state_sha256":"2585c6e41743300bdf87c75687a7a4db547b382928657a0875b3273c3502bf6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gYQA+jKUNshQzc62rb900HlQtNZHwCfSXKgPuUYN/nWdEmtYRzEl7BKqhccIH/GKzG2iwHRbBswhISOlQU/6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:57:53.669894Z","bundle_sha256":"8afc654586b2d4064c2788cff4e6cd3384bd6b25bc1aedf76e0413707e2d0715"}}