{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZMXEVOX3WZ3MYVGVBRUIWBSGIV","short_pith_number":"pith:ZMXEVOX3","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"},"canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","source":{"kind":"arxiv","id":"1712.01464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01464","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01464v1","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01464","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZMXEVOX3WZ3M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMXEVOX3WZ3MYVGV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMXEVOX3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZMXEVOX3WZ3MYVGVBRUIWBSGIV","target":"record","payload":{"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"},"canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","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"},"source_kind":"arxiv","source_id":"1712.01464","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:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ublOyFbbi0Nw3SY8M9CiceZXEdQkm1qVYjCbY9RyB3WRqY8JH7a2V2GZTP9kLUnikJyGpY+wqYHwVCg5+RpAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:02.676115Z"},"content_sha256":"4dc81b3e941cc329b557de4ca4cc94e46d52d7ac22f900a5933a952e02400448","schema_version":"1.0","event_id":"sha256:4dc81b3e941cc329b557de4ca4cc94e46d52d7ac22f900a5933a952e02400448"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZMXEVOX3WZ3MYVGVBRUIWBSGIV","target":"graph","payload":{"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"},"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:28:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wq7Q36jSuByTUlB9iUg5J4ez19lQMR12RAlwL1tpvyC54cRuB1MiCtal2jHaUdq7Qepy7ZQfvQQnOI14oVoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T21:09:02.676506Z"},"content_sha256":"21ff44a97dbbd747766701cae26276a7083832c552de697178b1f3710848d34a","schema_version":"1.0","event_id":"sha256:21ff44a97dbbd747766701cae26276a7083832c552de697178b1f3710848d34a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/bundle.json","state_url":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/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-05-28T21:09:02Z","links":{"resolver":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV","bundle":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/bundle.json","state":"https://pith.science/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMXEVOX3WZ3MYVGVBRUIWBSGIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZMXEVOX3WZ3MYVGVBRUIWBSGIV","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":"1a8c6cfc9ab1406e0d430a31a2352a2cc640f90fe851098043a006115c80b155","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T03:32:17Z","title_canon_sha256":"36197ce20f6bc5ffe7adfb30461dcae9c1d89407f3d7268e66d60d788cadb1f4"},"schema_version":"1.0","source":{"id":"1712.01464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.01464","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"arxiv_version","alias_value":"1712.01464v1","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01464","created_at":"2026-05-18T00:28:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZMXEVOX3WZ3M","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZMXEVOX3WZ3MYVGV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZMXEVOX3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:21ff44a97dbbd747766701cae26276a7083832c552de697178b1f3710848d34a","target":"graph","created_at":"2026-05-18T00:28:50Z","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":"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","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":"2017-12-05T03:32:17Z","title":"Broadcast Caching Networks with Two Receivers and Multiple Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01464","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:4dc81b3e941cc329b557de4ca4cc94e46d52d7ac22f900a5933a952e02400448","target":"record","created_at":"2026-05-18T00:28:50Z","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":"1a8c6cfc9ab1406e0d430a31a2352a2cc640f90fe851098043a006115c80b155","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T03:32:17Z","title_canon_sha256":"36197ce20f6bc5ffe7adfb30461dcae9c1d89407f3d7268e66d60d788cadb1f4"},"schema_version":"1.0","source":{"id":"1712.01464","kind":"arxiv","version":1}},"canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb2e4abafbb676cc54d50c688b064645512f5aab3173fc6ed8e1816daab3cc08","first_computed_at":"2026-05-18T00:28:50.694919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:50.694919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5udH/hzEaJT6Vzq99/4n8bSZ+x92tYcK72qncc63rfhb6N+m27tMHRmEKJ+rvAVxX9mwghBFeNlhmMk+utxDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:50.695566Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.01464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4dc81b3e941cc329b557de4ca4cc94e46d52d7ac22f900a5933a952e02400448","sha256:21ff44a97dbbd747766701cae26276a7083832c552de697178b1f3710848d34a"],"state_sha256":"6bc991ac4ed5e850436c40fbf04659f1c5c18c14798bdd2de9b27b98f4530720"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NQ30Z7tHkWO8u8v8Jleyv3UkYBrpWmMsdxiJ/DrcvR+1LAOFai89kyuaVL4lkSvtBzoQTPrPtGzK+AV+E4OCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T21:09:02.678832Z","bundle_sha256":"88ec63e37112b3336152132d4a3026b6b56d55b85b87238cee8504b51ab1d737"}}