{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WIP4IKSC5WK2XQRWQUDS7UAHKR","short_pith_number":"pith:WIP4IKSC","canonical_record":{"source":{"id":"1811.05498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T19:09:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f28825b01b48565a2221c9381dbecd81c3dfd73d7bc0f9b8617e2370e3c1a783","abstract_canon_sha256":"d261d99b3342216aee534d5b5ca7438a3637c6b49e64b246a0bf3c11cc8c6a9f"},"schema_version":"1.0"},"canonical_sha256":"b21fc42a42ed95abc23685072fd00754530d1ad5c368a1a52734c8ce5e3f660d","source":{"kind":"arxiv","id":"1811.05498","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05498","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05498v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05498","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"WIP4IKSC5WK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WIP4IKSC5WK2XQRW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WIP4IKSC","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WIP4IKSC5WK2XQRWQUDS7UAHKR","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T19:09:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f28825b01b48565a2221c9381dbecd81c3dfd73d7bc0f9b8617e2370e3c1a783","abstract_canon_sha256":"d261d99b3342216aee534d5b5ca7438a3637c6b49e64b246a0bf3c11cc8c6a9f"},"schema_version":"1.0"},"canonical_sha256":"b21fc42a42ed95abc23685072fd00754530d1ad5c368a1a52734c8ce5e3f660d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.220495Z","signature_b64":"NTBWu5XnB47L8H3nbM24hkSsDCNmVsNcLaURy1Vh/sgWnmVqNPOb8v3860d1yAgJZPIWKCBtgVHSrK50+BEdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21fc42a42ed95abc23685072fd00754530d1ad5c368a1a52734c8ce5e3f660d","last_reissued_at":"2026-05-17T23:45:15.220050Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.220050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05498","source_version":2,"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+QS563UAgWMSmkI0yHMaVLOQg3Bl7ODz5Wd4ROeTZWtpNnl8IFJnOoT4+0ACwXlwtxDSWUUQm5RLW0RoSJhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:43:34.212153Z"},"content_sha256":"389663cb376412231ef8381d0b8643299b9c8e9452f7d1605c14a10ef6b4319e","schema_version":"1.0","event_id":"sha256:389663cb376412231ef8381d0b8643299b9c8e9452f7d1605c14a10ef6b4319e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WIP4IKSC5WK2XQRWQUDS7UAHKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniela Tuninetti, Giuseppe Caire, Kai Wan, Mingyue Ji","submitted_at":"2018-11-13T19:09:08Z","abstract_excerpt":"Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05498","kind":"arxiv","version":2},"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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4UtRBL8P6BaWe9TFs62sN5l/lJDxznN7rDAn5bEGDau8hvvKxgQuETmpQ4ftMSJ4/Mhq94uQBCPAJguUEI5YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:43:34.212902Z"},"content_sha256":"7dac4ae194d5d44719878b1b7fc0e01ff6bb0eab23ddf2ed5e9fa8938f90c248","schema_version":"1.0","event_id":"sha256:7dac4ae194d5d44719878b1b7fc0e01ff6bb0eab23ddf2ed5e9fa8938f90c248"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/bundle.json","state_url":"https://pith.science/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/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-23T08:43:34Z","links":{"resolver":"https://pith.science/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR","bundle":"https://pith.science/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/bundle.json","state":"https://pith.science/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIP4IKSC5WK2XQRWQUDS7UAHKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WIP4IKSC5WK2XQRWQUDS7UAHKR","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":"d261d99b3342216aee534d5b5ca7438a3637c6b49e64b246a0bf3c11cc8c6a9f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T19:09:08Z","title_canon_sha256":"f28825b01b48565a2221c9381dbecd81c3dfd73d7bc0f9b8617e2370e3c1a783"},"schema_version":"1.0","source":{"id":"1811.05498","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05498","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05498v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05498","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"WIP4IKSC5WK2","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WIP4IKSC5WK2XQRW","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WIP4IKSC","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:7dac4ae194d5d44719878b1b7fc0e01ff6bb0eab23ddf2ed5e9fa8938f90c248","target":"graph","created_at":"2026-05-17T23:45:15Z","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":"Maddah-Ali and Niesen (MAN) in 2014 showed that coded caching in single bottleneck-link broadcast networks allows serving an arbitrarily large number of cache-equipped users with a total link load (bits per unit time) that does not scale with the number of users. Since then, the general topic of coded caching has generated enormous interest both from the information theoretic and (network) coding theoretic viewpoint, and from the viewpoint of applications. Building on the MAN work, this paper considers a particular network topology referred to as cache-aided Fog Radio Access Network (Fog-RAN),","authors_text":"Daniela Tuninetti, Giuseppe Caire, Kai Wan, Mingyue Ji","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T19:09:08Z","title":"On the Fundamental Limits of Fog-RAN Cache-aided Networks with Downlink and Sidelink Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05498","kind":"arxiv","version":2},"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:389663cb376412231ef8381d0b8643299b9c8e9452f7d1605c14a10ef6b4319e","target":"record","created_at":"2026-05-17T23:45:15Z","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":"d261d99b3342216aee534d5b5ca7438a3637c6b49e64b246a0bf3c11cc8c6a9f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-13T19:09:08Z","title_canon_sha256":"f28825b01b48565a2221c9381dbecd81c3dfd73d7bc0f9b8617e2370e3c1a783"},"schema_version":"1.0","source":{"id":"1811.05498","kind":"arxiv","version":2}},"canonical_sha256":"b21fc42a42ed95abc23685072fd00754530d1ad5c368a1a52734c8ce5e3f660d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b21fc42a42ed95abc23685072fd00754530d1ad5c368a1a52734c8ce5e3f660d","first_computed_at":"2026-05-17T23:45:15.220050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.220050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NTBWu5XnB47L8H3nbM24hkSsDCNmVsNcLaURy1Vh/sgWnmVqNPOb8v3860d1yAgJZPIWKCBtgVHSrK50+BEdDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.220495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05498","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:389663cb376412231ef8381d0b8643299b9c8e9452f7d1605c14a10ef6b4319e","sha256:7dac4ae194d5d44719878b1b7fc0e01ff6bb0eab23ddf2ed5e9fa8938f90c248"],"state_sha256":"2d0898d25b2f69231a959f53f1199973c2bac16a2ed983a678160889882fe54f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJmg9A0/ek86B+djU2g7EDkMRIxmI3GmNYDlGoFO3I488FYUwCto71FXPJBUZ/2aumK4XTQC7W9tC/oemBGOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:43:34.217016Z","bundle_sha256":"a96a8b3f133d5af5c4c6bcb62846d5941b89445637a0128b8c71197180279b87"}}