{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:DWMJNE3ZDJ5XIDHKBE4K4CPA64","short_pith_number":"pith:DWMJNE3Z","canonical_record":{"source":{"id":"cs/0605087","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-19T20:25:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82dc0af0507d16cd8f2e78e79a88e6475830d9b93edc540c3a2119fd30e0037a","abstract_canon_sha256":"74dbdfba2f62942fa83dccd8aa9be82320cad0c7fdb15b40b63492f2281962d8"},"schema_version":"1.0"},"canonical_sha256":"1d989693791a7b740cea0938ae09e0f71fadc5489540bff385d96ec27a21a6e2","source":{"kind":"arxiv","id":"cs/0605087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605087","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605087v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605087","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"DWMJNE3ZDJ5X","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"DWMJNE3ZDJ5XIDHK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"DWMJNE3Z","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:DWMJNE3ZDJ5XIDHKBE4K4CPA64","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0605087","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-19T20:25:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"82dc0af0507d16cd8f2e78e79a88e6475830d9b93edc540c3a2119fd30e0037a","abstract_canon_sha256":"74dbdfba2f62942fa83dccd8aa9be82320cad0c7fdb15b40b63492f2281962d8"},"schema_version":"1.0"},"canonical_sha256":"1d989693791a7b740cea0938ae09e0f71fadc5489540bff385d96ec27a21a6e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:45.016301Z","signature_b64":"W8SDs62P69jNBUY2E6+UvMUvdztweuWeRBt8/gjleAVig41r6+Yv70eOrH479DkpJDUy38HYHnNZUYlIV2svAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d989693791a7b740cea0938ae09e0f71fadc5489540bff385d96ec27a21a6e2","last_reissued_at":"2026-05-18T00:57:45.015798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:45.015798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0605087","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-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bG5lgaWELgzHjCLG9TprMPMXBK3Ge2DVLvlKAyVb4p1l1/GWlbYlo4DtQysAi5Ocada1ni30JSv1qarY0bJcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:23:01.935788Z"},"content_sha256":"ea1b81862fd601dc5018a864d676bd4de98f5ab4d02cdf19d827aca4b1175607","schema_version":"1.0","event_id":"sha256:ea1b81862fd601dc5018a864d676bd4de98f5ab4d02cdf19d827aca4b1175607"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:DWMJNE3ZDJ5XIDHKBE4K4CPA64","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mustafa Cenk Gursoy","submitted_at":"2006-05-19T20:25:27Z","abstract_excerpt":"In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject only to an average power constraint. In this case, a lower bound to the random coding error exponent is considered and the optimal input achieving this lower bound is shown to have a discrete amplitude and uniform phase. If the input is subject to both average and peak power constraints, it is proven that the optimal input achieving the random coding error expo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605087","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-18T00:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s+tjarZv4HMIMH8iP5Xmu0TMmzYrP2aNyn9jUYxYKyn+QaxnZWPz0egkQNM0uGe28WuXay4oHNHC12QTuwlrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:23:01.936118Z"},"content_sha256":"70bf154e57a023b17055e229d93154a54718362110c5041bf3d100b7ed240010","schema_version":"1.0","event_id":"sha256:70bf154e57a023b17055e229d93154a54718362110c5041bf3d100b7ed240010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/bundle.json","state_url":"https://pith.science/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/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-02T04:23:01Z","links":{"resolver":"https://pith.science/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64","bundle":"https://pith.science/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/bundle.json","state":"https://pith.science/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWMJNE3ZDJ5XIDHKBE4K4CPA64/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:DWMJNE3ZDJ5XIDHKBE4K4CPA64","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":"74dbdfba2f62942fa83dccd8aa9be82320cad0c7fdb15b40b63492f2281962d8","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-19T20:25:27Z","title_canon_sha256":"82dc0af0507d16cd8f2e78e79a88e6475830d9b93edc540c3a2119fd30e0037a"},"schema_version":"1.0","source":{"id":"cs/0605087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0605087","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0605087v1","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0605087","created_at":"2026-05-18T00:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"DWMJNE3ZDJ5X","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"DWMJNE3ZDJ5XIDHK","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"DWMJNE3Z","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:70bf154e57a023b17055e229d93154a54718362110c5041bf3d100b7ed240010","target":"graph","created_at":"2026-05-18T00:57:45Z","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, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject only to an average power constraint. In this case, a lower bound to the random coding error exponent is considered and the optimal input achieving this lower bound is shown to have a discrete amplitude and uniform phase. If the input is subject to both average and peak power constraints, it is proven that the optimal input achieving the random coding error expo","authors_text":"Mustafa Cenk Gursoy","cross_cats":["math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2006-05-19T20:25:27Z","title":"Error Exponents and Cutoff Rate for Noncoherent Rician Fading Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0605087","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:ea1b81862fd601dc5018a864d676bd4de98f5ab4d02cdf19d827aca4b1175607","target":"record","created_at":"2026-05-18T00:57:45Z","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":"74dbdfba2f62942fa83dccd8aa9be82320cad0c7fdb15b40b63492f2281962d8","cross_cats_sorted":["math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2006-05-19T20:25:27Z","title_canon_sha256":"82dc0af0507d16cd8f2e78e79a88e6475830d9b93edc540c3a2119fd30e0037a"},"schema_version":"1.0","source":{"id":"cs/0605087","kind":"arxiv","version":1}},"canonical_sha256":"1d989693791a7b740cea0938ae09e0f71fadc5489540bff385d96ec27a21a6e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d989693791a7b740cea0938ae09e0f71fadc5489540bff385d96ec27a21a6e2","first_computed_at":"2026-05-18T00:57:45.015798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:45.015798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8SDs62P69jNBUY2E6+UvMUvdztweuWeRBt8/gjleAVig41r6+Yv70eOrH479DkpJDUy38HYHnNZUYlIV2svAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:45.016301Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0605087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea1b81862fd601dc5018a864d676bd4de98f5ab4d02cdf19d827aca4b1175607","sha256:70bf154e57a023b17055e229d93154a54718362110c5041bf3d100b7ed240010"],"state_sha256":"99797e2db28e6380f3b62f08a9690a9b1a9ffeb9e3c589a417df42c3e0944f71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kadlYL3V7WoLepiO9cPoVWOqrU5tKpduZmCsN4j+Dd9vY7mpAfYEECVHH8Sf1Us+sIWXctiNkxgLsP7qH3ceBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:23:01.937961Z","bundle_sha256":"666770389cde27a02b8dfa38510397e97fec80cee3ba712457e522be5413ec19"}}