{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z3ADFQT3E4AR3NVHAVLIILFAIG","short_pith_number":"pith:Z3ADFQT3","schema_version":"1.0","canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","source":{"kind":"arxiv","id":"1410.4896","version":1},"attestation_state":"computed","paper":{"title":"Delay Optimal Secrecy in Two-Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Emre Koksal, Y.Ozan Basciftci","submitted_at":"2014-10-18T01:41:33Z","abstract_excerpt":"We consider a two-relay network in which a source aims to communicate a confidential message to a destination while keeping the message secret from the relay nodes. In the first hop, the channels from the source to the relays are assumed to be block-fading and the channel states change arbitrarily -possibly non-stationary and non-ergodic- across blocks. When the relay feedback on the states of the source-to-relay channels is available on the source with no delay, we provide an encoding strategy to achieve the optimal delay. We next consider the case in which there is one-block delayed relay fe"},"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":"1410.4896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T01:41:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7190c952ab8f552643390e044329cc1882ef2c08df4eb4908a9517527a54e51b","abstract_canon_sha256":"58d0c0f90fd2dda91894417a51d40514b8b5e24731a7d5b8fc1464fceb66e5d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:47.534352Z","signature_b64":"+uL+gLe/lWjSqm3WPSVidtteBMukstwV5y+vfm2IXrXskTUdpsCYImMfhMxLxPYrMGQB6vdXzSIHH8BYMVFxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","last_reissued_at":"2026-05-18T02:39:47.533843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:47.533843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay Optimal Secrecy in Two-Relay Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"C. Emre Koksal, Y.Ozan Basciftci","submitted_at":"2014-10-18T01:41:33Z","abstract_excerpt":"We consider a two-relay network in which a source aims to communicate a confidential message to a destination while keeping the message secret from the relay nodes. In the first hop, the channels from the source to the relays are assumed to be block-fading and the channel states change arbitrarily -possibly non-stationary and non-ergodic- across blocks. When the relay feedback on the states of the source-to-relay channels is available on the source with no delay, we provide an encoding strategy to achieve the optimal delay. We next consider the case in which there is one-block delayed relay fe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4896","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":"1410.4896","created_at":"2026-05-18T02:39:47.533918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4896v1","created_at":"2026-05-18T02:39:47.533918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4896","created_at":"2026-05-18T02:39:47.533918+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3ADFQT3E4AR","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3ADFQT3E4AR3NVH","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3ADFQT3","created_at":"2026-05-18T12:28:59.999130+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/Z3ADFQT3E4AR3NVHAVLIILFAIG","json":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG.json","graph_json":"https://pith.science/api/pith-number/Z3ADFQT3E4AR3NVHAVLIILFAIG/graph.json","events_json":"https://pith.science/api/pith-number/Z3ADFQT3E4AR3NVHAVLIILFAIG/events.json","paper":"https://pith.science/paper/Z3ADFQT3"},"agent_actions":{"view_html":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG","download_json":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG.json","view_paper":"https://pith.science/paper/Z3ADFQT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4896&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3ADFQT3E4AR3NVHAVLIILFAIG/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3ADFQT3E4AR3NVHAVLIILFAIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/action/storage_attestation","attest_author":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/action/author_attestation","sign_citation":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/action/citation_signature","submit_replication":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/action/replication_record"}},"created_at":"2026-05-18T02:39:47.533918+00:00","updated_at":"2026-05-18T02:39:47.533918+00:00"}