{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FORRGGGGCA4LJH3KUIUDH6ON2J","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":"c273cfed0533aa6e24f9c3c770152a74ff3cee0a91ba857e84b7a38d7c8d3a13","cross_cats_sorted":["cs.NI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-04T19:50:39Z","title_canon_sha256":"de3062e09d44963d9d3a901137d9dc91a9feb4634a92ddfb257b1f9f232331c3"},"schema_version":"1.0","source":{"id":"2301.01801","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.01801","created_at":"2026-07-05T05:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"2301.01801v2","created_at":"2026-07-05T05:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.01801","created_at":"2026-07-05T05:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"FORRGGGGCA4L","created_at":"2026-07-05T05:31:04Z"},{"alias_kind":"pith_short_16","alias_value":"FORRGGGGCA4LJH3K","created_at":"2026-07-05T05:31:04Z"},{"alias_kind":"pith_short_8","alias_value":"FORRGGGG","created_at":"2026-07-05T05:31:04Z"}],"graph_snapshots":[{"event_id":"sha256:0c3cb11bdae2c1ac3bd577541210e0112bb90d52aab6914267d6e360ba7a1e3e","target":"graph","created_at":"2026-07-05T05:31:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.01801/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fair resource allocation is one of the most important topics in communication networks. Existing solutions almost exclusively assume each user utility function is known and concave. This paper seeks to answer the following question: how to allocate resources when utility functions are unknown, even to the users? This answer has become increasingly important in the next-generation AI-aware communication networks where the user utilities are complex and their closed-forms are hard to obtain. In this paper, we provide a new solution using a distributed and data-driven bilevel optimization approac","authors_text":"Kaiyi Ji, Lei Ying","cross_cats":["cs.NI","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-04T19:50:39Z","title":"Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.01801","kind":"arxiv","version":2},"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:844eef2978a61b69d0e2421e3fd4a2d8c5acdcbb726292fd6a304c74d90a6238","target":"record","created_at":"2026-07-05T05:31:04Z","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":"c273cfed0533aa6e24f9c3c770152a74ff3cee0a91ba857e84b7a38d7c8d3a13","cross_cats_sorted":["cs.NI","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-01-04T19:50:39Z","title_canon_sha256":"de3062e09d44963d9d3a901137d9dc91a9feb4634a92ddfb257b1f9f232331c3"},"schema_version":"1.0","source":{"id":"2301.01801","kind":"arxiv","version":2}},"canonical_sha256":"2ba31318c61038b49f6aa22833f9cdd24fab6ca25feb877077c88886a4e260ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ba31318c61038b49f6aa22833f9cdd24fab6ca25feb877077c88886a4e260ff","first_computed_at":"2026-07-05T05:31:04.688353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:04.688353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/paBo8163hU7UOxhTGm6so7k2Fmxrani9PvUybBZ64N9KV3xTXaVeVhzp2mP7y9uZ5qaeun9TrfxR6dGO5lsCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:04.688766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.01801","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:844eef2978a61b69d0e2421e3fd4a2d8c5acdcbb726292fd6a304c74d90a6238","sha256:0c3cb11bdae2c1ac3bd577541210e0112bb90d52aab6914267d6e360ba7a1e3e"],"state_sha256":"136aca5bacd351c5bd22f8c29681d438785fa750829dac1b8b3631b66dbff73f"}