{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TJXVY2JLW5BVJCJJGKTIUJCHRH","short_pith_number":"pith:TJXVY2JL","canonical_record":{"source":{"id":"1405.5940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-23T00:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"257168a3cdd06185023b15aa1968c76a84355c15b33c1a4aee5c565058355e3e","abstract_canon_sha256":"d533d2900630fba593217f57f2beba4522db4039fbff72ea5912eb00a39f8b31"},"schema_version":"1.0"},"canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","source":{"kind":"arxiv","id":"1405.5940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5940","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5940v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5940","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"TJXVY2JLW5BV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJXVY2JLW5BVJCJJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJXVY2JL","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TJXVY2JLW5BVJCJJGKTIUJCHRH","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-23T00:42:09Z","cross_cats_sorted":[],"title_canon_sha256":"257168a3cdd06185023b15aa1968c76a84355c15b33c1a4aee5c565058355e3e","abstract_canon_sha256":"d533d2900630fba593217f57f2beba4522db4039fbff72ea5912eb00a39f8b31"},"schema_version":"1.0"},"canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.408930Z","signature_b64":"G1QqSUqMogl9fawGryfNnNpLUTckWZlp/91CEIVrjcC9EVMuZIpIAnQ4QzgOX6HU0U4siVSCITnjgGPD0RI3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","last_reissued_at":"2026-05-18T02:51:14.408445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.408445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5940","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q43ko7VXpSnlXay983Ynn5AWlCPYuH0Wknu/xj+fUhT9X+OQ3m0mD/QJYeJOZHJ19CeqEgQLnAsK17Stu8HbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:20:15.818941Z"},"content_sha256":"077a236d09e96ddd6c344a548460daf3edc6a610113eb1ec083a5d49432a6326","schema_version":"1.0","event_id":"sha256:077a236d09e96ddd6c344a548460daf3edc6a610113eb1ec083a5d49432a6326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TJXVY2JLW5BVJCJJGKTIUJCHRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Constantinos Daskalakis, S. Matthew Weinberg","submitted_at":"2014-05-23T00:42:09Z","abstract_excerpt":"We provide polynomial-time approximately optimal Bayesian mechanisms for makespan minimization on unrelated machines as well as for max-min fair allocations of indivisible goods, with approximation factors of $2$ and $\\min\\{m-k+1, \\tilde{O}(\\sqrt{k})\\}$ respectively, matching the approximation ratios of best known polynomial-time \\emph{algorithms} (for max-min fairness, the latter claim is true for certain ratios of the number of goods $m$ to people $k$). Our mechanisms are obtained by establishing a polynomial-time approximation-sensitive reduction from the problem of designing approximately "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5940","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SbDcbzo+30kEKmwINQQKR7XeWeSLDuDQyPXKII0A07zqOcUtVNMiYTB+epBnQ8CD3ZBwF67bwOTFTw/ZCfM5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:20:15.819279Z"},"content_sha256":"ec1c7a922eea4a987af3abdda657f1ddfe5a2975f4cfbc36efb5d37bdc8a1c91","schema_version":"1.0","event_id":"sha256:ec1c7a922eea4a987af3abdda657f1ddfe5a2975f4cfbc36efb5d37bdc8a1c91"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/bundle.json","state_url":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/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-06-20T08:20:15Z","links":{"resolver":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH","bundle":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/bundle.json","state":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TJXVY2JLW5BVJCJJGKTIUJCHRH","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":"d533d2900630fba593217f57f2beba4522db4039fbff72ea5912eb00a39f8b31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-23T00:42:09Z","title_canon_sha256":"257168a3cdd06185023b15aa1968c76a84355c15b33c1a4aee5c565058355e3e"},"schema_version":"1.0","source":{"id":"1405.5940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5940","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5940v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5940","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"TJXVY2JLW5BV","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TJXVY2JLW5BVJCJJ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TJXVY2JL","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:ec1c7a922eea4a987af3abdda657f1ddfe5a2975f4cfbc36efb5d37bdc8a1c91","target":"graph","created_at":"2026-05-18T02:51:14Z","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":"We provide polynomial-time approximately optimal Bayesian mechanisms for makespan minimization on unrelated machines as well as for max-min fair allocations of indivisible goods, with approximation factors of $2$ and $\\min\\{m-k+1, \\tilde{O}(\\sqrt{k})\\}$ respectively, matching the approximation ratios of best known polynomial-time \\emph{algorithms} (for max-min fairness, the latter claim is true for certain ratios of the number of goods $m$ to people $k$). Our mechanisms are obtained by establishing a polynomial-time approximation-sensitive reduction from the problem of designing approximately ","authors_text":"Constantinos Daskalakis, S. Matthew Weinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-23T00:42:09Z","title":"Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5940","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:077a236d09e96ddd6c344a548460daf3edc6a610113eb1ec083a5d49432a6326","target":"record","created_at":"2026-05-18T02:51:14Z","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":"d533d2900630fba593217f57f2beba4522db4039fbff72ea5912eb00a39f8b31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-05-23T00:42:09Z","title_canon_sha256":"257168a3cdd06185023b15aa1968c76a84355c15b33c1a4aee5c565058355e3e"},"schema_version":"1.0","source":{"id":"1405.5940","kind":"arxiv","version":1}},"canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","first_computed_at":"2026-05-18T02:51:14.408445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:14.408445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G1QqSUqMogl9fawGryfNnNpLUTckWZlp/91CEIVrjcC9EVMuZIpIAnQ4QzgOX6HU0U4siVSCITnjgGPD0RI3Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:14.408930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:077a236d09e96ddd6c344a548460daf3edc6a610113eb1ec083a5d49432a6326","sha256:ec1c7a922eea4a987af3abdda657f1ddfe5a2975f4cfbc36efb5d37bdc8a1c91"],"state_sha256":"dbeb9a08e86cefe02a091a01c500275f1dc7a4acdf6485dad6485a53c0f85feb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GomCKj5opC/Dol5pPC/NIxrLst2yCd6GPiAL4zKV/3iDwWwWrwozBsR4QBXTcxSUsURzOWl366Sa5cpZRczrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:20:15.821183Z","bundle_sha256":"dd0d4cc16538e084a018efa23075b819ce26f432045169974ee780270b55b5fe"}}