{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:Z7HWFNZXTGI3KRM4AKOLJAEGE6","short_pith_number":"pith:Z7HWFNZX","canonical_record":{"source":{"id":"1109.2993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-14T05:33:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"348b1d023675242510a9ee67229fc5a351daaa5160c6a0e9429cdc9b5de6c147","abstract_canon_sha256":"65d16e7d0a59f8f95a59e70baff971aa95b597a38b490a914ed16197cfae5e73"},"schema_version":"1.0"},"canonical_sha256":"cfcf62b7379991b5459c029cb480862793453d16254c399faa3ae45491dff5f7","source":{"kind":"arxiv","id":"1109.2993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2993","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2993v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2993","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z7HWFNZXTGI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z7HWFNZXTGI3KRM4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z7HWFNZX","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:Z7HWFNZXTGI3KRM4AKOLJAEGE6","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-14T05:33:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"348b1d023675242510a9ee67229fc5a351daaa5160c6a0e9429cdc9b5de6c147","abstract_canon_sha256":"65d16e7d0a59f8f95a59e70baff971aa95b597a38b490a914ed16197cfae5e73"},"schema_version":"1.0"},"canonical_sha256":"cfcf62b7379991b5459c029cb480862793453d16254c399faa3ae45491dff5f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:06.526806Z","signature_b64":"io2Yym2PtYIfrphfcQkJUienIZP4x0gQ5vWN2LD+igtgEfKTOso6PAW+NLMe+TkMyRFJ1zgv4HoaUxZeGINhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfcf62b7379991b5459c029cb480862793453d16254c399faa3ae45491dff5f7","last_reissued_at":"2026-05-18T04:13:06.526347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:06.526347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2993","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-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"16dIM1Fw0DeA6nCb1jjfmEy5nS2+HWCX68BKYqeXTrBfiCbx73lngRkFhvYHK1b65Vn/4P+itTcxid8FwN86Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:29:05.176363Z"},"content_sha256":"eb94cd9e78de3f9b66c112390b90f85ba3559791a1036eccf525a17bcce24d8d","schema_version":"1.0","event_id":"sha256:eb94cd9e78de3f9b66c112390b90f85ba3559791a1036eccf525a17bcce24d8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:Z7HWFNZXTGI3KRM4AKOLJAEGE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Delay-Constrained General Achievable Rate and Certain Capacity Results for UWB Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghosheh Abed Hodtani, Maryam Faramarzi Yazd","submitted_at":"2011-09-14T05:33:46Z","abstract_excerpt":"In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained lower and upper bounds. Then, we show that by appropriately choosing the noise correlation coefficients, our new upper bound coincides with the lower bound in special cases of degraded and reversely degraded UWB relay channels. Finally, some numerical results are illustrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2993","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-18T04:13:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4jxdUnTlRqweH41px+PBD2Yv6/MqSXas+6TsxLdovLhTg3xAtdrmFn1wP3KXzFGYvgWhiOB5r6lInR4t07tWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:29:05.177025Z"},"content_sha256":"b78c10f3da597c3012c213ba6c196dd638f314f4098c5e0beaad5370235fa2f3","schema_version":"1.0","event_id":"sha256:b78c10f3da597c3012c213ba6c196dd638f314f4098c5e0beaad5370235fa2f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/bundle.json","state_url":"https://pith.science/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/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-26T01:29:05Z","links":{"resolver":"https://pith.science/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6","bundle":"https://pith.science/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/bundle.json","state":"https://pith.science/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7HWFNZXTGI3KRM4AKOLJAEGE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:Z7HWFNZXTGI3KRM4AKOLJAEGE6","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":"65d16e7d0a59f8f95a59e70baff971aa95b597a38b490a914ed16197cfae5e73","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-14T05:33:46Z","title_canon_sha256":"348b1d023675242510a9ee67229fc5a351daaa5160c6a0e9429cdc9b5de6c147"},"schema_version":"1.0","source":{"id":"1109.2993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2993","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2993v1","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2993","created_at":"2026-05-18T04:13:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z7HWFNZXTGI3","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"Z7HWFNZXTGI3KRM4","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"Z7HWFNZX","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:b78c10f3da597c3012c213ba6c196dd638f314f4098c5e0beaad5370235fa2f3","target":"graph","created_at":"2026-05-18T04:13:06Z","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":"In this paper, we derive UWB version of (i) general best achievable rate for the relay channel with decode-andforward strategy and (ii) max-flow min-cut upper bound, such that the UWB relay channel can be studied considering the obtained lower and upper bounds. Then, we show that by appropriately choosing the noise correlation coefficients, our new upper bound coincides with the lower bound in special cases of degraded and reversely degraded UWB relay channels. Finally, some numerical results are illustrated.","authors_text":"Ghosheh Abed Hodtani, Maryam Faramarzi Yazd","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-14T05:33:46Z","title":"A Delay-Constrained General Achievable Rate and Certain Capacity Results for UWB Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2993","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:eb94cd9e78de3f9b66c112390b90f85ba3559791a1036eccf525a17bcce24d8d","target":"record","created_at":"2026-05-18T04:13:06Z","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":"65d16e7d0a59f8f95a59e70baff971aa95b597a38b490a914ed16197cfae5e73","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-09-14T05:33:46Z","title_canon_sha256":"348b1d023675242510a9ee67229fc5a351daaa5160c6a0e9429cdc9b5de6c147"},"schema_version":"1.0","source":{"id":"1109.2993","kind":"arxiv","version":1}},"canonical_sha256":"cfcf62b7379991b5459c029cb480862793453d16254c399faa3ae45491dff5f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfcf62b7379991b5459c029cb480862793453d16254c399faa3ae45491dff5f7","first_computed_at":"2026-05-18T04:13:06.526347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:06.526347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"io2Yym2PtYIfrphfcQkJUienIZP4x0gQ5vWN2LD+igtgEfKTOso6PAW+NLMe+TkMyRFJ1zgv4HoaUxZeGINhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:06.526806Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb94cd9e78de3f9b66c112390b90f85ba3559791a1036eccf525a17bcce24d8d","sha256:b78c10f3da597c3012c213ba6c196dd638f314f4098c5e0beaad5370235fa2f3"],"state_sha256":"c510676cebefd78402d3e3bbf3da2b558df75e445def7e9ed3a4dc4a359a8b24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PYAXP6GAW72CGJe/mu1g6vistveTCcgdq4JqVWwTGCugD/rTP8QkT4T+zzqFoATSFdbPYXRyzToaphV+bJkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:29:05.180589Z","bundle_sha256":"7268bb3c95896b3ca6c63eb80a6178d4f4aae575ae0796d5fdf1c0235b7e719c"}}