{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:67LUDARYLPXJQVWTNBAUVLTEDJ","short_pith_number":"pith:67LUDARY","schema_version":"1.0","canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","source":{"kind":"arxiv","id":"1205.1786","version":1},"attestation_state":"computed","paper":{"title":"Tight Lower Bounds on Envy-Free Makespan Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DM","authors_text":"Amos Fiat, Ariel Levavi","submitted_at":"2012-05-08T19:30:07Z","abstract_excerpt":"In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to $m$ machines with a makespan of less than a factor of $O(\\log m)$ of the minimal makespan. Combined with previous results, this paper definitively proves that the optimal algorithm for obtaining a minimal makespan for any envy-free division can at best approximate the makespan to a factor of $O(\\log m)$."},"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":"1205.1786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T19:30:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"015410523e4566e4de744d654cff316498d5117d5dd33c4af023fbb719b2c6b1","abstract_canon_sha256":"472140f6cead571e30b8a28fd68a1bdcb75a4588b937c4af76c0c0566f436391"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:08.950210Z","signature_b64":"jN9/IYoEF/okBxYTtGs9MHJtmkGxv2GszCJlYptLvvqupG9oHg0oP3QaRIo2JW9CkxI/KwmZTjhyHAtrp3ToDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","last_reissued_at":"2026-05-18T03:56:08.949432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:08.949432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Lower Bounds on Envy-Free Makespan Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DM","authors_text":"Amos Fiat, Ariel Levavi","submitted_at":"2012-05-08T19:30:07Z","abstract_excerpt":"In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to $m$ machines with a makespan of less than a factor of $O(\\log m)$ of the minimal makespan. Combined with previous results, this paper definitively proves that the optimal algorithm for obtaining a minimal makespan for any envy-free division can at best approximate the makespan to a factor of $O(\\log m)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1786","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":"1205.1786","created_at":"2026-05-18T03:56:08.949558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.1786v1","created_at":"2026-05-18T03:56:08.949558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1786","created_at":"2026-05-18T03:56:08.949558+00:00"},{"alias_kind":"pith_short_12","alias_value":"67LUDARYLPXJ","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"67LUDARYLPXJQVWT","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"67LUDARY","created_at":"2026-05-18T12:26:56.085431+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/67LUDARYLPXJQVWTNBAUVLTEDJ","json":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ.json","graph_json":"https://pith.science/api/pith-number/67LUDARYLPXJQVWTNBAUVLTEDJ/graph.json","events_json":"https://pith.science/api/pith-number/67LUDARYLPXJQVWTNBAUVLTEDJ/events.json","paper":"https://pith.science/paper/67LUDARY"},"agent_actions":{"view_html":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ","download_json":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ.json","view_paper":"https://pith.science/paper/67LUDARY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.1786&json=true","fetch_graph":"https://pith.science/api/pith-number/67LUDARYLPXJQVWTNBAUVLTEDJ/graph.json","fetch_events":"https://pith.science/api/pith-number/67LUDARYLPXJQVWTNBAUVLTEDJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/action/storage_attestation","attest_author":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/action/author_attestation","sign_citation":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/action/citation_signature","submit_replication":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/action/replication_record"}},"created_at":"2026-05-18T03:56:08.949558+00:00","updated_at":"2026-05-18T03:56:08.949558+00:00"}