{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FVZM5K4HJJHFEFHE6WAUPWTTGR","short_pith_number":"pith:FVZM5K4H","canonical_record":{"source":{"id":"1711.10279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-28T13:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"fa76d3998dc7e58b338004dffd40a74f7e492a75e0a536c4ea65b469476e8684","abstract_canon_sha256":"5e69dd6641ea4e0591dba7937f1463d6bf691aed2af0f84926a4ac62201dfa8c"},"schema_version":"1.0"},"canonical_sha256":"2d72ceab874a4e5214e4f58147da73347a78ab0d88842fa82ff3f775ba311ebd","source":{"kind":"arxiv","id":"1711.10279","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10279","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10279v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10279","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"FVZM5K4HJJHF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZM5K4HJJHFEFHE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZM5K4H","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FVZM5K4HJJHFEFHE6WAUPWTTGR","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-28T13:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"fa76d3998dc7e58b338004dffd40a74f7e492a75e0a536c4ea65b469476e8684","abstract_canon_sha256":"5e69dd6641ea4e0591dba7937f1463d6bf691aed2af0f84926a4ac62201dfa8c"},"schema_version":"1.0"},"canonical_sha256":"2d72ceab874a4e5214e4f58147da73347a78ab0d88842fa82ff3f775ba311ebd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:22.753559Z","signature_b64":"DqL/BeGyCsHoD/wd6MydRp89v89DYyq48AuU+H+M2/tQLwdVA4SPMDj6cM//iBjCzDpXgtEL/PsOPZvvudH8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d72ceab874a4e5214e4f58147da73347a78ab0d88842fa82ff3f775ba311ebd","last_reissued_at":"2026-05-18T00:29:22.752845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:22.752845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10279","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3PBumpxkqqX/I/2Q8IU1oOI6bXp2YplFJ7hj8pf2p3C1+TUYqsHTXW/VKa3hQrbfKevAVQeip0wo5aEqnBHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:29.399937Z"},"content_sha256":"5e9d1b7380351cdd6245390cf0675b29b6e7986242a2e7e86379bf0a1cbfee3c","schema_version":"1.0","event_id":"sha256:5e9d1b7380351cdd6245390cf0675b29b6e7986242a2e7e86379bf0a1cbfee3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FVZM5K4HJJHFEFHE6WAUPWTTGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Mechanism Design, with Applications to Dynamic Pricing in Sponsored Search Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Binghui Peng, Hanpeng Liu, Michael Zhang, Pengjun Lu, Pingzhong Tang, Ruohan Qian, Weiran Shen, Yan Hong, Zhi Guo, Zongyao Ding","submitted_at":"2017-11-28T13:25:35Z","abstract_excerpt":"In this study, we apply reinforcement learning techniques and propose what we call reinforcement mechanism design to tackle the dynamic pricing problem in sponsored search auctions. In contrast to previous game-theoretical approaches that heavily rely on rationality and common knowledge among the bidders, we take a data-driven approach, and try to learn, over repeated interactions, the set of optimal reserve prices. We implement our approach within the current sponsored search framework of a major search engine: we first train a buyer behavior model, via a real bidding data set, that accuratel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10279","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lh0+yF1L0259x9MdqLUpLanJ6X+4ler9e+IbOF3BU+sIlXHtzx7mkh0AkzN/fAnuDqADNPUY/xVR0UXGLU16Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:29.400626Z"},"content_sha256":"66d70a4687ccc9cebc05ee57e1e08f2c54cffb28a4da210ca6a0055dded0033c","schema_version":"1.0","event_id":"sha256:66d70a4687ccc9cebc05ee57e1e08f2c54cffb28a4da210ca6a0055dded0033c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/bundle.json","state_url":"https://pith.science/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T19:23:29Z","links":{"resolver":"https://pith.science/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR","bundle":"https://pith.science/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/bundle.json","state":"https://pith.science/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVZM5K4HJJHFEFHE6WAUPWTTGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FVZM5K4HJJHFEFHE6WAUPWTTGR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e69dd6641ea4e0591dba7937f1463d6bf691aed2af0f84926a4ac62201dfa8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-28T13:25:35Z","title_canon_sha256":"fa76d3998dc7e58b338004dffd40a74f7e492a75e0a536c4ea65b469476e8684"},"schema_version":"1.0","source":{"id":"1711.10279","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10279","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10279v1","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10279","created_at":"2026-05-18T00:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"FVZM5K4HJJHF","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FVZM5K4HJJHFEFHE","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FVZM5K4H","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:66d70a4687ccc9cebc05ee57e1e08f2c54cffb28a4da210ca6a0055dded0033c","target":"graph","created_at":"2026-05-18T00:29:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this study, we apply reinforcement learning techniques and propose what we call reinforcement mechanism design to tackle the dynamic pricing problem in sponsored search auctions. In contrast to previous game-theoretical approaches that heavily rely on rationality and common knowledge among the bidders, we take a data-driven approach, and try to learn, over repeated interactions, the set of optimal reserve prices. We implement our approach within the current sponsored search framework of a major search engine: we first train a buyer behavior model, via a real bidding data set, that accuratel","authors_text":"Binghui Peng, Hanpeng Liu, Michael Zhang, Pengjun Lu, Pingzhong Tang, Ruohan Qian, Weiran Shen, Yan Hong, Zhi Guo, Zongyao Ding","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-28T13:25:35Z","title":"Reinforcement Mechanism Design, with Applications to Dynamic Pricing in Sponsored Search Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10279","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5e9d1b7380351cdd6245390cf0675b29b6e7986242a2e7e86379bf0a1cbfee3c","target":"record","created_at":"2026-05-18T00:29:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e69dd6641ea4e0591dba7937f1463d6bf691aed2af0f84926a4ac62201dfa8c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-28T13:25:35Z","title_canon_sha256":"fa76d3998dc7e58b338004dffd40a74f7e492a75e0a536c4ea65b469476e8684"},"schema_version":"1.0","source":{"id":"1711.10279","kind":"arxiv","version":1}},"canonical_sha256":"2d72ceab874a4e5214e4f58147da73347a78ab0d88842fa82ff3f775ba311ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d72ceab874a4e5214e4f58147da73347a78ab0d88842fa82ff3f775ba311ebd","first_computed_at":"2026-05-18T00:29:22.752845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:22.752845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DqL/BeGyCsHoD/wd6MydRp89v89DYyq48AuU+H+M2/tQLwdVA4SPMDj6cM//iBjCzDpXgtEL/PsOPZvvudH8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:22.753559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10279","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e9d1b7380351cdd6245390cf0675b29b6e7986242a2e7e86379bf0a1cbfee3c","sha256:66d70a4687ccc9cebc05ee57e1e08f2c54cffb28a4da210ca6a0055dded0033c"],"state_sha256":"733d6cffd960102be115677d9abafe4fd659038b46e73c8ff77c54b1a8cb1d3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J/dSeuDZWQZJykuNmEwYnYUJ23IKIPr2JD5VNfKiKZg+e7icXsxb7iTlOvnrdw8wSY/koT/asI9/CaZmUZ8QCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:23:29.404536Z","bundle_sha256":"47300cccce67315ae1c957f13692e853439abb6a95beb7ced917648c04694e6f"}}