{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HUMFM2JMHZQXTEL5MFXHCMP4A2","short_pith_number":"pith:HUMFM2JM","schema_version":"1.0","canonical_sha256":"3d1856692c3e6179917d616e7131fc069d47cd163f5082e1b52065848f578129","source":{"kind":"arxiv","id":"1901.06808","version":2},"attestation_state":"computed","paper":{"title":"Online Learning for Measuring Incentive Compatibility in Ad Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Eric Sodomka, Okke Schrijvers, Zhe Feng","submitted_at":"2019-01-21T07:07:59Z","abstract_excerpt":"In this paper we investigate the problem of measuring end-to-end Incentive Compatibility (IC) regret given black-box access to an auction mechanism. Our goal is to 1) compute an estimate for IC regret in an auction, 2) provide a measure of certainty around the estimate of IC regret, and 3) minimize the time it takes to arrive at an accurate estimate. We consider two main problems, with different informational assumptions: In the \\emph{advertiser problem} the goal is to measure IC regret for some known valuation $v$, while in the more general \\emph{demand-side platform (DSP) problem} we wish to"},"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":"1901.06808","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-01-21T07:07:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9d094e0a1a6e5b1606619778e3e2eaa7ef941f646491ff930f60136fa4e3804","abstract_canon_sha256":"da5638e7144f9ac488f3abeb2cb6565a0787cd29b44b57cfd10273d3b286f79f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:21.824534Z","signature_b64":"fVczwcpylxTymhcYU8TOcjS3v/sMBfJeIjMTz3K65Zv6zVXe7uh/8a9wm9tWndMJlrMqjvyMe02+LFaJn84FCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d1856692c3e6179917d616e7131fc069d47cd163f5082e1b52065848f578129","last_reissued_at":"2026-05-17T23:44:21.823894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:21.823894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Learning for Measuring Incentive Compatibility in Ad Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Eric Sodomka, Okke Schrijvers, Zhe Feng","submitted_at":"2019-01-21T07:07:59Z","abstract_excerpt":"In this paper we investigate the problem of measuring end-to-end Incentive Compatibility (IC) regret given black-box access to an auction mechanism. Our goal is to 1) compute an estimate for IC regret in an auction, 2) provide a measure of certainty around the estimate of IC regret, and 3) minimize the time it takes to arrive at an accurate estimate. We consider two main problems, with different informational assumptions: In the \\emph{advertiser problem} the goal is to measure IC regret for some known valuation $v$, while in the more general \\emph{demand-side platform (DSP) problem} we wish to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06808","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":""},"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":"1901.06808","created_at":"2026-05-17T23:44:21.823987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06808v2","created_at":"2026-05-17T23:44:21.823987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06808","created_at":"2026-05-17T23:44:21.823987+00:00"},{"alias_kind":"pith_short_12","alias_value":"HUMFM2JMHZQX","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HUMFM2JMHZQXTEL5","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HUMFM2JM","created_at":"2026-05-18T12:33:18.533446+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/HUMFM2JMHZQXTEL5MFXHCMP4A2","json":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2.json","graph_json":"https://pith.science/api/pith-number/HUMFM2JMHZQXTEL5MFXHCMP4A2/graph.json","events_json":"https://pith.science/api/pith-number/HUMFM2JMHZQXTEL5MFXHCMP4A2/events.json","paper":"https://pith.science/paper/HUMFM2JM"},"agent_actions":{"view_html":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2","download_json":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2.json","view_paper":"https://pith.science/paper/HUMFM2JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06808&json=true","fetch_graph":"https://pith.science/api/pith-number/HUMFM2JMHZQXTEL5MFXHCMP4A2/graph.json","fetch_events":"https://pith.science/api/pith-number/HUMFM2JMHZQXTEL5MFXHCMP4A2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2/action/storage_attestation","attest_author":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2/action/author_attestation","sign_citation":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2/action/citation_signature","submit_replication":"https://pith.science/pith/HUMFM2JMHZQXTEL5MFXHCMP4A2/action/replication_record"}},"created_at":"2026-05-17T23:44:21.823987+00:00","updated_at":"2026-05-17T23:44:21.823987+00:00"}