{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DWDQG2ISQRG2VKS2D2VXOC3I6D","short_pith_number":"pith:DWDQG2IS","canonical_record":{"source":{"id":"1904.06029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-12T04:40:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e779a62eb02785acd53c7dae56ae71438c13f4e8fc23947d438810f31cd8d48","abstract_canon_sha256":"19afdaaffc7ffa17fd180ba0120a78f819bca6a3af2f472c67fd9c5d19466da0"},"schema_version":"1.0"},"canonical_sha256":"1d87036912844daaaa5a1eab770b68f0c45779e1bbc4f92e5ecf3acf554461af","source":{"kind":"arxiv","id":"1904.06029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06029","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06029v1","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06029","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"DWDQG2ISQRG2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DWDQG2ISQRG2VKS2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DWDQG2IS","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DWDQG2ISQRG2VKS2D2VXOC3I6D","target":"record","payload":{"canonical_record":{"source":{"id":"1904.06029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-12T04:40:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2e779a62eb02785acd53c7dae56ae71438c13f4e8fc23947d438810f31cd8d48","abstract_canon_sha256":"19afdaaffc7ffa17fd180ba0120a78f819bca6a3af2f472c67fd9c5d19466da0"},"schema_version":"1.0"},"canonical_sha256":"1d87036912844daaaa5a1eab770b68f0c45779e1bbc4f92e5ecf3acf554461af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:44.451865Z","signature_b64":"VKos6xWjMIoIizCUDwpGYC99dtMthcZCBRHH/GFLPW9Fwo8jyxu8OHJCowInYV4CCo17J/g0z6+TEXXeOf0mAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d87036912844daaaa5a1eab770b68f0c45779e1bbc4f92e5ecf3acf554461af","last_reissued_at":"2026-05-17T23:48:44.451362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:44.451362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.06029","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-17T23:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aocxHhSIOq/7pSbr2yWrd6vHhsawiGyqrMQxvdu7rwEyaU71+/e8+ZB68ve7uJKDWNmxLqTTmAFcGATvKyE6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:04.226450Z"},"content_sha256":"2929ccaeaab77a5fe7f358be82868947c1c5dd3d514ce2f424db65f148c038d9","schema_version":"1.0","event_id":"sha256:2929ccaeaab77a5fe7f358be82868947c1c5dd3d514ce2f424db65f148c038d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DWDQG2ISQRG2VKS2D2VXOC3I6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Caching Designs for Perfect, Imperfect and Unknown File Popularity Distributions in Large-Scale Multi-Tier Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chencheng Ye, Rui Wang, Yang Yang, Ying Cui","submitted_at":"2019-04-12T04:40:06Z","abstract_excerpt":"Most existing caching solutions for wireless networks rest on an unrealistic assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal caching designs for perfect, imperfect and unknown file popularity distributions in large-scale multi-tier wireless networks. First, in the case of perfect file popularity distribution, we formulate the optimization problem to maximize the successful transmission probability (STP), which is a nonconvex problem. We develop an efficient parallel iterative algorithm to obtain a stationary point using parallel successiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06029","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-17T23:48:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BFujeRfJOCzjHSxFnAQjUSp8DQtirSx9DAO5s6JeT1oGxjtZvn4mkAYyyBThxCrCNW0Xwc9hzgfC/ZThyHEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:19:04.226806Z"},"content_sha256":"78e517136507be2347323e6a1504f79681276dbdf728d607d807966d4db188b0","schema_version":"1.0","event_id":"sha256:78e517136507be2347323e6a1504f79681276dbdf728d607d807966d4db188b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/bundle.json","state_url":"https://pith.science/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/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-01T07:19:04Z","links":{"resolver":"https://pith.science/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D","bundle":"https://pith.science/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/bundle.json","state":"https://pith.science/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DWDQG2ISQRG2VKS2D2VXOC3I6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DWDQG2ISQRG2VKS2D2VXOC3I6D","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":"19afdaaffc7ffa17fd180ba0120a78f819bca6a3af2f472c67fd9c5d19466da0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-12T04:40:06Z","title_canon_sha256":"2e779a62eb02785acd53c7dae56ae71438c13f4e8fc23947d438810f31cd8d48"},"schema_version":"1.0","source":{"id":"1904.06029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.06029","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"arxiv_version","alias_value":"1904.06029v1","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.06029","created_at":"2026-05-17T23:48:44Z"},{"alias_kind":"pith_short_12","alias_value":"DWDQG2ISQRG2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"DWDQG2ISQRG2VKS2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"DWDQG2IS","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:78e517136507be2347323e6a1504f79681276dbdf728d607d807966d4db188b0","target":"graph","created_at":"2026-05-17T23:48:44Z","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":"Most existing caching solutions for wireless networks rest on an unrealistic assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal caching designs for perfect, imperfect and unknown file popularity distributions in large-scale multi-tier wireless networks. First, in the case of perfect file popularity distribution, we formulate the optimization problem to maximize the successful transmission probability (STP), which is a nonconvex problem. We develop an efficient parallel iterative algorithm to obtain a stationary point using parallel successiv","authors_text":"Chencheng Ye, Rui Wang, Yang Yang, Ying Cui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-12T04:40:06Z","title":"Optimal Caching Designs for Perfect, Imperfect and Unknown File Popularity Distributions in Large-Scale Multi-Tier Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.06029","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:2929ccaeaab77a5fe7f358be82868947c1c5dd3d514ce2f424db65f148c038d9","target":"record","created_at":"2026-05-17T23:48:44Z","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":"19afdaaffc7ffa17fd180ba0120a78f819bca6a3af2f472c67fd9c5d19466da0","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-12T04:40:06Z","title_canon_sha256":"2e779a62eb02785acd53c7dae56ae71438c13f4e8fc23947d438810f31cd8d48"},"schema_version":"1.0","source":{"id":"1904.06029","kind":"arxiv","version":1}},"canonical_sha256":"1d87036912844daaaa5a1eab770b68f0c45779e1bbc4f92e5ecf3acf554461af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d87036912844daaaa5a1eab770b68f0c45779e1bbc4f92e5ecf3acf554461af","first_computed_at":"2026-05-17T23:48:44.451362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:44.451362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKos6xWjMIoIizCUDwpGYC99dtMthcZCBRHH/GFLPW9Fwo8jyxu8OHJCowInYV4CCo17J/g0z6+TEXXeOf0mAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:44.451865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.06029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2929ccaeaab77a5fe7f358be82868947c1c5dd3d514ce2f424db65f148c038d9","sha256:78e517136507be2347323e6a1504f79681276dbdf728d607d807966d4db188b0"],"state_sha256":"a0b5ff53b7f9214ca1409ca0c7194a3c2d8ac3bb69f27b8fe638a1f7cfae18e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+unvLhGK0ibJxWAzA7xbM4dLJP8nFy/Cqvs+JEZxgxHCnafylev5kP69IxBWTklZpLzEdwODAF7Qfh3+481Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:19:04.230287Z","bundle_sha256":"79967a701045be1504a3ad853b7eb4cb60e0f6014de356499e52ec142deeb2e7"}}