{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NVUYYZTQG2F5RHW2GYSBU3WBNG","short_pith_number":"pith:NVUYYZTQ","schema_version":"1.0","canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","source":{"kind":"arxiv","id":"1712.06709","version":2},"attestation_state":"computed","paper":{"title":"No truthful mechanism can be better than $n$ approximate for two natural problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Paolo Penna, Stefano Leucci","submitted_at":"2017-12-18T22:52:11Z","abstract_excerpt":"This work gives the first natural non-utilitarian problems for which the trivial $n$ approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be better than $n$ approximate, where $n$ is the number of agents. The problems are the min-max variant of shortest path and (directed) minimum spanning tree mechanism design problems. In these procurement auctions, agents own the edges of a network, and the corresponding edge costs are private. Instead of the total weight of the subnetwork, in the min-max variant we aim to minimize the maximum agent cost."},"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":"1712.06709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-18T22:52:11Z","cross_cats_sorted":[],"title_canon_sha256":"651ec4eaadf6b20a6bb8f43567b481768e66af368feb3f0823dadd310dae096b","abstract_canon_sha256":"1cda4a0adf19a75b665add8ba8e0d7b8c0ac463321152abfad36cd4823874e36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:40.637060Z","signature_b64":"92x0cFARDHXDSSD0CIKYQdR8df0iN7iDUwtN/eYpWoYI7m3YGvEVEaaMDLYjhu8lAR6+qiixb0gMLbm2DaeeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","last_reissued_at":"2026-05-18T00:14:40.636290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:40.636290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No truthful mechanism can be better than $n$ approximate for two natural problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Akaki Mamageishvili, Paolo Penna, Stefano Leucci","submitted_at":"2017-12-18T22:52:11Z","abstract_excerpt":"This work gives the first natural non-utilitarian problems for which the trivial $n$ approximation via VCG mechanisms is the best possible. That is, no truthful mechanism can be better than $n$ approximate, where $n$ is the number of agents. The problems are the min-max variant of shortest path and (directed) minimum spanning tree mechanism design problems. In these procurement auctions, agents own the edges of a network, and the corresponding edge costs are private. Instead of the total weight of the subnetwork, in the min-max variant we aim to minimize the maximum agent cost."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06709","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":""},"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":"1712.06709","created_at":"2026-05-18T00:14:40.636457+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06709v2","created_at":"2026-05-18T00:14:40.636457+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06709","created_at":"2026-05-18T00:14:40.636457+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVUYYZTQG2F5","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVUYYZTQG2F5RHW2","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVUYYZTQ","created_at":"2026-05-18T12:31:34.259226+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/NVUYYZTQG2F5RHW2GYSBU3WBNG","json":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG.json","graph_json":"https://pith.science/api/pith-number/NVUYYZTQG2F5RHW2GYSBU3WBNG/graph.json","events_json":"https://pith.science/api/pith-number/NVUYYZTQG2F5RHW2GYSBU3WBNG/events.json","paper":"https://pith.science/paper/NVUYYZTQ"},"agent_actions":{"view_html":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG","download_json":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG.json","view_paper":"https://pith.science/paper/NVUYYZTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06709&json=true","fetch_graph":"https://pith.science/api/pith-number/NVUYYZTQG2F5RHW2GYSBU3WBNG/graph.json","fetch_events":"https://pith.science/api/pith-number/NVUYYZTQG2F5RHW2GYSBU3WBNG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/action/storage_attestation","attest_author":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/action/author_attestation","sign_citation":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/action/citation_signature","submit_replication":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/action/replication_record"}},"created_at":"2026-05-18T00:14:40.636457+00:00","updated_at":"2026-05-18T00:14:40.636457+00:00"}