{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CYUKFA3GPEYWE5UQKZRCDT5FU7","short_pith_number":"pith:CYUKFA3G","schema_version":"1.0","canonical_sha256":"1628a283667931627690566221cfa5a7e1e0b85f27fc0893f39888be2fe706c9","source":{"kind":"arxiv","id":"1806.07333","version":1},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.07333","created_at":"2026-05-18T00:12:51.315245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07333v1","created_at":"2026-05-18T00:12:51.315245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07333","created_at":"2026-05-18T00:12:51.315245+00:00"},{"alias_kind":"pith_short_12","alias_value":"CYUKFA3GPEYW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CYUKFA3GPEYWE5UQ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CYUKFA3G","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09970","citing_title":"Centralized Caching and Delivery of Correlated Contents over Gaussian Broadcast Channels","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7","json":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7.json","graph_json":"https://pith.science/api/pith-number/CYUKFA3GPEYWE5UQKZRCDT5FU7/graph.json","events_json":"https://pith.science/api/pith-number/CYUKFA3GPEYWE5UQKZRCDT5FU7/events.json","paper":"https://pith.science/paper/CYUKFA3G"},"agent_actions":{"view_html":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7","download_json":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7.json","view_paper":"https://pith.science/paper/CYUKFA3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07333&json=true","fetch_graph":"https://pith.science/api/pith-number/CYUKFA3GPEYWE5UQKZRCDT5FU7/graph.json","fetch_events":"https://pith.science/api/pith-number/CYUKFA3GPEYWE5UQKZRCDT5FU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/action/storage_attestation","attest_author":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/action/author_attestation","sign_citation":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/action/citation_signature","submit_replication":"https://pith.science/pith/CYUKFA3GPEYWE5UQKZRCDT5FU7/action/replication_record"}},"created_at":"2026-05-18T00:12:51.315245+00:00","updated_at":"2026-05-18T00:12:51.315245+00:00"}