{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P3JG4CHDHZ3T7YRPDEMRVAQIBG","short_pith_number":"pith:P3JG4CHD","schema_version":"1.0","canonical_sha256":"7ed26e08e33e773fe22f19191a82080989b44fe1b6f7e488239d569f2078bd1c","source":{"kind":"arxiv","id":"1712.06212","version":1},"attestation_state":"computed","paper":{"title":"On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinyu Wang, Minquan Cheng, Qifa Yan, Xiaohu Tang","submitted_at":"2017-12-18T00:29:52Z","abstract_excerpt":"The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak times in a Device-to-Device (D2D in short) communications. In a coded caching scheme, each file block should be divided into $F$ packets. It is meaningful to design a coded caching scheme with the rate and $F$ as small as possible, especially in the practice for D2D network. In this paper we first characterize coded caching scheme for D2D network by a simple array called D2D placement delivery array (DPDA in shot). Consequently some coded caching scheme for D2D network can be "},"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":"1712.06212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-18T00:29:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04cc8610eb74058613ea0c6602527bf1ed44c91daf40361fe415623f845545bb","abstract_canon_sha256":"ff2c44a146fb9984c573cf15446722aaa317e5912fe574b7dcfa11350a1927c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:50.854502Z","signature_b64":"U2m1Bzdpx51CD2wdgtwlx0lnYY0LrtMp/HGdmZMeDyE2VIVzVxJYPp3uRmdMod/ClkCsHgRG9+M7ZTkmZRteBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ed26e08e33e773fe22f19191a82080989b44fe1b6f7e488239d569f2078bd1c","last_reissued_at":"2026-05-18T00:27:50.854073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:50.854073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Placement Delivery Array Design for Coded Caching Scheme in D2D Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinyu Wang, Minquan Cheng, Qifa Yan, Xiaohu Tang","submitted_at":"2017-12-18T00:29:52Z","abstract_excerpt":"The coded caching scheme is an efficient technique as a solution to reduce the wireless network burden during the peak times in a Device-to-Device (D2D in short) communications. In a coded caching scheme, each file block should be divided into $F$ packets. It is meaningful to design a coded caching scheme with the rate and $F$ as small as possible, especially in the practice for D2D network. In this paper we first characterize coded caching scheme for D2D network by a simple array called D2D placement delivery array (DPDA in shot). Consequently some coded caching scheme for D2D network can be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06212","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":"1712.06212","created_at":"2026-05-18T00:27:50.854135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06212v1","created_at":"2026-05-18T00:27:50.854135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06212","created_at":"2026-05-18T00:27:50.854135+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3JG4CHDHZ3T","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3JG4CHDHZ3T7YRP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3JG4CHD","created_at":"2026-05-18T12:31:37.085036+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/P3JG4CHDHZ3T7YRPDEMRVAQIBG","json":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG.json","graph_json":"https://pith.science/api/pith-number/P3JG4CHDHZ3T7YRPDEMRVAQIBG/graph.json","events_json":"https://pith.science/api/pith-number/P3JG4CHDHZ3T7YRPDEMRVAQIBG/events.json","paper":"https://pith.science/paper/P3JG4CHD"},"agent_actions":{"view_html":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG","download_json":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG.json","view_paper":"https://pith.science/paper/P3JG4CHD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06212&json=true","fetch_graph":"https://pith.science/api/pith-number/P3JG4CHDHZ3T7YRPDEMRVAQIBG/graph.json","fetch_events":"https://pith.science/api/pith-number/P3JG4CHDHZ3T7YRPDEMRVAQIBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG/action/storage_attestation","attest_author":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG/action/author_attestation","sign_citation":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG/action/citation_signature","submit_replication":"https://pith.science/pith/P3JG4CHDHZ3T7YRPDEMRVAQIBG/action/replication_record"}},"created_at":"2026-05-18T00:27:50.854135+00:00","updated_at":"2026-05-18T00:27:50.854135+00:00"}