Pith Number

pith:6MCM3MHU

pith:2026:6MCM3MHUO3GROXHXXRNI524NAK

not attested not anchored not stored refs pending

Beyond Match Maximization and Fairness: Retention-Optimized Two-Sided Matching

Koichi Tanaka, Masahiro Nomura, Ren Kishimoto, Rikiya Takehi, Riku Togashi, Yoji Tomita, Yuta Saito

MRet maximizes retention in two-sided matching by learning personalized curves that predict how recommendations affect each user's decision to stay.

arxiv:2602.15752 v3 · 2026-02-17 · cs.LG

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{6MCM3MHUO3GROXHXXRNI524NAK}

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

empirical evaluations on synthetic and real-world datasets from a major online dating platform show that MRet achieves higher user retention, since conventional methods optimize matches or fairness rather than retention.

C2weakest assumption

that personalized retention curves learned from each user's profile and interaction history accurately capture how future recommendations will affect that user's decision to stay or leave, and that the joint optimization over both sides correctly allocates limited matches to maximize aggregate retention.

C3one line summary

MRet is a dynamic LTR algorithm that maximizes platform-wide user retention in two-sided matching by jointly optimizing retention gains for both the recipient and the recommended users via learned personalized retention curves.

Receipt and verification

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

Canonical hash

f304cdb0f476cd175cf7bc5a8eeb8d029df68ba4ae3b8d9687504058952cd31a

Aliases

arxiv: 2602.15752 · arxiv_version: 2602.15752v3 · doi: 10.48550/arxiv.2602.15752 · pith_short_12: 6MCM3MHUO3GR · pith_short_16: 6MCM3MHUO3GROXHX · pith_short_8: 6MCM3MHU

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/6MCM3MHUO3GROXHXXRNI524NAK \
  | 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: f304cdb0f476cd175cf7bc5a8eeb8d029df68ba4ae3b8d9687504058952cd31a

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "7946dfa3f296150e470e7a5e0abb96ae97dd8d3c2e2ea2fbefe4335acd84f0a1",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-02-17T17:30:53Z",
    "title_canon_sha256": "a89acae1b5fc8c9bf1e4a5038373d651560ffe4322cdd7110639a43c30e3ce54"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2602.15752",
    "kind": "arxiv",
    "version": 3
  }
}