{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UM6MMQ2QTXPAVGOKJEE6PZR53X","short_pith_number":"pith:UM6MMQ2Q","schema_version":"1.0","canonical_sha256":"a33cc643509dde0a99ca4909e7e63dddd49d318677ce6a465884c315f3ac4484","source":{"kind":"arxiv","id":"1801.00606","version":1},"attestation_state":"computed","paper":{"title":"Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaya Rekaya-Ben Othman, Mich\\`ele Wigger, Mireille Sarkiss, Sarah Kamel","submitted_at":"2018-01-02T11:02:07Z","abstract_excerpt":"This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key-aided one-time pads. The presented upper bound holds more generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak receivers have cache memories, upper and lower bounds coincide fo"},"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":"1801.00606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-02T11:02:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"440c769c7ed742c37934a6a6b71d21c6f129a499f32a5184f149768269246d38","abstract_canon_sha256":"0671232e6859d31d1076b000ccdb8c4326f00a54af9393fd9344adb5bc5f2569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:52.892111Z","signature_b64":"qz14GT2GTsiEOFFF4zTo3AO+E56Gn/gqdaWS/hGW9ZIUZ4YQRsImK2WtbtubrFfeuZCpBgzbK4PA5R8zA6xpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a33cc643509dde0a99ca4909e7e63dddd49d318677ce6a465884c315f3ac4484","last_reissued_at":"2026-05-18T00:26:52.891445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:52.891445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ghaya Rekaya-Ben Othman, Mich\\`ele Wigger, Mireille Sarkiss, Sarah Kamel","submitted_at":"2018-01-02T11:02:07Z","abstract_excerpt":"This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key-aided one-time pads. The presented upper bound holds more generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak receivers have cache memories, upper and lower bounds coincide fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.00606","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":"1801.00606","created_at":"2026-05-18T00:26:52.891554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.00606v1","created_at":"2026-05-18T00:26:52.891554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.00606","created_at":"2026-05-18T00:26:52.891554+00:00"},{"alias_kind":"pith_short_12","alias_value":"UM6MMQ2QTXPA","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UM6MMQ2QTXPAVGOK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UM6MMQ2Q","created_at":"2026-05-18T12:32:56.356000+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/UM6MMQ2QTXPAVGOKJEE6PZR53X","json":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X.json","graph_json":"https://pith.science/api/pith-number/UM6MMQ2QTXPAVGOKJEE6PZR53X/graph.json","events_json":"https://pith.science/api/pith-number/UM6MMQ2QTXPAVGOKJEE6PZR53X/events.json","paper":"https://pith.science/paper/UM6MMQ2Q"},"agent_actions":{"view_html":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X","download_json":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X.json","view_paper":"https://pith.science/paper/UM6MMQ2Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.00606&json=true","fetch_graph":"https://pith.science/api/pith-number/UM6MMQ2QTXPAVGOKJEE6PZR53X/graph.json","fetch_events":"https://pith.science/api/pith-number/UM6MMQ2QTXPAVGOKJEE6PZR53X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X/action/storage_attestation","attest_author":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X/action/author_attestation","sign_citation":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X/action/citation_signature","submit_replication":"https://pith.science/pith/UM6MMQ2QTXPAVGOKJEE6PZR53X/action/replication_record"}},"created_at":"2026-05-18T00:26:52.891554+00:00","updated_at":"2026-05-18T00:26:52.891554+00:00"}