{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B4RG6DYRA3OGGWHWVB572RXDV4","short_pith_number":"pith:B4RG6DYR","schema_version":"1.0","canonical_sha256":"0f226f0f1106dc6358f6a87bfd46e3af355d766c516dd84cd75dbcdcb435b084","source":{"kind":"arxiv","id":"2606.10112","version":1},"attestation_state":"computed","paper":{"title":"Duality for Optimal Multi-Item, Multi-Bidder Auction Design: Revenue Certificates through Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Tonghan Wang, Yanchen Jiang","submitted_at":"2026-06-08T19:42:01Z","abstract_excerpt":"Characterizing revenue-optimal auctions for multi-item, multi-bidder settings remains a fundamental open problem, with no known closed-form solution existing beyond restrictive binary-type instances. This has motivated interest in computational approaches to optimal auction design. In this paper, we introduce the first computational framework that directly tackles the dual problem for multi-item, multi-bidder auctions and dominant-strategy incentive compatibility (DSIC), generating certified revenue upper bounds. Our approach parametrizes Lagrange multipliers with a structurally guaranteed str"},"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":"2606.10112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-08T19:42:01Z","cross_cats_sorted":["cs.AI","cs.LG","econ.TH"],"title_canon_sha256":"08aa51e8f291b7d4a71bf031844370f49a7cbc6485a16de43948fe85c26c78d9","abstract_canon_sha256":"957b2b0565ea9a8a4741d04a0d496bbfd5a47db12da18c9e32bce77e0c68c402"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:54.844731Z","signature_b64":"m50KAzpPjsoueghdzZK5IdnkU/z6Aef4rs+RUTIAT/3SWhn6C9ffzIn0jDBscXQPkWNPy+Atn4ZDQnI7oqCMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f226f0f1106dc6358f6a87bfd46e3af355d766c516dd84cd75dbcdcb435b084","last_reissued_at":"2026-06-10T01:08:54.843540Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:54.843540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Duality for Optimal Multi-Item, Multi-Bidder Auction Design: Revenue Certificates through Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","econ.TH"],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Tonghan Wang, Yanchen Jiang","submitted_at":"2026-06-08T19:42:01Z","abstract_excerpt":"Characterizing revenue-optimal auctions for multi-item, multi-bidder settings remains a fundamental open problem, with no known closed-form solution existing beyond restrictive binary-type instances. This has motivated interest in computational approaches to optimal auction design. In this paper, we introduce the first computational framework that directly tackles the dual problem for multi-item, multi-bidder auctions and dominant-strategy incentive compatibility (DSIC), generating certified revenue upper bounds. Our approach parametrizes Lagrange multipliers with a structurally guaranteed str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10112","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.10112/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.10112","created_at":"2026-06-10T01:08:54.843674+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.10112v1","created_at":"2026-06-10T01:08:54.843674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10112","created_at":"2026-06-10T01:08:54.843674+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4RG6DYRA3OG","created_at":"2026-06-10T01:08:54.843674+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4RG6DYRA3OGGWHW","created_at":"2026-06-10T01:08:54.843674+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4RG6DYR","created_at":"2026-06-10T01:08:54.843674+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4","json":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4.json","graph_json":"https://pith.science/api/pith-number/B4RG6DYRA3OGGWHWVB572RXDV4/graph.json","events_json":"https://pith.science/api/pith-number/B4RG6DYRA3OGGWHWVB572RXDV4/events.json","paper":"https://pith.science/paper/B4RG6DYR"},"agent_actions":{"view_html":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4","download_json":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4.json","view_paper":"https://pith.science/paper/B4RG6DYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.10112&json=true","fetch_graph":"https://pith.science/api/pith-number/B4RG6DYRA3OGGWHWVB572RXDV4/graph.json","fetch_events":"https://pith.science/api/pith-number/B4RG6DYRA3OGGWHWVB572RXDV4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4/action/storage_attestation","attest_author":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4/action/author_attestation","sign_citation":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4/action/citation_signature","submit_replication":"https://pith.science/pith/B4RG6DYRA3OGGWHWVB572RXDV4/action/replication_record"}},"created_at":"2026-06-10T01:08:54.843674+00:00","updated_at":"2026-06-10T01:08:54.843674+00:00"}