{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BESUJ7NYSVFLRSHHXEKVTIJDNL","short_pith_number":"pith:BESUJ7NY","canonical_record":{"source":{"id":"1907.09328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-22T14:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"396b6d72e419d6a0a9770fa722191fb4e3532cb5164165a801424dcdbab97338","abstract_canon_sha256":"774f40af8ad2ff89b6b59fa96aa6cbcb0bb74f5260383351902087c214fd23ad"},"schema_version":"1.0"},"canonical_sha256":"092544fdb8954ab8c8e7b91559a1236afb513a17cce8b7919ff40ec8c0171625","source":{"kind":"arxiv","id":"1907.09328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09328","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09328v1","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09328","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"BESUJ7NYSVFL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BESUJ7NYSVFLRSHH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BESUJ7NY","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BESUJ7NYSVFLRSHHXEKVTIJDNL","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-22T14:09:20Z","cross_cats_sorted":[],"title_canon_sha256":"396b6d72e419d6a0a9770fa722191fb4e3532cb5164165a801424dcdbab97338","abstract_canon_sha256":"774f40af8ad2ff89b6b59fa96aa6cbcb0bb74f5260383351902087c214fd23ad"},"schema_version":"1.0"},"canonical_sha256":"092544fdb8954ab8c8e7b91559a1236afb513a17cce8b7919ff40ec8c0171625","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.478602Z","signature_b64":"Bx/FPpW0y4ZfyIXFD6Y+s6wSudWuyc2jxpZ3a4+hsPwKU/94shLwDD5wQGnaDwGIkP5ifMp7SmbPJCnikXdTCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092544fdb8954ab8c8e7b91559a1236afb513a17cce8b7919ff40ec8c0171625","last_reissued_at":"2026-05-17T23:39:59.478200Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.478200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09328","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-05-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHYI2H2hEQU6j2BWwGBIcnAmNUDEviGPrI+xipx9dqu2D4MM0T9frlsNOIVC3QL1z7D9CHItgZCbXHyh13c7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:47:40.900682Z"},"content_sha256":"86da798664fd12c85fb2f7d3d5864ef8837410d94281db4db6824123253ffa3c","schema_version":"1.0","event_id":"sha256:86da798664fd12c85fb2f7d3d5864ef8837410d94281db4db6824123253ffa3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BESUJ7NYSVFLRSHHXEKVTIJDNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Conceptual Framework for Evaluating Fairness in Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Anubrata Das, Matthew Lease","submitted_at":"2019-07-22T14:09:20Z","abstract_excerpt":"While search efficacy has been evaluated traditionally on the basis of result relevance, fairness of search has attracted recent attention. In this work, we define a notion of distributional fairness and provide a conceptual framework for evaluating search results based on it. As part of this, we formulate a set of axioms which an ideal evaluation framework should satisfy for distributional fairness. We show how existing TREC test collections can be repurposed to study fairness, and we measure potential data bias to inform test collection design for fair search. A set of analyses show metric d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09328","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":""},"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:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QqmKwvLulTUUkVpwft6woy9PO5sANnkofO+gUST96bzYmqnF6zdHn1CCSFgLgKj2SLZYaHZrWNmbxFnQfXTDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:47:40.901208Z"},"content_sha256":"ca23a4a5cda8fce41de5197fa62d23a686ff6cff0ad0061ecc8a14925236e6f1","schema_version":"1.0","event_id":"sha256:ca23a4a5cda8fce41de5197fa62d23a686ff6cff0ad0061ecc8a14925236e6f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/bundle.json","state_url":"https://pith.science/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/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-29T16:47:40Z","links":{"resolver":"https://pith.science/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL","bundle":"https://pith.science/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/bundle.json","state":"https://pith.science/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BESUJ7NYSVFLRSHHXEKVTIJDNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BESUJ7NYSVFLRSHHXEKVTIJDNL","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":"774f40af8ad2ff89b6b59fa96aa6cbcb0bb74f5260383351902087c214fd23ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-22T14:09:20Z","title_canon_sha256":"396b6d72e419d6a0a9770fa722191fb4e3532cb5164165a801424dcdbab97338"},"schema_version":"1.0","source":{"id":"1907.09328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09328","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09328v1","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09328","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"BESUJ7NYSVFL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BESUJ7NYSVFLRSHH","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BESUJ7NY","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:ca23a4a5cda8fce41de5197fa62d23a686ff6cff0ad0061ecc8a14925236e6f1","target":"graph","created_at":"2026-05-17T23:39:59Z","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":"While search efficacy has been evaluated traditionally on the basis of result relevance, fairness of search has attracted recent attention. In this work, we define a notion of distributional fairness and provide a conceptual framework for evaluating search results based on it. As part of this, we formulate a set of axioms which an ideal evaluation framework should satisfy for distributional fairness. We show how existing TREC test collections can be repurposed to study fairness, and we measure potential data bias to inform test collection design for fair search. A set of analyses show metric d","authors_text":"Anubrata Das, Matthew Lease","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-22T14:09:20Z","title":"A Conceptual Framework for Evaluating Fairness in Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09328","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:86da798664fd12c85fb2f7d3d5864ef8837410d94281db4db6824123253ffa3c","target":"record","created_at":"2026-05-17T23:39:59Z","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":"774f40af8ad2ff89b6b59fa96aa6cbcb0bb74f5260383351902087c214fd23ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-07-22T14:09:20Z","title_canon_sha256":"396b6d72e419d6a0a9770fa722191fb4e3532cb5164165a801424dcdbab97338"},"schema_version":"1.0","source":{"id":"1907.09328","kind":"arxiv","version":1}},"canonical_sha256":"092544fdb8954ab8c8e7b91559a1236afb513a17cce8b7919ff40ec8c0171625","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"092544fdb8954ab8c8e7b91559a1236afb513a17cce8b7919ff40ec8c0171625","first_computed_at":"2026-05-17T23:39:59.478200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:59.478200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bx/FPpW0y4ZfyIXFD6Y+s6wSudWuyc2jxpZ3a4+hsPwKU/94shLwDD5wQGnaDwGIkP5ifMp7SmbPJCnikXdTCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:59.478602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86da798664fd12c85fb2f7d3d5864ef8837410d94281db4db6824123253ffa3c","sha256:ca23a4a5cda8fce41de5197fa62d23a686ff6cff0ad0061ecc8a14925236e6f1"],"state_sha256":"d4a18a04c7002250d88fb4a5fb4b7f17f90d2dbfdb5e6cf05e9ad11ff733c21e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zZqB79d3O+k2lklX3jmIUA+kaDQ06wSBdq2H2TDP/1wMHvIMybnEu9znEhRet26P0ICf0h3XhKXnH3eZEJeiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:47:40.904377Z","bundle_sha256":"846553dcc611e2c11c4c326f813fbe996e10d5009d78f5b94f7311311b94add4"}}