{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4KU5JFG4IVB4KUHM5IAUZZJWOD","short_pith_number":"pith:4KU5JFG4","canonical_record":{"source":{"id":"1707.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-17T11:29:14Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"5a02031f12ed0a281af5c63828dbdd9e6c2cf787b6e0ea3453489756d1d15cbe","abstract_canon_sha256":"ee51254f7e556c44e2a901937fa18fc3b725637b6f3fc505d9a5680fbc0cc686"},"schema_version":"1.0"},"canonical_sha256":"e2a9d494dc4543c550ecea014ce53670f6dad9d1e56a17009b30abf2e36eff85","source":{"kind":"arxiv","id":"1707.05101","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05101","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05101v2","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05101","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"4KU5JFG4IVB4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KU5JFG4IVB4KUHM","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KU5JFG4","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4KU5JFG4IVB4KUHM5IAUZZJWOD","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05101","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-17T11:29:14Z","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"title_canon_sha256":"5a02031f12ed0a281af5c63828dbdd9e6c2cf787b6e0ea3453489756d1d15cbe","abstract_canon_sha256":"ee51254f7e556c44e2a901937fa18fc3b725637b6f3fc505d9a5680fbc0cc686"},"schema_version":"1.0"},"canonical_sha256":"e2a9d494dc4543c550ecea014ce53670f6dad9d1e56a17009b30abf2e36eff85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:04.295717Z","signature_b64":"khxwdeLvypZ2wST1He6IJOMaHRi+05/UIfXa8qQNgieCxKloNZn5cFZg2rJB7zQkHrh53d2CmNFyvfmho+5uAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a9d494dc4543c550ecea014ce53670f6dad9d1e56a17009b30abf2e36eff85","last_reissued_at":"2026-05-18T00:24:04.295214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:04.295214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05101","source_version":2,"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:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7RmHqUZLuWOQXQHbgEnDDBnXDbufSzK5MiG3HxzPxohSfnj9ZlQMcwDV2oCUylcejoD4oP0teyB8qJJ5hjXjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:29:28.503404Z"},"content_sha256":"59323e1ed0f581d07d41dce3e88985c0b2909fa5fee00706776d8ba2620f6b66","schema_version":"1.0","event_id":"sha256:59323e1ed0f581d07d41dce3e88985c0b2909fa5fee00706776d8ba2620f6b66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4KU5JFG4IVB4KUHM5IAUZZJWOD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On consistency of optimal pricing algorithms in repeated posted-price auctions with strategic buyer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Alexey Drutsa","submitted_at":"2017-07-17T11:29:14Z","abstract_excerpt":"We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his cumulative discounted surplus. For this setting, first, we propose a novel algorithm that never decreases offered prices and has a tight strategic regret bound in $\\Theta(\\log\\log T)$ under some mild assumptions on the buyer surplus discounting. This result closes the open research question on the existence of a no-regret horizon-independent weakly consistent pricing. The proposed al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05101","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"},"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:24:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0VFRqRhm5VhEua95fMa+/NEXNGaqcqEN4XOpq6XnIp3vOhX4bpSj/GCpUKfd/+CZ9iel7uZWq6MNsb40skhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:29:28.503750Z"},"content_sha256":"2847ec4069794d130c1c6ef6b6889b4bbfa8f2e5fb754bbb5287ef9156726b99","schema_version":"1.0","event_id":"sha256:2847ec4069794d130c1c6ef6b6889b4bbfa8f2e5fb754bbb5287ef9156726b99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/bundle.json","state_url":"https://pith.science/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/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-06-02T05:29:28Z","links":{"resolver":"https://pith.science/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD","bundle":"https://pith.science/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/bundle.json","state":"https://pith.science/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KU5JFG4IVB4KUHM5IAUZZJWOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4KU5JFG4IVB4KUHM5IAUZZJWOD","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":"ee51254f7e556c44e2a901937fa18fc3b725637b6f3fc505d9a5680fbc0cc686","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-17T11:29:14Z","title_canon_sha256":"5a02031f12ed0a281af5c63828dbdd9e6c2cf787b6e0ea3453489756d1d15cbe"},"schema_version":"1.0","source":{"id":"1707.05101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05101","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05101v2","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05101","created_at":"2026-05-18T00:24:04Z"},{"alias_kind":"pith_short_12","alias_value":"4KU5JFG4IVB4","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4KU5JFG4IVB4KUHM","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4KU5JFG4","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:2847ec4069794d130c1c6ef6b6889b4bbfa8f2e5fb754bbb5287ef9156726b99","target":"graph","created_at":"2026-05-18T00:24:04Z","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":"We study revenue optimization learning algorithms for repeated posted-price auctions where a seller interacts with a single strategic buyer that holds a fixed private valuation for a good and seeks to maximize his cumulative discounted surplus. For this setting, first, we propose a novel algorithm that never decreases offered prices and has a tight strategic regret bound in $\\Theta(\\log\\log T)$ under some mild assumptions on the buyer surplus discounting. This result closes the open research question on the existence of a no-regret horizon-independent weakly consistent pricing. The proposed al","authors_text":"Alexey Drutsa","cross_cats":["cs.AI","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-17T11:29:14Z","title":"On consistency of optimal pricing algorithms in repeated posted-price auctions with strategic buyer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05101","kind":"arxiv","version":2},"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:59323e1ed0f581d07d41dce3e88985c0b2909fa5fee00706776d8ba2620f6b66","target":"record","created_at":"2026-05-18T00:24:04Z","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":"ee51254f7e556c44e2a901937fa18fc3b725637b6f3fc505d9a5680fbc0cc686","cross_cats_sorted":["cs.AI","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-07-17T11:29:14Z","title_canon_sha256":"5a02031f12ed0a281af5c63828dbdd9e6c2cf787b6e0ea3453489756d1d15cbe"},"schema_version":"1.0","source":{"id":"1707.05101","kind":"arxiv","version":2}},"canonical_sha256":"e2a9d494dc4543c550ecea014ce53670f6dad9d1e56a17009b30abf2e36eff85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2a9d494dc4543c550ecea014ce53670f6dad9d1e56a17009b30abf2e36eff85","first_computed_at":"2026-05-18T00:24:04.295214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:04.295214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"khxwdeLvypZ2wST1He6IJOMaHRi+05/UIfXa8qQNgieCxKloNZn5cFZg2rJB7zQkHrh53d2CmNFyvfmho+5uAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:04.295717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59323e1ed0f581d07d41dce3e88985c0b2909fa5fee00706776d8ba2620f6b66","sha256:2847ec4069794d130c1c6ef6b6889b4bbfa8f2e5fb754bbb5287ef9156726b99"],"state_sha256":"f57e8d78de342cd154fb9894894274b75e187fed8819e4557ca1a461ade66d6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ig0NeMwdcTQGR0hWYVo4utywsKmYF3Vip6srHMHlKVLpmGsHfNv154i+H4Qpc5bwMO8GBxfJEclRldX69FMcDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:29:28.505586Z","bundle_sha256":"20c1052d0a03664d72967912cdf58ff07ff110cad6167f07dfc89a86794de10e"}}