{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6W566HZXVJRYWTDPRJW2JZDMF6","short_pith_number":"pith:6W566HZX","schema_version":"1.0","canonical_sha256":"f5bbef1f37aa638b4c6f8a6da4e46c2fa8ffd4efc0c7beb1f5188e862eda1fbe","source":{"kind":"arxiv","id":"1811.11099","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.11099","created_at":"2026-05-17T23:59:45.262784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11099v1","created_at":"2026-05-17T23:59:45.262784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11099","created_at":"2026-05-17T23:59:45.262784+00:00"},{"alias_kind":"pith_short_12","alias_value":"6W566HZXVJRY","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6W566HZXVJRYWTDP","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6W566HZX","created_at":"2026-05-18T12:32:11.075285+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/6W566HZXVJRYWTDPRJW2JZDMF6","json":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6.json","graph_json":"https://pith.science/api/pith-number/6W566HZXVJRYWTDPRJW2JZDMF6/graph.json","events_json":"https://pith.science/api/pith-number/6W566HZXVJRYWTDPRJW2JZDMF6/events.json","paper":"https://pith.science/paper/6W566HZX"},"agent_actions":{"view_html":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6","download_json":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6.json","view_paper":"https://pith.science/paper/6W566HZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11099&json=true","fetch_graph":"https://pith.science/api/pith-number/6W566HZXVJRYWTDPRJW2JZDMF6/graph.json","fetch_events":"https://pith.science/api/pith-number/6W566HZXVJRYWTDPRJW2JZDMF6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/action/storage_attestation","attest_author":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/action/author_attestation","sign_citation":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/action/citation_signature","submit_replication":"https://pith.science/pith/6W566HZXVJRYWTDPRJW2JZDMF6/action/replication_record"}},"created_at":"2026-05-17T23:59:45.262784+00:00","updated_at":"2026-05-17T23:59:45.262784+00:00"}