{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GCTIFQBPRJ3SWNZ2CUJTS6WIRB","short_pith_number":"pith:GCTIFQBP","schema_version":"1.0","canonical_sha256":"30a682c02f8a772b373a1513397ac88843654b18ce109e54ca23bf53300ada9f","source":{"kind":"arxiv","id":"2406.07428","version":3},"attestation_state":"computed","paper":{"title":"GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Tonghan Wang, Yanchen Jiang","submitted_at":"2024-06-11T16:30:30Z","abstract_excerpt":"Automated mechanism design (AMD) uses computational methods for mechanism design. Differentiable economics is a form of AMD that uses deep learning to learn mechanism designs and has enabled strong progress in AMD in recent years. Nevertheless, a major open problem has been to learn multi-bidder, general, and fully strategy-proof (SP) auctions. We introduce GEneral Menu-based NETwork (GemNet), which significantly extends the menu-based approach of the single-bidder RochetNet (D\\\"utting et al., 2024) to the multi-bidder setting. The challenge in achieving SP is to learn bidder-independent menus"},"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":"2406.07428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-06-11T16:30:30Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"87b71c80f51c9b333fbe9504525b4ff7e37410f141249ef653a53b48d8a0866c","abstract_canon_sha256":"150123dc5e3dc768d9433ca41fc92837bb1f6f17a3977348c4af6c0742d71469"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:04.035321Z","signature_b64":"sdEpjaCn03aqVhznupjjusn3AA/NpLtbecYDW09f4EGg53vjYJ8CJtHu1mYhSKx/7Dqr60JtnTSEbhHO/+v8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30a682c02f8a772b373a1513397ac88843654b18ce109e54ca23bf53300ada9f","last_reissued_at":"2026-07-05T09:31:04.034845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:04.034845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GemNet: Menu-Based, Strategy-Proof Multi-Bidder Auctions Through Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.GT","authors_text":"David C. Parkes, Tonghan Wang, Yanchen Jiang","submitted_at":"2024-06-11T16:30:30Z","abstract_excerpt":"Automated mechanism design (AMD) uses computational methods for mechanism design. Differentiable economics is a form of AMD that uses deep learning to learn mechanism designs and has enabled strong progress in AMD in recent years. Nevertheless, a major open problem has been to learn multi-bidder, general, and fully strategy-proof (SP) auctions. We introduce GEneral Menu-based NETwork (GemNet), which significantly extends the menu-based approach of the single-bidder RochetNet (D\\\"utting et al., 2024) to the multi-bidder setting. The challenge in achieving SP is to learn bidder-independent menus"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.07428","kind":"arxiv","version":3},"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/2406.07428/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":"2406.07428","created_at":"2026-07-05T09:31:04.034905+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.07428v3","created_at":"2026-07-05T09:31:04.034905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.07428","created_at":"2026-07-05T09:31:04.034905+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCTIFQBPRJ3S","created_at":"2026-07-05T09:31:04.034905+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCTIFQBPRJ3SWNZ2","created_at":"2026-07-05T09:31:04.034905+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCTIFQBP","created_at":"2026-07-05T09:31:04.034905+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07418","citing_title":"Optimal Auction Design in the Joint Advertising","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB","json":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB.json","graph_json":"https://pith.science/api/pith-number/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/graph.json","events_json":"https://pith.science/api/pith-number/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/events.json","paper":"https://pith.science/paper/GCTIFQBP"},"agent_actions":{"view_html":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB","download_json":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB.json","view_paper":"https://pith.science/paper/GCTIFQBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.07428&json=true","fetch_graph":"https://pith.science/api/pith-number/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/graph.json","fetch_events":"https://pith.science/api/pith-number/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/action/storage_attestation","attest_author":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/action/author_attestation","sign_citation":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/action/citation_signature","submit_replication":"https://pith.science/pith/GCTIFQBPRJ3SWNZ2CUJTS6WIRB/action/replication_record"}},"created_at":"2026-07-05T09:31:04.034905+00:00","updated_at":"2026-07-05T09:31:04.034905+00:00"}