{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6EOHOHO3DRF5GBDYI7DLDSC7CZ","short_pith_number":"pith:6EOHOHO3","schema_version":"1.0","canonical_sha256":"f11c771ddb1c4bd3047847c6b1c85f166040a4082f918298067aad6fe6eef959","source":{"kind":"arxiv","id":"1601.01526","version":1},"attestation_state":"computed","paper":{"title":"Delay-Aware Dynamic Resource Management for High-Speed Railway Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chao Shen, Gang Zhu, Shengfeng Xu, Shichao Li, Zhangdui Zhong","submitted_at":"2016-01-07T13:02:42Z","abstract_excerpt":"In this paper, we investigate the delay-aware dynamic resource management problem for multi-service transmission in high-speed railway wireless communications, with a focus on resource allocation among the services and power control along the time. By taking account of average delay requirements and power constraints, the considered problem is formulated into a stochastic optimization problem, rather than pursuing the traditional convex optimization means. Inspired by Lyapunov optimization theory, the intractable stochastic optimization problem is transformed into a tractable deterministic opt"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1601.01526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-07T13:02:42Z","cross_cats_sorted":[],"title_canon_sha256":"99dc0cd0514758cbfeeae2ecdd308151e474c930d67cb30674d8b78a33a25f8e","abstract_canon_sha256":"883d88dd04215b9f3a499dedc32991bdf653b3100b92fcb6ab4f1ae116d6803a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:13.389880Z","signature_b64":"+/NjwKmsJ+Fl7OMN8obKAI/Q6uJ4+GsXLaS9noMaFNl1sMOknqffo8sDdzccyfvgFDxT9LYX8sQVhc5lMW54DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f11c771ddb1c4bd3047847c6b1c85f166040a4082f918298067aad6fe6eef959","last_reissued_at":"2026-05-18T01:23:13.389262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:13.389262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay-Aware Dynamic Resource Management for High-Speed Railway Wireless Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chao Shen, Gang Zhu, Shengfeng Xu, Shichao Li, Zhangdui Zhong","submitted_at":"2016-01-07T13:02:42Z","abstract_excerpt":"In this paper, we investigate the delay-aware dynamic resource management problem for multi-service transmission in high-speed railway wireless communications, with a focus on resource allocation among the services and power control along the time. By taking account of average delay requirements and power constraints, the considered problem is formulated into a stochastic optimization problem, rather than pursuing the traditional convex optimization means. Inspired by Lyapunov optimization theory, the intractable stochastic optimization problem is transformed into a tractable deterministic opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01526","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.01526","created_at":"2026-05-18T01:23:13.389355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01526v1","created_at":"2026-05-18T01:23:13.389355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01526","created_at":"2026-05-18T01:23:13.389355+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EOHOHO3DRF5","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EOHOHO3DRF5GBDY","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EOHOHO3","created_at":"2026-05-18T12:30:01.593930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ","json":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ.json","graph_json":"https://pith.science/api/pith-number/6EOHOHO3DRF5GBDYI7DLDSC7CZ/graph.json","events_json":"https://pith.science/api/pith-number/6EOHOHO3DRF5GBDYI7DLDSC7CZ/events.json","paper":"https://pith.science/paper/6EOHOHO3"},"agent_actions":{"view_html":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ","download_json":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ.json","view_paper":"https://pith.science/paper/6EOHOHO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01526&json=true","fetch_graph":"https://pith.science/api/pith-number/6EOHOHO3DRF5GBDYI7DLDSC7CZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6EOHOHO3DRF5GBDYI7DLDSC7CZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ/action/storage_attestation","attest_author":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ/action/author_attestation","sign_citation":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ/action/citation_signature","submit_replication":"https://pith.science/pith/6EOHOHO3DRF5GBDYI7DLDSC7CZ/action/replication_record"}},"created_at":"2026-05-18T01:23:13.389355+00:00","updated_at":"2026-05-18T01:23:13.389355+00:00"}