{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LEFZUGPEVLOACUHGB6QSC2U5TZ","short_pith_number":"pith:LEFZUGPE","schema_version":"1.0","canonical_sha256":"590b9a19e4aadc0150e60fa1216a9d9e495df0c0bc8e7df9ac7d27211eebe642","source":{"kind":"arxiv","id":"1512.03484","version":1},"attestation_state":"computed","paper":{"title":"Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Paolo Penna","submitted_at":"2015-12-10T23:35:39Z","abstract_excerpt":"In this paper we study the inefficiency ratio of stable equilibria in load balancing games introduced by Asadpour and Saberi [3]. We prove tighter lower and upper bounds of 7/6 and 4/3, respectively. This improves over the best known bounds in problem (19/18 and 3/2, respectively). Equivalently, the results apply to the question of how well the optimum for the $L_2$ -norm can approximate the $L_{\\infty}$-norm (makespan) in identical machines scheduling."},"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":"1512.03484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-12-10T23:35:39Z","cross_cats_sorted":[],"title_canon_sha256":"af8c3af29b09ef58b440aa60aa55a607bef9d82827f60fca2543d02a11d235ae","abstract_canon_sha256":"6d916030621e08fa1cd28e35e0db378e1a8fa8ae3b7974b0df54be383febdce5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:32.323469Z","signature_b64":"WnJwL8zNsGqJOdFyUFcU06GBg12Gs4M7gWjlyJXvdwDqtlqAv40rXibjtSHLpHV73QnvVaVNRxZB+6tKJhcUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590b9a19e4aadc0150e60fa1216a9d9e495df0c0bc8e7df9ac7d27211eebe642","last_reissued_at":"2026-05-18T01:24:32.322856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:32.322856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Paolo Penna","submitted_at":"2015-12-10T23:35:39Z","abstract_excerpt":"In this paper we study the inefficiency ratio of stable equilibria in load balancing games introduced by Asadpour and Saberi [3]. We prove tighter lower and upper bounds of 7/6 and 4/3, respectively. This improves over the best known bounds in problem (19/18 and 3/2, respectively). Equivalently, the results apply to the question of how well the optimum for the $L_2$ -norm can approximate the $L_{\\infty}$-norm (makespan) in identical machines scheduling."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03484","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":"1512.03484","created_at":"2026-05-18T01:24:32.322942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03484v1","created_at":"2026-05-18T01:24:32.322942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03484","created_at":"2026-05-18T01:24:32.322942+00:00"},{"alias_kind":"pith_short_12","alias_value":"LEFZUGPEVLOA","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LEFZUGPEVLOACUHG","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LEFZUGPE","created_at":"2026-05-18T12:29:29.992203+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/LEFZUGPEVLOACUHGB6QSC2U5TZ","json":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ.json","graph_json":"https://pith.science/api/pith-number/LEFZUGPEVLOACUHGB6QSC2U5TZ/graph.json","events_json":"https://pith.science/api/pith-number/LEFZUGPEVLOACUHGB6QSC2U5TZ/events.json","paper":"https://pith.science/paper/LEFZUGPE"},"agent_actions":{"view_html":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ","download_json":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ.json","view_paper":"https://pith.science/paper/LEFZUGPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03484&json=true","fetch_graph":"https://pith.science/api/pith-number/LEFZUGPEVLOACUHGB6QSC2U5TZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LEFZUGPEVLOACUHGB6QSC2U5TZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ/action/storage_attestation","attest_author":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ/action/author_attestation","sign_citation":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ/action/citation_signature","submit_replication":"https://pith.science/pith/LEFZUGPEVLOACUHGB6QSC2U5TZ/action/replication_record"}},"created_at":"2026-05-18T01:24:32.322942+00:00","updated_at":"2026-05-18T01:24:32.322942+00:00"}