{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:P6ROXHAFM6QBYJZE3AUMYPVZWV","short_pith_number":"pith:P6ROXHAF","schema_version":"1.0","canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","source":{"kind":"arxiv","id":"2308.10499","version":1},"attestation_state":"computed","paper":{"title":"Fair Rank Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Subramanian, Arindam Khan, Diptarka Chakraborty, Syamantak Das","submitted_at":"2023-08-21T06:38:43Z","abstract_excerpt":"Ranking algorithms find extensive usage in diverse areas such as web search, employment, college admission, voting, etc. The related rank aggregation problem deals with combining multiple rankings into a single aggregate ranking. However, algorithms for both these problems might be biased against some individuals or groups due to implicit prejudice or marginalization in the historical data. We study ranking and rank aggregation problems from a fairness or diversity perspective, where the candidates (to be ranked) may belong to different groups and each group should have a fair representation i"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2308.10499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T06:38:43Z","cross_cats_sorted":[],"title_canon_sha256":"2287e0d567192874f8b47381f95a373c6a8ba6dd42698aecad6d2304d3f657a8","abstract_canon_sha256":"18c1d30f0a3cc481e40dd736a97ca8e7065f36fd2a5ef22db1e300511098f1f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:10.197048Z","signature_b64":"4ysV9a8nnLq25YrpKIFYG2lraxd0uSW2aawbNHHmcrlOYaedUUKmX9SZ5AcYYVUH0fsBSloNxJhOtSF3pgWjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","last_reissued_at":"2026-07-05T06:43:10.196646Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:10.196646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Rank Aggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Subramanian, Arindam Khan, Diptarka Chakraborty, Syamantak Das","submitted_at":"2023-08-21T06:38:43Z","abstract_excerpt":"Ranking algorithms find extensive usage in diverse areas such as web search, employment, college admission, voting, etc. The related rank aggregation problem deals with combining multiple rankings into a single aggregate ranking. However, algorithms for both these problems might be biased against some individuals or groups due to implicit prejudice or marginalization in the historical data. We study ranking and rank aggregation problems from a fairness or diversity perspective, where the candidates (to be ranked) may belong to different groups and each group should have a fair representation i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10499","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.10499/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.10499","created_at":"2026-07-05T06:43:10.196706+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.10499v1","created_at":"2026-07-05T06:43:10.196706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10499","created_at":"2026-07-05T06:43:10.196706+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6ROXHAFM6QB","created_at":"2026-07-05T06:43:10.196706+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6ROXHAFM6QBYJZE","created_at":"2026-07-05T06:43:10.196706+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6ROXHAF","created_at":"2026-07-05T06:43:10.196706+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07153","citing_title":"Ranking and Rank Aggregation with Matroid Prefix Constraints","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV","json":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV.json","graph_json":"https://pith.science/api/pith-number/P6ROXHAFM6QBYJZE3AUMYPVZWV/graph.json","events_json":"https://pith.science/api/pith-number/P6ROXHAFM6QBYJZE3AUMYPVZWV/events.json","paper":"https://pith.science/paper/P6ROXHAF"},"agent_actions":{"view_html":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV","download_json":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV.json","view_paper":"https://pith.science/paper/P6ROXHAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.10499&json=true","fetch_graph":"https://pith.science/api/pith-number/P6ROXHAFM6QBYJZE3AUMYPVZWV/graph.json","fetch_events":"https://pith.science/api/pith-number/P6ROXHAFM6QBYJZE3AUMYPVZWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/action/storage_attestation","attest_author":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/action/author_attestation","sign_citation":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/action/citation_signature","submit_replication":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/action/replication_record"}},"created_at":"2026-07-05T06:43:10.196706+00:00","updated_at":"2026-07-05T06:43:10.196706+00:00"}