{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IJ5A2UUQYTCA6K4CPSI45NVD6C","short_pith_number":"pith:IJ5A2UUQ","canonical_record":{"source":{"id":"1708.04322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-14T20:56:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"417d8c2b60e0a3acb47670f0398219d6ad566e6bc0489c2f7bb7d45fe89be99b","abstract_canon_sha256":"1845c1f0e6006b71b0236afe7d12a1065e38398ebf9051a1d64bd38636af0e93"},"schema_version":"1.0"},"canonical_sha256":"427a0d5290c4c40f2b827c91ceb6a3f098188a6b7bf94094fa00f213012608f5","source":{"kind":"arxiv","id":"1708.04322","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04322","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04322v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04322","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"IJ5A2UUQYTCA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJ5A2UUQYTCA6K4C","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJ5A2UUQ","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IJ5A2UUQYTCA6K4CPSI45NVD6C","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-14T20:56:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"417d8c2b60e0a3acb47670f0398219d6ad566e6bc0489c2f7bb7d45fe89be99b","abstract_canon_sha256":"1845c1f0e6006b71b0236afe7d12a1065e38398ebf9051a1d64bd38636af0e93"},"schema_version":"1.0"},"canonical_sha256":"427a0d5290c4c40f2b827c91ceb6a3f098188a6b7bf94094fa00f213012608f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.671251Z","signature_b64":"ZbeAWR/Fj0pzXJF+4mLwuHMfGjHgbPCUvJZSVmUhnpsxyejmKwcVpSCc1cYw0c+LRjN7pzzvbiZgmCTP5hKyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"427a0d5290c4c40f2b827c91ceb6a3f098188a6b7bf94094fa00f213012608f5","last_reissued_at":"2026-05-18T00:37:59.670644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.670644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04322","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-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJof4zb6XsPXwe9SbBTBJR1hkHheBiLyiWjGVnGDicezF33qEEMltpVX1QWcZ3T5UyLWmk0r5rZ0zqrwqKIiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:43:30.613643Z"},"content_sha256":"81d36729f498d06a1447acf9dae0fb4e87946501c2aae89a71da25052067f167","schema_version":"1.0","event_id":"sha256:81d36729f498d06a1447acf9dae0fb4e87946501c2aae89a71da25052067f167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IJ5A2UUQYTCA6K4CPSI45NVD6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of Heterogeneous Coded Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Michael Daniel, Wei Yu","submitted_at":"2017-08-14T20:56:04Z","abstract_excerpt":"This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-trivial family of possible caching schemes. The optimization framework is then used to develop a coded caching scheme capable of handling simultaneous non-uniform file length, non-uniform file popularity,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04322","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-18T00:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVbzxtv5vcR81FZID4t2jRJhV7IQ0HlAMG8Q2NETks2iQ8cdWvYCQBgwhTXJCuCbk0CTXKwq9QrRa+pqXKWQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:43:30.614294Z"},"content_sha256":"a75fd160f3b305e0d79e3c95ae3eaeac44dc19ac8ac53d9350199981a95da876","schema_version":"1.0","event_id":"sha256:a75fd160f3b305e0d79e3c95ae3eaeac44dc19ac8ac53d9350199981a95da876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/bundle.json","state_url":"https://pith.science/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/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-05-30T11:43:30Z","links":{"resolver":"https://pith.science/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C","bundle":"https://pith.science/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/bundle.json","state":"https://pith.science/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ5A2UUQYTCA6K4CPSI45NVD6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IJ5A2UUQYTCA6K4CPSI45NVD6C","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":"1845c1f0e6006b71b0236afe7d12a1065e38398ebf9051a1d64bd38636af0e93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-14T20:56:04Z","title_canon_sha256":"417d8c2b60e0a3acb47670f0398219d6ad566e6bc0489c2f7bb7d45fe89be99b"},"schema_version":"1.0","source":{"id":"1708.04322","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04322","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04322v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04322","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"IJ5A2UUQYTCA","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IJ5A2UUQYTCA6K4C","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IJ5A2UUQ","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:a75fd160f3b305e0d79e3c95ae3eaeac44dc19ac8ac53d9350199981a95da876","target":"graph","created_at":"2026-05-18T00:37:59Z","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":"This paper aims to provide an optimization framework for coded caching that accounts for various heterogeneous aspects of practical systems. An optimization theoretic perspective on the seminal work on the fundamental limits of caching by Maddah Ali and Niesen is first developed, whereas it is proved that the coded caching scheme presented in that work is the optimal scheme among a large, non-trivial family of possible caching schemes. The optimization framework is then used to develop a coded caching scheme capable of handling simultaneous non-uniform file length, non-uniform file popularity,","authors_text":"Alexander Michael Daniel, Wei Yu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-14T20:56:04Z","title":"Optimization of Heterogeneous Coded Caching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04322","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:81d36729f498d06a1447acf9dae0fb4e87946501c2aae89a71da25052067f167","target":"record","created_at":"2026-05-18T00:37:59Z","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":"1845c1f0e6006b71b0236afe7d12a1065e38398ebf9051a1d64bd38636af0e93","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-14T20:56:04Z","title_canon_sha256":"417d8c2b60e0a3acb47670f0398219d6ad566e6bc0489c2f7bb7d45fe89be99b"},"schema_version":"1.0","source":{"id":"1708.04322","kind":"arxiv","version":1}},"canonical_sha256":"427a0d5290c4c40f2b827c91ceb6a3f098188a6b7bf94094fa00f213012608f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"427a0d5290c4c40f2b827c91ceb6a3f098188a6b7bf94094fa00f213012608f5","first_computed_at":"2026-05-18T00:37:59.670644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.670644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZbeAWR/Fj0pzXJF+4mLwuHMfGjHgbPCUvJZSVmUhnpsxyejmKwcVpSCc1cYw0c+LRjN7pzzvbiZgmCTP5hKyDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.671251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04322","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81d36729f498d06a1447acf9dae0fb4e87946501c2aae89a71da25052067f167","sha256:a75fd160f3b305e0d79e3c95ae3eaeac44dc19ac8ac53d9350199981a95da876"],"state_sha256":"f9cb65095877c3224db1f052dad6775434f5c5c4b2428a7ccf3054807d2d9989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nH+x44nltVSL0cZSJRvcj9kiaC9KYhTiDgtHTBNaHtb5Ay7xXJmRWdgDiJS2WzL5RE+rZXtXQmviHNjK3DgoDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:43:30.618032Z","bundle_sha256":"ba542734e122ad75d7b1a943580b7211f7f7ec681f049cffe54d270254c07890"}}