{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JBF6T2KTY5E5XB3CJDJMS42DAT","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":"4084eac4fe1e012c9d873cb4bf0f23f06393b50e05eee5ab44ec53e53ed32187","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-22T01:50:38Z","title_canon_sha256":"155f9eb1198a761e264b3f1fa300ab45aff199650cb543b843060673f3180a10"},"schema_version":"1.0","source":{"id":"2605.23145","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23145","created_at":"2026-05-25T02:01:40Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23145v1","created_at":"2026-05-25T02:01:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23145","created_at":"2026-05-25T02:01:40Z"},{"alias_kind":"pith_short_12","alias_value":"JBF6T2KTY5E5","created_at":"2026-05-25T02:01:40Z"},{"alias_kind":"pith_short_16","alias_value":"JBF6T2KTY5E5XB3C","created_at":"2026-05-25T02:01:40Z"},{"alias_kind":"pith_short_8","alias_value":"JBF6T2KT","created_at":"2026-05-25T02:01:40Z"}],"graph_snapshots":[{"event_id":"sha256:a7e59a15c241455916fa9a400dbddc2b57d1c44ab49db8f2ef59c0e4ec0ce988","target":"graph","created_at":"2026-05-25T02:01:40Z","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/2605.23145/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Individual fairness, the notion that \"similar individuals should be treated similarly,\" provides a strong and flexible fairness guarantee for algorithmic decision makers. However, a barrier to implementing individual fairness in practice is the difficulty of learning the similarity metric over individuals. In this work, we present an algorithm for learning a Mahalanobis similarity metric from triplet queries of the form \"is individual $i$ more similar to individual $j$ or $k$?\" We work in the standard Bradley-Terry model for pairwise comparisons. Our algorithm consists of a spectral initializa","authors_text":"Conlan Olson, Linjun Zhang, Pragya Sur, Zhun Deng","cross_cats":["cs.LG","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-22T01:50:38Z","title":"Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23145","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:794d9f5a1532d5152f27c0f1c6c235c804574a0048ad20dc0d6bf401ceac47ca","target":"record","created_at":"2026-05-25T02:01:40Z","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":"4084eac4fe1e012c9d873cb4bf0f23f06393b50e05eee5ab44ec53e53ed32187","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-22T01:50:38Z","title_canon_sha256":"155f9eb1198a761e264b3f1fa300ab45aff199650cb543b843060673f3180a10"},"schema_version":"1.0","source":{"id":"2605.23145","kind":"arxiv","version":1}},"canonical_sha256":"484be9e953c749db876248d2c9734304c48f7cef0437348db18e430f8f867532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"484be9e953c749db876248d2c9734304c48f7cef0437348db18e430f8f867532","first_computed_at":"2026-05-25T02:01:40.341050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:40.341050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JixowIiG+eP/Wuj7K0Kj5yD2aBg5fg3A/qjzxUpH71G54HURaOwxan+WbTx2VL3NR33AKP/guaIKqU25Ec8lDQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:40.341670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23145","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:794d9f5a1532d5152f27c0f1c6c235c804574a0048ad20dc0d6bf401ceac47ca","sha256:a7e59a15c241455916fa9a400dbddc2b57d1c44ab49db8f2ef59c0e4ec0ce988"],"state_sha256":"bfee3ce7c83c03f35319ff2c18f5f7f8a787dd3a241894c8cc3fb613ddd07da6"}