{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XCL4VEH3LQFJKYI7VT4MUQHA5M","short_pith_number":"pith:XCL4VEH3","canonical_record":{"source":{"id":"2605.23265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T06:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"b113d752d2f91977e46ebe486218acb43419700d0aadb05c6fdd28db5d11f1ad","abstract_canon_sha256":"6e965b7a6405bdc88f83b7af043fb994c8ad43ca02006b32529919b2a83fef8d"},"schema_version":"1.0"},"canonical_sha256":"b897ca90fb5c0a95611facf8ca40e0eb13c3710f30eb64275b19148a06191a47","source":{"kind":"arxiv","id":"2605.23265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23265","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23265v1","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23265","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"XCL4VEH3LQFJ","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_16","alias_value":"XCL4VEH3LQFJKYI7","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_8","alias_value":"XCL4VEH3","created_at":"2026-05-25T02:01:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XCL4VEH3LQFJKYI7VT4MUQHA5M","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T06:10:05Z","cross_cats_sorted":[],"title_canon_sha256":"b113d752d2f91977e46ebe486218acb43419700d0aadb05c6fdd28db5d11f1ad","abstract_canon_sha256":"6e965b7a6405bdc88f83b7af043fb994c8ad43ca02006b32529919b2a83fef8d"},"schema_version":"1.0"},"canonical_sha256":"b897ca90fb5c0a95611facf8ca40e0eb13c3710f30eb64275b19148a06191a47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:46.378018Z","signature_b64":"v+J3pKx/wsZ4L0DqfCrmuP7usi/7D0OCE+qJBGn+yLXTuU+MuMwYJ0Hode1LD+zXiaUlxKQO5TT3+/IbbYbzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b897ca90fb5c0a95611facf8ca40e0eb13c3710f30eb64275b19148a06191a47","last_reissued_at":"2026-05-25T02:01:46.377511Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:46.377511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23265","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-25T02:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIrlcHHEi3O4Qrtp70q1COT78RquRSn/45ElOAvWnuhxe7Z3Fbm6mKdAFRL9Hqk89f0qmxL6Szl4tlJMmzN/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:54:40.439882Z"},"content_sha256":"1442e5f110e04aad0678da26a77c92dc66d8f90251c2cad802be0f74469d5e9e","schema_version":"1.0","event_id":"sha256:1442e5f110e04aad0678da26a77c92dc66d8f90251c2cad802be0f74469d5e9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XCL4VEH3LQFJKYI7VT4MUQHA5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alvin Hong Yao Yan, Arya Mazumdar, Barna Saha, Diptarka Chakraborty","submitted_at":"2026-05-22T06:10:05Z","abstract_excerpt":"Ensuring fairness in algorithmic ranking systems is a critical challenge with significant societal implications for hiring, recommendations, web search, and data management. Standard methods for aggregating multiple preference orders into a consensus ranking may perpetuate and even amplify the lack of representation of underrepresented groups. To address this, recent research has focused on incorporating fairness constraints to ensure the presence of different groups in the top-$k$ positions of the final aggregate ranking.\n  We study two fairness-aware variants under the well-known Spearman fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23265","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/2605.23265/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-05-25T02:01:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iy9vb1vqrppwgyJ1qg/VMBT3v8rdGwUslERIvJ+yd6c4cnr4+B3PvTA2kl790TItvMtH7Jm/gjAqO5UAS5QmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:54:40.440611Z"},"content_sha256":"b611be9c9457758d15bccd6fc1cc8a3ae7212d790639e1a279f0658b2e493ca1","schema_version":"1.0","event_id":"sha256:b611be9c9457758d15bccd6fc1cc8a3ae7212d790639e1a279f0658b2e493ca1"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:XCL4VEH3LQFJKYI7VT4MUQHA5M","target":"integrity","payload":{"note":"Identifier '10.1007/s00453-021-00847-1' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs , author=. Algorithmica , volume=. 2021 , publisher=. doi:10.1007/s00453-021-00847-1 , note=","arxiv_id":"2605.23265","detector":"doi_compliance","evidence":{"doi":"10.1007/s00453-021-00847-1","arxiv_id":null,"ref_index":48,"raw_excerpt":"A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs , author=. Algorithmica , volume=. 2021 , publisher=. doi:10.1007/s00453-021-00847-1 , note=","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":48,"audited_at":"2026-05-25T03:18:22.211645Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00453-021-00847-1","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ada90f93fdc71c703ce72dffe0bb0b8ffa76526945dd0a410b159da7646d74ae","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7326,"payload_sha256":"238400e59ba3181808df01d13c1e81f39bbb7c85d5d89d1394d7f9d051780d9a","signature_b64":"7HwZ3LDa8ctBhEEBqs1eCifpEZnEEB/YeMV0yHE5g69XG84hqxnovPaghdSwjfn5lwDPpXUt12AsbOb7LlwnCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T03:19:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcnqIUQnbSAP8tHwERj+E5/yE2GurUWu03pBaFhJ9DU5+6GFjeMxhRQwM3JCdgBQkIWJLP7DGNMsXtUi3LjHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:54:40.442039Z"},"content_sha256":"74db8fa64677af9abc15c346aa66014e5f2abd44ecc742bb44f90142e7d9e910","schema_version":"1.0","event_id":"sha256:74db8fa64677af9abc15c346aa66014e5f2abd44ecc742bb44f90142e7d9e910"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/bundle.json","state_url":"https://pith.science/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/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-27T16:54:40Z","links":{"resolver":"https://pith.science/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M","bundle":"https://pith.science/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/bundle.json","state":"https://pith.science/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XCL4VEH3LQFJKYI7VT4MUQHA5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XCL4VEH3LQFJKYI7VT4MUQHA5M","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e965b7a6405bdc88f83b7af043fb994c8ad43ca02006b32529919b2a83fef8d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T06:10:05Z","title_canon_sha256":"b113d752d2f91977e46ebe486218acb43419700d0aadb05c6fdd28db5d11f1ad"},"schema_version":"1.0","source":{"id":"2605.23265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23265","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23265v1","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23265","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_12","alias_value":"XCL4VEH3LQFJ","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_16","alias_value":"XCL4VEH3LQFJKYI7","created_at":"2026-05-25T02:01:46Z"},{"alias_kind":"pith_short_8","alias_value":"XCL4VEH3","created_at":"2026-05-25T02:01:46Z"}],"graph_snapshots":[{"event_id":"sha256:b611be9c9457758d15bccd6fc1cc8a3ae7212d790639e1a279f0658b2e493ca1","target":"graph","created_at":"2026-05-25T02:01:46Z","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.23265/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ensuring fairness in algorithmic ranking systems is a critical challenge with significant societal implications for hiring, recommendations, web search, and data management. Standard methods for aggregating multiple preference orders into a consensus ranking may perpetuate and even amplify the lack of representation of underrepresented groups. To address this, recent research has focused on incorporating fairness constraints to ensure the presence of different groups in the top-$k$ positions of the final aggregate ranking.\n  We study two fairness-aware variants under the well-known Spearman fo","authors_text":"Alvin Hong Yao Yan, Arya Mazumdar, Barna Saha, Diptarka Chakraborty","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T06:10:05Z","title":"Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23265","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:1442e5f110e04aad0678da26a77c92dc66d8f90251c2cad802be0f74469d5e9e","target":"record","created_at":"2026-05-25T02:01:46Z","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":"6e965b7a6405bdc88f83b7af043fb994c8ad43ca02006b32529919b2a83fef8d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T06:10:05Z","title_canon_sha256":"b113d752d2f91977e46ebe486218acb43419700d0aadb05c6fdd28db5d11f1ad"},"schema_version":"1.0","source":{"id":"2605.23265","kind":"arxiv","version":1}},"canonical_sha256":"b897ca90fb5c0a95611facf8ca40e0eb13c3710f30eb64275b19148a06191a47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b897ca90fb5c0a95611facf8ca40e0eb13c3710f30eb64275b19148a06191a47","first_computed_at":"2026-05-25T02:01:46.377511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:46.377511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v+J3pKx/wsZ4L0DqfCrmuP7usi/7D0OCE+qJBGn+yLXTuU+MuMwYJ0Hode1LD+zXiaUlxKQO5TT3+/IbbYbzAw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:46.378018Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1442e5f110e04aad0678da26a77c92dc66d8f90251c2cad802be0f74469d5e9e","sha256:b611be9c9457758d15bccd6fc1cc8a3ae7212d790639e1a279f0658b2e493ca1","sha256:74db8fa64677af9abc15c346aa66014e5f2abd44ecc742bb44f90142e7d9e910"],"state_sha256":"d24cff925a010f325f15daeff38276aae7d928d64e4fc202cc07ec7287f12d0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eqRak/VXAIPrxuXuvrYhMYVxrNnjLd/AhFuC+V0k5+m7fgmMVKoNPaEK+TLY6G/SMqhOUBZ8PyjGAJUX7bm6Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:54:40.445491Z","bundle_sha256":"4a9955e8bdff195c0f311420ea60101c86dedda6297a0d42edaa563d30df37d8"}}