{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6W566HZXVJRYWTDPRJW2JZDMF6","short_pith_number":"pith:6W566HZX","canonical_record":{"source":{"id":"1811.11099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T16:59:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"997dec41d5e67138b81a7e22b0872c824f79a6a394498dbc049622c0f49719dd","abstract_canon_sha256":"ab129a04ad3ef264cd0c84b02566d654254de0c84c1c3e38c7cd141d2581fd38"},"schema_version":"1.0"},"canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","source":{"kind":"arxiv","id":"1811.11099","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11099","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11099v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11099","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"6W566HZXVJRY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6W566HZXVJRYWTDP","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6W566HZX","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6W566HZXVJRYWTDPRJW2JZDMF6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T16:59:13Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"997dec41d5e67138b81a7e22b0872c824f79a6a394498dbc049622c0f49719dd","abstract_canon_sha256":"ab129a04ad3ef264cd0c84b02566d654254de0c84c1c3e38c7cd141d2581fd38"},"schema_version":"1.0"},"canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:45.263222Z","signature_b64":"1JjzlzAiBl/xmsg6QmXRQH/JWIKDOAgs/bWDnMYILJBsYjapvjcI90oOE8YdVDCZEpkJ382YyabzinBwUrKKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","last_reissued_at":"2026-05-17T23:59:45.262707Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:45.262707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11099","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:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OnJy4uLf7u3C4dj1ilxuCbCkwtqTv0Tj8TwKx1++1bHah3BScIaQR5/7F3gcVElyZ6Hnr5zhWnsP2u7RsamCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:30:23.121838Z"},"content_sha256":"3940654ad52c3b5c13cfd2903adbb18164ba005bb7992d151afb14dcf258e884","schema_version":"1.0","event_id":"sha256:3940654ad52c3b5c13cfd2903adbb18164ba005bb7992d151afb14dcf258e884"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6W566HZXVJRYWTDPRJW2JZDMF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Transmission and Probabilistic Caching for Clustered D2D Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Hesham ElSawy, Jacek Kibi{\\l}da, M. Majid Butt, Nicola Marchetti, Ramy Amer","submitted_at":"2018-11-24T16:59:13Z","abstract_excerpt":"In this paper, we aim at maximizing the cache offloading gain for a clustered \\ac{D2D} caching network by exploiting probabilistic caching and cooperative transmission among the cluster devices. Devices with surplus memory probabilistically cache a content from a known library. A requested content is either brought from the device's local cache, cooperatively transmitted from catering devices, or downloaded from the macro base station as a last resort. Using stochastic geometry, we derive a closed-form expression for the offloading gain and formulate the offloading maximization problem. In ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11099","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:59:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ConThdATcsV+2jil9uZl8n7c2Rs6skQRKUSjFyzfa0IFNr5hJ2n8lvuxUrK9INdHAfDhKC7hGHHOmOzg0zccBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:30:23.122183Z"},"content_sha256":"8c8183eaaf4253981a479beddd21015c06055ed71803b2d871094778988d1f38","schema_version":"1.0","event_id":"sha256:8c8183eaaf4253981a479beddd21015c06055ed71803b2d871094778988d1f38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/bundle.json","state_url":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W566HZXVJRYWTDPRJW2JZDMF6/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-08T23:30:23Z","links":{"resolver":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6","bundle":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/bundle.json","state":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W566HZXVJRYWTDPRJW2JZDMF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6W566HZXVJRYWTDPRJW2JZDMF6","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":"ab129a04ad3ef264cd0c84b02566d654254de0c84c1c3e38c7cd141d2581fd38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T16:59:13Z","title_canon_sha256":"997dec41d5e67138b81a7e22b0872c824f79a6a394498dbc049622c0f49719dd"},"schema_version":"1.0","source":{"id":"1811.11099","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11099","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11099v1","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11099","created_at":"2026-05-17T23:59:45Z"},{"alias_kind":"pith_short_12","alias_value":"6W566HZXVJRY","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6W566HZXVJRYWTDP","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6W566HZX","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:8c8183eaaf4253981a479beddd21015c06055ed71803b2d871094778988d1f38","target":"graph","created_at":"2026-05-17T23:59:45Z","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, we aim at maximizing the cache offloading gain for a clustered \\ac{D2D} caching network by exploiting probabilistic caching and cooperative transmission among the cluster devices. Devices with surplus memory probabilistically cache a content from a known library. A requested content is either brought from the device's local cache, cooperatively transmitted from catering devices, or downloaded from the macro base station as a last resort. Using stochastic geometry, we derive a closed-form expression for the offloading gain and formulate the offloading maximization problem. In ord","authors_text":"Hesham ElSawy, Jacek Kibi{\\l}da, M. Majid Butt, Nicola Marchetti, Ramy Amer","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T16:59:13Z","title":"Cooperative Transmission and Probabilistic Caching for Clustered D2D Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11099","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:3940654ad52c3b5c13cfd2903adbb18164ba005bb7992d151afb14dcf258e884","target":"record","created_at":"2026-05-17T23:59:45Z","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":"ab129a04ad3ef264cd0c84b02566d654254de0c84c1c3e38c7cd141d2581fd38","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2018-11-24T16:59:13Z","title_canon_sha256":"997dec41d5e67138b81a7e22b0872c824f79a6a394498dbc049622c0f49719dd"},"schema_version":"1.0","source":{"id":"1811.11099","kind":"arxiv","version":1}},"canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","first_computed_at":"2026-05-17T23:59:45.262707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:45.262707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1JjzlzAiBl/xmsg6QmXRQH/JWIKDOAgs/bWDnMYILJBsYjapvjcI90oOE8YdVDCZEpkJ382YyabzinBwUrKKDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:45.263222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11099","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3940654ad52c3b5c13cfd2903adbb18164ba005bb7992d151afb14dcf258e884","sha256:8c8183eaaf4253981a479beddd21015c06055ed71803b2d871094778988d1f38"],"state_sha256":"d27170a43d85252170d943b439e8541f9b6229dbaa7e17cc2dc9bf9ac310c37f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Rwah9dVFv06bBQZPFNMOoSv0QQU+Dwr7L/WO+nJZpMGhpekl9y2pi0/xxbO+3MhgcB6QfOxLapzibOJcN4SCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:30:23.124075Z","bundle_sha256":"d39c557507c885a30a3d5467287ad3279978c58269110d392d729ed1a46d2982"}}