{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XHR2LPNDXKSW2GXDNO6V3HA36J","short_pith_number":"pith:XHR2LPND","canonical_record":{"source":{"id":"1504.04428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T02:52:45Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"633a41ba578cbf0a21eab2e95cbe51de6fea6bb60c28114cb16eff18a0ab4230","abstract_canon_sha256":"17fd7659dccf7b1eec3832d1f38d1bb01ab87b3fbba53d430be91454c49e7a51"},"schema_version":"1.0"},"canonical_sha256":"b9e3a5bda3baa56d1ae36bbd5d9c1bf267fece85e0f5fa64d0e935e1593dc25c","source":{"kind":"arxiv","id":"1504.04428","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04428","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04428v3","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04428","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"XHR2LPNDXKSW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XHR2LPNDXKSW2GXD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XHR2LPND","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XHR2LPNDXKSW2GXDNO6V3HA36J","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T02:52:45Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"633a41ba578cbf0a21eab2e95cbe51de6fea6bb60c28114cb16eff18a0ab4230","abstract_canon_sha256":"17fd7659dccf7b1eec3832d1f38d1bb01ab87b3fbba53d430be91454c49e7a51"},"schema_version":"1.0"},"canonical_sha256":"b9e3a5bda3baa56d1ae36bbd5d9c1bf267fece85e0f5fa64d0e935e1593dc25c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:06.529113Z","signature_b64":"lK+8Q+EH8p0zZfFT5fPsUyriTqaMUHF7TcIcnLRkvADKAT2w+DRpOpRQZ7LvMUP0wrANRKe3WR7e2ro4o4kFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9e3a5bda3baa56d1ae36bbd5d9c1bf267fece85e0f5fa64d0e935e1593dc25c","last_reissued_at":"2026-05-18T01:20:06.528444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:06.528444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04428","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:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7C5ZzYddVXTfKLQgRasaD/LQOQX6UEsYy94QgW8/pFUIpgT5voypM8KAvBfT/KV+srpHSfJlDMH6dXLDEE3VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:25.130518Z"},"content_sha256":"3a91e49fa7fafd4d22ee9e0340a5112eec0bb3f150254aef6b9c7b813a46e381","schema_version":"1.0","event_id":"sha256:3a91e49fa7fafd4d22ee9e0340a5112eec0bb3f150254aef6b9c7b813a46e381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XHR2LPNDXKSW2GXDNO6V3HA36J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Dynamic Multicast Scheduling for Cache-Enabled Content-Centric Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Bo Zhou, Meixia Tao, Ying Cui","submitted_at":"2015-04-17T02:52:45Z","abstract_excerpt":"Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing scheduling designs do not make full use of the advantages of the two approaches. In this paper, we consider the optimal dynamic multicast scheduling to jointly minimize the average delay, power, and fetching costs for cache-enabled content-centric wireless networks. We formulate this stochastic optimization problem as an infinite horizon average cost Markov decision process (MDP). It is well-known to be a difficult problem due to the curse of dime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04428","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:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvQDdaRq1hQe2PvDpz+vT5HOSH0lZUWE0//A5uM2GQY+7tFEUzXmvT1dGXRaL8/jbFIwT24U3+0Kgw/QvNxDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:25.131222Z"},"content_sha256":"36d00233f6881bd01f55e03eca81d8fb01fb1a5637bf788064d571b8eb3a073e","schema_version":"1.0","event_id":"sha256:36d00233f6881bd01f55e03eca81d8fb01fb1a5637bf788064d571b8eb3a073e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/bundle.json","state_url":"https://pith.science/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/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-25T17:58:25Z","links":{"resolver":"https://pith.science/pith/XHR2LPNDXKSW2GXDNO6V3HA36J","bundle":"https://pith.science/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/bundle.json","state":"https://pith.science/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHR2LPNDXKSW2GXDNO6V3HA36J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XHR2LPNDXKSW2GXDNO6V3HA36J","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":"17fd7659dccf7b1eec3832d1f38d1bb01ab87b3fbba53d430be91454c49e7a51","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T02:52:45Z","title_canon_sha256":"633a41ba578cbf0a21eab2e95cbe51de6fea6bb60c28114cb16eff18a0ab4230"},"schema_version":"1.0","source":{"id":"1504.04428","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04428","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04428v3","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04428","created_at":"2026-05-18T01:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"XHR2LPNDXKSW","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XHR2LPNDXKSW2GXD","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XHR2LPND","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:36d00233f6881bd01f55e03eca81d8fb01fb1a5637bf788064d571b8eb3a073e","target":"graph","created_at":"2026-05-18T01:20: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":"Caching and multicasting at base stations are two promising approaches to support massive content delivery over wireless networks. However, existing scheduling designs do not make full use of the advantages of the two approaches. In this paper, we consider the optimal dynamic multicast scheduling to jointly minimize the average delay, power, and fetching costs for cache-enabled content-centric wireless networks. We formulate this stochastic optimization problem as an infinite horizon average cost Markov decision process (MDP). It is well-known to be a difficult problem due to the curse of dime","authors_text":"Bo Zhou, Meixia Tao, Ying Cui","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T02:52:45Z","title":"Optimal Dynamic Multicast Scheduling for Cache-Enabled Content-Centric Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04428","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:3a91e49fa7fafd4d22ee9e0340a5112eec0bb3f150254aef6b9c7b813a46e381","target":"record","created_at":"2026-05-18T01:20: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":"17fd7659dccf7b1eec3832d1f38d1bb01ab87b3fbba53d430be91454c49e7a51","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-17T02:52:45Z","title_canon_sha256":"633a41ba578cbf0a21eab2e95cbe51de6fea6bb60c28114cb16eff18a0ab4230"},"schema_version":"1.0","source":{"id":"1504.04428","kind":"arxiv","version":3}},"canonical_sha256":"b9e3a5bda3baa56d1ae36bbd5d9c1bf267fece85e0f5fa64d0e935e1593dc25c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9e3a5bda3baa56d1ae36bbd5d9c1bf267fece85e0f5fa64d0e935e1593dc25c","first_computed_at":"2026-05-18T01:20:06.528444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:06.528444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lK+8Q+EH8p0zZfFT5fPsUyriTqaMUHF7TcIcnLRkvADKAT2w+DRpOpRQZ7LvMUP0wrANRKe3WR7e2ro4o4kFCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:06.529113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04428","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a91e49fa7fafd4d22ee9e0340a5112eec0bb3f150254aef6b9c7b813a46e381","sha256:36d00233f6881bd01f55e03eca81d8fb01fb1a5637bf788064d571b8eb3a073e"],"state_sha256":"d97a1ce64ef2454437363c539672b332f81da6b482cdac80561eeb171e20ac74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"St9MdZJKBLMJ2H83p9GDKjehP5kls1vSUYkvFkFsKY8SxB5MoopqixDVim4QvmhRwBzF683jtcx9YI2FZl6uCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:58:25.135237Z","bundle_sha256":"e50a1b0128e0d304d3dbbd0b6d181dd63c519d117d0be2d76f66b69dd6c89409"}}