{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PDCTQNXAL5U5XAUVJ2Y55KAESE","short_pith_number":"pith:PDCTQNXA","schema_version":"1.0","canonical_sha256":"78c53836e05f69db82954eb1dea8049134cbc18dc19caba9a1f3fa2b25ceb11f","source":{"kind":"arxiv","id":"1604.07157","version":1},"attestation_state":"computed","paper":{"title":"Closed-form Approximations for Coverage and Rate in a Multi-tier Heterogeneous Network in Nakagami-m Fading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Kumar, G. V. S. S. Praneeth Varma, G. V. V. Sharma","submitted_at":"2016-04-25T08:07:07Z","abstract_excerpt":"In this paper, we consider the downlink in a K-tier heterogeneous network in the presence of Nakagami-m fading and noise. For such a system, we derive closed-form approximations of coverage probability and average rate achievable. A piece-wise linear approximation is employed in obtaining the simplified expressions. The proposed results are verified numerically through simulations. A comparison with existing work shows that the proposed work is a good approximation."},"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":"1604.07157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-25T08:07:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"79a54432238aeaae3f5132dcf2e59e68c032496ad84f5952c2d227d44aae418b","abstract_canon_sha256":"1564c7cf3e2670d0f6c62d2c5910f3e3e37677026d4c2bb255aa2c66feba3c27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:22.918556Z","signature_b64":"/w9LMuaKHK6x0mAtEEPKpvmpEKiGRbffbRxir78dObIm54aoMigBNnzFcvSOoBG+fgSjaNZ6V5f6jFBaNB0oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c53836e05f69db82954eb1dea8049134cbc18dc19caba9a1f3fa2b25ceb11f","last_reissued_at":"2026-05-18T01:16:22.917885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:22.917885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closed-form Approximations for Coverage and Rate in a Multi-tier Heterogeneous Network in Nakagami-m Fading","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Kumar, G. V. S. S. Praneeth Varma, G. V. V. Sharma","submitted_at":"2016-04-25T08:07:07Z","abstract_excerpt":"In this paper, we consider the downlink in a K-tier heterogeneous network in the presence of Nakagami-m fading and noise. For such a system, we derive closed-form approximations of coverage probability and average rate achievable. A piece-wise linear approximation is employed in obtaining the simplified expressions. The proposed results are verified numerically through simulations. A comparison with existing work shows that the proposed work is a good approximation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07157","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":"1604.07157","created_at":"2026-05-18T01:16:22.917980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07157v1","created_at":"2026-05-18T01:16:22.917980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07157","created_at":"2026-05-18T01:16:22.917980+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDCTQNXAL5U5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDCTQNXAL5U5XAUV","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDCTQNXA","created_at":"2026-05-18T12:30:39.010887+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/PDCTQNXAL5U5XAUVJ2Y55KAESE","json":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE.json","graph_json":"https://pith.science/api/pith-number/PDCTQNXAL5U5XAUVJ2Y55KAESE/graph.json","events_json":"https://pith.science/api/pith-number/PDCTQNXAL5U5XAUVJ2Y55KAESE/events.json","paper":"https://pith.science/paper/PDCTQNXA"},"agent_actions":{"view_html":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE","download_json":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE.json","view_paper":"https://pith.science/paper/PDCTQNXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07157&json=true","fetch_graph":"https://pith.science/api/pith-number/PDCTQNXAL5U5XAUVJ2Y55KAESE/graph.json","fetch_events":"https://pith.science/api/pith-number/PDCTQNXAL5U5XAUVJ2Y55KAESE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE/action/storage_attestation","attest_author":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE/action/author_attestation","sign_citation":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE/action/citation_signature","submit_replication":"https://pith.science/pith/PDCTQNXAL5U5XAUVJ2Y55KAESE/action/replication_record"}},"created_at":"2026-05-18T01:16:22.917980+00:00","updated_at":"2026-05-18T01:16:22.917980+00:00"}