{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z3ADFQT3E4AR3NVHAVLIILFAIG","short_pith_number":"pith:Z3ADFQT3","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"},"canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","source":{"kind":"arxiv","id":"1410.4896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4896","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4896v1","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4896","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"Z3ADFQT3E4AR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3ADFQT3E4AR3NVH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3ADFQT3","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z3ADFQT3E4AR3NVHAVLIILFAIG","target":"record","payload":{"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"},"canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","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"},"source_kind":"arxiv","source_id":"1410.4896","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-18T02:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RlXclfYpxpT5I+PrXx1HGXTZtGlSUrV6NG/VD4krhV4IFborAdcDg2C6GT0nCpAr2uDFp5makbAo1GZDmT93Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:58:47.148329Z"},"content_sha256":"41f1b3414a9fd271580d6eefe6ae52b760a7d42d6884871a57be08aadea2d663","schema_version":"1.0","event_id":"sha256:41f1b3414a9fd271580d6eefe6ae52b760a7d42d6884871a57be08aadea2d663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z3ADFQT3E4AR3NVHAVLIILFAIG","target":"graph","payload":{"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"},"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-18T02:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36xpXVLBAoY5nD+zx2/CX5O5iBGF5/glx2oqJtcOig2BDgcu+CamkjPj4ZO5v9tYMvJ5K088DjV3u4XlJEftCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:58:47.148672Z"},"content_sha256":"8138fae4431a355ec2dbe7063445d18c2385e4ee74250c1ba9e6b4bc69fbbf1c","schema_version":"1.0","event_id":"sha256:8138fae4431a355ec2dbe7063445d18c2385e4ee74250c1ba9e6b4bc69fbbf1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/bundle.json","state_url":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/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-06-20T02:58:47Z","links":{"resolver":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG","bundle":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/bundle.json","state":"https://pith.science/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z3ADFQT3E4AR3NVHAVLIILFAIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z3ADFQT3E4AR3NVHAVLIILFAIG","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":"58d0c0f90fd2dda91894417a51d40514b8b5e24731a7d5b8fc1464fceb66e5d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T01:41:33Z","title_canon_sha256":"7190c952ab8f552643390e044329cc1882ef2c08df4eb4908a9517527a54e51b"},"schema_version":"1.0","source":{"id":"1410.4896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4896","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4896v1","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4896","created_at":"2026-05-18T02:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"Z3ADFQT3E4AR","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z3ADFQT3E4AR3NVH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z3ADFQT3","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:8138fae4431a355ec2dbe7063445d18c2385e4ee74250c1ba9e6b4bc69fbbf1c","target":"graph","created_at":"2026-05-18T02:39:47Z","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 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","authors_text":"C. Emre Koksal, Y.Ozan Basciftci","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T01:41:33Z","title":"Delay Optimal Secrecy in Two-Relay Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4896","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:41f1b3414a9fd271580d6eefe6ae52b760a7d42d6884871a57be08aadea2d663","target":"record","created_at":"2026-05-18T02:39:47Z","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":"58d0c0f90fd2dda91894417a51d40514b8b5e24731a7d5b8fc1464fceb66e5d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-18T01:41:33Z","title_canon_sha256":"7190c952ab8f552643390e044329cc1882ef2c08df4eb4908a9517527a54e51b"},"schema_version":"1.0","source":{"id":"1410.4896","kind":"arxiv","version":1}},"canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cec032c27b27011db6a70556842ca041ba0fee5f8dcdb3da7aa82c5f4bb42352","first_computed_at":"2026-05-18T02:39:47.533843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:47.533843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+uL+gLe/lWjSqm3WPSVidtteBMukstwV5y+vfm2IXrXskTUdpsCYImMfhMxLxPYrMGQB6vdXzSIHH8BYMVFxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:47.534352Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41f1b3414a9fd271580d6eefe6ae52b760a7d42d6884871a57be08aadea2d663","sha256:8138fae4431a355ec2dbe7063445d18c2385e4ee74250c1ba9e6b4bc69fbbf1c"],"state_sha256":"43d47ab5bc71a79a58a58c7a2b166f8b9c88e91df50a0d852d232bc9681393ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T+HbEEvs3GatB7nrEH6xfMtD2JQ0DZwMaxz48zEm28XLiglqLWdLqsuK9Zco1AyaKM7Nvce1OInfwLkdq2HVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:58:47.150558Z","bundle_sha256":"6d46b1845201b1fce37cd19bf0652b55c1559e350cdc2083a21ebea28ff12071"}}