{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z5NPOVXUIPYHUOELS5WELP7RQ6","short_pith_number":"pith:Z5NPOVXU","schema_version":"1.0","canonical_sha256":"cf5af756f443f07a388b976c45bff187b183ccfcd757e1fbec4a6988ec5a1e46","source":{"kind":"arxiv","id":"1805.03382","version":2},"attestation_state":"computed","paper":{"title":"Automated Mechanism Design via Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Pingzhong Tang, Song Zuo, Weiran Shen","submitted_at":"2018-05-09T05:57:29Z","abstract_excerpt":"Using AI approaches to automatically design mechanisms has been a central research mission at the interface of AI and economics [Conitzer and Sandholm, 2002]. Previous approaches that attempt to design revenue optimal auctions for the multi-dimensional settings fall short in at least one of the three aspects: 1) representation -- search in a space that probably does not even contain the optimal mechanism; 2) exactness -- finding a mechanism that is either not truthful or far from optimal; 3) domain dependence -- need a different design for different environment settings.\n  To resolve the three"},"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":"1805.03382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-09T05:57:29Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e3d3c65317f605389cb36a2e5a6802524f1177f594b72e09863bf50f16167dfd","abstract_canon_sha256":"b200369b10a834ca1be6b59ff93fa4445c39516d3909b3a3b0e2e451072328fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:36:41.876189Z","signature_b64":"opMF0oRfAy4i7C/3HkMGv2Nsxied7e7Dc5cJO6eP9jhl5wKGc9ZRQR7h7GqvM2nhS5H5I8ff0HSC7lmb9pXTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf5af756f443f07a388b976c45bff187b183ccfcd757e1fbec4a6988ec5a1e46","last_reissued_at":"2026-07-05T02:36:41.875739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:36:41.875739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated Mechanism Design via Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Pingzhong Tang, Song Zuo, Weiran Shen","submitted_at":"2018-05-09T05:57:29Z","abstract_excerpt":"Using AI approaches to automatically design mechanisms has been a central research mission at the interface of AI and economics [Conitzer and Sandholm, 2002]. Previous approaches that attempt to design revenue optimal auctions for the multi-dimensional settings fall short in at least one of the three aspects: 1) representation -- search in a space that probably does not even contain the optimal mechanism; 2) exactness -- finding a mechanism that is either not truthful or far from optimal; 3) domain dependence -- need a different design for different environment settings.\n  To resolve the three"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03382","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.03382/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":"1805.03382","created_at":"2026-07-05T02:36:41.875807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03382v2","created_at":"2026-07-05T02:36:41.875807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03382","created_at":"2026-07-05T02:36:41.875807+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5NPOVXUIPYH","created_at":"2026-07-05T02:36:41.875807+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5NPOVXUIPYHUOEL","created_at":"2026-07-05T02:36:41.875807+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5NPOVXU","created_at":"2026-07-05T02:36:41.875807+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02435","citing_title":"Deterministic-Allocation and Anonymous Joint Advertising in E-commerce Platforms","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6","json":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6.json","graph_json":"https://pith.science/api/pith-number/Z5NPOVXUIPYHUOELS5WELP7RQ6/graph.json","events_json":"https://pith.science/api/pith-number/Z5NPOVXUIPYHUOELS5WELP7RQ6/events.json","paper":"https://pith.science/paper/Z5NPOVXU"},"agent_actions":{"view_html":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6","download_json":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6.json","view_paper":"https://pith.science/paper/Z5NPOVXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03382&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5NPOVXUIPYHUOELS5WELP7RQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5NPOVXUIPYHUOELS5WELP7RQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6/action/storage_attestation","attest_author":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6/action/author_attestation","sign_citation":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6/action/citation_signature","submit_replication":"https://pith.science/pith/Z5NPOVXUIPYHUOELS5WELP7RQ6/action/replication_record"}},"created_at":"2026-07-05T02:36:41.875807+00:00","updated_at":"2026-07-05T02:36:41.875807+00:00"}