{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F3ZDV6MSLKWJP56YWVXQYF5KX4","short_pith_number":"pith:F3ZDV6MS","schema_version":"1.0","canonical_sha256":"2ef23af9925aac97f7d8b56f0c17aabf2b1ffe081a13ce04b605ab7f8345f7e8","source":{"kind":"arxiv","id":"2202.02872","version":1},"attestation_state":"computed","paper":{"title":"Differentiable Economics for Randomized Affine Maximizer Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.GN","q-fin.EC"],"primary_cat":"cs.GT","authors_text":"John Dickerson, Michael Curry, Tuomas Sandholm","submitted_at":"2022-02-06T22:01:21Z","abstract_excerpt":"A recent approach to automated mechanism design, differentiable economics, represents auctions by rich function approximators and optimizes their performance by gradient descent. The ideal auction architecture for differentiable economics would be perfectly strategyproof, support multiple bidders and items, and be rich enough to represent the optimal (i.e. revenue-maximizing) mechanism. So far, such an architecture does not exist. There are single-bidder approaches (MenuNet, RochetNet) which are always strategyproof and can represent optimal mechanisms. RegretNet is multi-bidder and can approx"},"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":"2202.02872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2022-02-06T22:01:21Z","cross_cats_sorted":["cs.LG","econ.GN","q-fin.EC"],"title_canon_sha256":"c17c52698ec1d94c6cada50ad7895a7e38e63edd1899d914fdce26dc4e548d5c","abstract_canon_sha256":"c20980691b829c5c830b98f20363849928984ad8e40f31fa1e5432e6ca08427a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:54:33.705464Z","signature_b64":"FGg56qZzvnbj+IXBzfAYRfrFeUjyM6Q5gu1Deg9E6shGxYUa1+0nBjpZpmQXZ18NjEXE3m6/C1AtBWT0VOlOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef23af9925aac97f7d8b56f0c17aabf2b1ffe081a13ce04b605ab7f8345f7e8","last_reissued_at":"2026-07-05T03:54:33.705012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:54:33.705012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differentiable Economics for Randomized Affine Maximizer Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","econ.GN","q-fin.EC"],"primary_cat":"cs.GT","authors_text":"John Dickerson, Michael Curry, Tuomas Sandholm","submitted_at":"2022-02-06T22:01:21Z","abstract_excerpt":"A recent approach to automated mechanism design, differentiable economics, represents auctions by rich function approximators and optimizes their performance by gradient descent. The ideal auction architecture for differentiable economics would be perfectly strategyproof, support multiple bidders and items, and be rich enough to represent the optimal (i.e. revenue-maximizing) mechanism. So far, such an architecture does not exist. There are single-bidder approaches (MenuNet, RochetNet) which are always strategyproof and can represent optimal mechanisms. RegretNet is multi-bidder and can approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.02872","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/2202.02872/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":"2202.02872","created_at":"2026-07-05T03:54:33.705070+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.02872v1","created_at":"2026-07-05T03:54:33.705070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.02872","created_at":"2026-07-05T03:54:33.705070+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3ZDV6MSLKWJ","created_at":"2026-07-05T03:54:33.705070+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3ZDV6MSLKWJP56Y","created_at":"2026-07-05T03:54:33.705070+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3ZDV6MS","created_at":"2026-07-05T03:54:33.705070+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.10112","citing_title":"Duality for Optimal Multi-Item, Multi-Bidder Auction Design: Revenue Certificates through Deep Learning","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4","json":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4.json","graph_json":"https://pith.science/api/pith-number/F3ZDV6MSLKWJP56YWVXQYF5KX4/graph.json","events_json":"https://pith.science/api/pith-number/F3ZDV6MSLKWJP56YWVXQYF5KX4/events.json","paper":"https://pith.science/paper/F3ZDV6MS"},"agent_actions":{"view_html":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4","download_json":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4.json","view_paper":"https://pith.science/paper/F3ZDV6MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.02872&json=true","fetch_graph":"https://pith.science/api/pith-number/F3ZDV6MSLKWJP56YWVXQYF5KX4/graph.json","fetch_events":"https://pith.science/api/pith-number/F3ZDV6MSLKWJP56YWVXQYF5KX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4/action/storage_attestation","attest_author":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4/action/author_attestation","sign_citation":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4/action/citation_signature","submit_replication":"https://pith.science/pith/F3ZDV6MSLKWJP56YWVXQYF5KX4/action/replication_record"}},"created_at":"2026-07-05T03:54:33.705070+00:00","updated_at":"2026-07-05T03:54:33.705070+00:00"}