{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BIZFQMX752IHIB7Q4GV3XJASQW","short_pith_number":"pith:BIZFQMX7","canonical_record":{"source":{"id":"1510.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T11:17:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffad69d252dacb99b6cc7ae0b557581956025c6bd526fb57a16b07d3e13f9e0f","abstract_canon_sha256":"95f42834dc42e9b566396d872b1ac7fedcf8540bf3dd8c65ad2e87e2eaeafa22"},"schema_version":"1.0"},"canonical_sha256":"0a325832ffee907407f0e1abbba41285be7a749fdd51aa0df8e29f4e385bddb1","source":{"kind":"arxiv","id":"1510.07865","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07865","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07865v2","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07865","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"BIZFQMX752IH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BIZFQMX752IHIB7Q","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BIZFQMX7","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BIZFQMX752IHIB7Q4GV3XJASQW","target":"record","payload":{"canonical_record":{"source":{"id":"1510.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T11:17:16Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ffad69d252dacb99b6cc7ae0b557581956025c6bd526fb57a16b07d3e13f9e0f","abstract_canon_sha256":"95f42834dc42e9b566396d872b1ac7fedcf8540bf3dd8c65ad2e87e2eaeafa22"},"schema_version":"1.0"},"canonical_sha256":"0a325832ffee907407f0e1abbba41285be7a749fdd51aa0df8e29f4e385bddb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.667968Z","signature_b64":"5gKHdWjfwO6FQffURcMM0p3cMJ4sjsigMKrCvpXxnZfVCxrXWs/B6Nox4Id4jK+sIOiIvXJj+C0iIm8IMcLbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a325832ffee907407f0e1abbba41285be7a749fdd51aa0df8e29f4e385bddb1","last_reissued_at":"2026-05-18T01:28:06.667355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.667355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.07865","source_version":2,"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:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2HLjmckYFSVGHz2toDVOkttkQkI1ou8Yc5b40g+xqmDxSCOUV8VRVcoXu8PJ1ZqSZH/I7hCUTpQGjJAjpPyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:44:48.123775Z"},"content_sha256":"47ff6c6756f23914fb8d255e567def6883afecacda52633cf8678c6cf83762ce","schema_version":"1.0","event_id":"sha256:47ff6c6756f23914fb8d255e567def6883afecacda52633cf8678c6cf83762ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BIZFQMX752IHIB7Q4GV3XJASQW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Caching Placement 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":"Bin Xia, Chenchen Yang, Hao Feng, Jun Rao, Zhiyong Chen","submitted_at":"2015-10-27T11:17:16Z","abstract_excerpt":"In this paper, we devise the optimal caching placement to maximize the offloading probability for a two-tier wireless caching system, where the helpers and a part of users have caching ability. The offloading comes from the local caching, D2D sharing and the helper transmission. In particular, to maximize the offloading probability we reformulate the caching placement problem for users and helpers into a difference of convex (DC) problem which can be effectively solved by DC programming. Moreover, we analyze the two extreme cases where there is only help-tier caching network and only user-tier"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07865","kind":"arxiv","version":2},"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:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D68Z3hdXmyV5Qtw4HhUCSP828LrWrahezzf+pzTUzvkD/TcsFBsG81Uvbwp8YTKDJxmM8Wu7oUp1OPF4/oH6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:44:48.124490Z"},"content_sha256":"2623461e22070fac767353e209c63b4bb35075944cd3283fddb221c0174c0a30","schema_version":"1.0","event_id":"sha256:2623461e22070fac767353e209c63b4bb35075944cd3283fddb221c0174c0a30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIZFQMX752IHIB7Q4GV3XJASQW/bundle.json","state_url":"https://pith.science/pith/BIZFQMX752IHIB7Q4GV3XJASQW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIZFQMX752IHIB7Q4GV3XJASQW/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-26T03:44:48Z","links":{"resolver":"https://pith.science/pith/BIZFQMX752IHIB7Q4GV3XJASQW","bundle":"https://pith.science/pith/BIZFQMX752IHIB7Q4GV3XJASQW/bundle.json","state":"https://pith.science/pith/BIZFQMX752IHIB7Q4GV3XJASQW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIZFQMX752IHIB7Q4GV3XJASQW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BIZFQMX752IHIB7Q4GV3XJASQW","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":"95f42834dc42e9b566396d872b1ac7fedcf8540bf3dd8c65ad2e87e2eaeafa22","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T11:17:16Z","title_canon_sha256":"ffad69d252dacb99b6cc7ae0b557581956025c6bd526fb57a16b07d3e13f9e0f"},"schema_version":"1.0","source":{"id":"1510.07865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.07865","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.07865v2","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07865","created_at":"2026-05-18T01:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"BIZFQMX752IH","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BIZFQMX752IHIB7Q","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BIZFQMX7","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:2623461e22070fac767353e209c63b4bb35075944cd3283fddb221c0174c0a30","target":"graph","created_at":"2026-05-18T01:28:06Z","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 devise the optimal caching placement to maximize the offloading probability for a two-tier wireless caching system, where the helpers and a part of users have caching ability. The offloading comes from the local caching, D2D sharing and the helper transmission. In particular, to maximize the offloading probability we reformulate the caching placement problem for users and helpers into a difference of convex (DC) problem which can be effectively solved by DC programming. Moreover, we analyze the two extreme cases where there is only help-tier caching network and only user-tier","authors_text":"Bin Xia, Chenchen Yang, Hao Feng, Jun Rao, Zhiyong Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T11:17:16Z","title":"Optimal Caching Placement for D2D Assisted Wireless Caching Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07865","kind":"arxiv","version":2},"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:47ff6c6756f23914fb8d255e567def6883afecacda52633cf8678c6cf83762ce","target":"record","created_at":"2026-05-18T01:28:06Z","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":"95f42834dc42e9b566396d872b1ac7fedcf8540bf3dd8c65ad2e87e2eaeafa22","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-10-27T11:17:16Z","title_canon_sha256":"ffad69d252dacb99b6cc7ae0b557581956025c6bd526fb57a16b07d3e13f9e0f"},"schema_version":"1.0","source":{"id":"1510.07865","kind":"arxiv","version":2}},"canonical_sha256":"0a325832ffee907407f0e1abbba41285be7a749fdd51aa0df8e29f4e385bddb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a325832ffee907407f0e1abbba41285be7a749fdd51aa0df8e29f4e385bddb1","first_computed_at":"2026-05-18T01:28:06.667355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:06.667355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5gKHdWjfwO6FQffURcMM0p3cMJ4sjsigMKrCvpXxnZfVCxrXWs/B6Nox4Id4jK+sIOiIvXJj+C0iIm8IMcLbBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:06.667968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.07865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47ff6c6756f23914fb8d255e567def6883afecacda52633cf8678c6cf83762ce","sha256:2623461e22070fac767353e209c63b4bb35075944cd3283fddb221c0174c0a30"],"state_sha256":"31cdfb6c6957d9cd414c1ef185cbd791d14ea3051d668980ce6e3c2c24d5cbb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FVWzRCOpZ1Va5vHyucH71axtHHv2otoTp3yGpRQUlCTT5gnzA26frnQkio2sJponPnZ3jzhzNT+KGaZ3us0ACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:44:48.127875Z","bundle_sha256":"cb12a48a459708cee0c3f510b3ae5ea8228bd3e0eb887a29a4569c2709d9b6ad"}}