{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZMXEVOX3WZ3MYVGVBRUIWBSGIV","short_pith_number":"pith:ZMXEVOX3","schema_version":"1.0","canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","source":{"kind":"arxiv","id":"1712.01464","version":1},"attestation_state":"computed","paper":{"title":"Broadcast Caching Networks with Two Receivers and Multiple 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":"2017-12-05T03:32:17Z","abstract_excerpt":"The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and studies its fundamental limits for the worst-case demand. A class of achievable schemes based on a two-step source coding approach is proposed. Library files are first compressed using Gray-Wyner source coding, and then cached and delivered using a combination of correlation-unaware cache-aided coded multicast schemes. The second step is interesting in its ow"},"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":"1712.01464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T03:32:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"36197ce20f6bc5ffe7adfb30461dcae9c1d89407f3d7268e66d60d788cadb1f4","abstract_canon_sha256":"1a8c6cfc9ab1406e0d430a31a2352a2cc640f90fe851098043a006115c80b155"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:50.695566Z","signature_b64":"5udH/hzEaJT6Vzq99/4n8bSZ+x92tYcK72qncc63rfhb6N+m27tMHRmEKJ+rvAVxX9mwghBFeNlhmMk+utxDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","last_reissued_at":"2026-05-18T00:28:50.694919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:50.694919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Broadcast Caching Networks with Two Receivers and Multiple 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":"2017-12-05T03:32:17Z","abstract_excerpt":"The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and studies its fundamental limits for the worst-case demand. A class of achievable schemes based on a two-step source coding approach is proposed. Library files are first compressed using Gray-Wyner source coding, and then cached and delivered using a combination of correlation-unaware cache-aided coded multicast schemes. The second step is interesting in its ow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01464","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":"1712.01464","created_at":"2026-05-18T00:28:50.695037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01464v1","created_at":"2026-05-18T00:28:50.695037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01464","created_at":"2026-05-18T00:28:50.695037+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMXEVOX3WZ3M","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMXEVOX3WZ3MYVGV","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMXEVOX3","created_at":"2026-05-18T12:31:59.375834+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/ZMXEVOX3WZ3MYVGVBRUIWBSGIV","json":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV.json","graph_json":"https://pith.science/api/pith-number/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/graph.json","events_json":"https://pith.science/api/pith-number/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/events.json","paper":"https://pith.science/paper/ZMXEVOX3"},"agent_actions":{"view_html":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV","download_json":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV.json","view_paper":"https://pith.science/paper/ZMXEVOX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01464&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/action/storage_attestation","attest_author":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/action/author_attestation","sign_citation":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/action/citation_signature","submit_replication":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/action/replication_record"}},"created_at":"2026-05-18T00:28:50.695037+00:00","updated_at":"2026-05-18T00:28:50.695037+00:00"}