{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CYUKFA3GPEYWE5UQKZRCDT5FU7","short_pith_number":"pith:CYUKFA3G","canonical_record":{"source":{"id":"1806.07333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-19T16:30:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"780d9c9762faf25f21d919b2fb18ed394a041540f84ccb05393fb3a3203b6185","abstract_canon_sha256":"8dbe91ff663f35f5bfb954234a5ffaad4c48853fa767c5497d4e5c368654f64b"},"schema_version":"1.0"},"canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","source":{"kind":"arxiv","id":"1806.07333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07333","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07333v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07333","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"CYUKFA3GPEYW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYUKFA3GPEYWE5UQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYUKFA3G","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CYUKFA3GPEYWE5UQKZRCDT5FU7","target":"record","payload":{"canonical_record":{"source":{"id":"1806.07333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-19T16:30:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"780d9c9762faf25f21d919b2fb18ed394a041540f84ccb05393fb3a3203b6185","abstract_canon_sha256":"8dbe91ff663f35f5bfb954234a5ffaad4c48853fa767c5497d4e5c368654f64b"},"schema_version":"1.0"},"canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:51.315661Z","signature_b64":"f5mx47dPI2inR7/h6sA1VoNjH7xQjENkJKTucQjm7svc39WJVRszRyBVdkOfMu+BWALvauYRRHaUdsgn7MOOAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","last_reissued_at":"2026-05-18T00:12:51.315165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:51.315165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.07333","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha1/luBNGlGaqZFtXYezruxa1X2vJOP07Y+CeQ45a+0haqKCzpSMk8zJpb4czfaAfndgcy5eYielaoO9sjHeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:06:46.216673Z"},"content_sha256":"efe6387f253920f89df5233497d29ca0ce040a020e8b08af77ed9c2a399b0696","schema_version":"1.0","event_id":"sha256:efe6387f253920f89df5233497d29ca0ce040a020e8b08af77ed9c2a399b0696"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CYUKFA3GPEYWE5UQKZRCDT5FU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia M. Tulino, Elza Erkip, Jaime Llorca, Parisa Hassanzadeh","submitted_at":"2018-06-19T16:30:46Z","abstract_excerpt":"This paper studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. A class of achievable correlation-aware schemes based on a two-step source coding approach is proposed. Library files are first compressed, and then cached and delivered using a combination of correlation-unaware multiple-request cache-aided coded multicast schemes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07333","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:12:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9d0AjyJC7FRtYhrfe/Ueo1iMp+jJUmpM1jIBN0z+t4oJnI8VtfHE1sXwHy2Pk8XB9ScrkQvkITyBzHXyMokyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:06:46.217010Z"},"content_sha256":"e457a447f8dc1650b14eac2cac5f02215a7e43508585cfe25f2f7743174c0b29","schema_version":"1.0","event_id":"sha256:e457a447f8dc1650b14eac2cac5f02215a7e43508585cfe25f2f7743174c0b29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/bundle.json","state_url":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/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-20T10:06:46Z","links":{"resolver":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7","bundle":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/bundle.json","state":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CYUKFA3GPEYWE5UQKZRCDT5FU7","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":"8dbe91ff663f35f5bfb954234a5ffaad4c48853fa767c5497d4e5c368654f64b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-19T16:30:46Z","title_canon_sha256":"780d9c9762faf25f21d919b2fb18ed394a041540f84ccb05393fb3a3203b6185"},"schema_version":"1.0","source":{"id":"1806.07333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07333","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07333v1","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07333","created_at":"2026-05-18T00:12:51Z"},{"alias_kind":"pith_short_12","alias_value":"CYUKFA3GPEYW","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CYUKFA3GPEYWE5UQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CYUKFA3G","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:e457a447f8dc1650b14eac2cac5f02215a7e43508585cfe25f2f7743174c0b29","target":"graph","created_at":"2026-05-18T00:12:51Z","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 studies the fundamental limits of content delivery in a cache-aided broadcast network for correlated content generated by a discrete memoryless source with arbitrary joint distribution. Each receiver is equipped with a cache of equal capacity, and the requested files are delivered over a shared error-free broadcast link. A class of achievable correlation-aware schemes based on a two-step source coding approach is proposed. Library files are first compressed, and then cached and delivered using a combination of correlation-unaware multiple-request cache-aided coded multicast schemes.","authors_text":"Antonia M. Tulino, Elza Erkip, Jaime Llorca, Parisa Hassanzadeh","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-19T16:30:46Z","title":"Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07333","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:efe6387f253920f89df5233497d29ca0ce040a020e8b08af77ed9c2a399b0696","target":"record","created_at":"2026-05-18T00:12:51Z","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":"8dbe91ff663f35f5bfb954234a5ffaad4c48853fa767c5497d4e5c368654f64b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-19T16:30:46Z","title_canon_sha256":"780d9c9762faf25f21d919b2fb18ed394a041540f84ccb05393fb3a3203b6185"},"schema_version":"1.0","source":{"id":"1806.07333","kind":"arxiv","version":1}},"canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","first_computed_at":"2026-05-18T00:12:51.315165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:51.315165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f5mx47dPI2inR7/h6sA1VoNjH7xQjENkJKTucQjm7svc39WJVRszRyBVdkOfMu+BWALvauYRRHaUdsgn7MOOAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:51.315661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efe6387f253920f89df5233497d29ca0ce040a020e8b08af77ed9c2a399b0696","sha256:e457a447f8dc1650b14eac2cac5f02215a7e43508585cfe25f2f7743174c0b29"],"state_sha256":"45d5d1a1c00689901397b4e3f2b8626ffb52bc177fa4b73b29af0223e498171c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKDYji/4BQBo1a4ho8a/tgelCrSkoySivyn61fPdGVL798KAqepCYwk8xWgGQE1I4A/XL/pOmg/90pTGVF6vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:06:46.218899Z","bundle_sha256":"40d2192e7264c45b6091e206637859f8a536af6b97880f30a3aaa215cfbb0bf9"}}