{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OG4UU5HXXNKPL5QU3LKJS464AP","short_pith_number":"pith:OG4UU5HX","canonical_record":{"source":{"id":"1812.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-06T07:41:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"07193e868784a1a5b4055b79b2742317be39dc5b1a03c4341335765b5bd1223e","abstract_canon_sha256":"22d7ffdcf6c02de10de2cca65ef512364595c7e6dee20f891b174ba261bd7962"},"schema_version":"1.0"},"canonical_sha256":"71b94a74f7bb54f5f614dad49973dc03c8b3bb8da439981e444575f6f84c77ef","source":{"kind":"arxiv","id":"1812.02388","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02388","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02388v1","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02388","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"OG4UU5HXXNKP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OG4UU5HXXNKPL5QU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OG4UU5HX","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OG4UU5HXXNKPL5QU3LKJS464AP","target":"record","payload":{"canonical_record":{"source":{"id":"1812.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-06T07:41:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"07193e868784a1a5b4055b79b2742317be39dc5b1a03c4341335765b5bd1223e","abstract_canon_sha256":"22d7ffdcf6c02de10de2cca65ef512364595c7e6dee20f891b174ba261bd7962"},"schema_version":"1.0"},"canonical_sha256":"71b94a74f7bb54f5f614dad49973dc03c8b3bb8da439981e444575f6f84c77ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:56.442406Z","signature_b64":"WC/hhUulpOCk6Ou5SCdW7bfjvMLHHpeVZdufkNG/IjY01EzZh532oDJbgpNlfxrQtZJwRjsKmGSEJLXiZ4HJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71b94a74f7bb54f5f614dad49973dc03c8b3bb8da439981e444575f6f84c77ef","last_reissued_at":"2026-05-17T23:58:56.442004Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:56.442004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.02388","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-17T23:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFBCQO+WeNNzfOXTwrY6rSo2l/qVt23+oUDWEpwsw0tkgGlDmbk+XQVB7ooPHHq9GUe2ziZyFYgxeepVHBXXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:19:15.437889Z"},"content_sha256":"58c87cdaf36ebd1924c67a8b41dbf1dc4f4e8a33404be4796dcd8e30f4ede5ad","schema_version":"1.0","event_id":"sha256:58c87cdaf36ebd1924c67a8b41dbf1dc4f4e8a33404be4796dcd8e30f4ede5ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OG4UU5HXXNKPL5QU3LKJS464AP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Converse Bound for Cache-Aided Interference Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonious M. Girgis, Mohammed Nafie, Ozgur Ercetin, Tamer ElBatt","submitted_at":"2018-12-06T07:41:07Z","abstract_excerpt":"In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \\textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02388","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-17T23:58:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lmhTZH4V7PJ2Plnty6xsP9zFWWVT9pCd3Yg2GaoanW073rVO2RvEBw5Ie44CfBzROxl5kheSZvMoHOwTrkdaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:19:15.438219Z"},"content_sha256":"ee2229dadf6b368f3c1d90dd70a014730572abddd1b25f471152f6bdfb396b76","schema_version":"1.0","event_id":"sha256:ee2229dadf6b368f3c1d90dd70a014730572abddd1b25f471152f6bdfb396b76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OG4UU5HXXNKPL5QU3LKJS464AP/bundle.json","state_url":"https://pith.science/pith/OG4UU5HXXNKPL5QU3LKJS464AP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OG4UU5HXXNKPL5QU3LKJS464AP/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-20T13:19:15Z","links":{"resolver":"https://pith.science/pith/OG4UU5HXXNKPL5QU3LKJS464AP","bundle":"https://pith.science/pith/OG4UU5HXXNKPL5QU3LKJS464AP/bundle.json","state":"https://pith.science/pith/OG4UU5HXXNKPL5QU3LKJS464AP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OG4UU5HXXNKPL5QU3LKJS464AP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OG4UU5HXXNKPL5QU3LKJS464AP","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":"22d7ffdcf6c02de10de2cca65ef512364595c7e6dee20f891b174ba261bd7962","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-06T07:41:07Z","title_canon_sha256":"07193e868784a1a5b4055b79b2742317be39dc5b1a03c4341335765b5bd1223e"},"schema_version":"1.0","source":{"id":"1812.02388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02388","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02388v1","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02388","created_at":"2026-05-17T23:58:56Z"},{"alias_kind":"pith_short_12","alias_value":"OG4UU5HXXNKP","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OG4UU5HXXNKPL5QU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OG4UU5HX","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:ee2229dadf6b368f3c1d90dd70a014730572abddd1b25f471152f6bdfb396b76","target":"graph","created_at":"2026-05-17T23:58:56Z","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":"In this paper, an interference network with arbitrary number of transmitters and receivers is studied, where each transmitter is equipped with a finite size cache. We obtain an information-theoretic lower bound on both the peak normalized delivery time (NDT), and the \\textit{expected} NDT of cache-aided interference networks with uniform content popularity. For the peak NDT, we show that our lower bound is strictly tighter than the bound in the literature for small cache sizes. Moreover, we show that the feasibility region on the expected NDT is bigger than that of the peak NDT.","authors_text":"Antonious M. Girgis, Mohammed Nafie, Ozgur Ercetin, Tamer ElBatt","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-06T07:41:07Z","title":"A Converse Bound for Cache-Aided Interference Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02388","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:58c87cdaf36ebd1924c67a8b41dbf1dc4f4e8a33404be4796dcd8e30f4ede5ad","target":"record","created_at":"2026-05-17T23:58:56Z","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":"22d7ffdcf6c02de10de2cca65ef512364595c7e6dee20f891b174ba261bd7962","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-06T07:41:07Z","title_canon_sha256":"07193e868784a1a5b4055b79b2742317be39dc5b1a03c4341335765b5bd1223e"},"schema_version":"1.0","source":{"id":"1812.02388","kind":"arxiv","version":1}},"canonical_sha256":"71b94a74f7bb54f5f614dad49973dc03c8b3bb8da439981e444575f6f84c77ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71b94a74f7bb54f5f614dad49973dc03c8b3bb8da439981e444575f6f84c77ef","first_computed_at":"2026-05-17T23:58:56.442004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:56.442004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WC/hhUulpOCk6Ou5SCdW7bfjvMLHHpeVZdufkNG/IjY01EzZh532oDJbgpNlfxrQtZJwRjsKmGSEJLXiZ4HJAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:56.442406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58c87cdaf36ebd1924c67a8b41dbf1dc4f4e8a33404be4796dcd8e30f4ede5ad","sha256:ee2229dadf6b368f3c1d90dd70a014730572abddd1b25f471152f6bdfb396b76"],"state_sha256":"0efa8e16f167d858ad0ae1b07a2e7454bd8b7734f44984827ae81d8254791547"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wne2gNGsGTQBvDip7MXyahYAbCRAqwPHaCTHsUrMOetPmvFV0xuaAitUvSMLYcem02N4BZbqLM26iNKzNdd4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:19:15.440086Z","bundle_sha256":"ce8e16619e099acac39eaa9cc9825159b8d0b24c069aa71e9fcb6288e447a9e9"}}