{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6A7SH2ZNI6AXGD6YX53I7Q5XLM","short_pith_number":"pith:6A7SH2ZN","schema_version":"1.0","canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","source":{"kind":"arxiv","id":"1509.06932","version":3},"attestation_state":"computed","paper":{"title":"Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gang Wu, Lin Zhang, Ming Xiao, Shaoqian Li","submitted_at":"2015-09-23T11:48:53Z","abstract_excerpt":"We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link schedulin"},"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":"1509.06932","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-23T11:48:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"851b05949128054a4bde7ab7839d46b694569d29b5e1d2eb7101f1e4e688abb7","abstract_canon_sha256":"1632689a03c5b92bea0fb55cc0b5492ed6d07d69567e06b412d6336032b64dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:10.539028Z","signature_b64":"U3o7AunpFCv6CDmJj7lQR+GGKXXZN4P6gS08tYKtNGz9x9n+8i1uylaBokviA+riy6kzXaTwyLqULMGO7IC+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","last_reissued_at":"2026-05-18T01:24:10.538454Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:10.538454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gang Wu, Lin Zhang, Ming Xiao, Shaoqian Li","submitted_at":"2015-09-23T11:48:53Z","abstract_excerpt":"We study an one-hop device-to-device (D2D) assisted wireless caching network, where popular files are randomly and independently cached in the memory of end-users. Each user may obtain the requested files from its own memory without any transmission, or from a helper through an one-hop D2D transmission, or from the base station (BS). We formulate a joint D2D link scheduling and power allocation problem to maximize the system throughput. However, the problem is non-convex and obtaining an optimal solution is computationally hard. Alternatively, we decompose the problem into a D2D link schedulin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06932","kind":"arxiv","version":3},"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":"1509.06932","created_at":"2026-05-18T01:24:10.538574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06932v3","created_at":"2026-05-18T01:24:10.538574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06932","created_at":"2026-05-18T01:24:10.538574+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A7SH2ZNI6AX","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A7SH2ZNI6AXGD6Y","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A7SH2ZN","created_at":"2026-05-18T12:29:07.941421+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/6A7SH2ZNI6AXGD6YX53I7Q5XLM","json":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM.json","graph_json":"https://pith.science/api/pith-number/6A7SH2ZNI6AXGD6YX53I7Q5XLM/graph.json","events_json":"https://pith.science/api/pith-number/6A7SH2ZNI6AXGD6YX53I7Q5XLM/events.json","paper":"https://pith.science/paper/6A7SH2ZN"},"agent_actions":{"view_html":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM","download_json":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM.json","view_paper":"https://pith.science/paper/6A7SH2ZN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06932&json=true","fetch_graph":"https://pith.science/api/pith-number/6A7SH2ZNI6AXGD6YX53I7Q5XLM/graph.json","fetch_events":"https://pith.science/api/pith-number/6A7SH2ZNI6AXGD6YX53I7Q5XLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/action/storage_attestation","attest_author":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/action/author_attestation","sign_citation":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/action/citation_signature","submit_replication":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/action/replication_record"}},"created_at":"2026-05-18T01:24:10.538574+00:00","updated_at":"2026-05-18T01:24:10.538574+00:00"}