{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V5NGA4PZFTXAN67YOO7XFBL2X2","short_pith_number":"pith:V5NGA4PZ","schema_version":"1.0","canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","source":{"kind":"arxiv","id":"1705.04616","version":1},"attestation_state":"computed","paper":{"title":"Rate-Memory Trade-off for the Two-User Broadcast Caching Network with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Tulino, Elza Erkip, Jaime Llorca, Parisa Hassanzadeh","submitted_at":"2017-05-12T15:09:42Z","abstract_excerpt":"This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component 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. First, a lower bound on the optimal peak rate-memory trade-off is provided. Then, in order to leverage the correlation among the library files to alleviate the load over the shared link, a two-step correlation-aware cache-aided coded multicast (CACM) scheme is proposed. Th"},"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":"1705.04616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T15:09:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"78de079048ffbf7055d24d0b7da491f6b9dc16d5bfb3fae0ba753b9fc04e95f2","abstract_canon_sha256":"9af29bfca2a23d28dcd3ba282b954fd11bde466199b2fa2ca11f64b882b3dbe8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.654230Z","signature_b64":"yk2gMZSlFAkhyCF5GXMAhR9jYbRaWntcpoa5RNWpotv73g4SAgwW0JS9miXzO4OjppnRoGdz/NtFgdEse2N5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","last_reissued_at":"2026-05-18T00:44:37.653847Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.653847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rate-Memory Trade-off for the Two-User Broadcast Caching Network with Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Tulino, Elza Erkip, Jaime Llorca, Parisa Hassanzadeh","submitted_at":"2017-05-12T15:09:42Z","abstract_excerpt":"This paper studies the fundamental limits of caching in a network with two receivers and two files generated by a two-component 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. First, a lower bound on the optimal peak rate-memory trade-off is provided. Then, in order to leverage the correlation among the library files to alleviate the load over the shared link, a two-step correlation-aware cache-aided coded multicast (CACM) scheme is proposed. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04616","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":"1705.04616","created_at":"2026-05-18T00:44:37.653904+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.04616v1","created_at":"2026-05-18T00:44:37.653904+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04616","created_at":"2026-05-18T00:44:37.653904+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5NGA4PZFTXA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5NGA4PZFTXAN67Y","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5NGA4PZ","created_at":"2026-05-18T12:31:49.984773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2","json":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2.json","graph_json":"https://pith.science/api/pith-number/V5NGA4PZFTXAN67YOO7XFBL2X2/graph.json","events_json":"https://pith.science/api/pith-number/V5NGA4PZFTXAN67YOO7XFBL2X2/events.json","paper":"https://pith.science/paper/V5NGA4PZ"},"agent_actions":{"view_html":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2","download_json":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2.json","view_paper":"https://pith.science/paper/V5NGA4PZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.04616&json=true","fetch_graph":"https://pith.science/api/pith-number/V5NGA4PZFTXAN67YOO7XFBL2X2/graph.json","fetch_events":"https://pith.science/api/pith-number/V5NGA4PZFTXAN67YOO7XFBL2X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/action/storage_attestation","attest_author":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/action/author_attestation","sign_citation":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/action/citation_signature","submit_replication":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/action/replication_record"}},"created_at":"2026-05-18T00:44:37.653904+00:00","updated_at":"2026-05-18T00:44:37.653904+00:00"}