{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ANWPZ3PZ45GXU3XBJPJE6LWPGQ","short_pith_number":"pith:ANWPZ3PZ","schema_version":"1.0","canonical_sha256":"036cfcedf9e74d7a6ee14bd24f2ecf3414f6e87c381bbc8767f51d2b6a97e3d3","source":{"kind":"arxiv","id":"1802.02932","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for the Fair Resource Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"J\\'er\\'emie Leguay, Konstantin Avrachenkov, Lorenzo Maggi, Zaid Allybokus","submitted_at":"2018-02-08T15:44:59Z","abstract_excerpt":"The $\\alpha$-fair resource allocation problem has received remarkable attention and has been studied in numerous application fields. Several algorithms have been proposed in the context of $\\alpha$-fair resource sharing to distributively compute its value. However, little work has been done on its structural properties. In this work, we present a lower bound for the optimal solution of the weighted $\\alpha$-fair resource allocation problem and compare it with existing propositions in the literature. Our derivations rely on a localization property verified by optimization problems with separabl"},"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":"1802.02932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-02-08T15:44:59Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8e476baa7873716722a7963f6e2ae4a56893740fb83c685bed187525ac8c81a6","abstract_canon_sha256":"908e5efa50967c0cab02eeac52af19d0e483638d154d49aa8505c5ca6165bc14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.775171Z","signature_b64":"aKWnVBYr0Ktcshi2xBTHkhVh8vSigrH3t84XUw8wKS7S81xooyUicgaZr6SBPZa5Pci17z6GsmBTathbTWjfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"036cfcedf9e74d7a6ee14bd24f2ecf3414f6e87c381bbc8767f51d2b6a97e3d3","last_reissued_at":"2026-05-18T00:24:02.774769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.774769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for the Fair Resource Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NI","authors_text":"J\\'er\\'emie Leguay, Konstantin Avrachenkov, Lorenzo Maggi, Zaid Allybokus","submitted_at":"2018-02-08T15:44:59Z","abstract_excerpt":"The $\\alpha$-fair resource allocation problem has received remarkable attention and has been studied in numerous application fields. Several algorithms have been proposed in the context of $\\alpha$-fair resource sharing to distributively compute its value. However, little work has been done on its structural properties. In this work, we present a lower bound for the optimal solution of the weighted $\\alpha$-fair resource allocation problem and compare it with existing propositions in the literature. Our derivations rely on a localization property verified by optimization problems with separabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02932","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":"1802.02932","created_at":"2026-05-18T00:24:02.774831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02932v1","created_at":"2026-05-18T00:24:02.774831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02932","created_at":"2026-05-18T00:24:02.774831+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANWPZ3PZ45GX","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANWPZ3PZ45GXU3XB","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANWPZ3PZ","created_at":"2026-05-18T12:32:13.499390+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/ANWPZ3PZ45GXU3XBJPJE6LWPGQ","json":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ.json","graph_json":"https://pith.science/api/pith-number/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/graph.json","events_json":"https://pith.science/api/pith-number/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/events.json","paper":"https://pith.science/paper/ANWPZ3PZ"},"agent_actions":{"view_html":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ","download_json":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ.json","view_paper":"https://pith.science/paper/ANWPZ3PZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02932&json=true","fetch_graph":"https://pith.science/api/pith-number/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/action/storage_attestation","attest_author":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/action/author_attestation","sign_citation":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/action/citation_signature","submit_replication":"https://pith.science/pith/ANWPZ3PZ45GXU3XBJPJE6LWPGQ/action/replication_record"}},"created_at":"2026-05-18T00:24:02.774831+00:00","updated_at":"2026-05-18T00:24:02.774831+00:00"}