{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TJXVY2JLW5BVJCJJGKTIUJCHRH","short_pith_number":"pith:TJXVY2JL","schema_version":"1.0","canonical_sha256":"9a6f5c692bb74354892932a68a244789c2cb9c8432b47d42e92feff8c5b0b6e5","source":{"kind":"arxiv","id":"1405.5940","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.5940","created_at":"2026-05-18T02:51:14.408534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5940v1","created_at":"2026-05-18T02:51:14.408534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5940","created_at":"2026-05-18T02:51:14.408534+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJXVY2JLW5BV","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJXVY2JLW5BVJCJJ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJXVY2JL","created_at":"2026-05-18T12:28:49.207871+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/TJXVY2JLW5BVJCJJGKTIUJCHRH","json":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH.json","graph_json":"https://pith.science/api/pith-number/TJXVY2JLW5BVJCJJGKTIUJCHRH/graph.json","events_json":"https://pith.science/api/pith-number/TJXVY2JLW5BVJCJJGKTIUJCHRH/events.json","paper":"https://pith.science/paper/TJXVY2JL"},"agent_actions":{"view_html":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH","download_json":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH.json","view_paper":"https://pith.science/paper/TJXVY2JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5940&json=true","fetch_graph":"https://pith.science/api/pith-number/TJXVY2JLW5BVJCJJGKTIUJCHRH/graph.json","fetch_events":"https://pith.science/api/pith-number/TJXVY2JLW5BVJCJJGKTIUJCHRH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/action/storage_attestation","attest_author":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/action/author_attestation","sign_citation":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/action/citation_signature","submit_replication":"https://pith.science/pith/TJXVY2JLW5BVJCJJGKTIUJCHRH/action/replication_record"}},"created_at":"2026-05-18T02:51:14.408534+00:00","updated_at":"2026-05-18T02:51:14.408534+00:00"}