{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:THUEYEBIQQFVURZ4VRSEARUNTG","short_pith_number":"pith:THUEYEBI","schema_version":"1.0","canonical_sha256":"99e84c1028840b5a473cac6440468d99add85eda6cc13a5969951d8aa6e1f4c3","source":{"kind":"arxiv","id":"1605.02317","version":1},"attestation_state":"computed","paper":{"title":"Noisy Broadcast Networks with Receiver Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mich\\`ele Wigger, Roy Timo, Shirin Saeedi Bidokhti","submitted_at":"2016-05-08T12:44:21Z","abstract_excerpt":"We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure probabilities and no cache memories. We present lower and upper bounds on the capacity-memory tradeoff of this network. The lower bound is achieved by a new joint cache-channel coding idea and significa"},"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":"1605.02317","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-08T12:44:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"da1e06b323a83948edfe61b53181aa99c2168a0a44e2b953204c1fa920fb7128","abstract_canon_sha256":"6cd3f7c1e2d8c7bb4729d31c81328cea696365c37fed6da78d9df8d1c877f77d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:21.313209Z","signature_b64":"xOSfIPhXggt0d/1S077RE912NBBrkAAkYs02VX8M22c8zNTcQgWJg68teWUCmb72PVU+k5EGYbvxG5JWMwnpCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99e84c1028840b5a473cac6440468d99add85eda6cc13a5969951d8aa6e1f4c3","last_reissued_at":"2026-05-18T01:15:21.312497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:21.312497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Broadcast Networks with Receiver Caching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mich\\`ele Wigger, Roy Timo, Shirin Saeedi Bidokhti","submitted_at":"2016-05-08T12:44:21Z","abstract_excerpt":"We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers' requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure probabilities and no cache memories. We present lower and upper bounds on the capacity-memory tradeoff of this network. The lower bound is achieved by a new joint cache-channel coding idea and significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02317","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":"1605.02317","created_at":"2026-05-18T01:15:21.312617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02317v1","created_at":"2026-05-18T01:15:21.312617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02317","created_at":"2026-05-18T01:15:21.312617+00:00"},{"alias_kind":"pith_short_12","alias_value":"THUEYEBIQQFV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"THUEYEBIQQFVURZ4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"THUEYEBI","created_at":"2026-05-18T12:30:44.179134+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":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG","json":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG.json","graph_json":"https://pith.science/api/pith-number/THUEYEBIQQFVURZ4VRSEARUNTG/graph.json","events_json":"https://pith.science/api/pith-number/THUEYEBIQQFVURZ4VRSEARUNTG/events.json","paper":"https://pith.science/paper/THUEYEBI"},"agent_actions":{"view_html":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG","download_json":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG.json","view_paper":"https://pith.science/paper/THUEYEBI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02317&json=true","fetch_graph":"https://pith.science/api/pith-number/THUEYEBIQQFVURZ4VRSEARUNTG/graph.json","fetch_events":"https://pith.science/api/pith-number/THUEYEBIQQFVURZ4VRSEARUNTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG/action/storage_attestation","attest_author":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG/action/author_attestation","sign_citation":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG/action/citation_signature","submit_replication":"https://pith.science/pith/THUEYEBIQQFVURZ4VRSEARUNTG/action/replication_record"}},"created_at":"2026-05-18T01:15:21.312617+00:00","updated_at":"2026-05-18T01:15:21.312617+00:00"}