{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RNZVGIORCNBCTXEEUGU7YXQRDJ","short_pith_number":"pith:RNZVGIOR","canonical_record":{"source":{"id":"1709.04791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T13:42:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e9589f94df859843f8527fcc345e377eea786c90ac56c3c5ec4772d29212be4","abstract_canon_sha256":"49ba2d839adfdb930c28a0f48410f2ad9803c2749c6a2eb0a57ed427b9798707"},"schema_version":"1.0"},"canonical_sha256":"8b735321d1134229dc84a1a9fc5e111a7ca12885124bff1134e9dd02134d99d9","source":{"kind":"arxiv","id":"1709.04791","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04791","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04791v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04791","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"RNZVGIORCNBC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNZVGIORCNBCTXEE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNZVGIOR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RNZVGIORCNBCTXEEUGU7YXQRDJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04791","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T13:42:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e9589f94df859843f8527fcc345e377eea786c90ac56c3c5ec4772d29212be4","abstract_canon_sha256":"49ba2d839adfdb930c28a0f48410f2ad9803c2749c6a2eb0a57ed427b9798707"},"schema_version":"1.0"},"canonical_sha256":"8b735321d1134229dc84a1a9fc5e111a7ca12885124bff1134e9dd02134d99d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.164885Z","signature_b64":"zt7sARkhyYeKMSUmgwLsuDEFLx7mbNWXWfUuOXbk07Hjv1yb+CD9Py7jXoaTAuZOvb4GEc//ELcPL0ML1AThAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b735321d1134229dc84a1a9fc5e111a7ca12885124bff1134e9dd02134d99d9","last_reissued_at":"2026-05-18T00:35:10.164371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.164371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04791","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XV7wYUiOdkbdr3VUpfKUOrrnWWBB/nB9MEMGQq4spNJ04fDeZFObogzGiqDwoBvMcBZY+37lD61QL1Djr7ZVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:57:15.691048Z"},"content_sha256":"2dd594dcf824488d89248c221be8964d5276acf4ff11b559ed8a4886ce5e2187","schema_version":"1.0","event_id":"sha256:2dd594dcf824488d89248c221be8964d5276acf4ff11b559ed8a4886ce5e2187"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RNZVGIORCNBCTXEEUGU7YXQRDJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation in Cloud Radio Access Networks with Device-to-Device Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongyu Xiang, Mugen Peng, Xiaodong Ji, Yaohua Sun, Yitao Mo","submitted_at":"2017-09-14T13:42:30Z","abstract_excerpt":"To alleviate the burdens on the fronthaul and reduce the transmit latency, the device-to-device (D2D) communication is presented in cloud radio access networks (C-RANs). Considering dynamic traffic arrivals and time-varying channel conditions, the resource allocation in C-RANs with D2D is formulated into a stochastic optimization problem, which is aimed at maximizing the overall throughput subject to network stability, interference, and fronthaul capacity constraints. Leveraging on the Lyapunov optimization technique, the stochastic optimization problem is transformed into a delay-aware optimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04791","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:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3fjqNKis7xXdaOShElpmpvZZBFFmxKtGfCJmBLM3NuOOcBJ+Ymw0YSXZymPpMcmdUl2W+9HPF71UYxyZbPwkBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:57:15.691476Z"},"content_sha256":"be6172d5c2cc0bdbf329e2235aa60a9619499dd5e73e499e16214b246257ca37","schema_version":"1.0","event_id":"sha256:be6172d5c2cc0bdbf329e2235aa60a9619499dd5e73e499e16214b246257ca37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/bundle.json","state_url":"https://pith.science/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/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-06-06T11:57:15Z","links":{"resolver":"https://pith.science/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ","bundle":"https://pith.science/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/bundle.json","state":"https://pith.science/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNZVGIORCNBCTXEEUGU7YXQRDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RNZVGIORCNBCTXEEUGU7YXQRDJ","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":"49ba2d839adfdb930c28a0f48410f2ad9803c2749c6a2eb0a57ed427b9798707","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T13:42:30Z","title_canon_sha256":"5e9589f94df859843f8527fcc345e377eea786c90ac56c3c5ec4772d29212be4"},"schema_version":"1.0","source":{"id":"1709.04791","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04791","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04791v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04791","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"RNZVGIORCNBC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RNZVGIORCNBCTXEE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RNZVGIOR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:be6172d5c2cc0bdbf329e2235aa60a9619499dd5e73e499e16214b246257ca37","target":"graph","created_at":"2026-05-18T00:35: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":"To alleviate the burdens on the fronthaul and reduce the transmit latency, the device-to-device (D2D) communication is presented in cloud radio access networks (C-RANs). Considering dynamic traffic arrivals and time-varying channel conditions, the resource allocation in C-RANs with D2D is formulated into a stochastic optimization problem, which is aimed at maximizing the overall throughput subject to network stability, interference, and fronthaul capacity constraints. Leveraging on the Lyapunov optimization technique, the stochastic optimization problem is transformed into a delay-aware optimi","authors_text":"Hongyu Xiang, Mugen Peng, Xiaodong Ji, Yaohua Sun, Yitao Mo","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T13:42:30Z","title":"Resource Allocation in Cloud Radio Access Networks with Device-to-Device Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04791","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:2dd594dcf824488d89248c221be8964d5276acf4ff11b559ed8a4886ce5e2187","target":"record","created_at":"2026-05-18T00:35: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":"49ba2d839adfdb930c28a0f48410f2ad9803c2749c6a2eb0a57ed427b9798707","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-14T13:42:30Z","title_canon_sha256":"5e9589f94df859843f8527fcc345e377eea786c90ac56c3c5ec4772d29212be4"},"schema_version":"1.0","source":{"id":"1709.04791","kind":"arxiv","version":1}},"canonical_sha256":"8b735321d1134229dc84a1a9fc5e111a7ca12885124bff1134e9dd02134d99d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b735321d1134229dc84a1a9fc5e111a7ca12885124bff1134e9dd02134d99d9","first_computed_at":"2026-05-18T00:35:10.164371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.164371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zt7sARkhyYeKMSUmgwLsuDEFLx7mbNWXWfUuOXbk07Hjv1yb+CD9Py7jXoaTAuZOvb4GEc//ELcPL0ML1AThAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.164885Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04791","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dd594dcf824488d89248c221be8964d5276acf4ff11b559ed8a4886ce5e2187","sha256:be6172d5c2cc0bdbf329e2235aa60a9619499dd5e73e499e16214b246257ca37"],"state_sha256":"1e4799e6b27f2dcd3eb22705bc2400eae9616edb00351dadf21b95754af7734b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPo/hnLXbKijjse04SxIVt1RXtwFk8QJqMx5ttVd0CILoW57wfKn2Kls009eQj6kdPAJroKJRE6aXlRXharyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:57:15.694712Z","bundle_sha256":"25ac5bd7ac36f34ebb19de5e6bee862b5e1e733c0470b62c521940bf5aa915b6"}}