{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V52A7DLKMQ753ZMCICX7QNSL4V","short_pith_number":"pith:V52A7DLK","schema_version":"1.0","canonical_sha256":"af740f8d6a643fdde58240aff8364be563e064236cff31a5ae5da9bdc950eae8","source":{"kind":"arxiv","id":"1605.00203","version":4},"attestation_state":"computed","paper":{"title":"Fundamental Tradeoff between Storage and Latency in Cache-Aided Wireless Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Xu, Kangqi Liu, Meixia Tao","submitted_at":"2016-05-01T04:49:32Z","abstract_excerpt":"This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, \\emph{normalized delivery time} (NDT), which is the worst-case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom (DoF) of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tup"},"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":"1605.00203","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-01T04:49:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4f1b33ff1bf37c0d031dfd01cf0b9a5f128ba45ce911d31a8eed11699dfe6a5c","abstract_canon_sha256":"13cb8139a9f27cf27c20270c92ca74c64a6e5abda8173348ce387baf7763f51d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:01.828365Z","signature_b64":"LFc/NalhV0ukbxgLHkRokcWlYLavXG4Ej4TCs+WJP42rR6FQaL2EzjCvRRJizV3koz9licd4EdCeBUToltT3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af740f8d6a643fdde58240aff8364be563e064236cff31a5ae5da9bdc950eae8","last_reissued_at":"2026-05-18T00:23:01.827729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:01.827729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fundamental Tradeoff between Storage and Latency in Cache-Aided Wireless Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fan Xu, Kangqi Liu, Meixia Tao","submitted_at":"2016-05-01T04:49:32Z","abstract_excerpt":"This paper studies the fundamental tradeoff between storage and latency in a general wireless interference network with caches equipped at all transmitters and receivers. The tradeoff is characterized by an information-theoretic metric, \\emph{normalized delivery time} (NDT), which is the worst-case delivery time of the actual traffic load at a transmission rate specified by degrees of freedom (DoF) of a given channel. We obtain both an achievable upper bound and a theoretical lower bound of the minimum NDT for any number of transmitters, any number of receivers, and any feasible cache size tup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00203","kind":"arxiv","version":4},"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":"1605.00203","created_at":"2026-05-18T00:23:01.827824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00203v4","created_at":"2026-05-18T00:23:01.827824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00203","created_at":"2026-05-18T00:23:01.827824+00:00"},{"alias_kind":"pith_short_12","alias_value":"V52A7DLKMQ75","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"V52A7DLKMQ753ZMC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"V52A7DLK","created_at":"2026-05-18T12:30:46.583412+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/V52A7DLKMQ753ZMCICX7QNSL4V","json":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V.json","graph_json":"https://pith.science/api/pith-number/V52A7DLKMQ753ZMCICX7QNSL4V/graph.json","events_json":"https://pith.science/api/pith-number/V52A7DLKMQ753ZMCICX7QNSL4V/events.json","paper":"https://pith.science/paper/V52A7DLK"},"agent_actions":{"view_html":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V","download_json":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V.json","view_paper":"https://pith.science/paper/V52A7DLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00203&json=true","fetch_graph":"https://pith.science/api/pith-number/V52A7DLKMQ753ZMCICX7QNSL4V/graph.json","fetch_events":"https://pith.science/api/pith-number/V52A7DLKMQ753ZMCICX7QNSL4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V/action/storage_attestation","attest_author":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V/action/author_attestation","sign_citation":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V/action/citation_signature","submit_replication":"https://pith.science/pith/V52A7DLKMQ753ZMCICX7QNSL4V/action/replication_record"}},"created_at":"2026-05-18T00:23:01.827824+00:00","updated_at":"2026-05-18T00:23:01.827824+00:00"}