{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AN6LMD2OI5JJEMTPAH2QXD5VHG","short_pith_number":"pith:AN6LMD2O","canonical_record":{"source":{"id":"1806.02197","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-06T14:10:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c592469fcb3863b2e8ec7910110cfc38438df7bbc2d81ff9f74f51f22ebfc196","abstract_canon_sha256":"202dfde3114df424173a386bc49b78e37a1399264bf210f700489fc62fd1d388"},"schema_version":"1.0"},"canonical_sha256":"037cb60f4e475292326f01f50b8fb539b0d220ea03bf2029675c143eabe764f1","source":{"kind":"arxiv","id":"1806.02197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02197","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02197v2","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02197","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"AN6LMD2OI5JJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AN6LMD2OI5JJEMTP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AN6LMD2O","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AN6LMD2OI5JJEMTPAH2QXD5VHG","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02197","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-06T14:10:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c592469fcb3863b2e8ec7910110cfc38438df7bbc2d81ff9f74f51f22ebfc196","abstract_canon_sha256":"202dfde3114df424173a386bc49b78e37a1399264bf210f700489fc62fd1d388"},"schema_version":"1.0"},"canonical_sha256":"037cb60f4e475292326f01f50b8fb539b0d220ea03bf2029675c143eabe764f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:20.760353Z","signature_b64":"ckq1y2+cM85nkJeY5hDBCBpUWd/viqh47if8U0Ag0UWg/BXDJ2NKd3i/tOQbTOnL40IDrsbJQ0TKQVoYlAPRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037cb60f4e475292326f01f50b8fb539b0d220ea03bf2029675c143eabe764f1","last_reissued_at":"2026-05-17T23:40:20.759642Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:20.759642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02197","source_version":2,"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:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DgK8vEJ7jAriG/mHfGPk30613QuRD/vh7TPqzaqY4I7uN/2CAVsvCuHNWVzn8WDKCTKCKpjdHluv7w11U2inAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:36:32.679578Z"},"content_sha256":"74e6c01bbb336a9864c5864ef48259d394a7acafe32f58ea89c9f446a80ca89f","schema_version":"1.0","event_id":"sha256:74e6c01bbb336a9864c5864ef48259d394a7acafe32f58ea89c9f446a80ca89f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AN6LMD2OI5JJEMTPAH2QXD5VHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunhua Pan, Ming Chen, Mohammad Shikh-Bahaei, Wei Xu, Yijin Pan, Yongpeng Wu, Zhaohui Yang","submitted_at":"2018-06-06T14:10:46Z","abstract_excerpt":"In this paper, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first der"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02197","kind":"arxiv","version":2},"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:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwsWE09r01wVpZF+rhAd51M2QophPNH4XXlIVUaYcouqhbY8DeIGP419JqPaDpNYxWd8BJTBaPhrbUD+yURBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:36:32.680240Z"},"content_sha256":"820c65f6255c198635d296f2f54c247d08833efbaf1d19e4b839caa255c0df13","schema_version":"1.0","event_id":"sha256:820c65f6255c198635d296f2f54c247d08833efbaf1d19e4b839caa255c0df13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/bundle.json","state_url":"https://pith.science/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/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-07T18:36:32Z","links":{"resolver":"https://pith.science/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG","bundle":"https://pith.science/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/bundle.json","state":"https://pith.science/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN6LMD2OI5JJEMTPAH2QXD5VHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AN6LMD2OI5JJEMTPAH2QXD5VHG","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":"202dfde3114df424173a386bc49b78e37a1399264bf210f700489fc62fd1d388","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-06T14:10:46Z","title_canon_sha256":"c592469fcb3863b2e8ec7910110cfc38438df7bbc2d81ff9f74f51f22ebfc196"},"schema_version":"1.0","source":{"id":"1806.02197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02197","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02197v2","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02197","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"AN6LMD2OI5JJ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AN6LMD2OI5JJEMTP","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AN6LMD2O","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:820c65f6255c198635d296f2f54c247d08833efbaf1d19e4b839caa255c0df13","target":"graph","created_at":"2026-05-17T23:40:20Z","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, we aim to minimize the average file transmission delay via bandwidth allocation and cache placement in two-tier heterogeneous networks with limited storage capacity, which consists of cache capacity and buffer capacity. For average delay minimization problem with fixed bandwidth allocation, although this problem is nonconvex, the optimal solution is obtained in closed form by comparing all locally optimal solutions calculated from solving the Karush-Kuhn-Tucker conditions. To jointly optimize bandwidth allocation and cache placement, the optimal bandwidth allocation is first der","authors_text":"Cunhua Pan, Ming Chen, Mohammad Shikh-Bahaei, Wei Xu, Yijin Pan, Yongpeng Wu, Zhaohui Yang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-06T14:10:46Z","title":"Cache Placement in Two-Tier HetNets with Limited Storage Capacity: Cache or Buffer?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02197","kind":"arxiv","version":2},"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:74e6c01bbb336a9864c5864ef48259d394a7acafe32f58ea89c9f446a80ca89f","target":"record","created_at":"2026-05-17T23:40:20Z","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":"202dfde3114df424173a386bc49b78e37a1399264bf210f700489fc62fd1d388","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2018-06-06T14:10:46Z","title_canon_sha256":"c592469fcb3863b2e8ec7910110cfc38438df7bbc2d81ff9f74f51f22ebfc196"},"schema_version":"1.0","source":{"id":"1806.02197","kind":"arxiv","version":2}},"canonical_sha256":"037cb60f4e475292326f01f50b8fb539b0d220ea03bf2029675c143eabe764f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037cb60f4e475292326f01f50b8fb539b0d220ea03bf2029675c143eabe764f1","first_computed_at":"2026-05-17T23:40:20.759642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:20.759642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ckq1y2+cM85nkJeY5hDBCBpUWd/viqh47if8U0Ag0UWg/BXDJ2NKd3i/tOQbTOnL40IDrsbJQ0TKQVoYlAPRDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:20.760353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74e6c01bbb336a9864c5864ef48259d394a7acafe32f58ea89c9f446a80ca89f","sha256:820c65f6255c198635d296f2f54c247d08833efbaf1d19e4b839caa255c0df13"],"state_sha256":"3ac350208db2070bb437761a7c5f9f2754eacd705a8143feb0092880422791db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WziGGED+z95Ezr0nwXtFMBCcOvHdIFZSI0K97gyNptDDA7vSaMtJZfS/vt3zmBehWMsUA+bpMPvyRGMRc6D4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:36:32.683867Z","bundle_sha256":"a9fb04646121ac4da7564e0c9fada9ae7fde8d1d86360170a6201eed8f9b0989"}}