{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4PWTAOH3AOZVFRVBJ66XAVRYDP","short_pith_number":"pith:4PWTAOH3","schema_version":"1.0","canonical_sha256":"e3ed3038fb03b352c6a14fbd7056381bf894972b544fadfeee017b7fc3bcc616","source":{"kind":"arxiv","id":"1710.09318","version":6},"attestation_state":"computed","paper":{"title":"A robust machine learning method for cell-load approximation in wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniyal Amir Awan, Renato L.G. Cavalcante, Slawomir Stanczak","submitted_at":"2017-10-25T16:07:18Z","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"},"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":"1710.09318","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-25T16:07:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5795a10552562a0794f394ece82fd20752257ba79ffae6958cb5ca05846dfa30","abstract_canon_sha256":"325a9234b5c808a6b3a3107c73587d0f153a7173bb7d9e9fcf5ccd526d84e979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:21.965331Z","signature_b64":"CfN2NUq2uBJt6lrR/XLzH0EsikMUP1pwcUvoDtHQI9STpJNj6LnbX3+J2qvWQww/2hxnK6vxw5M6qfb6hXi6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ed3038fb03b352c6a14fbd7056381bf894972b544fadfeee017b7fc3bcc616","last_reissued_at":"2026-05-18T00:20:21.964723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:21.964723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust machine learning method for cell-load approximation in wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Daniyal Amir Awan, Renato L.G. Cavalcante, Slawomir Stanczak","submitted_at":"2017-10-25T16:07:18Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09318","kind":"arxiv","version":6},"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":"1710.09318","created_at":"2026-05-18T00:20:21.964804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09318v6","created_at":"2026-05-18T00:20:21.964804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09318","created_at":"2026-05-18T00:20:21.964804+00:00"},{"alias_kind":"pith_short_12","alias_value":"4PWTAOH3AOZV","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4PWTAOH3AOZVFRVB","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4PWTAOH3","created_at":"2026-05-18T12:31:00.734936+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/4PWTAOH3AOZVFRVBJ66XAVRYDP","json":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP.json","graph_json":"https://pith.science/api/pith-number/4PWTAOH3AOZVFRVBJ66XAVRYDP/graph.json","events_json":"https://pith.science/api/pith-number/4PWTAOH3AOZVFRVBJ66XAVRYDP/events.json","paper":"https://pith.science/paper/4PWTAOH3"},"agent_actions":{"view_html":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP","download_json":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP.json","view_paper":"https://pith.science/paper/4PWTAOH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09318&json=true","fetch_graph":"https://pith.science/api/pith-number/4PWTAOH3AOZVFRVBJ66XAVRYDP/graph.json","fetch_events":"https://pith.science/api/pith-number/4PWTAOH3AOZVFRVBJ66XAVRYDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP/action/storage_attestation","attest_author":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP/action/author_attestation","sign_citation":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP/action/citation_signature","submit_replication":"https://pith.science/pith/4PWTAOH3AOZVFRVBJ66XAVRYDP/action/replication_record"}},"created_at":"2026-05-18T00:20:21.964804+00:00","updated_at":"2026-05-18T00:20:21.964804+00:00"}