{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XGTHT4VH6J3PGBYBL6EBUYGIW7","short_pith_number":"pith:XGTHT4VH","schema_version":"1.0","canonical_sha256":"b9a679f2a7f276f307015f881a60c8b7d9faf58f858a3b2dc5c756d59d5efbc3","source":{"kind":"arxiv","id":"1312.3198","version":2},"attestation_state":"computed","paper":{"title":"Secrecy Capacity Scaling in Large Cooperative Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahtab Mirmohseni, Panagiotis Papadimitratos","submitted_at":"2013-12-11T14:59:55Z","abstract_excerpt":"We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a network with $n_l$ legitimate nodes, $n_e$ eavesdroppers, and path loss exponent $\\alpha\\geq 2$. As long as $n_e^2(\\log(n_e))^{\\gamma}=o(n_l)$, for some positive $\\gamma$, we show one can obtain unbounded secure aggregate rate. This means zero-cost secure communication, given fixed total power constraint for the entire network. We achieve this result through (i) t"},"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":"1312.3198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-11T14:59:55Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6f95b536cf54bff2abca7ceead5753e2ea365dbe7a93f156c7ee8696d14b24ea","abstract_canon_sha256":"902acaaaff46e2e1207e96072eafbcb51870ec9f79294392d1b915f09f466ca0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:56.377382Z","signature_b64":"uhB6Dxo6H8FEmd/NhFoGRWZQSCAp6uIW5hHpVpRMtC9MzNfSkgZCgHAJEf56zh7bcgF2JltuHQkeVkaBtlnpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9a679f2a7f276f307015f881a60c8b7d9faf58f858a3b2dc5c756d59d5efbc3","last_reissued_at":"2026-05-18T02:25:56.376835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:56.376835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secrecy Capacity Scaling in Large Cooperative Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Mahtab Mirmohseni, Panagiotis Papadimitratos","submitted_at":"2013-12-11T14:59:55Z","abstract_excerpt":"We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a network with $n_l$ legitimate nodes, $n_e$ eavesdroppers, and path loss exponent $\\alpha\\geq 2$. As long as $n_e^2(\\log(n_e))^{\\gamma}=o(n_l)$, for some positive $\\gamma$, we show one can obtain unbounded secure aggregate rate. This means zero-cost secure communication, given fixed total power constraint for the entire network. We achieve this result through (i) t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3198","kind":"arxiv","version":2},"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":"1312.3198","created_at":"2026-05-18T02:25:56.376924+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3198v2","created_at":"2026-05-18T02:25:56.376924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3198","created_at":"2026-05-18T02:25:56.376924+00:00"},{"alias_kind":"pith_short_12","alias_value":"XGTHT4VH6J3P","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XGTHT4VH6J3PGBYB","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XGTHT4VH","created_at":"2026-05-18T12:28:06.772260+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/XGTHT4VH6J3PGBYBL6EBUYGIW7","json":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7.json","graph_json":"https://pith.science/api/pith-number/XGTHT4VH6J3PGBYBL6EBUYGIW7/graph.json","events_json":"https://pith.science/api/pith-number/XGTHT4VH6J3PGBYBL6EBUYGIW7/events.json","paper":"https://pith.science/paper/XGTHT4VH"},"agent_actions":{"view_html":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7","download_json":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7.json","view_paper":"https://pith.science/paper/XGTHT4VH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3198&json=true","fetch_graph":"https://pith.science/api/pith-number/XGTHT4VH6J3PGBYBL6EBUYGIW7/graph.json","fetch_events":"https://pith.science/api/pith-number/XGTHT4VH6J3PGBYBL6EBUYGIW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7/action/storage_attestation","attest_author":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7/action/author_attestation","sign_citation":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7/action/citation_signature","submit_replication":"https://pith.science/pith/XGTHT4VH6J3PGBYBL6EBUYGIW7/action/replication_record"}},"created_at":"2026-05-18T02:25:56.376924+00:00","updated_at":"2026-05-18T02:25:56.376924+00:00"}