{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:GIWWLXZOVL2LYYPOMNYUASVM74","short_pith_number":"pith:GIWWLXZO","schema_version":"1.0","canonical_sha256":"322d65df2eaaf4bc61ee6371404aacff17da8f2ba4537bd9659dfc8c69089c03","source":{"kind":"arxiv","id":"0707.1588","version":1},"attestation_state":"computed","paper":{"title":"A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guillen i Fabregas, Khoa D. Nguyen, Lars K. Rasmussen","submitted_at":"2007-07-11T11:23:10Z","abstract_excerpt":"In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant."},"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":"0707.1588","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-07-11T11:23:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7747c8c01b0cf98584def96a91cd0c76c0c111968929e0499506ab86ec46a85d","abstract_canon_sha256":"91a23d9bc42811d1e8e7da0809b207f3684762c9226180d72cc1029e9a8e1094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:12.063267Z","signature_b64":"NfPT8Z5N9bhtJXbJGkCt1QMHLqDKA6nZXlOzeJBW6yNBYoSEX/xzYHqyv3GE5pwPo00wlN8KSytTjQozfBqyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"322d65df2eaaf4bc61ee6371404aacff17da8f2ba4537bd9659dfc8c69089c03","last_reissued_at":"2026-05-18T00:59:12.062509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:12.062509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Albert Guillen i Fabregas, Khoa D. Nguyen, Lars K. Rasmussen","submitted_at":"2007-07-11T11:23:10Z","abstract_excerpt":"In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.1588","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":"0707.1588","created_at":"2026-05-18T00:59:12.062620+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.1588v1","created_at":"2026-05-18T00:59:12.062620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.1588","created_at":"2026-05-18T00:59:12.062620+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIWWLXZOVL2L","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIWWLXZOVL2LYYPO","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIWWLXZO","created_at":"2026-05-18T12:25:55.427421+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/GIWWLXZOVL2LYYPOMNYUASVM74","json":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74.json","graph_json":"https://pith.science/api/pith-number/GIWWLXZOVL2LYYPOMNYUASVM74/graph.json","events_json":"https://pith.science/api/pith-number/GIWWLXZOVL2LYYPOMNYUASVM74/events.json","paper":"https://pith.science/paper/GIWWLXZO"},"agent_actions":{"view_html":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74","download_json":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74.json","view_paper":"https://pith.science/paper/GIWWLXZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.1588&json=true","fetch_graph":"https://pith.science/api/pith-number/GIWWLXZOVL2LYYPOMNYUASVM74/graph.json","fetch_events":"https://pith.science/api/pith-number/GIWWLXZOVL2LYYPOMNYUASVM74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74/action/storage_attestation","attest_author":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74/action/author_attestation","sign_citation":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74/action/citation_signature","submit_replication":"https://pith.science/pith/GIWWLXZOVL2LYYPOMNYUASVM74/action/replication_record"}},"created_at":"2026-05-18T00:59:12.062620+00:00","updated_at":"2026-05-18T00:59:12.062620+00:00"}