{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PLBEOE4LWWGDMQMY3KBE3NNJNC","short_pith_number":"pith:PLBEOE4L","schema_version":"1.0","canonical_sha256":"7ac247138bb58c364198da824db5a968a4c4788ece2e06d936010c5e3832680a","source":{"kind":"arxiv","id":"1811.09946","version":1},"attestation_state":"computed","paper":{"title":"A Learning Approach to Wi-Fi Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernardo A. Huberman, Thomas Sandholm","submitted_at":"2018-11-25T05:26:45Z","abstract_excerpt":"We show experimentally that workload-based AP-STA associations can improve system throughput significantly. We present a predictive model that guides optimal resource allocations in dense Wi-Fi networks and achieves 72-77% of the optimal throughput with varying training data set sizes using a 3-day trace of real cable modem traffic."},"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":"1811.09946","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-25T05:26:45Z","cross_cats_sorted":[],"title_canon_sha256":"2933eb83de53e881b34a07f74b40d1ea81c84b06d8f4a23e937fe81a9c739ae5","abstract_canon_sha256":"e041be8c7a5269e38da40161a8a102780e53755058609dd85e3b5d179db89bc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:59.027118Z","signature_b64":"KMNzOnksC+t8qnj8lxVr7k9BQwodMVsujTE718mhdDWZNSV/GaoU8t85ZRzQWKQPd87DJpNP0jrNUqrB37nUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac247138bb58c364198da824db5a968a4c4788ece2e06d936010c5e3832680a","last_reissued_at":"2026-05-17T23:59:59.026570Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:59.026570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Learning Approach to Wi-Fi Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernardo A. Huberman, Thomas Sandholm","submitted_at":"2018-11-25T05:26:45Z","abstract_excerpt":"We show experimentally that workload-based AP-STA associations can improve system throughput significantly. We present a predictive model that guides optimal resource allocations in dense Wi-Fi networks and achieves 72-77% of the optimal throughput with varying training data set sizes using a 3-day trace of real cable modem traffic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09946","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":"1811.09946","created_at":"2026-05-17T23:59:59.026669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.09946v1","created_at":"2026-05-17T23:59:59.026669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09946","created_at":"2026-05-17T23:59:59.026669+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLBEOE4LWWGD","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLBEOE4LWWGDMQMY","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLBEOE4L","created_at":"2026-05-18T12:32:46.962924+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/PLBEOE4LWWGDMQMY3KBE3NNJNC","json":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC.json","graph_json":"https://pith.science/api/pith-number/PLBEOE4LWWGDMQMY3KBE3NNJNC/graph.json","events_json":"https://pith.science/api/pith-number/PLBEOE4LWWGDMQMY3KBE3NNJNC/events.json","paper":"https://pith.science/paper/PLBEOE4L"},"agent_actions":{"view_html":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC","download_json":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC.json","view_paper":"https://pith.science/paper/PLBEOE4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.09946&json=true","fetch_graph":"https://pith.science/api/pith-number/PLBEOE4LWWGDMQMY3KBE3NNJNC/graph.json","fetch_events":"https://pith.science/api/pith-number/PLBEOE4LWWGDMQMY3KBE3NNJNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC/action/storage_attestation","attest_author":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC/action/author_attestation","sign_citation":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC/action/citation_signature","submit_replication":"https://pith.science/pith/PLBEOE4LWWGDMQMY3KBE3NNJNC/action/replication_record"}},"created_at":"2026-05-17T23:59:59.026669+00:00","updated_at":"2026-05-17T23:59:59.026669+00:00"}