{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UK352SH3GJU5AVSBUNAQPJASGW","short_pith_number":"pith:UK352SH3","canonical_record":{"source":{"id":"1811.04067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-09T18:53:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae17ca6bb65d3c38eb2c35af309b5890abd97e90b1ea070d5eb4303cf8968df7","abstract_canon_sha256":"500dcdef42deeaea14d8035f5d0ed53e7064bd64383f7049bfa2129ba3709cd5"},"schema_version":"1.0"},"canonical_sha256":"a2b7dd48fb3269d05641a34107a41235bda983a67684e36855ee9e03d23ed6b3","source":{"kind":"arxiv","id":"1811.04067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04067","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04067v1","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04067","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"UK352SH3GJU5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UK352SH3GJU5AVSB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UK352SH3","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UK352SH3GJU5AVSBUNAQPJASGW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-09T18:53:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ae17ca6bb65d3c38eb2c35af309b5890abd97e90b1ea070d5eb4303cf8968df7","abstract_canon_sha256":"500dcdef42deeaea14d8035f5d0ed53e7064bd64383f7049bfa2129ba3709cd5"},"schema_version":"1.0"},"canonical_sha256":"a2b7dd48fb3269d05641a34107a41235bda983a67684e36855ee9e03d23ed6b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:11.153569Z","signature_b64":"blaIKSdR0mDDVMKL2kOf9/rYngbEztDBTYF8ejl3fdqZOcmHcEMQh8kyFaW4IY5A7Xopvb4Z6EEkP++u8oDxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b7dd48fb3269d05641a34107a41235bda983a67684e36855ee9e03d23ed6b3","last_reissued_at":"2026-05-18T00:01:11.153120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:11.153120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04067","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:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T4d7/QhZ6oL0vNqWneHJJosAVmXFTcnhM3MptQtPRpF3XxtwobF89OB154vmERWK/xTVC/WWYuVCUFVyPnJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:41:17.332886Z"},"content_sha256":"997d15400d567ac3aa5a1af374436b08e0153fa022a0b8939d101b0038565b2f","schema_version":"1.0","event_id":"sha256:997d15400d567ac3aa5a1af374436b08e0153fa022a0b8939d101b0038565b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UK352SH3GJU5AVSBUNAQPJASGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Benefits of Coded Placement for Networks with Heterogeneous Cache Sizes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abdelrahman M. Ibrahim, Ahmed A. Zewail, Aylin Yener","submitted_at":"2018-11-09T18:53:09Z","abstract_excerpt":"In this work, we study coded placement in caching systems where the users have unequal cache sizes and demonstrate its performance advantage. In particular, we propose a caching scheme with coded placement for three-user systems that outperforms the best caching scheme with uncoded placement. In our proposed scheme, users cache both uncoded and coded pieces of the files, and the coded pieces at the users with large memories are decoded using the unicast/multicast signals intended to serve users with smaller memories. Furthermore, we extend the proposed scheme to larger systems and show the red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04067","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:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J1sIJ1tAqgQ/Hjtt3siqiStMlG2ifES71/0amuK5yL0zrLjOEg+ae3+88Io/Cq+pHm92wXcHTrthu8Gpbn7hAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:41:17.333515Z"},"content_sha256":"4bcb4a84e6ee01f86fb624d5535a6c063c77d67261edfa3bd9beb7ec2b9163d4","schema_version":"1.0","event_id":"sha256:4bcb4a84e6ee01f86fb624d5535a6c063c77d67261edfa3bd9beb7ec2b9163d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UK352SH3GJU5AVSBUNAQPJASGW/bundle.json","state_url":"https://pith.science/pith/UK352SH3GJU5AVSBUNAQPJASGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UK352SH3GJU5AVSBUNAQPJASGW/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-07T16:41:17Z","links":{"resolver":"https://pith.science/pith/UK352SH3GJU5AVSBUNAQPJASGW","bundle":"https://pith.science/pith/UK352SH3GJU5AVSBUNAQPJASGW/bundle.json","state":"https://pith.science/pith/UK352SH3GJU5AVSBUNAQPJASGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UK352SH3GJU5AVSBUNAQPJASGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UK352SH3GJU5AVSBUNAQPJASGW","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":"500dcdef42deeaea14d8035f5d0ed53e7064bd64383f7049bfa2129ba3709cd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-09T18:53:09Z","title_canon_sha256":"ae17ca6bb65d3c38eb2c35af309b5890abd97e90b1ea070d5eb4303cf8968df7"},"schema_version":"1.0","source":{"id":"1811.04067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04067","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04067v1","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04067","created_at":"2026-05-18T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"UK352SH3GJU5","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UK352SH3GJU5AVSB","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UK352SH3","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:4bcb4a84e6ee01f86fb624d5535a6c063c77d67261edfa3bd9beb7ec2b9163d4","target":"graph","created_at":"2026-05-18T00:01:11Z","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 work, we study coded placement in caching systems where the users have unequal cache sizes and demonstrate its performance advantage. In particular, we propose a caching scheme with coded placement for three-user systems that outperforms the best caching scheme with uncoded placement. In our proposed scheme, users cache both uncoded and coded pieces of the files, and the coded pieces at the users with large memories are decoded using the unicast/multicast signals intended to serve users with smaller memories. Furthermore, we extend the proposed scheme to larger systems and show the red","authors_text":"Abdelrahman M. Ibrahim, Ahmed A. Zewail, Aylin Yener","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-09T18:53:09Z","title":"Benefits of Coded Placement for Networks with Heterogeneous Cache Sizes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04067","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:997d15400d567ac3aa5a1af374436b08e0153fa022a0b8939d101b0038565b2f","target":"record","created_at":"2026-05-18T00:01:11Z","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":"500dcdef42deeaea14d8035f5d0ed53e7064bd64383f7049bfa2129ba3709cd5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-09T18:53:09Z","title_canon_sha256":"ae17ca6bb65d3c38eb2c35af309b5890abd97e90b1ea070d5eb4303cf8968df7"},"schema_version":"1.0","source":{"id":"1811.04067","kind":"arxiv","version":1}},"canonical_sha256":"a2b7dd48fb3269d05641a34107a41235bda983a67684e36855ee9e03d23ed6b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b7dd48fb3269d05641a34107a41235bda983a67684e36855ee9e03d23ed6b3","first_computed_at":"2026-05-18T00:01:11.153120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:11.153120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"blaIKSdR0mDDVMKL2kOf9/rYngbEztDBTYF8ejl3fdqZOcmHcEMQh8kyFaW4IY5A7Xopvb4Z6EEkP++u8oDxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:11.153569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:997d15400d567ac3aa5a1af374436b08e0153fa022a0b8939d101b0038565b2f","sha256:4bcb4a84e6ee01f86fb624d5535a6c063c77d67261edfa3bd9beb7ec2b9163d4"],"state_sha256":"490d6d514ef877d788f75e9c476b367449bfb2e7be94aeb2fffadf407c5826c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0RCfbAHnB2k6dIpyVO+DcUWDQ6VFLu+1vKwhQARLdhUqpM8Yr1ss3rzgUbR7qkxhwPzL/SJXPzyPhgfGqcrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:41:17.337445Z","bundle_sha256":"5b4d9bf0f770fce2d98eb9ed16f2e4bc09dc617a74d66a32cd1d30f2fc0b1864"}}