{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WZWA7VZTBVY6W5NRMJJXY3PCJF","short_pith_number":"pith:WZWA7VZT","canonical_record":{"source":{"id":"1705.09700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T19:59:50Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"9ad74cd092cc7972d0003c8bd13aa89e421957d9f55eb557fac338a9aaaec989","abstract_canon_sha256":"5046e379e1360b87d9823b1779a43803aa072680940b139dbb9d77d191b10686"},"schema_version":"1.0"},"canonical_sha256":"b66c0fd7330d71eb75b162537c6de2496f9f30a9e6cb7a0dd4183b69d5f0ef12","source":{"kind":"arxiv","id":"1705.09700","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09700","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09700v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09700","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"WZWA7VZTBVY6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZWA7VZTBVY6W5NR","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZWA7VZT","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WZWA7VZTBVY6W5NRMJJXY3PCJF","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09700","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T19:59:50Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"9ad74cd092cc7972d0003c8bd13aa89e421957d9f55eb557fac338a9aaaec989","abstract_canon_sha256":"5046e379e1360b87d9823b1779a43803aa072680940b139dbb9d77d191b10686"},"schema_version":"1.0"},"canonical_sha256":"b66c0fd7330d71eb75b162537c6de2496f9f30a9e6cb7a0dd4183b69d5f0ef12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:56.702141Z","signature_b64":"FeNbxmlTT9c8w1Lmth84i2lECPHkd3Npad5YEV7V5+uRIfTHDmi8Tat+9hlP6KgbyntG29rS47xiGHzEx1dhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66c0fd7330d71eb75b162537c6de2496f9f30a9e6cb7a0dd4183b69d5f0ef12","last_reissued_at":"2026-05-18T00:05:56.701568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:56.701568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09700","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8W+fI6CKbEniOU6ggwoYuyp3gkYjGTlQXNnnQGPHqMiVeC8DF4PTnkHh4tm0sJTsCQl9LsoWYiJ+jkSU23MgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T16:47:37.675746Z"},"content_sha256":"13145d3f0543be1edc8e88b95d443c1b92c134811d09b4f99c16ba50c336ea7a","schema_version":"1.0","event_id":"sha256:13145d3f0543be1edc8e88b95d443c1b92c134811d09b4f99c16ba50c336ea7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WZWA7VZTBVY6W5NRMJJXY3PCJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-scale Online Learning and its Applications to Online Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"cs.GT","authors_text":"Nikhil R. Devanur, Rad Niazadeh, S\\'ebastien Bubeck, Zhiyi Huang","submitted_at":"2017-05-26T19:59:50Z","abstract_excerpt":"We consider revenue maximization in online auction/pricing problems. A seller sells an identical item in each period to a new buyer, or a new set of buyers. For the online posted pricing problem, we show regret bounds that scale with the best fixed price, rather than the range of the values. We also show regret bounds that are almost scale free, and match the offline sample complexity, when comparing to a benchmark that requires a lower bound on the market share. These results are obtained by generalizing the classical learning from experts and multi-armed bandit problems to their multi-scale "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09700","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:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q58jK76rEFLurGdbn/xA67Aq5wYQRXW4Tj7YvwKltxYKUvPO4QO+L0qHPcGpB88QIwPF/w1BrUTRNoy4cgxhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T16:47:37.676094Z"},"content_sha256":"2204320d6c9f585e15bfcd0fe0aefc7c542fb9078aca663927b125f25516f33c","schema_version":"1.0","event_id":"sha256:2204320d6c9f585e15bfcd0fe0aefc7c542fb9078aca663927b125f25516f33c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/bundle.json","state_url":"https://pith.science/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/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-29T16:47:37Z","links":{"resolver":"https://pith.science/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF","bundle":"https://pith.science/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/bundle.json","state":"https://pith.science/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZWA7VZTBVY6W5NRMJJXY3PCJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WZWA7VZTBVY6W5NRMJJXY3PCJF","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":"5046e379e1360b87d9823b1779a43803aa072680940b139dbb9d77d191b10686","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T19:59:50Z","title_canon_sha256":"9ad74cd092cc7972d0003c8bd13aa89e421957d9f55eb557fac338a9aaaec989"},"schema_version":"1.0","source":{"id":"1705.09700","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09700","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09700v2","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09700","created_at":"2026-05-18T00:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"WZWA7VZTBVY6","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WZWA7VZTBVY6W5NR","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WZWA7VZT","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:2204320d6c9f585e15bfcd0fe0aefc7c542fb9078aca663927b125f25516f33c","target":"graph","created_at":"2026-05-18T00:05:56Z","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 consider revenue maximization in online auction/pricing problems. A seller sells an identical item in each period to a new buyer, or a new set of buyers. For the online posted pricing problem, we show regret bounds that scale with the best fixed price, rather than the range of the values. We also show regret bounds that are almost scale free, and match the offline sample complexity, when comparing to a benchmark that requires a lower bound on the market share. These results are obtained by generalizing the classical learning from experts and multi-armed bandit problems to their multi-scale ","authors_text":"Nikhil R. Devanur, Rad Niazadeh, S\\'ebastien Bubeck, Zhiyi Huang","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T19:59:50Z","title":"Multi-scale Online Learning and its Applications to Online Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09700","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:13145d3f0543be1edc8e88b95d443c1b92c134811d09b4f99c16ba50c336ea7a","target":"record","created_at":"2026-05-18T00:05:56Z","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":"5046e379e1360b87d9823b1779a43803aa072680940b139dbb9d77d191b10686","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-05-26T19:59:50Z","title_canon_sha256":"9ad74cd092cc7972d0003c8bd13aa89e421957d9f55eb557fac338a9aaaec989"},"schema_version":"1.0","source":{"id":"1705.09700","kind":"arxiv","version":2}},"canonical_sha256":"b66c0fd7330d71eb75b162537c6de2496f9f30a9e6cb7a0dd4183b69d5f0ef12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b66c0fd7330d71eb75b162537c6de2496f9f30a9e6cb7a0dd4183b69d5f0ef12","first_computed_at":"2026-05-18T00:05:56.701568Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:56.701568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FeNbxmlTT9c8w1Lmth84i2lECPHkd3Npad5YEV7V5+uRIfTHDmi8Tat+9hlP6KgbyntG29rS47xiGHzEx1dhAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:56.702141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09700","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13145d3f0543be1edc8e88b95d443c1b92c134811d09b4f99c16ba50c336ea7a","sha256:2204320d6c9f585e15bfcd0fe0aefc7c542fb9078aca663927b125f25516f33c"],"state_sha256":"bdc6c5cf03a16c055e16e384747787a644d07f27309c320aa972827d12f311cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"siC6B8xQEcL8BK7W334M+Vi/BCvKchtkyqa5rMiouzVk18+5JW7sy5bOLOz9GlvjV8GZ1jFxX96TKFDXVJG3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T16:47:37.677893Z","bundle_sha256":"a53e521650a548253dd6df7da9097ee391181c885dd23d112739bbbe1c46f504"}}