{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CN7IMAKB5GPHBFAXAEVYSINQOS","short_pith_number":"pith:CN7IMAKB","canonical_record":{"source":{"id":"1701.04596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T09:49:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e9a51f8bf4611e1caa18f6ac5b593e64299df1f2eaa26c883359a4b7846b354","abstract_canon_sha256":"91909d89c8e71924fa3dd9077f9c1f3b9c18af19c7b7ad268a97b06f70fc9c99"},"schema_version":"1.0"},"canonical_sha256":"137e860141e99e709417012b8921b0748f42075f322b4addbd876b1161675b83","source":{"kind":"arxiv","id":"1701.04596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04596","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04596v1","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04596","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"CN7IMAKB5GPH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CN7IMAKB5GPHBFAX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CN7IMAKB","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CN7IMAKB5GPHBFAXAEVYSINQOS","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T09:49:00Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e9a51f8bf4611e1caa18f6ac5b593e64299df1f2eaa26c883359a4b7846b354","abstract_canon_sha256":"91909d89c8e71924fa3dd9077f9c1f3b9c18af19c7b7ad268a97b06f70fc9c99"},"schema_version":"1.0"},"canonical_sha256":"137e860141e99e709417012b8921b0748f42075f322b4addbd876b1161675b83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:33.688684Z","signature_b64":"ziRdinIUowExt+HgCSruEh2UFFE05wAlgcVn2wHe0BvA1Szmvk825p2YppntUq4b20mP1UyQR6wvGZaMrnhsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"137e860141e99e709417012b8921b0748f42075f322b4addbd876b1161675b83","last_reissued_at":"2026-05-18T00:52:33.688270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:33.688270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04596","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nQK5n77Y7uj7BPMZappkqukqjBNK+KjoDS4qE6JS4SDulh7D4iUj15y6HlMFekgFoo6yGk4wwIKtzlZlOLcuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:04:06.005310Z"},"content_sha256":"a4279dcd21ea1e40eed33ff033f885e2bdd91650a4dc29ce4c52de60759bbaa5","schema_version":"1.0","event_id":"sha256:a4279dcd21ea1e40eed33ff033f885e2bdd91650a4dc29ce4c52de60759bbaa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CN7IMAKB5GPHBFAXAEVYSINQOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Caching and Scheduling for Cache-enabled D2D Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Binqiang Chen, Chenyang Yang, Zixiang Xiong","submitted_at":"2017-01-17T09:49:00Z","abstract_excerpt":"To maximize offloading gain of cache-enabled device-to-device (D2D) communications, content placement and delivery should be jointly designed. In this letter, we jointly optimize caching and scheduling policies to maximize successful offloading probability, defined as the probability that a user can obtain desired file in local cache or via D2D link with data rate larger than a given threshold. We obtain the optimal scheduling factor for a random scheduling policy that can control interference in a distributed manner, and a low complexity solution to compute caching distribution. We show that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04596","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:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dvPe9t4RB1g4BwzMvN3iZuVWq6B6js2j2rF1ii/xknRZQeVqC03sEiNNV+OQ+aXs5ci5WVAne16AuBEX1tvlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:04:06.005700Z"},"content_sha256":"6db19ecee97f80e55642646ce82ab45f00994ccb70b26c41207e29977cbcb375","schema_version":"1.0","event_id":"sha256:6db19ecee97f80e55642646ce82ab45f00994ccb70b26c41207e29977cbcb375"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/bundle.json","state_url":"https://pith.science/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/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-28T16:04:06Z","links":{"resolver":"https://pith.science/pith/CN7IMAKB5GPHBFAXAEVYSINQOS","bundle":"https://pith.science/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/bundle.json","state":"https://pith.science/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CN7IMAKB5GPHBFAXAEVYSINQOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CN7IMAKB5GPHBFAXAEVYSINQOS","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":"91909d89c8e71924fa3dd9077f9c1f3b9c18af19c7b7ad268a97b06f70fc9c99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T09:49:00Z","title_canon_sha256":"7e9a51f8bf4611e1caa18f6ac5b593e64299df1f2eaa26c883359a4b7846b354"},"schema_version":"1.0","source":{"id":"1701.04596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04596","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04596v1","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04596","created_at":"2026-05-18T00:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"CN7IMAKB5GPH","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CN7IMAKB5GPHBFAX","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CN7IMAKB","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:6db19ecee97f80e55642646ce82ab45f00994ccb70b26c41207e29977cbcb375","target":"graph","created_at":"2026-05-18T00:52:33Z","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":"To maximize offloading gain of cache-enabled device-to-device (D2D) communications, content placement and delivery should be jointly designed. In this letter, we jointly optimize caching and scheduling policies to maximize successful offloading probability, defined as the probability that a user can obtain desired file in local cache or via D2D link with data rate larger than a given threshold. We obtain the optimal scheduling factor for a random scheduling policy that can control interference in a distributed manner, and a low complexity solution to compute caching distribution. We show that ","authors_text":"Binqiang Chen, Chenyang Yang, Zixiang Xiong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T09:49:00Z","title":"Optimal Caching and Scheduling for Cache-enabled D2D Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04596","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:a4279dcd21ea1e40eed33ff033f885e2bdd91650a4dc29ce4c52de60759bbaa5","target":"record","created_at":"2026-05-18T00:52:33Z","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":"91909d89c8e71924fa3dd9077f9c1f3b9c18af19c7b7ad268a97b06f70fc9c99","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-17T09:49:00Z","title_canon_sha256":"7e9a51f8bf4611e1caa18f6ac5b593e64299df1f2eaa26c883359a4b7846b354"},"schema_version":"1.0","source":{"id":"1701.04596","kind":"arxiv","version":1}},"canonical_sha256":"137e860141e99e709417012b8921b0748f42075f322b4addbd876b1161675b83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"137e860141e99e709417012b8921b0748f42075f322b4addbd876b1161675b83","first_computed_at":"2026-05-18T00:52:33.688270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:33.688270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ziRdinIUowExt+HgCSruEh2UFFE05wAlgcVn2wHe0BvA1Szmvk825p2YppntUq4b20mP1UyQR6wvGZaMrnhsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:33.688684Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4279dcd21ea1e40eed33ff033f885e2bdd91650a4dc29ce4c52de60759bbaa5","sha256:6db19ecee97f80e55642646ce82ab45f00994ccb70b26c41207e29977cbcb375"],"state_sha256":"24075b9ef8a115a7fb518a103f1d417e1c66416c6033bc802951f359ab59fe40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHc//OUAUvjVR06K4GMsFjUopOCgAJ94rtPlA7fM7KECA8y1qeBN2mn/fIn4grKxnAjA3TUGRyDA2xNIygQGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:04:06.007714Z","bundle_sha256":"d7f21b972762060e0991d47e3640e4c70818aa187ad6b400c8b90350c91e87e2"}}