{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MTRJXDUQJ3FERXIKJWRM7LNVGF","short_pith_number":"pith:MTRJXDUQ","schema_version":"1.0","canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","source":{"kind":"arxiv","id":"2007.04362","version":2},"attestation_state":"computed","paper":{"title":"Improved Lower Bounds for Truthful Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel Shaulker, Shahar Dobzinski","submitted_at":"2020-07-08T18:41:16Z","abstract_excerpt":"The problem of scheduling unrelated machines by a truthful mechanism to minimize the makespan was introduced in the seminal \"Algorithmic Mechanism Design\" paper by Nisan and Ronen. Nisan and Ronen showed that there is a truthful mechanism that provides an approximation ratio of $\\min(m,n)$, where $n$ is the number of machines and $m$ is the number of jobs. They also proved that no truthful mechanism can provide an approximation ratio better than $2$. Since then, the lower bound was improved to $1 +\\sqrt 2 \\approx 2.41$ by Christodoulou, Kotsoupias, and Vidali, and then to $1+\\phi\\approx 2.618$"},"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":"2007.04362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-08T18:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"dc55ceab24d8976f32ed6bce780db43cbecb1fba28b1f51d5a5ec2bcccb90410","abstract_canon_sha256":"5457b158c1ffa8bbf7bf6a67fb8f91cb72dd7aaed18e2a32e6f5b054926e8d45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:43.319681Z","signature_b64":"IHiZHenkqn/kwvR4usA16qTFCMKw1Cgqmc0Nn0hpcsz4F0lGtnO/pwVh5sRuU1cqXHJMU3riKPhHvIE+B79pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","last_reissued_at":"2026-07-05T01:51:43.319188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:43.319188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Lower Bounds for Truthful Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ariel Shaulker, Shahar Dobzinski","submitted_at":"2020-07-08T18:41:16Z","abstract_excerpt":"The problem of scheduling unrelated machines by a truthful mechanism to minimize the makespan was introduced in the seminal \"Algorithmic Mechanism Design\" paper by Nisan and Ronen. Nisan and Ronen showed that there is a truthful mechanism that provides an approximation ratio of $\\min(m,n)$, where $n$ is the number of machines and $m$ is the number of jobs. They also proved that no truthful mechanism can provide an approximation ratio better than $2$. Since then, the lower bound was improved to $1 +\\sqrt 2 \\approx 2.41$ by Christodoulou, Kotsoupias, and Vidali, and then to $1+\\phi\\approx 2.618$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04362","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.04362/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2007.04362","created_at":"2026-07-05T01:51:43.319247+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.04362v2","created_at":"2026-07-05T01:51:43.319247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04362","created_at":"2026-07-05T01:51:43.319247+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTRJXDUQJ3FE","created_at":"2026-07-05T01:51:43.319247+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTRJXDUQJ3FERXIK","created_at":"2026-07-05T01:51:43.319247+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTRJXDUQ","created_at":"2026-07-05T01:51:43.319247+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.08572","citing_title":"Proportionally Fair Makespan Approximation","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF","json":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF.json","graph_json":"https://pith.science/api/pith-number/MTRJXDUQJ3FERXIKJWRM7LNVGF/graph.json","events_json":"https://pith.science/api/pith-number/MTRJXDUQJ3FERXIKJWRM7LNVGF/events.json","paper":"https://pith.science/paper/MTRJXDUQ"},"agent_actions":{"view_html":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF","download_json":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF.json","view_paper":"https://pith.science/paper/MTRJXDUQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.04362&json=true","fetch_graph":"https://pith.science/api/pith-number/MTRJXDUQJ3FERXIKJWRM7LNVGF/graph.json","fetch_events":"https://pith.science/api/pith-number/MTRJXDUQJ3FERXIKJWRM7LNVGF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/action/storage_attestation","attest_author":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/action/author_attestation","sign_citation":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/action/citation_signature","submit_replication":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/action/replication_record"}},"created_at":"2026-07-05T01:51:43.319247+00:00","updated_at":"2026-07-05T01:51:43.319247+00:00"}