{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6KWZMSYWM5D6AZE2CKS3NIBYYA","short_pith_number":"pith:6KWZMSYW","canonical_record":{"source":{"id":"1303.0463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T05:39:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db6b4b276cd51ef59d718d869af1dcd7d0ad6be05ed28f1d8f4d3251d021fd20","abstract_canon_sha256":"8044d48072bdac1b9c21b585eba083cc53c1657616cbe2a6c6a3301e56b7f6d4"},"schema_version":"1.0"},"canonical_sha256":"f2ad964b166747e0649a12a5b6a038c0395a89cda961680be806e01c7f26f5dc","source":{"kind":"arxiv","id":"1303.0463","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0463","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0463v1","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0463","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"6KWZMSYWM5D6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6KWZMSYWM5D6AZE2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6KWZMSYW","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6KWZMSYWM5D6AZE2CKS3NIBYYA","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T05:39:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"db6b4b276cd51ef59d718d869af1dcd7d0ad6be05ed28f1d8f4d3251d021fd20","abstract_canon_sha256":"8044d48072bdac1b9c21b585eba083cc53c1657616cbe2a6c6a3301e56b7f6d4"},"schema_version":"1.0"},"canonical_sha256":"f2ad964b166747e0649a12a5b6a038c0395a89cda961680be806e01c7f26f5dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:55.943345Z","signature_b64":"c0nwcBHmUq4NB4mQSrtJ8S39PNm6d/u0BuhRKN7u8yHrKKXo//fycMKcYNL33Ez6hTvStMSVhaQxPTVIN5kTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2ad964b166747e0649a12a5b6a038c0395a89cda961680be806e01c7f26f5dc","last_reissued_at":"2026-05-18T03:31:55.942572Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:55.942572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0463","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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2ddPyX9Ggnl4BmqLkkaR5BAY8qkkzEIZoH9Ktf2JBjFsp/lsbfKRt81pMfaai2PUuufSeRWFLGkBio2Bg28AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:07:50.700069Z"},"content_sha256":"bbaf3fbaef369ad77cb85170361bc8c3e2534fa31b2dbfa193c8a5f4be9b61f7","schema_version":"1.0","event_id":"sha256:bbaf3fbaef369ad77cb85170361bc8c3e2534fa31b2dbfa193c8a5f4be9b61f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6KWZMSYWM5D6AZE2CKS3NIBYYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mobile Jammers for Secrecy Rate Maximization in Cooperative Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Athina P. Petropulu, Dionysios S. Kalogerias, Michael M. Zavlanos, Nikolaos Chatzipanagiotis","submitted_at":"2013-03-03T05:39:57Z","abstract_excerpt":"We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by multiple multi-antenna cooperating nodes (helpers) who have the ability to move. While Alice transmits, the helpers transmit noise that is designed to affect the entire space except Bob. We consider the problem of selecting the helper weights and positions that maximize the system secrecy rate. It turns out that this optimization problem can be efficiently solved"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0463","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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9BqDNGDwpZCmhp8wuRoP/SJ3r+xpkKje0O3odQv/JpYWrjytSPcD/sMZtFh9WTQzfRMhyyD/cqEnI+PUJNeAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:07:50.700694Z"},"content_sha256":"9b31acd0fbd40207701d0b16756c2dd79ed21d4a256be4cbc8de0a0016471895","schema_version":"1.0","event_id":"sha256:9b31acd0fbd40207701d0b16756c2dd79ed21d4a256be4cbc8de0a0016471895"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/bundle.json","state_url":"https://pith.science/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/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-27T09:07:50Z","links":{"resolver":"https://pith.science/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA","bundle":"https://pith.science/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/bundle.json","state":"https://pith.science/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KWZMSYWM5D6AZE2CKS3NIBYYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6KWZMSYWM5D6AZE2CKS3NIBYYA","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":"8044d48072bdac1b9c21b585eba083cc53c1657616cbe2a6c6a3301e56b7f6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T05:39:57Z","title_canon_sha256":"db6b4b276cd51ef59d718d869af1dcd7d0ad6be05ed28f1d8f4d3251d021fd20"},"schema_version":"1.0","source":{"id":"1303.0463","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0463","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0463v1","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0463","created_at":"2026-05-18T03:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"6KWZMSYWM5D6","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6KWZMSYWM5D6AZE2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6KWZMSYW","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:9b31acd0fbd40207701d0b16756c2dd79ed21d4a256be4cbc8de0a0016471895","target":"graph","created_at":"2026-05-18T03:31:55Z","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":"We consider a source (Alice) trying to communicate with a destination (Bob), in a way that an unauthorized node (Eve) cannot infer, based on her observations, the information that is being transmitted. The communication is assisted by multiple multi-antenna cooperating nodes (helpers) who have the ability to move. While Alice transmits, the helpers transmit noise that is designed to affect the entire space except Bob. We consider the problem of selecting the helper weights and positions that maximize the system secrecy rate. It turns out that this optimization problem can be efficiently solved","authors_text":"Athina P. Petropulu, Dionysios S. Kalogerias, Michael M. Zavlanos, Nikolaos Chatzipanagiotis","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T05:39:57Z","title":"Mobile Jammers for Secrecy Rate Maximization in Cooperative Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0463","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:bbaf3fbaef369ad77cb85170361bc8c3e2534fa31b2dbfa193c8a5f4be9b61f7","target":"record","created_at":"2026-05-18T03:31:55Z","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":"8044d48072bdac1b9c21b585eba083cc53c1657616cbe2a6c6a3301e56b7f6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-03-03T05:39:57Z","title_canon_sha256":"db6b4b276cd51ef59d718d869af1dcd7d0ad6be05ed28f1d8f4d3251d021fd20"},"schema_version":"1.0","source":{"id":"1303.0463","kind":"arxiv","version":1}},"canonical_sha256":"f2ad964b166747e0649a12a5b6a038c0395a89cda961680be806e01c7f26f5dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2ad964b166747e0649a12a5b6a038c0395a89cda961680be806e01c7f26f5dc","first_computed_at":"2026-05-18T03:31:55.942572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:55.942572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c0nwcBHmUq4NB4mQSrtJ8S39PNm6d/u0BuhRKN7u8yHrKKXo//fycMKcYNL33Ez6hTvStMSVhaQxPTVIN5kTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:55.943345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0463","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbaf3fbaef369ad77cb85170361bc8c3e2534fa31b2dbfa193c8a5f4be9b61f7","sha256:9b31acd0fbd40207701d0b16756c2dd79ed21d4a256be4cbc8de0a0016471895"],"state_sha256":"1cf1ac41683f68ccbe50dfddc5f37c8e87264206799e4d16fd6b3732c821290d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82vOenEqAc40juki7mQj2tdA97dlI5XmzPXOCxgncra5UQdGb2g0n5KT7Jer3YCXBPqP72Lcn8JUizE26ZQNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:07:50.703422Z","bundle_sha256":"7b9541c40098bf15ad0fad37419d987ce3af7e31dcdffc26e44acbd1a87e2cb3"}}