<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Hardness on Tenu Tech Brief</title>
    <link>https://cluster-site.onrender.com/tags/hardness/</link>
    <description>Recent content in Hardness on Tenu Tech Brief</description>
    <generator>Hugo -- 0.146.0</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 24 Feb 2026 06:04:34 +0000</lastBuildDate>
    <atom:link href="https://cluster-site.onrender.com/tags/hardness/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Finding a Fair Scoring Function for Top-$k$ Selection: From Hardness to Practice</title>
      <link>https://cluster-site.onrender.com/posts/finding-a-fair-scoring-function-for-top-k-selection-from-hardness-to-practice/</link>
      <pubDate>Fri, 20 Feb 2026 05:00:00 +0000</pubDate>
      <guid>https://cluster-site.onrender.com/posts/finding-a-fair-scoring-function-for-top-k-selection-from-hardness-to-practice/</guid>
      <description>• Computer Science &amp;gt; Databases [Submitted on 14 Mar 2025 (v1), last revised 19 Feb 2026 (this version, v4)] Title:Finding a Fair Scoring Function for Top-$k$ Selection: From Hardne</description>
    </item>
  </channel>
</rss>
