{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:43I6TKRTLHWFFX7WTEGYAZHS5E","short_pith_number":"pith:43I6TKRT","canonical_record":{"source":{"id":"1707.07146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-22T11:59:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8372c43ce28b61c13fff33556b26c149aeb2f79ae31f5b2d6a9d82acbaf943e3","abstract_canon_sha256":"65c76785733f4f80f1d5d52619d9e5ec85718dc43304a891194e7327474af5bc"},"schema_version":"1.0"},"canonical_sha256":"e6d1e9aa3359ec52dff6990d8064f2e9109f817a1f26586d56c7e3f005c9a536","source":{"kind":"arxiv","id":"1707.07146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07146","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07146v1","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07146","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"43I6TKRTLHWF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43I6TKRTLHWFFX7W","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43I6TKRT","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:43I6TKRTLHWFFX7WTEGYAZHS5E","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-22T11:59:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8372c43ce28b61c13fff33556b26c149aeb2f79ae31f5b2d6a9d82acbaf943e3","abstract_canon_sha256":"65c76785733f4f80f1d5d52619d9e5ec85718dc43304a891194e7327474af5bc"},"schema_version":"1.0"},"canonical_sha256":"e6d1e9aa3359ec52dff6990d8064f2e9109f817a1f26586d56c7e3f005c9a536","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:45.244353Z","signature_b64":"hNzYDVwhyiM+uvFmpsxNr9cxECZZJOqhW8617uKpJIiBKIfjcVXKKWi9EMjzwhuaNOkZN08U97ofl0fwQWW/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6d1e9aa3359ec52dff6990d8064f2e9109f817a1f26586d56c7e3f005c9a536","last_reissued_at":"2026-05-18T00:39:45.243710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:45.243710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07146","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:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"momfRzV9uZc77KshteqeFeN4MTlRE8cSJPpHYxWYrdOhbmChtMuq5tiQn70QjLHTKKors4HuhUDcjZMb5ZJuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:43.721926Z"},"content_sha256":"b01f045739e6e4ad73cb528cc1705aa719733f3cb69c8acd0d575495790f3ca8","schema_version":"1.0","event_id":"sha256:b01f045739e6e4ad73cb528cc1705aa719733f3cb69c8acd0d575495790f3ca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:43I6TKRTLHWFFX7WTEGYAZHS5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Properties of Uncoded Placement Optimization for Coded Delivery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","submitted_at":"2017-07-22T11:59:15Z","abstract_excerpt":"A centralized coded caching scheme has been proposed by Maddah-Ali and Niesen to reduce the worst-case load of a network consisting of a server with access to N files and connected through a shared link to K users, each equipped with a cache of size M. However, this centralized coded caching scheme is not able to take advantage of a non-uniform, possibly very skewed, file popularity distribution. In this work, we consider the same network setting but aim to reduce the average load under an arbitrary (known) file popularity distribution. First, we consider a class of centralized coded caching s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07146","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:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQHadwU3B4o+wMJ+j8wMUaQKzdQfJ8a+sU2MYjRs7ERnKXY7O0Pdb+Tht9Z2+uWsbzDyVWlggzwU6sSyRK5ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T01:14:43.722583Z"},"content_sha256":"041ef5dfb71389db6e30faa59b6d78af5fc375521eca81b3e9a4381786271e0f","schema_version":"1.0","event_id":"sha256:041ef5dfb71389db6e30faa59b6d78af5fc375521eca81b3e9a4381786271e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/bundle.json","state_url":"https://pith.science/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/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-26T01:14:43Z","links":{"resolver":"https://pith.science/pith/43I6TKRTLHWFFX7WTEGYAZHS5E","bundle":"https://pith.science/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/bundle.json","state":"https://pith.science/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43I6TKRTLHWFFX7WTEGYAZHS5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:43I6TKRTLHWFFX7WTEGYAZHS5E","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":"65c76785733f4f80f1d5d52619d9e5ec85718dc43304a891194e7327474af5bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-22T11:59:15Z","title_canon_sha256":"8372c43ce28b61c13fff33556b26c149aeb2f79ae31f5b2d6a9d82acbaf943e3"},"schema_version":"1.0","source":{"id":"1707.07146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07146","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07146v1","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07146","created_at":"2026-05-18T00:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"43I6TKRTLHWF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"43I6TKRTLHWFFX7W","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"43I6TKRT","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:041ef5dfb71389db6e30faa59b6d78af5fc375521eca81b3e9a4381786271e0f","target":"graph","created_at":"2026-05-18T00:39:45Z","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":"A centralized coded caching scheme has been proposed by Maddah-Ali and Niesen to reduce the worst-case load of a network consisting of a server with access to N files and connected through a shared link to K users, each equipped with a cache of size M. However, this centralized coded caching scheme is not able to take advantage of a non-uniform, possibly very skewed, file popularity distribution. In this work, we consider the same network setting but aim to reduce the average load under an arbitrary (known) file popularity distribution. First, we consider a class of centralized coded caching s","authors_text":"Giuseppe Caire, Hui Liu, Sian Jin, Ying Cui","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-22T11:59:15Z","title":"Structural Properties of Uncoded Placement Optimization for Coded Delivery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07146","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:b01f045739e6e4ad73cb528cc1705aa719733f3cb69c8acd0d575495790f3ca8","target":"record","created_at":"2026-05-18T00:39:45Z","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":"65c76785733f4f80f1d5d52619d9e5ec85718dc43304a891194e7327474af5bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-22T11:59:15Z","title_canon_sha256":"8372c43ce28b61c13fff33556b26c149aeb2f79ae31f5b2d6a9d82acbaf943e3"},"schema_version":"1.0","source":{"id":"1707.07146","kind":"arxiv","version":1}},"canonical_sha256":"e6d1e9aa3359ec52dff6990d8064f2e9109f817a1f26586d56c7e3f005c9a536","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6d1e9aa3359ec52dff6990d8064f2e9109f817a1f26586d56c7e3f005c9a536","first_computed_at":"2026-05-18T00:39:45.243710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:45.243710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hNzYDVwhyiM+uvFmpsxNr9cxECZZJOqhW8617uKpJIiBKIfjcVXKKWi9EMjzwhuaNOkZN08U97ofl0fwQWW/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:45.244353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b01f045739e6e4ad73cb528cc1705aa719733f3cb69c8acd0d575495790f3ca8","sha256:041ef5dfb71389db6e30faa59b6d78af5fc375521eca81b3e9a4381786271e0f"],"state_sha256":"b0a4d381320cfbda4e11c7b1c94a4d435f123db98789e3c21e29323c0ee2148f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yGsBCTRidGrTnjbhIUP/FgcejgLLgDn238o1+jneOlyGBj+56pSKgIJxHAdJRXdRWrxqDpNuPYn625S/s9dAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T01:14:43.725871Z","bundle_sha256":"4762e6533b8b13844f56edb7d3f36ccbd3ee5cdd9211eef912e78c5960e62b5d"}}