{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5GUWN4AVG4JA3IP7KUC6HF26BY","short_pith_number":"pith:5GUWN4AV","canonical_record":{"source":{"id":"1302.4138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"401f8d0db7679b8884076b0ef4ec9c774fc0a1c93c0cd0157c35aa82e952e190","abstract_canon_sha256":"63f3707154e0cb8f9641b36adf6f8de2429e120561d004449667426728f2b367"},"schema_version":"1.0"},"canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","source":{"kind":"arxiv","id":"1302.4138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4138","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4138v2","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4138","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"5GUWN4AVG4JA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5GUWN4AVG4JA3IP7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5GUWN4AV","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5GUWN4AVG4JA3IP7KUC6HF26BY","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","cross_cats_sorted":[],"title_canon_sha256":"401f8d0db7679b8884076b0ef4ec9c774fc0a1c93c0cd0157c35aa82e952e190","abstract_canon_sha256":"63f3707154e0cb8f9641b36adf6f8de2429e120561d004449667426728f2b367"},"schema_version":"1.0"},"canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:58.538554Z","signature_b64":"jsAENIdriuTWIlXfLypyaCk69RWsn+aea44PmUtqRboyrTaYnOyFECjbR0UPt36SRIkgJn6e5UjnupwBgqxcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","last_reissued_at":"2026-05-18T03:25:58.537817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:58.537817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4138","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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CPRMx9PTqG+NPPCoxydrEBU/XJE2loFZm8KXj6xRNMOX13kOwU0N0hzCUPjs1K63vaA8NBexK9DtZbP/dtegBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:00:47.101897Z"},"content_sha256":"1847afcf67785ec8a3757bbe84c1fe219bc2d587e8ae17eaf0b0ae78ebc2f6f9","schema_version":"1.0","event_id":"sha256:1847afcf67785ec8a3757bbe84c1fe219bc2d587e8ae17eaf0b0ae78ebc2f6f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5GUWN4AVG4JA3IP7KUC6HF26BY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-parameter Mechanisms with Implicit Payment Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Aleksandrs Slivkins, Moshe Babaioff, Robert Kleinberg","submitted_at":"2013-02-18T00:25:29Z","abstract_excerpt":"In this paper we show that payment computation essentially does not present any obstacle in designing truthful mechanisms, even for multi-parameter domains, and even when we can only call the allocation rule once. We present a general reduction that takes any allocation rule which satisfies \"cyclic monotonicity\" (a known necessary and sufficient condition for truthfulness) and converts it to a truthful mechanism using a single call to the allocation rule, with arbitrarily small loss to the expected social welfare.\n  A prominent example for a multi-parameter setting in which an allocation rule "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4138","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-18T03:25:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsR7Cq6MtjHvssbiSu6Aqz3YH+eCqBiaxPDb1vzLiGuqteBNmPLSPKH39d8FUTEH+xY5DWv0tD7UZLX8xcbvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:00:47.102281Z"},"content_sha256":"78d033d08ceeb12f460c8e8fee5a6a196fd6522e7fd501f94060f11a6dd1eba4","schema_version":"1.0","event_id":"sha256:78d033d08ceeb12f460c8e8fee5a6a196fd6522e7fd501f94060f11a6dd1eba4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/bundle.json","state_url":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/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-30T17:00:47Z","links":{"resolver":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY","bundle":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/bundle.json","state":"https://pith.science/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5GUWN4AVG4JA3IP7KUC6HF26BY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5GUWN4AVG4JA3IP7KUC6HF26BY","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":"63f3707154e0cb8f9641b36adf6f8de2429e120561d004449667426728f2b367","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","title_canon_sha256":"401f8d0db7679b8884076b0ef4ec9c774fc0a1c93c0cd0157c35aa82e952e190"},"schema_version":"1.0","source":{"id":"1302.4138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4138","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4138v2","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4138","created_at":"2026-05-18T03:25:58Z"},{"alias_kind":"pith_short_12","alias_value":"5GUWN4AVG4JA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5GUWN4AVG4JA3IP7","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5GUWN4AV","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:78d033d08ceeb12f460c8e8fee5a6a196fd6522e7fd501f94060f11a6dd1eba4","target":"graph","created_at":"2026-05-18T03:25:58Z","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":"In this paper we show that payment computation essentially does not present any obstacle in designing truthful mechanisms, even for multi-parameter domains, and even when we can only call the allocation rule once. We present a general reduction that takes any allocation rule which satisfies \"cyclic monotonicity\" (a known necessary and sufficient condition for truthfulness) and converts it to a truthful mechanism using a single call to the allocation rule, with arbitrarily small loss to the expected social welfare.\n  A prominent example for a multi-parameter setting in which an allocation rule ","authors_text":"Aleksandrs Slivkins, Moshe Babaioff, Robert Kleinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","title":"Multi-parameter Mechanisms with Implicit Payment Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4138","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:1847afcf67785ec8a3757bbe84c1fe219bc2d587e8ae17eaf0b0ae78ebc2f6f9","target":"record","created_at":"2026-05-18T03:25:58Z","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":"63f3707154e0cb8f9641b36adf6f8de2429e120561d004449667426728f2b367","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-02-18T00:25:29Z","title_canon_sha256":"401f8d0db7679b8884076b0ef4ec9c774fc0a1c93c0cd0157c35aa82e952e190"},"schema_version":"1.0","source":{"id":"1302.4138","kind":"arxiv","version":2}},"canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9a966f01537120da1ff5505e3975e0e267e0906cfff396fbdbeff4b00375ca7","first_computed_at":"2026-05-18T03:25:58.537817Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:58.537817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jsAENIdriuTWIlXfLypyaCk69RWsn+aea44PmUtqRboyrTaYnOyFECjbR0UPt36SRIkgJn6e5UjnupwBgqxcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:58.538554Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1847afcf67785ec8a3757bbe84c1fe219bc2d587e8ae17eaf0b0ae78ebc2f6f9","sha256:78d033d08ceeb12f460c8e8fee5a6a196fd6522e7fd501f94060f11a6dd1eba4"],"state_sha256":"ed62d8c536cbab8249a919757f64b0c420ad94223305ea78d9e85db000dd1082"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HcJICo/e27i9sQEAHqcU0tdd3Hn+Fcdxm4FqFPIH26bJ+EFpDfmBGqqNd+2cfrg6d0Mzzth2PADw5P+/2BzJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:00:47.104281Z","bundle_sha256":"3d79ec12a2b5a23bb32dc91de544cc0eb814b82ca3f4a373f2dd0f1f3e4509b1"}}