{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BXY4RT3DN3RQBGZYYGA5OCCOLX","short_pith_number":"pith:BXY4RT3D","schema_version":"1.0","canonical_sha256":"0df1c8cf636ee3009b38c181d7084e5dddbe66b683aaeb1cd6fce7483d3de017","source":{"kind":"arxiv","id":"1706.03459","version":6},"attestation_state":"computed","paper":{"title":"Optimal Auctions through Deep Learning: Advances in Differentiable Economics","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, Harikrishna Narasimhan, Paul D\\\"utting, Sai Srivatsa Ravindranath, Zhe Feng","submitted_at":"2017-06-12T04:03:15Z","abstract_excerpt":"Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later a full analytical understanding of the optimal design still remains elusive for settings with two or more items. In this work, we initiate the exploration of the use of tools from deep learning for the automated design of optimal auctions. We model an auction as a multi-layer neural network, frame optimal auction design as a constrained learning problem, and show how it can be solved using s"},"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":"1706.03459","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-06-12T04:03:15Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"5f1fbb8abe4e14c4f4dac5ac2f05692a7a13344037b3a26b6a4286b1f1c06323","abstract_canon_sha256":"b59826869bebff17e8a2fe70cde3cb45a352dc390e85bf1717d5e62899cc8ff8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:06:26.502002Z","signature_b64":"Yhvq1Y6Sqrv2agODbfQ5UEVN9+0L1fo+emFEUChwZ2PRZoFuEVAsvW/JbqaLFoHH41OtixlufMRRkn9CGTW+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0df1c8cf636ee3009b38c181d7084e5dddbe66b683aaeb1cd6fce7483d3de017","last_reissued_at":"2026-07-05T05:06:26.501590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:06:26.501590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Auctions through Deep Learning: Advances in Differentiable Economics","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, Harikrishna Narasimhan, Paul D\\\"utting, Sai Srivatsa Ravindranath, Zhe Feng","submitted_at":"2017-06-12T04:03:15Z","abstract_excerpt":"Designing an incentive compatible auction that maximizes expected revenue is an intricate task. The single-item case was resolved in a seminal piece of work by Myerson in 1981, but more than 40 years later a full analytical understanding of the optimal design still remains elusive for settings with two or more items. In this work, we initiate the exploration of the use of tools from deep learning for the automated design of optimal auctions. We model an auction as a multi-layer neural network, frame optimal auction design as a constrained learning problem, and show how it can be solved using s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03459","kind":"arxiv","version":6},"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/1706.03459/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":"1706.03459","created_at":"2026-07-05T05:06:26.501648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03459v6","created_at":"2026-07-05T05:06:26.501648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03459","created_at":"2026-07-05T05:06:26.501648+00:00"},{"alias_kind":"pith_short_12","alias_value":"BXY4RT3DN3RQ","created_at":"2026-07-05T05:06:26.501648+00:00"},{"alias_kind":"pith_short_16","alias_value":"BXY4RT3DN3RQBGZY","created_at":"2026-07-05T05:06:26.501648+00:00"},{"alias_kind":"pith_short_8","alias_value":"BXY4RT3D","created_at":"2026-07-05T05:06:26.501648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02421","citing_title":"Emergence of Fair Leaders via Mediators in Multi-Agent Reinforcement Learning","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX","json":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX.json","graph_json":"https://pith.science/api/pith-number/BXY4RT3DN3RQBGZYYGA5OCCOLX/graph.json","events_json":"https://pith.science/api/pith-number/BXY4RT3DN3RQBGZYYGA5OCCOLX/events.json","paper":"https://pith.science/paper/BXY4RT3D"},"agent_actions":{"view_html":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX","download_json":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX.json","view_paper":"https://pith.science/paper/BXY4RT3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03459&json=true","fetch_graph":"https://pith.science/api/pith-number/BXY4RT3DN3RQBGZYYGA5OCCOLX/graph.json","fetch_events":"https://pith.science/api/pith-number/BXY4RT3DN3RQBGZYYGA5OCCOLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX/action/storage_attestation","attest_author":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX/action/author_attestation","sign_citation":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX/action/citation_signature","submit_replication":"https://pith.science/pith/BXY4RT3DN3RQBGZYYGA5OCCOLX/action/replication_record"}},"created_at":"2026-07-05T05:06:26.501648+00:00","updated_at":"2026-07-05T05:06:26.501648+00:00"}