{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4PWTAOH3AOZVFRVBJ66XAVRYDP","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":"325a9234b5c808a6b3a3107c73587d0f153a7173bb7d9e9fcf5ccd526d84e979","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T16:07:18Z","title_canon_sha256":"5795a10552562a0794f394ece82fd20752257ba79ffae6958cb5ca05846dfa30"},"schema_version":"1.0","source":{"id":"1710.09318","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09318","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09318v6","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09318","created_at":"2026-05-18T00:20:21Z"},{"alias_kind":"pith_short_12","alias_value":"4PWTAOH3AOZV","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4PWTAOH3AOZVFRVB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4PWTAOH3","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:60b5e2302314ff869677ca92227ae7b1f4a6a07d0d006db6b41ec83542d39f76","target":"graph","created_at":"2026-05-18T00:20:21Z","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":"We propose a learning algorithm for cell-load approximation in wireless networks. The proposed algorithm is robust in the sense that it is designed to cope with the uncertainty arising from a small number of training samples. This scenario is highly relevant in wireless networks where training has to be performed on short time scales because of a fast time-varying communication environment. The first part of this work studies the set of feasible rates and shows that this set is compact. We then prove that the mapping relating a feasible rate vector to the unique fixed point of the non-linear c","authors_text":"Daniyal Amir Awan, Renato L.G. Cavalcante, Slawomir Stanczak","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T16:07:18Z","title":"A robust machine learning method for cell-load approximation in wireless networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09318","kind":"arxiv","version":6},"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:27a83ac62299ce3077105b0b9a5f973008f953ec5ff95c61ad1a2b39690f4da0","target":"record","created_at":"2026-05-18T00:20:21Z","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":"325a9234b5c808a6b3a3107c73587d0f153a7173bb7d9e9fcf5ccd526d84e979","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T16:07:18Z","title_canon_sha256":"5795a10552562a0794f394ece82fd20752257ba79ffae6958cb5ca05846dfa30"},"schema_version":"1.0","source":{"id":"1710.09318","kind":"arxiv","version":6}},"canonical_sha256":"e3ed3038fb03b352c6a14fbd7056381bf894972b544fadfeee017b7fc3bcc616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ed3038fb03b352c6a14fbd7056381bf894972b544fadfeee017b7fc3bcc616","first_computed_at":"2026-05-18T00:20:21.964723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:21.964723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CfN2NUq2uBJt6lrR/XLzH0EsikMUP1pwcUvoDtHQI9STpJNj6LnbX3+J2qvWQww/2hxnK6vxw5M6qfb6hXi6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:21.965331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09318","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a83ac62299ce3077105b0b9a5f973008f953ec5ff95c61ad1a2b39690f4da0","sha256:60b5e2302314ff869677ca92227ae7b1f4a6a07d0d006db6b41ec83542d39f76"],"state_sha256":"66d02d1d34f8910129959eaf4b88fac6155d45c755d99ab4bae7a6cf677edf6d"}