{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OUOWZJ4MWND3B3MEP2B5D2BFYU","short_pith_number":"pith:OUOWZJ4M","canonical_record":{"source":{"id":"1401.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"2edd810bf52d0649fe8d50e3793cb056f8e3905fffcb144d760827e9c1d79fa0","abstract_canon_sha256":"a1f50fe4f3e33fecb202b2f55e1ce90796ab6403b73559db111bc49b96ed10bd"},"schema_version":"1.0"},"canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","source":{"kind":"arxiv","id":"1401.3834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3834","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3834v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3834","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"OUOWZJ4MWND3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUOWZJ4MWND3B3ME","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUOWZJ4M","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OUOWZJ4MWND3B3MEP2B5D2BFYU","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","cross_cats_sorted":[],"title_canon_sha256":"2edd810bf52d0649fe8d50e3793cb056f8e3905fffcb144d760827e9c1d79fa0","abstract_canon_sha256":"a1f50fe4f3e33fecb202b2f55e1ce90796ab6403b73559db111bc49b96ed10bd"},"schema_version":"1.0"},"canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.783092Z","signature_b64":"L/fb3tAHygRgTOHHNpb1Or2VjVRM8rybI06kIuH6YyeqNMjGURf5UOwWBES0/ePFO4/m288Py5Ba/dL1IyUlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","last_reissued_at":"2026-05-18T03:02:06.782568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:06.782568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3834","source_version":1,"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fdE8UDGjxp3c3bvTOT1JsJLKDaufccx7rjYNPxk5/v2gBlQHWLi9AsNXDiLjSd166LZKTgrU9sMr277GtvzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:43:15.415558Z"},"content_sha256":"25c436720c7704cd96341fa68194eb9ba3b438261dc4ef1fa6d914bd7d34830a","schema_version":"1.0","event_id":"sha256:25c436720c7704cd96341fa68194eb9ba3b438261dc4ef1fa6d914bd7d34830a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OUOWZJ4MWND3B3MEP2B5D2BFYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mechanisms for Multi-Unit Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Noam Nisan, Shahar Dobzinski","submitted_at":"2014-01-16T04:50:35Z","abstract_excerpt":"We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then uses VCG payments over this sub-range. We show that obtaining a fully polynomial-time incentive-compatible approximation scheme, at least using VCG payments, is NP-hard. For the case of valuations given by black boxes, we give a polynomial-time incentive-compatible 2-approximation mechanism and show that no better is possible, at least using VCG payments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3834","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"},"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-18T03:02:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X6YrmhjXQgiEO6xUwEH2Qzokyy8f4dem82YKAY6o88NWaR+Q47lQx6BNGkWgEpquVTsfa0zn4T4WxpEMtgkDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T19:43:15.415922Z"},"content_sha256":"7bd49194420340fbe6cc3e97985fd80aff1debca2f5ed9db67cb35f1eaa6efdc","schema_version":"1.0","event_id":"sha256:7bd49194420340fbe6cc3e97985fd80aff1debca2f5ed9db67cb35f1eaa6efdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/bundle.json","state_url":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/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-06-29T19:43:15Z","links":{"resolver":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU","bundle":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/bundle.json","state":"https://pith.science/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUOWZJ4MWND3B3MEP2B5D2BFYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OUOWZJ4MWND3B3MEP2B5D2BFYU","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":"a1f50fe4f3e33fecb202b2f55e1ce90796ab6403b73559db111bc49b96ed10bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","title_canon_sha256":"2edd810bf52d0649fe8d50e3793cb056f8e3905fffcb144d760827e9c1d79fa0"},"schema_version":"1.0","source":{"id":"1401.3834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3834","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3834v1","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3834","created_at":"2026-05-18T03:02:06Z"},{"alias_kind":"pith_short_12","alias_value":"OUOWZJ4MWND3","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OUOWZJ4MWND3B3ME","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OUOWZJ4M","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:7bd49194420340fbe6cc3e97985fd80aff1debca2f5ed9db67cb35f1eaa6efdc","target":"graph","created_at":"2026-05-18T03:02:06Z","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":"We present an incentive-compatible polynomial-time approximation scheme for multi-unit auctions with general k-minded player valuations. The mechanism fully optimizes over an appropriately chosen sub-range of possible allocations and then uses VCG payments over this sub-range. We show that obtaining a fully polynomial-time incentive-compatible approximation scheme, at least using VCG payments, is NP-hard. For the case of valuations given by black boxes, we give a polynomial-time incentive-compatible 2-approximation mechanism and show that no better is possible, at least using VCG payments.","authors_text":"Noam Nisan, Shahar Dobzinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","title":"Mechanisms for Multi-Unit Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3834","kind":"arxiv","version":1},"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:25c436720c7704cd96341fa68194eb9ba3b438261dc4ef1fa6d914bd7d34830a","target":"record","created_at":"2026-05-18T03:02:06Z","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":"a1f50fe4f3e33fecb202b2f55e1ce90796ab6403b73559db111bc49b96ed10bd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-01-16T04:50:35Z","title_canon_sha256":"2edd810bf52d0649fe8d50e3793cb056f8e3905fffcb144d760827e9c1d79fa0"},"schema_version":"1.0","source":{"id":"1401.3834","kind":"arxiv","version":1}},"canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"751d6ca78cb347b0ed847e83d1e825c533f12fe7a8aa322292dfc887c88ac387","first_computed_at":"2026-05-18T03:02:06.782568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:06.782568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L/fb3tAHygRgTOHHNpb1Or2VjVRM8rybI06kIuH6YyeqNMjGURf5UOwWBES0/ePFO4/m288Py5Ba/dL1IyUlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.783092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25c436720c7704cd96341fa68194eb9ba3b438261dc4ef1fa6d914bd7d34830a","sha256:7bd49194420340fbe6cc3e97985fd80aff1debca2f5ed9db67cb35f1eaa6efdc"],"state_sha256":"7b28959f682cb52ec14ae99483bf6d3ed0e226b8eafd754bb2b584982d349d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P31ZdUFIAryQfQd1+9/XGpkSOsPegvZZ7LuVxbfP/LZ5SXo/62Wj3jSFNyPw0LxtL42rs27dxBz+GqVjx6FEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T19:43:15.417799Z","bundle_sha256":"e20bdf94324fe9b89680374a7e6b57448406030c16de728ca44467e4a69c8610"}}