{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EFNKZUAUE4G4XC7XDQ3NL5Y5K2","short_pith_number":"pith:EFNKZUAU","canonical_record":{"source":{"id":"1305.0598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-02T23:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"fe599aa9e43efcf9519426663bb03d6fdbea69d6020212d69262c5ceadfe52a8","abstract_canon_sha256":"c9e46ce3ec658f4b5c3668d77b7497a14ba476dfedec4a125ccb89189e524122"},"schema_version":"1.0"},"canonical_sha256":"215aacd014270dcb8bf71c36d5f71d56881c0a72074d73edba89f637f5e4c0c7","source":{"kind":"arxiv","id":"1305.0598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0598","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0598v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0598","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"EFNKZUAUE4G4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EFNKZUAUE4G4XC7X","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EFNKZUAU","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EFNKZUAUE4G4XC7XDQ3NL5Y5K2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-02T23:51:41Z","cross_cats_sorted":[],"title_canon_sha256":"fe599aa9e43efcf9519426663bb03d6fdbea69d6020212d69262c5ceadfe52a8","abstract_canon_sha256":"c9e46ce3ec658f4b5c3668d77b7497a14ba476dfedec4a125ccb89189e524122"},"schema_version":"1.0"},"canonical_sha256":"215aacd014270dcb8bf71c36d5f71d56881c0a72074d73edba89f637f5e4c0c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:33.246787Z","signature_b64":"FM7/6RYjHrovMfHPUQpRrjKsIOkX/DgeZ8g+KgSOT/e7w7kZCdXANbLDs7u6LuSyP/rqh+8YiBra1I9BKzCHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215aacd014270dcb8bf71c36d5f71d56881c0a72074d73edba89f637f5e4c0c7","last_reissued_at":"2026-05-18T03:26:33.246348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:33.246348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0598","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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zb4Ios9Rf4OvD9LdEhtRpglcLyWNxO16zSgsQOTvuMF+jNrnYsa2IBd3tCzWzvb8ME+z2t9D+nB1kHkwnregBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:06:35.087920Z"},"content_sha256":"bd6c3281959faeac85571422f80f19f8ac0ce7275ce8a1cf0ce460e0fad5d5f4","schema_version":"1.0","event_id":"sha256:bd6c3281959faeac85571422f80f19f8ac0ce7275ce8a1cf0ce460e0fad5d5f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EFNKZUAUE4G4XC7XDQ3NL5Y5K2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-Recovering Bayesian Algorithmic Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Balasubramanian Sivan, Brendan Lucier, Hu Fu, Vasilis Syrgkanis","submitted_at":"2013-05-02T23:51:41Z","abstract_excerpt":"We study the design of Bayesian incentive compatible mechanisms in single parameter domains, for the objective of optimizing social efficiency as measured by social cost. In the problems we consider, a group of participants compete to receive service from a mechanism that can provide such services at a cost. The mechanism wishes to choose which agents to serve in order to maximize social efficiency, but is not willing to suffer an expected loss: the agents' payments should cover the cost of service in expectation.\n  We develop a general method for converting arbitrary approximation algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0598","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:26:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMWou6Hu0wQhbyFlRzv5kFDXwJZGtLlT8E9oVAx1d3w6V6n1TyAZ/YGZ6Y1O5RgOtZ+bM86nf+8DI5g27XXNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:06:35.088621Z"},"content_sha256":"7cc1de63904ce84c49bfde26afac15d5c863561d72726816e48521d02a81bb5f","schema_version":"1.0","event_id":"sha256:7cc1de63904ce84c49bfde26afac15d5c863561d72726816e48521d02a81bb5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/bundle.json","state_url":"https://pith.science/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/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-06T22:06:35Z","links":{"resolver":"https://pith.science/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2","bundle":"https://pith.science/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/bundle.json","state":"https://pith.science/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFNKZUAUE4G4XC7XDQ3NL5Y5K2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EFNKZUAUE4G4XC7XDQ3NL5Y5K2","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":"c9e46ce3ec658f4b5c3668d77b7497a14ba476dfedec4a125ccb89189e524122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-02T23:51:41Z","title_canon_sha256":"fe599aa9e43efcf9519426663bb03d6fdbea69d6020212d69262c5ceadfe52a8"},"schema_version":"1.0","source":{"id":"1305.0598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0598","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0598v1","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0598","created_at":"2026-05-18T03:26:33Z"},{"alias_kind":"pith_short_12","alias_value":"EFNKZUAUE4G4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EFNKZUAUE4G4XC7X","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EFNKZUAU","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:7cc1de63904ce84c49bfde26afac15d5c863561d72726816e48521d02a81bb5f","target":"graph","created_at":"2026-05-18T03:26:33Z","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 study the design of Bayesian incentive compatible mechanisms in single parameter domains, for the objective of optimizing social efficiency as measured by social cost. In the problems we consider, a group of participants compete to receive service from a mechanism that can provide such services at a cost. The mechanism wishes to choose which agents to serve in order to maximize social efficiency, but is not willing to suffer an expected loss: the agents' payments should cover the cost of service in expectation.\n  We develop a general method for converting arbitrary approximation algorithms ","authors_text":"Balasubramanian Sivan, Brendan Lucier, Hu Fu, Vasilis Syrgkanis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-02T23:51:41Z","title":"Cost-Recovering Bayesian Algorithmic Mechanism Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0598","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:bd6c3281959faeac85571422f80f19f8ac0ce7275ce8a1cf0ce460e0fad5d5f4","target":"record","created_at":"2026-05-18T03:26:33Z","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":"c9e46ce3ec658f4b5c3668d77b7497a14ba476dfedec4a125ccb89189e524122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-05-02T23:51:41Z","title_canon_sha256":"fe599aa9e43efcf9519426663bb03d6fdbea69d6020212d69262c5ceadfe52a8"},"schema_version":"1.0","source":{"id":"1305.0598","kind":"arxiv","version":1}},"canonical_sha256":"215aacd014270dcb8bf71c36d5f71d56881c0a72074d73edba89f637f5e4c0c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215aacd014270dcb8bf71c36d5f71d56881c0a72074d73edba89f637f5e4c0c7","first_computed_at":"2026-05-18T03:26:33.246348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:33.246348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FM7/6RYjHrovMfHPUQpRrjKsIOkX/DgeZ8g+KgSOT/e7w7kZCdXANbLDs7u6LuSyP/rqh+8YiBra1I9BKzCHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:33.246787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd6c3281959faeac85571422f80f19f8ac0ce7275ce8a1cf0ce460e0fad5d5f4","sha256:7cc1de63904ce84c49bfde26afac15d5c863561d72726816e48521d02a81bb5f"],"state_sha256":"e9c7bcd3d4c7830d590fd20876d018a806072b4cf421c5954c35b28b0f94e31d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qY9pRlOfNVXoWbUhTMpztcRoG7KIc5D3oHctuIiEl4Vc4A+MXy/MZcyKaVU9PmfWyyYKYdQTOkph/XGxMizHBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:06:35.092433Z","bundle_sha256":"44524d7f05ded7ab42b3104c7b3d269bb524caa91e65138772a305bf7c71fec0"}}