{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BLQSPXLS3IPRSYNCLT237O2R2J","short_pith_number":"pith:BLQSPXLS","canonical_record":{"source":{"id":"1902.04056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T18:56:10Z","cross_cats_sorted":["cs.CY","cs.IR","stat.ML"],"title_canon_sha256":"0faded1f6e5db0d2f0c8f60b60dcf4d18e7e696fde65a5c5624f7847432fdcb9","abstract_canon_sha256":"5a60e9f63b822815d064469a139f156c2bdbe8131f8cd273cde32349a69c0c1d"},"schema_version":"1.0"},"canonical_sha256":"0ae127dd72da1f1961a25cf5bfbb51d26b2810e3408ccafa147753383bebdc78","source":{"kind":"arxiv","id":"1902.04056","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04056","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04056v2","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04056","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"BLQSPXLS3IPR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BLQSPXLS3IPRSYNC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BLQSPXLS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BLQSPXLS3IPRSYNCLT237O2R2J","target":"record","payload":{"canonical_record":{"source":{"id":"1902.04056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T18:56:10Z","cross_cats_sorted":["cs.CY","cs.IR","stat.ML"],"title_canon_sha256":"0faded1f6e5db0d2f0c8f60b60dcf4d18e7e696fde65a5c5624f7847432fdcb9","abstract_canon_sha256":"5a60e9f63b822815d064469a139f156c2bdbe8131f8cd273cde32349a69c0c1d"},"schema_version":"1.0"},"canonical_sha256":"0ae127dd72da1f1961a25cf5bfbb51d26b2810e3408ccafa147753383bebdc78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:08.339581Z","signature_b64":"EWuShpmiVb6cyWdayOQeZfOStOeK2P2+jXdj+5NDzSsIiYtZFLGIKBI10wfgv7plA/IYLJ6JyYKrg2XNyOI/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ae127dd72da1f1961a25cf5bfbb51d26b2810e3408ccafa147753383bebdc78","last_reissued_at":"2026-05-17T23:42:08.338919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:08.338919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.04056","source_version":2,"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-05-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xgn5WTzHRtQxuIoCoVaAGa6QK1P+iovLNILuao6EZ6HpPo0Aj56REIz8EhfVbBOS8sg9OAGOTPMt8zPffkPHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:14:59.806261Z"},"content_sha256":"7276e96738fe38559977f3c8fa82d78ba49106908940007805ffc3f7588cc6a5","schema_version":"1.0","event_id":"sha256:7276e96738fe38559977f3c8fa82d78ba49106908940007805ffc3f7588cc6a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BLQSPXLS3IPRSYNCLT237O2R2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Policy Learning for Fairness in Ranking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ashudeep Singh, Thorsten Joachims","submitted_at":"2019-02-11T18:56:10Z","abstract_excerpt":"Conventional Learning-to-Rank (LTR) methods optimize the utility of the rankings to the users, but they are oblivious to their impact on the ranked items. However, there has been a growing understanding that the latter is important to consider for a wide range of ranking applications (e.g. online marketplaces, job placement, admissions). To address this need, we propose a general LTR framework that can optimize a wide range of utility metrics (e.g. NDCG) while satisfying fairness of exposure constraints with respect to the items. This framework expands the class of learnable ranking functions "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04056","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-17T23:42:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HI1X0qp7SHIjV51+gYv3y47Qe5QL6efehjRPs0Izz8X3yDi3Xgjn0NyGFIEwaGx0cPIwrKpajbJRVtYytdeoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:14:59.806982Z"},"content_sha256":"fe8de191eb454e50bff8fd804f097b46ee505239297e50623f3780214560bb13","schema_version":"1.0","event_id":"sha256:fe8de191eb454e50bff8fd804f097b46ee505239297e50623f3780214560bb13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BLQSPXLS3IPRSYNCLT237O2R2J/bundle.json","state_url":"https://pith.science/pith/BLQSPXLS3IPRSYNCLT237O2R2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BLQSPXLS3IPRSYNCLT237O2R2J/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-05-27T04:14:59Z","links":{"resolver":"https://pith.science/pith/BLQSPXLS3IPRSYNCLT237O2R2J","bundle":"https://pith.science/pith/BLQSPXLS3IPRSYNCLT237O2R2J/bundle.json","state":"https://pith.science/pith/BLQSPXLS3IPRSYNCLT237O2R2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BLQSPXLS3IPRSYNCLT237O2R2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BLQSPXLS3IPRSYNCLT237O2R2J","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":"5a60e9f63b822815d064469a139f156c2bdbe8131f8cd273cde32349a69c0c1d","cross_cats_sorted":["cs.CY","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T18:56:10Z","title_canon_sha256":"0faded1f6e5db0d2f0c8f60b60dcf4d18e7e696fde65a5c5624f7847432fdcb9"},"schema_version":"1.0","source":{"id":"1902.04056","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.04056","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"arxiv_version","alias_value":"1902.04056v2","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.04056","created_at":"2026-05-17T23:42:08Z"},{"alias_kind":"pith_short_12","alias_value":"BLQSPXLS3IPR","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BLQSPXLS3IPRSYNC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BLQSPXLS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:fe8de191eb454e50bff8fd804f097b46ee505239297e50623f3780214560bb13","target":"graph","created_at":"2026-05-17T23:42:08Z","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"},"paper":{"abstract_excerpt":"Conventional Learning-to-Rank (LTR) methods optimize the utility of the rankings to the users, but they are oblivious to their impact on the ranked items. However, there has been a growing understanding that the latter is important to consider for a wide range of ranking applications (e.g. online marketplaces, job placement, admissions). To address this need, we propose a general LTR framework that can optimize a wide range of utility metrics (e.g. NDCG) while satisfying fairness of exposure constraints with respect to the items. This framework expands the class of learnable ranking functions ","authors_text":"Ashudeep Singh, Thorsten Joachims","cross_cats":["cs.CY","cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T18:56:10Z","title":"Policy Learning for Fairness in Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.04056","kind":"arxiv","version":2},"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:7276e96738fe38559977f3c8fa82d78ba49106908940007805ffc3f7588cc6a5","target":"record","created_at":"2026-05-17T23:42:08Z","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":"5a60e9f63b822815d064469a139f156c2bdbe8131f8cd273cde32349a69c0c1d","cross_cats_sorted":["cs.CY","cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-11T18:56:10Z","title_canon_sha256":"0faded1f6e5db0d2f0c8f60b60dcf4d18e7e696fde65a5c5624f7847432fdcb9"},"schema_version":"1.0","source":{"id":"1902.04056","kind":"arxiv","version":2}},"canonical_sha256":"0ae127dd72da1f1961a25cf5bfbb51d26b2810e3408ccafa147753383bebdc78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ae127dd72da1f1961a25cf5bfbb51d26b2810e3408ccafa147753383bebdc78","first_computed_at":"2026-05-17T23:42:08.338919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:08.338919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EWuShpmiVb6cyWdayOQeZfOStOeK2P2+jXdj+5NDzSsIiYtZFLGIKBI10wfgv7plA/IYLJ6JyYKrg2XNyOI/Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:08.339581Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.04056","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7276e96738fe38559977f3c8fa82d78ba49106908940007805ffc3f7588cc6a5","sha256:fe8de191eb454e50bff8fd804f097b46ee505239297e50623f3780214560bb13"],"state_sha256":"55b3f6f4868d7d668809cd65b9902f0078f4fa27cfd2eba5fd8ca89fd6ba8366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/lRA7DaaEj9/7N35mKq32SPLuwQHHEdEriA34nhCQf2hB5JZX4ABdEp4IlKe5uKX3xlkvSA39dXQlpCOyWTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:14:59.810820Z","bundle_sha256":"def33a988e4862ec471ba00fbfe56045c3b2ddce2cf6d3a5e9fe5228ad133d32"}}