{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FFHTGIOI23SO7KQLQWQLC7UXNZ","short_pith_number":"pith:FFHTGIOI","canonical_record":{"source":{"id":"1811.00957","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-02T16:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"d6a26ce2a223a45c656e6a9fe1034198bc2b3b9fb13901d690dc323eb2ca2a12","abstract_canon_sha256":"9f118a5a956a02b733b8e247980193f1a25ff84bb8543261f7729ce9ff02081e"},"schema_version":"1.0"},"canonical_sha256":"294f3321c8d6e4efaa0b85a0b17e976e479cccf0b6bc62465dfdbb35bdec847b","source":{"kind":"arxiv","id":"1811.00957","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00957","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00957v4","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00957","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"FFHTGIOI23SO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FFHTGIOI23SO7KQL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FFHTGIOI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FFHTGIOI23SO7KQLQWQLC7UXNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00957","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-02T16:12:09Z","cross_cats_sorted":[],"title_canon_sha256":"d6a26ce2a223a45c656e6a9fe1034198bc2b3b9fb13901d690dc323eb2ca2a12","abstract_canon_sha256":"9f118a5a956a02b733b8e247980193f1a25ff84bb8543261f7729ce9ff02081e"},"schema_version":"1.0"},"canonical_sha256":"294f3321c8d6e4efaa0b85a0b17e976e479cccf0b6bc62465dfdbb35bdec847b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.863412Z","signature_b64":"PY4RtzWkxKAJCzJ558VqUuKkLvh4az++EcuM0h4pofhy/Pa56/wstMf766qsxhKRbqUukYX0D6BLliHTsM9cBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"294f3321c8d6e4efaa0b85a0b17e976e479cccf0b6bc62465dfdbb35bdec847b","last_reissued_at":"2026-05-17T23:42:49.862928Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.862928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00957","source_version":4,"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nk/rdT4qNhi27yUPTCnzunCeMhcuNqKjiW9eqL5rt3NtL/94+knj21H5s2VUWuYLBH7Fm/55yfTOShxfEVSFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:32.484898Z"},"content_sha256":"a5475ef55f903079de13b9af409a02bf45061b3c927ff7f81edefa9109cca9a0","schema_version":"1.0","event_id":"sha256:a5475ef55f903079de13b9af409a02bf45061b3c927ff7f81edefa9109cca9a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FFHTGIOI23SO7KQLQWQLC7UXNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Resource Allocation in IEEE 802.11ax Uplink OFDMA with Scheduled Access","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Boris Bellalta, Konstantinos Dovelos","submitted_at":"2018-11-02T16:12:09Z","abstract_excerpt":"We consider the scheduling and resource allocation problem in AP-initiated uplink OFDMA transmissions of IEEE 802.11ax networks. The uplink OFDMA resource allocation problem is known to be non-convex and difficult to solve in general. However, due to the special subcarrier allocation model of IEEE 802.11ax, the utility maximization problem involving the instantaneous rates of stations can be formulated as an assignment problem, and hence can be solved using the Hungarian method. In this paper, we address the more general problem of stochastic network utility maximization. Specifically, we maxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00957","kind":"arxiv","version":4},"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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9C8feouNPJacdKrxdCNDTgtNE6e5jZZjIpDIssIwyhSwRTaYnfS6Mc/RalokUWZj4Ow1G7+4RQLMbsG8yTbTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:33:32.485602Z"},"content_sha256":"2d04fcb4be174da2210ccc07842b0194a3361b5943c7462c207bdefdd003d8cb","schema_version":"1.0","event_id":"sha256:2d04fcb4be174da2210ccc07842b0194a3361b5943c7462c207bdefdd003d8cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/bundle.json","state_url":"https://pith.science/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/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-08T01:33:32Z","links":{"resolver":"https://pith.science/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ","bundle":"https://pith.science/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/bundle.json","state":"https://pith.science/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FFHTGIOI23SO7KQLQWQLC7UXNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FFHTGIOI23SO7KQLQWQLC7UXNZ","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":"9f118a5a956a02b733b8e247980193f1a25ff84bb8543261f7729ce9ff02081e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-02T16:12:09Z","title_canon_sha256":"d6a26ce2a223a45c656e6a9fe1034198bc2b3b9fb13901d690dc323eb2ca2a12"},"schema_version":"1.0","source":{"id":"1811.00957","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00957","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00957v4","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00957","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"FFHTGIOI23SO","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FFHTGIOI23SO7KQL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FFHTGIOI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:2d04fcb4be174da2210ccc07842b0194a3361b5943c7462c207bdefdd003d8cb","target":"graph","created_at":"2026-05-17T23:42:49Z","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 consider the scheduling and resource allocation problem in AP-initiated uplink OFDMA transmissions of IEEE 802.11ax networks. The uplink OFDMA resource allocation problem is known to be non-convex and difficult to solve in general. However, due to the special subcarrier allocation model of IEEE 802.11ax, the utility maximization problem involving the instantaneous rates of stations can be formulated as an assignment problem, and hence can be solved using the Hungarian method. In this paper, we address the more general problem of stochastic network utility maximization. Specifically, we maxi","authors_text":"Boris Bellalta, Konstantinos Dovelos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-02T16:12:09Z","title":"Optimal Resource Allocation in IEEE 802.11ax Uplink OFDMA with Scheduled Access"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00957","kind":"arxiv","version":4},"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:a5475ef55f903079de13b9af409a02bf45061b3c927ff7f81edefa9109cca9a0","target":"record","created_at":"2026-05-17T23:42:49Z","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":"9f118a5a956a02b733b8e247980193f1a25ff84bb8543261f7729ce9ff02081e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-02T16:12:09Z","title_canon_sha256":"d6a26ce2a223a45c656e6a9fe1034198bc2b3b9fb13901d690dc323eb2ca2a12"},"schema_version":"1.0","source":{"id":"1811.00957","kind":"arxiv","version":4}},"canonical_sha256":"294f3321c8d6e4efaa0b85a0b17e976e479cccf0b6bc62465dfdbb35bdec847b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"294f3321c8d6e4efaa0b85a0b17e976e479cccf0b6bc62465dfdbb35bdec847b","first_computed_at":"2026-05-17T23:42:49.862928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.862928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PY4RtzWkxKAJCzJ558VqUuKkLvh4az++EcuM0h4pofhy/Pa56/wstMf766qsxhKRbqUukYX0D6BLliHTsM9cBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.863412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00957","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5475ef55f903079de13b9af409a02bf45061b3c927ff7f81edefa9109cca9a0","sha256:2d04fcb4be174da2210ccc07842b0194a3361b5943c7462c207bdefdd003d8cb"],"state_sha256":"bdaf5da116130c70bf7c7a600dc1d80fe429d06266f7f2ad8e134f3ab7d06ef2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pMpHvU1U7DRhiiIQc/PPPl2L5W+ISD1VdnWCLQ6/MGEkoKMh8n+OxysKsbr5UvRNk6WykqinsG6kul1qF8TMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:33:32.489624Z","bundle_sha256":"63b65d927686019c2f4ef8c4fddf4e95e63ef00c48854db933ef31dbbc5b720f"}}