{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V5NGA4PZFTXAN67YOO7XFBL2X2","short_pith_number":"pith:V5NGA4PZ","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"},"canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","source":{"kind":"arxiv","id":"1705.04616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04616","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04616v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04616","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"V5NGA4PZFTXA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5NGA4PZFTXAN67Y","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5NGA4PZ","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V5NGA4PZFTXAN67YOO7XFBL2X2","target":"record","payload":{"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"},"canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","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"},"source_kind":"arxiv","source_id":"1705.04616","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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tz9JchxJ3T76FsE2ysvkw3RsOIGM26p8NLSA0p49XIa5ep88c5l5Ir9BDHoYsc4GBt6nSreMLTxGRraUGWvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:00:59.666543Z"},"content_sha256":"59c1d76f33f878a4c0a907b76bb5f6cfc034e93fa39a2907c74b4dac44ed15fc","schema_version":"1.0","event_id":"sha256:59c1d76f33f878a4c0a907b76bb5f6cfc034e93fa39a2907c74b4dac44ed15fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V5NGA4PZFTXAN67YOO7XFBL2X2","target":"graph","payload":{"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"},"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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etfJqHmhXz1+xy9cJOxwMKyeO3K1H11+yS+390QKYpXVjdrCU1idJaJwHitH9hxPNu96VLTX820mD+myxwxZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:00:59.666889Z"},"content_sha256":"1c1ea44c306f7c4289ebc3d7f40797822b65afc399b10c45275e68a99d250336","schema_version":"1.0","event_id":"sha256:1c1ea44c306f7c4289ebc3d7f40797822b65afc399b10c45275e68a99d250336"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/bundle.json","state_url":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/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-20T09:00:59Z","links":{"resolver":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2","bundle":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/bundle.json","state":"https://pith.science/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5NGA4PZFTXAN67YOO7XFBL2X2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V5NGA4PZFTXAN67YOO7XFBL2X2","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":"9af29bfca2a23d28dcd3ba282b954fd11bde466199b2fa2ca11f64b882b3dbe8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T15:09:42Z","title_canon_sha256":"78de079048ffbf7055d24d0b7da491f6b9dc16d5bfb3fae0ba753b9fc04e95f2"},"schema_version":"1.0","source":{"id":"1705.04616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04616","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04616v1","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04616","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"V5NGA4PZFTXA","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V5NGA4PZFTXAN67Y","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V5NGA4PZ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:1c1ea44c306f7c4289ebc3d7f40797822b65afc399b10c45275e68a99d250336","target":"graph","created_at":"2026-05-18T00:44:37Z","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 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","authors_text":"Antonia 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":"2017-05-12T15:09:42Z","title":"Rate-Memory Trade-off for the Two-User Broadcast Caching Network with Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04616","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:59c1d76f33f878a4c0a907b76bb5f6cfc034e93fa39a2907c74b4dac44ed15fc","target":"record","created_at":"2026-05-18T00:44:37Z","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":"9af29bfca2a23d28dcd3ba282b954fd11bde466199b2fa2ca11f64b882b3dbe8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-12T15:09:42Z","title_canon_sha256":"78de079048ffbf7055d24d0b7da491f6b9dc16d5bfb3fae0ba753b9fc04e95f2"},"schema_version":"1.0","source":{"id":"1705.04616","kind":"arxiv","version":1}},"canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af5a6071f92cee06fbf873bf72857abe9450a348dc4c1d47a95d91d0f961a962","first_computed_at":"2026-05-18T00:44:37.653847Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.653847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yk2gMZSlFAkhyCF5GXMAhR9jYbRaWntcpoa5RNWpotv73g4SAgwW0JS9miXzO4OjppnRoGdz/NtFgdEse2N5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.654230Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59c1d76f33f878a4c0a907b76bb5f6cfc034e93fa39a2907c74b4dac44ed15fc","sha256:1c1ea44c306f7c4289ebc3d7f40797822b65afc399b10c45275e68a99d250336"],"state_sha256":"fe8f254530b335b41ecd333a6f4a2fd25d16892698d14bcee17049b7c02a89f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0sqZUmaOF1c/Mza4fjmv1+Lu32R2kBsVKuJ5SEmjdukI6WROVsXi1MEVynO13gaOrSSeYHveB/g5WE82F1RZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:00:59.668841Z","bundle_sha256":"a58935c7fd608108bc8f92283ddb5e6f913b5788b58235db5d13a084a114bc4e"}}