{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:P6ROXHAFM6QBYJZE3AUMYPVZWV","short_pith_number":"pith:P6ROXHAF","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"},"canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","source":{"kind":"arxiv","id":"2308.10499","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10499","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10499v1","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10499","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_12","alias_value":"P6ROXHAFM6QB","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_16","alias_value":"P6ROXHAFM6QBYJZE","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_8","alias_value":"P6ROXHAF","created_at":"2026-07-05T06:43:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:P6ROXHAFM6QBYJZE3AUMYPVZWV","target":"record","payload":{"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"},"canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","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"},"source_kind":"arxiv","source_id":"2308.10499","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:43:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aSEsUsSjpSU1T9596j5IJ0ibXAwq+PKun/95xTY+ONigr/1ytZfHdRZv6bOsAUwCc+TSBWNA49Kxdxt+kDC4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T09:10:25.467519Z"},"content_sha256":"73fc7a7a17435f292636420488c6fff1c61caf87fe66be1c2076497a0e43a551","schema_version":"1.0","event_id":"sha256:73fc7a7a17435f292636420488c6fff1c61caf87fe66be1c2076497a0e43a551"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:P6ROXHAFM6QBYJZE3AUMYPVZWV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:43:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mNPa0yXImGuorVox5IEB4rmhYQ3Gqa+eKb0cZ3KIIhdw2GzXnGtBNbHDA5fRpAgUBA7dDLT73fMuWeSsXWSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T09:10:25.468193Z"},"content_sha256":"0ae259e4e60e6526662f4a6f4332992142e90d52a2eb4d4d9375a1e896909266","schema_version":"1.0","event_id":"sha256:0ae259e4e60e6526662f4a6f4332992142e90d52a2eb4d4d9375a1e896909266"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/bundle.json","state_url":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-23T09:10:25Z","links":{"resolver":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV","bundle":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/bundle.json","state":"https://pith.science/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6ROXHAFM6QBYJZE3AUMYPVZWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:P6ROXHAFM6QBYJZE3AUMYPVZWV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"18c1d30f0a3cc481e40dd736a97ca8e7065f36fd2a5ef22db1e300511098f1f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T06:38:43Z","title_canon_sha256":"2287e0d567192874f8b47381f95a373c6a8ba6dd42698aecad6d2304d3f657a8"},"schema_version":"1.0","source":{"id":"2308.10499","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.10499","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"arxiv_version","alias_value":"2308.10499v1","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.10499","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_12","alias_value":"P6ROXHAFM6QB","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_16","alias_value":"P6ROXHAFM6QBYJZE","created_at":"2026-07-05T06:43:10Z"},{"alias_kind":"pith_short_8","alias_value":"P6ROXHAF","created_at":"2026-07-05T06:43:10Z"}],"graph_snapshots":[{"event_id":"sha256:0ae259e4e60e6526662f4a6f4332992142e90d52a2eb4d4d9375a1e896909266","target":"graph","created_at":"2026-07-05T06:43:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.10499/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Aditya Subramanian, Arindam Khan, Diptarka Chakraborty, Syamantak Das","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T06:38:43Z","title":"Fair Rank Aggregation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.10499","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:73fc7a7a17435f292636420488c6fff1c61caf87fe66be1c2076497a0e43a551","target":"record","created_at":"2026-07-05T06:43:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"18c1d30f0a3cc481e40dd736a97ca8e7065f36fd2a5ef22db1e300511098f1f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-21T06:38:43Z","title_canon_sha256":"2287e0d567192874f8b47381f95a373c6a8ba6dd42698aecad6d2304d3f657a8"},"schema_version":"1.0","source":{"id":"2308.10499","kind":"arxiv","version":1}},"canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fa2eb9c0567a01c2724d828cc3eb9b54d66a6d767895ca01919eab8a9a7adff","first_computed_at":"2026-07-05T06:43:10.196646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:43:10.196646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ysV9a8nnLq25YrpKIFYG2lraxd0uSW2aawbNHHmcrlOYaedUUKmX9SZ5AcYYVUH0fsBSloNxJhOtSF3pgWjBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:43:10.197048Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.10499","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73fc7a7a17435f292636420488c6fff1c61caf87fe66be1c2076497a0e43a551","sha256:0ae259e4e60e6526662f4a6f4332992142e90d52a2eb4d4d9375a1e896909266"],"state_sha256":"d65243e349334b5bb426cc14fa93076c397bcd73e38bacaaecbda19263fb0d23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W2UX2c/K6QcXMhwcWunD/DPhPk9WPsEYEV5Gg2khp2yByPRsLJvfneiQthD2O/wvnouNB7dCD8jZM+0lY1KQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T09:10:25.487015Z","bundle_sha256":"2a15830d8b3c3a44263c866a1b49df103565ad9b4104f349d00041dfb81b5122"}}