{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:MTRJXDUQJ3FERXIKJWRM7LNVGF","short_pith_number":"pith:MTRJXDUQ","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"},"canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","source":{"kind":"arxiv","id":"2007.04362","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04362","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04362v2","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04362","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"MTRJXDUQJ3FE","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_16","alias_value":"MTRJXDUQJ3FERXIK","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_8","alias_value":"MTRJXDUQ","created_at":"2026-07-05T01:51:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:MTRJXDUQJ3FERXIKJWRM7LNVGF","target":"record","payload":{"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"},"canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","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"},"source_kind":"arxiv","source_id":"2007.04362","source_version":2,"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-07-05T01:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/t0semhuSKttJwVWjFjszzrZVSJie6203g2gTgElHE2aXZeaYrVBc7nIk2ZmZ5nvdjGjRdyMEkDXC+K5LmRdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:44:43.506400Z"},"content_sha256":"2a9529dbfca3542be7a76456d95b40272e4d80c4bdc050e9c7d6f78e43a5e946","schema_version":"1.0","event_id":"sha256:2a9529dbfca3542be7a76456d95b40272e4d80c4bdc050e9c7d6f78e43a5e946"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:MTRJXDUQJ3FERXIKJWRM7LNVGF","target":"graph","payload":{"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"},"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-07-05T01:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2e7355IUAcbjiosq1kS1hUhpCTEHUlyA1zfhh9nGFfDobKXxH7lz2qFChjdreJdgFA0D3mmNcbT16Gre9fFWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T21:44:43.507353Z"},"content_sha256":"f1d32ec8e0c028ca536ec001fc0139cea716203e791450a8ec360258ec5b4fe6","schema_version":"1.0","event_id":"sha256:f1d32ec8e0c028ca536ec001fc0139cea716203e791450a8ec360258ec5b4fe6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/bundle.json","state_url":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/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-08-16T21:44:43Z","links":{"resolver":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF","bundle":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/bundle.json","state":"https://pith.science/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTRJXDUQJ3FERXIKJWRM7LNVGF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:MTRJXDUQJ3FERXIKJWRM7LNVGF","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":"5457b158c1ffa8bbf7bf6a67fb8f91cb72dd7aaed18e2a32e6f5b054926e8d45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-08T18:41:16Z","title_canon_sha256":"dc55ceab24d8976f32ed6bce780db43cbecb1fba28b1f51d5a5ec2bcccb90410"},"schema_version":"1.0","source":{"id":"2007.04362","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.04362","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"2007.04362v2","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04362","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"MTRJXDUQJ3FE","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_16","alias_value":"MTRJXDUQJ3FERXIK","created_at":"2026-07-05T01:51:43Z"},{"alias_kind":"pith_short_8","alias_value":"MTRJXDUQ","created_at":"2026-07-05T01:51:43Z"}],"graph_snapshots":[{"event_id":"sha256:f1d32ec8e0c028ca536ec001fc0139cea716203e791450a8ec360258ec5b4fe6","target":"graph","created_at":"2026-07-05T01:51:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.04362/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$","authors_text":"Ariel Shaulker, Shahar Dobzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-08T18:41:16Z","title":"Improved Lower Bounds for Truthful Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04362","kind":"arxiv","version":2},"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:2a9529dbfca3542be7a76456d95b40272e4d80c4bdc050e9c7d6f78e43a5e946","target":"record","created_at":"2026-07-05T01:51:43Z","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":"5457b158c1ffa8bbf7bf6a67fb8f91cb72dd7aaed18e2a32e6f5b054926e8d45","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-07-08T18:41:16Z","title_canon_sha256":"dc55ceab24d8976f32ed6bce780db43cbecb1fba28b1f51d5a5ec2bcccb90410"},"schema_version":"1.0","source":{"id":"2007.04362","kind":"arxiv","version":2}},"canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e29b8e904eca48dd0a4da2cfadb531578bb08a3c93193f7c50b34b54cd3487","first_computed_at":"2026-07-05T01:51:43.319188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:51:43.319188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IHiZHenkqn/kwvR4usA16qTFCMKw1Cgqmc0Nn0hpcsz4F0lGtnO/pwVh5sRuU1cqXHJMU3riKPhHvIE+B79pCg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:51:43.319681Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.04362","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a9529dbfca3542be7a76456d95b40272e4d80c4bdc050e9c7d6f78e43a5e946","sha256:f1d32ec8e0c028ca536ec001fc0139cea716203e791450a8ec360258ec5b4fe6"],"state_sha256":"fdcd821bc951b18e8353eef6597c89b8c4f3aaf7557f303b912b27606eeb4cba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKVxSUYYmEH+MAyJaXaW/JytASwLNWZWXQ9eop/csAac0f2jhxUBWx576Ctfzh56/vZa11NE+yOmI81vN4kcBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T21:44:43.516002Z","bundle_sha256":"1a65062b3b1b5a8471be6070892cf3d7c015a17302bb35c80718ee5a78083bf4"}}