{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EDEGHMFIU24VOZXCDXQC4CAFOS","short_pith_number":"pith:EDEGHMFI","canonical_record":{"source":{"id":"1808.06998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T16:19:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"93b1322619d2ae2df5ef54b4672e282304051440e18c7f9499d18f80a99439bc","abstract_canon_sha256":"2a1db6fd35dc830ff51a8ebf47a82f7a5d9a60960415ff26e20b97485dd1dc57"},"schema_version":"1.0"},"canonical_sha256":"20c863b0a8a6b95766e21de02e0805749813f2f1796a4328fb5ce10ce48b0fbf","source":{"kind":"arxiv","id":"1808.06998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06998","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06998v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06998","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"EDEGHMFIU24V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EDEGHMFIU24VOZXC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EDEGHMFI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EDEGHMFIU24VOZXCDXQC4CAFOS","target":"record","payload":{"canonical_record":{"source":{"id":"1808.06998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T16:19:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"93b1322619d2ae2df5ef54b4672e282304051440e18c7f9499d18f80a99439bc","abstract_canon_sha256":"2a1db6fd35dc830ff51a8ebf47a82f7a5d9a60960415ff26e20b97485dd1dc57"},"schema_version":"1.0"},"canonical_sha256":"20c863b0a8a6b95766e21de02e0805749813f2f1796a4328fb5ce10ce48b0fbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:38.441998Z","signature_b64":"nHxdWCf/k92mVTCOWtxMVCc58XfPTjolWT3Iqu1J9FI9oejCb2i72EJkPJhr+hyqBfQyB2ZEFm+RWANsECczDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20c863b0a8a6b95766e21de02e0805749813f2f1796a4328fb5ce10ce48b0fbf","last_reissued_at":"2026-05-18T00:07:38.441363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:38.441363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.06998","source_version":1,"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-18T00:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIUMxwfuwhRKHrhfB1tBsWJDHE2CLXXkFUCyKzmXZh1T1Y+349IcVExJ5SJUDWzueXZa8o6e+8AqUi6IyzVjBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:51:49.653566Z"},"content_sha256":"b7d0bb58ca2ad4772e5dd76a9f28a9d3fff8de6d654df280f8e7be9d5df32acd","schema_version":"1.0","event_id":"sha256:b7d0bb58ca2ad4772e5dd76a9f28a9d3fff8de6d654df280f8e7be9d5df32acd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EDEGHMFIU24VOZXCDXQC4CAFOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Cooperative D2D-Enabled 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, Geoffrey Ye Li, Jiaqi Liu, Miao Pan, Sa Xiao, Shaoqian Li, Shengjie Guo, Xiangwei Zhou","submitted_at":"2018-08-21T16:19:05Z","abstract_excerpt":"In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06998","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"},"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-18T00:07:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YxFaW0P9VIAntK9HZ8sJid8p3dAOzkIClwnKiV2LrrYmoxdotq5KjofjPYCn7CJoamLLBd2+CiS/PRbce+QUBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:51:49.654026Z"},"content_sha256":"f596794311ab8f267b8fd71a72f06d438ca3b6c2288c6dd70f9461a42e897a62","schema_version":"1.0","event_id":"sha256:f596794311ab8f267b8fd71a72f06d438ca3b6c2288c6dd70f9461a42e897a62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/bundle.json","state_url":"https://pith.science/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/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-31T12:51:49Z","links":{"resolver":"https://pith.science/pith/EDEGHMFIU24VOZXCDXQC4CAFOS","bundle":"https://pith.science/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/bundle.json","state":"https://pith.science/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDEGHMFIU24VOZXCDXQC4CAFOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EDEGHMFIU24VOZXCDXQC4CAFOS","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":"2a1db6fd35dc830ff51a8ebf47a82f7a5d9a60960415ff26e20b97485dd1dc57","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T16:19:05Z","title_canon_sha256":"93b1322619d2ae2df5ef54b4672e282304051440e18c7f9499d18f80a99439bc"},"schema_version":"1.0","source":{"id":"1808.06998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.06998","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"arxiv_version","alias_value":"1808.06998v1","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06998","created_at":"2026-05-18T00:07:38Z"},{"alias_kind":"pith_short_12","alias_value":"EDEGHMFIU24V","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EDEGHMFIU24VOZXC","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EDEGHMFI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:f596794311ab8f267b8fd71a72f06d438ca3b6c2288c6dd70f9461a42e897a62","target":"graph","created_at":"2026-05-18T00:07:38Z","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 study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links","authors_text":"Gang Wu, Geoffrey Ye Li, Jiaqi Liu, Miao Pan, Sa Xiao, Shaoqian Li, Shengjie Guo, Xiangwei Zhou","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T16:19:05Z","title":"Resource Allocation for Cooperative D2D-Enabled Wireless Caching Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06998","kind":"arxiv","version":1},"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:b7d0bb58ca2ad4772e5dd76a9f28a9d3fff8de6d654df280f8e7be9d5df32acd","target":"record","created_at":"2026-05-18T00:07:38Z","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":"2a1db6fd35dc830ff51a8ebf47a82f7a5d9a60960415ff26e20b97485dd1dc57","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-21T16:19:05Z","title_canon_sha256":"93b1322619d2ae2df5ef54b4672e282304051440e18c7f9499d18f80a99439bc"},"schema_version":"1.0","source":{"id":"1808.06998","kind":"arxiv","version":1}},"canonical_sha256":"20c863b0a8a6b95766e21de02e0805749813f2f1796a4328fb5ce10ce48b0fbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20c863b0a8a6b95766e21de02e0805749813f2f1796a4328fb5ce10ce48b0fbf","first_computed_at":"2026-05-18T00:07:38.441363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:38.441363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nHxdWCf/k92mVTCOWtxMVCc58XfPTjolWT3Iqu1J9FI9oejCb2i72EJkPJhr+hyqBfQyB2ZEFm+RWANsECczDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:38.441998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.06998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7d0bb58ca2ad4772e5dd76a9f28a9d3fff8de6d654df280f8e7be9d5df32acd","sha256:f596794311ab8f267b8fd71a72f06d438ca3b6c2288c6dd70f9461a42e897a62"],"state_sha256":"0a071c00f778b85503e36a5d5d39385524e88e46f7295b5e45a914e44eaa1fd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5cNvLzivEzmWj/GF7rGmTrcOrZFj3xUmGcSzBv5ErIOOI87SYb05Brg8Ej6Fal823tqur1kb2+v/oKlBxKx3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:51:49.657417Z","bundle_sha256":"ed7efa2a92903145ae96bec2f6312b06943512d6b1e6dab0fe7d88a146f602aa"}}