{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6A7SH2ZNI6AXGD6YX53I7Q5XLM","short_pith_number":"pith:6A7SH2ZN","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"},"canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","source":{"kind":"arxiv","id":"1509.06932","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06932","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06932v3","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06932","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"6A7SH2ZNI6AX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6A7SH2ZNI6AXGD6Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6A7SH2ZN","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6A7SH2ZNI6AXGD6YX53I7Q5XLM","target":"record","payload":{"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"},"canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","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"},"source_kind":"arxiv","source_id":"1509.06932","source_version":3,"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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXYipIUDVvDjIxWwplI5KSe1uBmHksMbKkZPx9Yne5STaDrOqemAQKLwd2B8f/Ko/0cg3LJqIOFwgaWJmbkgCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:16.233610Z"},"content_sha256":"0b6c5f9e980bd6bebcad9562780b78b71d3648c19f7039adef7ffffe58ab7f9a","schema_version":"1.0","event_id":"sha256:0b6c5f9e980bd6bebcad9562780b78b71d3648c19f7039adef7ffffe58ab7f9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6A7SH2ZNI6AXGD6YX53I7Q5XLM","target":"graph","payload":{"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"},"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-18T01:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ugw1fg4mIM5HrZRL0YWd62hDiecTMkhRiq4V1BJ3/RmcCS4RmDHs7WyA2k+22jgRmTjKVt8LDCF7vdvnMR2IBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:40:16.234300Z"},"content_sha256":"7ee9864ac1cd8092f546a626976297e215ddc7556b093baa6ed33d0b5c6d5590","schema_version":"1.0","event_id":"sha256:7ee9864ac1cd8092f546a626976297e215ddc7556b093baa6ed33d0b5c6d5590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/bundle.json","state_url":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/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-25T16:40:16Z","links":{"resolver":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM","bundle":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/bundle.json","state":"https://pith.science/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6A7SH2ZNI6AXGD6YX53I7Q5XLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6A7SH2ZNI6AXGD6YX53I7Q5XLM","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":"1632689a03c5b92bea0fb55cc0b5492ed6d07d69567e06b412d6336032b64dea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-23T11:48:53Z","title_canon_sha256":"851b05949128054a4bde7ab7839d46b694569d29b5e1d2eb7101f1e4e688abb7"},"schema_version":"1.0","source":{"id":"1509.06932","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06932","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06932v3","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06932","created_at":"2026-05-18T01:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"6A7SH2ZNI6AX","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6A7SH2ZNI6AXGD6Y","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6A7SH2ZN","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:7ee9864ac1cd8092f546a626976297e215ddc7556b093baa6ed33d0b5c6d5590","target":"graph","created_at":"2026-05-18T01:24:10Z","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":"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","authors_text":"Gang Wu, Lin Zhang, Ming Xiao, Shaoqian Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-23T11:48:53Z","title":"Efficient Scheduling and Power Allocation for D2D-assisted Wireless Caching Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06932","kind":"arxiv","version":3},"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:0b6c5f9e980bd6bebcad9562780b78b71d3648c19f7039adef7ffffe58ab7f9a","target":"record","created_at":"2026-05-18T01:24:10Z","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":"1632689a03c5b92bea0fb55cc0b5492ed6d07d69567e06b412d6336032b64dea","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-23T11:48:53Z","title_canon_sha256":"851b05949128054a4bde7ab7839d46b694569d29b5e1d2eb7101f1e4e688abb7"},"schema_version":"1.0","source":{"id":"1509.06932","kind":"arxiv","version":3}},"canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f03f23eb2d4781730fd8bf768fc3b75b26d320c196667caef5ce5db4cff833cc","first_computed_at":"2026-05-18T01:24:10.538454Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:10.538454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3o7AunpFCv6CDmJj7lQR+GGKXXZN4P6gS08tYKtNGz9x9n+8i1uylaBokviA+riy6kzXaTwyLqULMGO7IC+BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:10.539028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06932","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b6c5f9e980bd6bebcad9562780b78b71d3648c19f7039adef7ffffe58ab7f9a","sha256:7ee9864ac1cd8092f546a626976297e215ddc7556b093baa6ed33d0b5c6d5590"],"state_sha256":"be9196337f4745fc908aaf7a83ab3247fe37801ef02f36da16792b2b8b59e80b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/3qQKFWedG0PrXV9rxJ0NSJeM/mKzVGzldEEgDFPDzYoqEbtc5yxGhOC5alniawPAcjT2hcP6py0j4VMNlqBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:40:16.237780Z","bundle_sha256":"3e00b46edf9349a096c854ac2942915bc70d4a1ce92ccc1bd4703dacf5fe4dcd"}}