Pith Number

pith:GRAVZULO

pith:2026:GRAVZULO5LXBWQTQKPQ4PCPP2I

not attested not anchored not stored refs resolved

Policy-Grounded Dynamic Facet Suggestions for Job Search

Baofen Zheng, Chunnan Yao, Dan Xu, Hsiang Lin, Jianqiang Shen, Jingwei Wu, Kevin Kao, Ping Liu, Qianqi Shen, Rajat Arora, Wanjun Jiang, Wenjing Zhang, Wenqiong Liu, Yusuke Takebuchi

Dynamic facet suggestion refines short job queries by surfacing personalized semantic attributes from user and query context.

arxiv:2605.16479 v1 · 2026-05-15 · cs.IR · cs.AI

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{GRAVZULO5LXBWQTQKPQ4PCPP2I}

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

We present dynamic facet suggestion (DFS), an interactive query refinement mechanism that facilitates intent disambiguation by surfacing personalized semantic attributes conditioned on the joint user-query context in real time.

C2weakest assumption

That the combination of offline taxonomy curation, embedding retrieval, and distilled SLM scoring will reliably produce personalized facets that improve downstream job search outcomes when deployed in production.

C3one line summary

A policy-grounded retrieval-augmented framework with SLM scoring generates real-time personalized facet suggestions that boost engagement and job search outcomes.

References

38 extracted · 38 resolved · 7 Pith anchors

[1] Kato, and Masafumi Oyamada 2025

[2] Qwen Technical Report 2023 · arXiv:2309.16609

[3] Constitutional AI: Harmlessness from AI Feedback 2022 · doi:10.48550/arxiv.2212.08073

[4] Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. InProceedings of the 24th ICML. 129–136 2007

[5] Yuanning Feng, Sinan Wang, Zhengxiang Cheng, Yao Wan, and Dongping Chen

Formal links

1 machine-checked theorem link

Receipt and verification

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

Canonical hash

34415cd16eeaee1b427053e1c789efd21b4f7453a79ee06b49bd06bbad553b38

Aliases

arxiv: 2605.16479 · arxiv_version: 2605.16479v1 · doi: 10.48550/arxiv.2605.16479 · pith_short_12: GRAVZULO5LXB · pith_short_16: GRAVZULO5LXBWQTQ · pith_short_8: GRAVZULO

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/GRAVZULO5LXBWQTQKPQ4PCPP2I \
  | 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: 34415cd16eeaee1b427053e1c789efd21b4f7453a79ee06b49bd06bbad553b38

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "ca350b042ab72f0436434606a885c496c1de9cc5e719b0d0506f70fe1420329a",
    "cross_cats_sorted": [
      "cs.AI"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.IR",
    "submitted_at": "2026-05-15T17:30:45Z",
    "title_canon_sha256": "9bd892258d7e475992d22b3ae35a901f9e86a4925548273e6fd1d8b1b0a92c1f"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16479",
    "kind": "arxiv",
    "version": 1
  }
}