{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:67LUDARYLPXJQVWTNBAUVLTEDJ","short_pith_number":"pith:67LUDARY","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"},"canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","source":{"kind":"arxiv","id":"1205.1786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1786","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1786v1","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1786","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"67LUDARYLPXJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"67LUDARYLPXJQVWT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"67LUDARY","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:67LUDARYLPXJQVWTNBAUVLTEDJ","target":"record","payload":{"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"},"canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","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"},"source_kind":"arxiv","source_id":"1205.1786","source_version":1,"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-18T03:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/clbzzInO6uzmsvu/hIAUl1GfV7OOtsnr9wF7oLpykLTx6f6apYDjJg6nSO0OGFbcFYEo9+wvLUdqGN+CmqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:09.925907Z"},"content_sha256":"527a25d9ec689add90c23ea6d8ad6da19a164791236a0f36dd4d08ed81bfaf50","schema_version":"1.0","event_id":"sha256:527a25d9ec689add90c23ea6d8ad6da19a164791236a0f36dd4d08ed81bfaf50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:67LUDARYLPXJQVWTNBAUVLTEDJ","target":"graph","payload":{"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"},"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-18T03:56:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRfpIwCuRLzZK8kbMNSwdwdCDExGzCIJ0+SD+B07dOprEbgypOJ+7e6qGuuc5Hp9251K6zvSAxJQpJ7u0QR7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:16:09.926605Z"},"content_sha256":"116cbf298cd7abf7577022d065d521d2f506f0e607668bf922f21d6badcdcc21","schema_version":"1.0","event_id":"sha256:116cbf298cd7abf7577022d065d521d2f506f0e607668bf922f21d6badcdcc21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/bundle.json","state_url":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/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-05-31T08:16:09Z","links":{"resolver":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ","bundle":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/bundle.json","state":"https://pith.science/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67LUDARYLPXJQVWTNBAUVLTEDJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:67LUDARYLPXJQVWTNBAUVLTEDJ","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":"472140f6cead571e30b8a28fd68a1bdcb75a4588b937c4af76c0c0566f436391","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T19:30:07Z","title_canon_sha256":"015410523e4566e4de744d654cff316498d5117d5dd33c4af023fbb719b2c6b1"},"schema_version":"1.0","source":{"id":"1205.1786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1786","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1786v1","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1786","created_at":"2026-05-18T03:56:08Z"},{"alias_kind":"pith_short_12","alias_value":"67LUDARYLPXJ","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"67LUDARYLPXJQVWT","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"67LUDARY","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:116cbf298cd7abf7577022d065d521d2f506f0e607668bf922f21d6badcdcc21","target":"graph","created_at":"2026-05-18T03:56:08Z","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":"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)$.","authors_text":"Amos Fiat, Ariel Levavi","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T19:30:07Z","title":"Tight Lower Bounds on Envy-Free Makespan Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1786","kind":"arxiv","version":1},"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:527a25d9ec689add90c23ea6d8ad6da19a164791236a0f36dd4d08ed81bfaf50","target":"record","created_at":"2026-05-18T03:56:08Z","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":"472140f6cead571e30b8a28fd68a1bdcb75a4588b937c4af76c0c0566f436391","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-08T19:30:07Z","title_canon_sha256":"015410523e4566e4de744d654cff316498d5117d5dd33c4af023fbb719b2c6b1"},"schema_version":"1.0","source":{"id":"1205.1786","kind":"arxiv","version":1}},"canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7d74182385bee9856d368414aae641a5c48323d8f911f0556c855858e3da5c1","first_computed_at":"2026-05-18T03:56:08.949432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:08.949432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jN9/IYoEF/okBxYTtGs9MHJtmkGxv2GszCJlYptLvvqupG9oHg0oP3QaRIo2JW9CkxI/KwmZTjhyHAtrp3ToDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:08.950210Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:527a25d9ec689add90c23ea6d8ad6da19a164791236a0f36dd4d08ed81bfaf50","sha256:116cbf298cd7abf7577022d065d521d2f506f0e607668bf922f21d6badcdcc21"],"state_sha256":"6ea8dd200717af74214e58d73aa3d209dd76b6e2e8682dccd898107bd65d1f70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vp+y5MkRS7snlhQMlMUqWlxfIGEvfdXjkLxvf2oF8OoHZ9FLpEiu92dqZbq6t9P2rMHy8uXVsmoMuzeCr807AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:16:09.930904Z","bundle_sha256":"0325408079b48a3c444713e5d7e2934652cbfcc5acd96c8f60e27b3dba57abda"}}