{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KTABA3OIVLPSKUUKUH366JEKZ7","short_pith_number":"pith:KTABA3OI","schema_version":"1.0","canonical_sha256":"54c0106dc8aadf25528aa1f7ef248acfd408640b2b86da1b3be82409c1c87ae6","source":{"kind":"arxiv","id":"1406.7858","version":1},"attestation_state":"computed","paper":{"title":"Secrecy Outage Probability of Network-Coded Cooperative Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Jo\\~ao Luiz Rebelatto, Ohara Kerusauskas Rayel, Richard Demo Souza, Rodrigo Tsuneyoshi Kaido","submitted_at":"2014-06-30T19:07:15Z","abstract_excerpt":"We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with"},"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":"1406.7858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-06-30T19:07:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"610ff921ad696cd7f382bdd7347c10eebfcb633d520860e4588016fda97f916e","abstract_canon_sha256":"842ff64fa6210f2561fad6b03d11efed7039ea2490b342b42c59a79295906940"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:43.999963Z","signature_b64":"h4jAXWJYe+2scyKGClG+/+xg1tyZ7BjDlotGFQrWQGDYuprpMOz+SvOMwWNb34uSlSORDd+sPWKxA6+uihdCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54c0106dc8aadf25528aa1f7ef248acfd408640b2b86da1b3be82409c1c87ae6","last_reissued_at":"2026-05-18T02:48:43.999257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:43.999257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secrecy Outage Probability of Network-Coded Cooperative Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bartolomeu F. Uch\\^oa-Filho, Jo\\~ao Luiz Rebelatto, Ohara Kerusauskas Rayel, Richard Demo Souza, Rodrigo Tsuneyoshi Kaido","submitted_at":"2014-06-30T19:07:15Z","abstract_excerpt":"We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to increase the secrecy at the destination node, on the top of improving the error performance of the legitimate communication, already demonstrated in the literature. Network coding is leveraged by assuming that the legitime cooperative nodes are able to perform non-binary linear combinations of different frames before the transmission. Different scenarios with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7858","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.7858","created_at":"2026-05-18T02:48:43.999365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7858v1","created_at":"2026-05-18T02:48:43.999365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7858","created_at":"2026-05-18T02:48:43.999365+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTABA3OIVLPS","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTABA3OIVLPSKUUK","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTABA3OI","created_at":"2026-05-18T12:28:35.611951+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/KTABA3OIVLPSKUUKUH366JEKZ7","json":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7.json","graph_json":"https://pith.science/api/pith-number/KTABA3OIVLPSKUUKUH366JEKZ7/graph.json","events_json":"https://pith.science/api/pith-number/KTABA3OIVLPSKUUKUH366JEKZ7/events.json","paper":"https://pith.science/paper/KTABA3OI"},"agent_actions":{"view_html":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7","download_json":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7.json","view_paper":"https://pith.science/paper/KTABA3OI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7858&json=true","fetch_graph":"https://pith.science/api/pith-number/KTABA3OIVLPSKUUKUH366JEKZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/KTABA3OIVLPSKUUKUH366JEKZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7/action/storage_attestation","attest_author":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7/action/author_attestation","sign_citation":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7/action/citation_signature","submit_replication":"https://pith.science/pith/KTABA3OIVLPSKUUKUH366JEKZ7/action/replication_record"}},"created_at":"2026-05-18T02:48:43.999365+00:00","updated_at":"2026-05-18T02:48:43.999365+00:00"}