{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4TLAR2LWMQDG3I2VT7AXP3AH5Z","short_pith_number":"pith:4TLAR2LW","schema_version":"1.0","canonical_sha256":"e4d608e97664066da3559fc177ec07ee5969932a933801568d2fb39ca5688cc9","source":{"kind":"arxiv","id":"1506.02719","version":1},"attestation_state":"computed","paper":{"title":"Non-parametric Revenue Optimization for Generalized Second Price Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Andres Munoz Medina, Mehryar Mohri","submitted_at":"2015-06-08T22:45:30Z","abstract_excerpt":"We present an extensive analysis of the key problem of learning optimal reserve prices for generalized second price auctions. We describe two algorithms for this task: one based on density estimation, and a novel algorithm benefiting from solid theoretical guarantees and with a very favorable running-time complexity of $O(n S \\log (n S))$, where $n$ is the sample size and $S$ the number of slots. Our theoretical guarantees are more favorable than those previously presented in the literature. Additionally, we show that even if bidders do not play at an equilibrium, our second algorithm is still"},"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":"1506.02719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-08T22:45:30Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"db31293e693670d8e5987483c4552dbf621169945b45f9edf8673afe98508708","abstract_canon_sha256":"3045cc027d8b630c50440ff47b68453608bfac856e181be894e3578a0def532d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:41.133054Z","signature_b64":"CHOP4NNQuY+rAlj3xrjViUKRCOX1wz88uoswcyMQ5SFBBnMhFtwIPUIvEcU8Icrq6cWQPzs/bsKSNDcdn/jfDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d608e97664066da3559fc177ec07ee5969932a933801568d2fb39ca5688cc9","last_reissued_at":"2026-05-18T01:55:41.132376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:41.132376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-parametric Revenue Optimization for Generalized Second Price Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Andres Munoz Medina, Mehryar Mohri","submitted_at":"2015-06-08T22:45:30Z","abstract_excerpt":"We present an extensive analysis of the key problem of learning optimal reserve prices for generalized second price auctions. We describe two algorithms for this task: one based on density estimation, and a novel algorithm benefiting from solid theoretical guarantees and with a very favorable running-time complexity of $O(n S \\log (n S))$, where $n$ is the sample size and $S$ the number of slots. Our theoretical guarantees are more favorable than those previously presented in the literature. Additionally, we show that even if bidders do not play at an equilibrium, our second algorithm is still"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02719","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":"1506.02719","created_at":"2026-05-18T01:55:41.132488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02719v1","created_at":"2026-05-18T01:55:41.132488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02719","created_at":"2026-05-18T01:55:41.132488+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TLAR2LWMQDG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TLAR2LWMQDG3I2V","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TLAR2LW","created_at":"2026-05-18T12:29:05.191682+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/4TLAR2LWMQDG3I2VT7AXP3AH5Z","json":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z.json","graph_json":"https://pith.science/api/pith-number/4TLAR2LWMQDG3I2VT7AXP3AH5Z/graph.json","events_json":"https://pith.science/api/pith-number/4TLAR2LWMQDG3I2VT7AXP3AH5Z/events.json","paper":"https://pith.science/paper/4TLAR2LW"},"agent_actions":{"view_html":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z","download_json":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z.json","view_paper":"https://pith.science/paper/4TLAR2LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02719&json=true","fetch_graph":"https://pith.science/api/pith-number/4TLAR2LWMQDG3I2VT7AXP3AH5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/4TLAR2LWMQDG3I2VT7AXP3AH5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z/action/storage_attestation","attest_author":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z/action/author_attestation","sign_citation":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z/action/citation_signature","submit_replication":"https://pith.science/pith/4TLAR2LWMQDG3I2VT7AXP3AH5Z/action/replication_record"}},"created_at":"2026-05-18T01:55:41.132488+00:00","updated_at":"2026-05-18T01:55:41.132488+00:00"}