{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NVUYYZTQG2F5RHW2GYSBU3WBNG","short_pith_number":"pith:NVUYYZTQ","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"},"canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","source":{"kind":"arxiv","id":"1712.06709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06709","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06709v2","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06709","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"NVUYYZTQG2F5","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NVUYYZTQG2F5RHW2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NVUYYZTQ","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NVUYYZTQG2F5RHW2GYSBU3WBNG","target":"record","payload":{"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"},"canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","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"},"source_kind":"arxiv","source_id":"1712.06709","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-05-18T00:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHO3GGPtHlSkXnzFpm8wAvvbcKiZgh3dE443Rx5OxPpNHnURHnVPTNY9F9bC8kW0YugVuCasz9u/5E8BwEpxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:27.782374Z"},"content_sha256":"a7b6718ed019cf0e02dbcfad644cbf40be104b9b59a917096563d6362a987edf","schema_version":"1.0","event_id":"sha256:a7b6718ed019cf0e02dbcfad644cbf40be104b9b59a917096563d6362a987edf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NVUYYZTQG2F5RHW2GYSBU3WBNG","target":"graph","payload":{"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"},"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-18T00:14:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlEsl5jkD6I5SujgO9UonDvaQXP7eQ+ZFtzyO9ubq3U3JsChcy6B4tyGeDDANnCo7RU36Td+TMJ/pC+pH6yyCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:27.783013Z"},"content_sha256":"cf5917c76ccb4b26a5fc7d72d35d08553efa061c727d4662c0d00babfdb311bb","schema_version":"1.0","event_id":"sha256:cf5917c76ccb4b26a5fc7d72d35d08553efa061c727d4662c0d00babfdb311bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/bundle.json","state_url":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/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-05-26T06:51:27Z","links":{"resolver":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG","bundle":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/bundle.json","state":"https://pith.science/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVUYYZTQG2F5RHW2GYSBU3WBNG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NVUYYZTQG2F5RHW2GYSBU3WBNG","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":"1cda4a0adf19a75b665add8ba8e0d7b8c0ac463321152abfad36cd4823874e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-18T22:52:11Z","title_canon_sha256":"651ec4eaadf6b20a6bb8f43567b481768e66af368feb3f0823dadd310dae096b"},"schema_version":"1.0","source":{"id":"1712.06709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06709","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06709v2","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06709","created_at":"2026-05-18T00:14:40Z"},{"alias_kind":"pith_short_12","alias_value":"NVUYYZTQG2F5","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NVUYYZTQG2F5RHW2","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NVUYYZTQ","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:cf5917c76ccb4b26a5fc7d72d35d08553efa061c727d4662c0d00babfdb311bb","target":"graph","created_at":"2026-05-18T00:14:40Z","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":"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.","authors_text":"Akaki Mamageishvili, Paolo Penna, Stefano Leucci","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-18T22:52:11Z","title":"No truthful mechanism can be better than $n$ approximate for two natural problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06709","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:a7b6718ed019cf0e02dbcfad644cbf40be104b9b59a917096563d6362a987edf","target":"record","created_at":"2026-05-18T00:14:40Z","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":"1cda4a0adf19a75b665add8ba8e0d7b8c0ac463321152abfad36cd4823874e36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-12-18T22:52:11Z","title_canon_sha256":"651ec4eaadf6b20a6bb8f43567b481768e66af368feb3f0823dadd310dae096b"},"schema_version":"1.0","source":{"id":"1712.06709","kind":"arxiv","version":2}},"canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d698c6670368bd89eda36241a6ec1698d2ac3365ab0fae167290ecb1b94edc0","first_computed_at":"2026-05-18T00:14:40.636290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:40.636290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"92x0cFARDHXDSSD0CIKYQdR8df0iN7iDUwtN/eYpWoYI7m3YGvEVEaaMDLYjhu8lAR6+qiixb0gMLbm2DaeeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:40.637060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7b6718ed019cf0e02dbcfad644cbf40be104b9b59a917096563d6362a987edf","sha256:cf5917c76ccb4b26a5fc7d72d35d08553efa061c727d4662c0d00babfdb311bb"],"state_sha256":"4291f61c148e84e985eeadb27aadd01ecf8ff87bcaa29238fabe096ce9f9c7c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZi1dbFieWuOXtjk8/NWYI4BR+nK5A8gGqN61LiGwHBn4zcgM/55zz27h5gGmBIM4c13wFcwsDfWFG+2bcNYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:27.787084Z","bundle_sha256":"cf1eeb8374a85c57e756ca18e795e415a997e721d3a1b8cdab3a684a75bcf448"}}