{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KA4KLK6Q7BQTPDZSGWOD62CUYY","short_pith_number":"pith:KA4KLK6Q","schema_version":"1.0","canonical_sha256":"5038a5abd0f861378f32359c3f6854c62f5f94fb3350fc184f1dc929ddb5b166","source":{"kind":"arxiv","id":"1208.1184","version":1},"attestation_state":"computed","paper":{"title":"Payment Rules through Discriminant-Based Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Benjamin Lubin, David C. Parkes, Felix Fischer, John K. Lai, Paul Duetting, Pitchayut Jirapinyo","submitted_at":"2012-08-06T15:07:32Z","abstract_excerpt":"In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret, we are able to adapt statistical machine learning techniques to the design of payment rules. This computational approach to mechanism design is applicable to domains with multi-dimensional types and situations where computational efficiency is a concern. Specifically, given an outcome rule and access to a type distribution, we train a support vector machine w"},"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":"1208.1184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-08-06T15:07:32Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"92d685e38f022b9599f22b94bdfc98c8324757fa7f1a646c64d044389db0faf0","abstract_canon_sha256":"193161bf18a85b84613289d4ae3270f13cd2486c641253952c4d59a18836312b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:20.422607Z","signature_b64":"GgETWMHdPQm81ND7pEQzDRJIYWNYcVjGVpVCVzBo0KzifDCL/Ri29skokLD14regMcD441lhqpZjgzuXA5qpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5038a5abd0f861378f32359c3f6854c62f5f94fb3350fc184f1dc929ddb5b166","last_reissued_at":"2026-05-18T03:49:20.421884Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:20.421884Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Payment Rules through Discriminant-Based Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Benjamin Lubin, David C. Parkes, Felix Fischer, John K. Lai, Paul Duetting, Pitchayut Jirapinyo","submitted_at":"2012-08-06T15:07:32Z","abstract_excerpt":"In mechanism design it is typical to impose incentive compatibility and then derive an optimal mechanism subject to this constraint. By replacing the incentive compatibility requirement with the goal of minimizing expected ex post regret, we are able to adapt statistical machine learning techniques to the design of payment rules. This computational approach to mechanism design is applicable to domains with multi-dimensional types and situations where computational efficiency is a concern. Specifically, given an outcome rule and access to a type distribution, we train a support vector machine w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.1184","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":""},"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":"1208.1184","created_at":"2026-05-18T03:49:20.421987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.1184v1","created_at":"2026-05-18T03:49:20.421987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.1184","created_at":"2026-05-18T03:49:20.421987+00:00"},{"alias_kind":"pith_short_12","alias_value":"KA4KLK6Q7BQT","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KA4KLK6Q7BQTPDZS","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KA4KLK6Q","created_at":"2026-05-18T12:27:11.947152+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/KA4KLK6Q7BQTPDZSGWOD62CUYY","json":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY.json","graph_json":"https://pith.science/api/pith-number/KA4KLK6Q7BQTPDZSGWOD62CUYY/graph.json","events_json":"https://pith.science/api/pith-number/KA4KLK6Q7BQTPDZSGWOD62CUYY/events.json","paper":"https://pith.science/paper/KA4KLK6Q"},"agent_actions":{"view_html":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY","download_json":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY.json","view_paper":"https://pith.science/paper/KA4KLK6Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.1184&json=true","fetch_graph":"https://pith.science/api/pith-number/KA4KLK6Q7BQTPDZSGWOD62CUYY/graph.json","fetch_events":"https://pith.science/api/pith-number/KA4KLK6Q7BQTPDZSGWOD62CUYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY/action/storage_attestation","attest_author":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY/action/author_attestation","sign_citation":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY/action/citation_signature","submit_replication":"https://pith.science/pith/KA4KLK6Q7BQTPDZSGWOD62CUYY/action/replication_record"}},"created_at":"2026-05-18T03:49:20.421987+00:00","updated_at":"2026-05-18T03:49:20.421987+00:00"}