{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AS3JTJREK35JVAETMQ3CW322ZJ","short_pith_number":"pith:AS3JTJRE","canonical_record":{"source":{"id":"1604.04818","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-04-17T02:31:20Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"945bc02045bc09f084e88f3978bc56a58f9ce7e8bf5e982469b69409be7776e2","abstract_canon_sha256":"bc509a71c2960246f6fa0a752a1cf5fa736b1b923e2143175407fb9c84016a8a"},"schema_version":"1.0"},"canonical_sha256":"04b699a62456fa9a809364362b6f5aca78b399f65471bdbcbfb9aef4ca40b14e","source":{"kind":"arxiv","id":"1604.04818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04818","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04818v1","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04818","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"AS3JTJREK35J","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AS3JTJREK35JVAET","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AS3JTJRE","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AS3JTJREK35JVAETMQ3CW322ZJ","target":"record","payload":{"canonical_record":{"source":{"id":"1604.04818","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-04-17T02:31:20Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"945bc02045bc09f084e88f3978bc56a58f9ce7e8bf5e982469b69409be7776e2","abstract_canon_sha256":"bc509a71c2960246f6fa0a752a1cf5fa736b1b923e2143175407fb9c84016a8a"},"schema_version":"1.0"},"canonical_sha256":"04b699a62456fa9a809364362b6f5aca78b399f65471bdbcbfb9aef4ca40b14e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:24.021254Z","signature_b64":"yxpVrjhp3B+gt9qSxY+5sHNRB+OH8EPUMnhAcE6DyA4/RENDOsHBcTBEZ7QhbOfTy9ODm/UnuDCKUhYyceXDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04b699a62456fa9a809364362b6f5aca78b399f65471bdbcbfb9aef4ca40b14e","last_reissued_at":"2026-05-18T01:16:24.020625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:24.020625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.04818","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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2faj9daRuWR7T+hzogclKa/nXZ4cwbSmHkPI2Y75AZBEUQ4o5nsGvxtbo15sxTE5fsaL3K6dVhNaPJPqQXmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:55:18.143744Z"},"content_sha256":"f1031f7db2be098f1ca19c0fe9e5606921221ddc83b703fc5b84f4a01ef379d8","schema_version":"1.0","event_id":"sha256:f1031f7db2be098f1ca19c0fe9e5606921221ddc83b703fc5b84f4a01ef379d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AS3JTJREK35JVAETMQ3CW322ZJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secrecy Capacity in Large Cooperative Networks in Presence of Eavesdroppers with Unknown Locations","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Hossein Hadavi, Mahtab Mirmohseni, Mohammad Reza Aref, Narges Kazempour","submitted_at":"2016-04-17T02:31:20Z","abstract_excerpt":"In this paper, an extended large wireless network under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI. Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named \\emph{stochastic virtual beamforming}, is proposed. Applying this scheme, an unbounded secure rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04818","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-18T01:16:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25tSNioxCrStTNtLHt8T3bzOXPERPigRXbDype6djl2XjzQjL+vhAf8Vm7LCfaJ9hIaZ3ryHSj16XsRR2UEbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:55:18.144086Z"},"content_sha256":"7dd46ee5c8d4a959c3cdff6b753948a7b025babc7e6986bca9e10869f965062b","schema_version":"1.0","event_id":"sha256:7dd46ee5c8d4a959c3cdff6b753948a7b025babc7e6986bca9e10869f965062b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS3JTJREK35JVAETMQ3CW322ZJ/bundle.json","state_url":"https://pith.science/pith/AS3JTJREK35JVAETMQ3CW322ZJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS3JTJREK35JVAETMQ3CW322ZJ/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-07-07T11:55:18Z","links":{"resolver":"https://pith.science/pith/AS3JTJREK35JVAETMQ3CW322ZJ","bundle":"https://pith.science/pith/AS3JTJREK35JVAETMQ3CW322ZJ/bundle.json","state":"https://pith.science/pith/AS3JTJREK35JVAETMQ3CW322ZJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS3JTJREK35JVAETMQ3CW322ZJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AS3JTJREK35JVAETMQ3CW322ZJ","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":"bc509a71c2960246f6fa0a752a1cf5fa736b1b923e2143175407fb9c84016a8a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-04-17T02:31:20Z","title_canon_sha256":"945bc02045bc09f084e88f3978bc56a58f9ce7e8bf5e982469b69409be7776e2"},"schema_version":"1.0","source":{"id":"1604.04818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04818","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04818v1","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04818","created_at":"2026-05-18T01:16:24Z"},{"alias_kind":"pith_short_12","alias_value":"AS3JTJREK35J","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AS3JTJREK35JVAET","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AS3JTJRE","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:7dd46ee5c8d4a959c3cdff6b753948a7b025babc7e6986bca9e10869f965062b","target":"graph","created_at":"2026-05-18T01:16:24Z","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, an extended large wireless network under the secrecy constraint is considered. In contrast to works which use idealized assumptions, a more realistic network situation with unknown eavesdroppers locations is investigated: the legitimate users only know their own Channel State Information (CSI), not the eavesdroppers CSI. Also, the network is analyzed by taking in to account the effects of both fading and path loss. Under these assumptions, a power efficient cooperative scheme, named \\emph{stochastic virtual beamforming}, is proposed. Applying this scheme, an unbounded secure rat","authors_text":"Amir Hossein Hadavi, Mahtab Mirmohseni, Mohammad Reza Aref, Narges Kazempour","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-04-17T02:31:20Z","title":"Secrecy Capacity in Large Cooperative Networks in Presence of Eavesdroppers with Unknown Locations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04818","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:f1031f7db2be098f1ca19c0fe9e5606921221ddc83b703fc5b84f4a01ef379d8","target":"record","created_at":"2026-05-18T01:16:24Z","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":"bc509a71c2960246f6fa0a752a1cf5fa736b1b923e2143175407fb9c84016a8a","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.IT","submitted_at":"2016-04-17T02:31:20Z","title_canon_sha256":"945bc02045bc09f084e88f3978bc56a58f9ce7e8bf5e982469b69409be7776e2"},"schema_version":"1.0","source":{"id":"1604.04818","kind":"arxiv","version":1}},"canonical_sha256":"04b699a62456fa9a809364362b6f5aca78b399f65471bdbcbfb9aef4ca40b14e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04b699a62456fa9a809364362b6f5aca78b399f65471bdbcbfb9aef4ca40b14e","first_computed_at":"2026-05-18T01:16:24.020625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:24.020625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yxpVrjhp3B+gt9qSxY+5sHNRB+OH8EPUMnhAcE6DyA4/RENDOsHBcTBEZ7QhbOfTy9ODm/UnuDCKUhYyceXDDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:24.021254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1031f7db2be098f1ca19c0fe9e5606921221ddc83b703fc5b84f4a01ef379d8","sha256:7dd46ee5c8d4a959c3cdff6b753948a7b025babc7e6986bca9e10869f965062b"],"state_sha256":"08a11f6089b601e9801a7011f07c2acf4fa88fbe2aad3c754b84de7b067effea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gT4H7dir7N+JKjRRgYgJK6pOf3paS0RXNlybaaPy/VlpA3y6OV/kmED/sKqdriHr0eD3Ribn1mLTYxr+ADx+Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:55:18.146081Z","bundle_sha256":"1ef739912911bc7e1d378af1c89439e72c602babbbf24f71e6d034e83906db33"}}