{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WTXDFTP7A3LCJJABUACAE27BXU","short_pith_number":"pith:WTXDFTP7","schema_version":"1.0","canonical_sha256":"b4ee32cdff06d624a401a004026be1bd25a99b118639ce3838df53f4efcafea7","source":{"kind":"arxiv","id":"1203.5099","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Optimal Auctions via Multi- to Single-agent Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Azarakhsh Malekian, Hu Fu, Jason Hartline, Nima Haghpanah, Saeed Alaei","submitted_at":"2012-03-22T19:59:22Z","abstract_excerpt":"We study an abstract optimal auction problem for a single good or service. This problem includes environments where agents have budgets, risk preferences, or multi-dimensional preferences over several possible configurations of the good (furthermore, it allows an agent's budget and risk preference to be known only privately to the agent). These are the main challenge areas for auction theory. A single-agent problem is to optimize a given objective subject to a constraint on the maximum probability with which each type is allocated, a.k.a., an allocation rule. Our approach is a reduction from m"},"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":"1203.5099","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-03-22T19:59:22Z","cross_cats_sorted":[],"title_canon_sha256":"776d5cbe346709b8140451b586c00997d31f52af1bd641a4449a7d6e61381e21","abstract_canon_sha256":"a15e18258d39fd01bbbc6e48aca20259899e8e40d4579ee5baecd6f32772a23c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:27.919663Z","signature_b64":"GydJvD652udsd6qJBGpOMeCaVv9WnYZJdQcVmKxfFn2Xs4sf+87wGyorGP3djb0WpgJli1SG8m1xJsM88AxHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ee32cdff06d624a401a004026be1bd25a99b118639ce3838df53f4efcafea7","last_reissued_at":"2026-05-18T03:59:27.918879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:27.918879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Optimal Auctions via Multi- to Single-agent Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Azarakhsh Malekian, Hu Fu, Jason Hartline, Nima Haghpanah, Saeed Alaei","submitted_at":"2012-03-22T19:59:22Z","abstract_excerpt":"We study an abstract optimal auction problem for a single good or service. This problem includes environments where agents have budgets, risk preferences, or multi-dimensional preferences over several possible configurations of the good (furthermore, it allows an agent's budget and risk preference to be known only privately to the agent). These are the main challenge areas for auction theory. A single-agent problem is to optimize a given objective subject to a constraint on the maximum probability with which each type is allocated, a.k.a., an allocation rule. Our approach is a reduction from m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.5099","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.5099","created_at":"2026-05-18T03:59:27.919003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.5099v1","created_at":"2026-05-18T03:59:27.919003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.5099","created_at":"2026-05-18T03:59:27.919003+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTXDFTP7A3LC","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTXDFTP7A3LCJJAB","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTXDFTP7","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2208.02229","citing_title":"A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU","json":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU.json","graph_json":"https://pith.science/api/pith-number/WTXDFTP7A3LCJJABUACAE27BXU/graph.json","events_json":"https://pith.science/api/pith-number/WTXDFTP7A3LCJJABUACAE27BXU/events.json","paper":"https://pith.science/paper/WTXDFTP7"},"agent_actions":{"view_html":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU","download_json":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU.json","view_paper":"https://pith.science/paper/WTXDFTP7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.5099&json=true","fetch_graph":"https://pith.science/api/pith-number/WTXDFTP7A3LCJJABUACAE27BXU/graph.json","fetch_events":"https://pith.science/api/pith-number/WTXDFTP7A3LCJJABUACAE27BXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU/action/storage_attestation","attest_author":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU/action/author_attestation","sign_citation":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU/action/citation_signature","submit_replication":"https://pith.science/pith/WTXDFTP7A3LCJJABUACAE27BXU/action/replication_record"}},"created_at":"2026-05-18T03:59:27.919003+00:00","updated_at":"2026-05-18T03:59:27.919003+00:00"}