Pith Number

pith:4UBO4OFW

pith:2026:4UBO4OFWBNFWQZPKJIPJJWDY2S

not attested not anchored not stored refs resolved

Harnessing Unimodality in Semiparametric Contextual Pricing via Oracle Price Map Learning

Jinchi Lv, Xiaocong Xu, Yingying Fan, Yuxuan Han, Zhengyuan Zhou

In semiparametric contextual pricing, a scalar-index pilot reduces the problem to learning a one-dimensional smooth oracle price map whose nonparametric cost is minimax sharp.

arxiv:2605.15411 v1 · 2026-05-14 · stat.ML · cs.LG · math.OC

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{4UBO4OFWBNFWQZPKJIPJJWDY2S}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

The resulting policy achieves regret Õ(T^{(2β-1)/(4β-3)} + √(dT)). For fixed d, we establish a matching lower bound in the horizon dependence, unveiling that the nonparametric oracle-map learning term is minimax sharp.

C2weakest assumption

The revenue-geometry condition that gives a unique, stable, interior maximizer of the expected revenue function for each scalar index u (invoked to guarantee that the oracle price map is well-defined and (β-1)-smooth).

C3one line summary

ORBIT learns the (β-1)-smooth oracle price map via local polynomial approximation and bandit convex optimization in a semiparametric contextual pricing model, achieving regret Õ(T^{(2β-1)/(4β-3)} + √(dT)) with a matching lower bound for fixed d.

References

56 extracted · 56 resolved · 1 Pith anchors

[1] Proceedings of IEEE 36th Annual Foundations of Computer Science , pages= 1995

[2] SIAM Journal on Computing , volume=

[3] Revenue Maximization Under Sequential Price Competition Via The Estimation Of s-Concave Demand Functions · arXiv:2503.16737

[4] A Distribution-Free Theory of Nonparametric Regression , publisher =

[5] arXiv preprint arXiv:2405.06866 , year=

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:00:57.210540Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67

Aliases

arxiv: 2605.15411 · arxiv_version: 2605.15411v1 · doi: 10.48550/arxiv.2605.15411 · pith_short_12: 4UBO4OFWBNFW · pith_short_16: 4UBO4OFWBNFWQZPK · pith_short_8: 4UBO4OFW

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/4UBO4OFWBNFWQZPKJIPJJWDY2S \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: e502ee38b60b4b6865ea4a1e94d878d4a63f13df9b0ebb116a3d6d44f3911a67

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "3d59096f3bd29415ea9a139d7bff9f83170fdc8514151c3ba6eabfd7d9e546d1",
    "cross_cats_sorted": [
      "cs.LG",
      "math.OC"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "stat.ML",
    "submitted_at": "2026-05-14T20:53:23Z",
    "title_canon_sha256": "e79ebfe63e42145a850c015dc15b97c140245c16344fac9caf43e04d89bb80c3"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.15411",
    "kind": "arxiv",
    "version": 1
  }
}