{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GDKLA5ABJ4NI6DN6OEXQRNE7NY","short_pith_number":"pith:GDKLA5AB","schema_version":"1.0","canonical_sha256":"30d4b074014f1a8f0dbe712f08b49f6e2e2b7ecfd169fcc553e6830a62fa9819","source":{"kind":"arxiv","id":"2405.01063","version":2},"attestation_state":"computed","paper":{"title":"Fair Recommendations with Limited Sensitive Attributes: A Distributionally Robust Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Jizhi Zhang, Tianhao Shi, Xiangnan He, Yang Zhang","submitted_at":"2024-05-02T07:40:51Z","abstract_excerpt":"As recommender systems are indispensable in various domains such as job searching and e-commerce, providing equitable recommendations to users with different sensitive attributes becomes an imperative requirement. Prior approaches for enhancing fairness in recommender systems presume the availability of all sensitive attributes, which can be difficult to obtain due to privacy concerns or inadequate means of capturing these attributes. In practice, the efficacy of these approaches is limited, pushing us to investigate ways of promoting fairness with limited sensitive attribute information.\n  To"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2405.01063","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-05-02T07:40:51Z","cross_cats_sorted":["cs.CY","cs.LG"],"title_canon_sha256":"83386a80b3f7fdb407b432c7badf1d956225cef4d4433666ec55771d76375b86","abstract_canon_sha256":"2e524f5d0fb82e8f2eb71138897ddada0cd0f31eab9fe832f82315c087d412fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:23:22.111032Z","signature_b64":"XRH8dydw0waqTwFDXSfFGxUhuPtD7C74vsXZ5YMk1/SWOO1tg2osrhowjxbXCsJOIwjY4cvd0tKy9eFuyscHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30d4b074014f1a8f0dbe712f08b49f6e2e2b7ecfd169fcc553e6830a62fa9819","last_reissued_at":"2026-07-05T08:23:22.110579Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:23:22.110579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Recommendations with Limited Sensitive Attributes: A Distributionally Robust Optimization Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.LG"],"primary_cat":"cs.IR","authors_text":"Fuli Feng, Jizhi Zhang, Tianhao Shi, Xiangnan He, Yang Zhang","submitted_at":"2024-05-02T07:40:51Z","abstract_excerpt":"As recommender systems are indispensable in various domains such as job searching and e-commerce, providing equitable recommendations to users with different sensitive attributes becomes an imperative requirement. Prior approaches for enhancing fairness in recommender systems presume the availability of all sensitive attributes, which can be difficult to obtain due to privacy concerns or inadequate means of capturing these attributes. In practice, the efficacy of these approaches is limited, pushing us to investigate ways of promoting fairness with limited sensitive attribute information.\n  To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.01063","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.01063/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.01063","created_at":"2026-07-05T08:23:22.110636+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.01063v2","created_at":"2026-07-05T08:23:22.110636+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.01063","created_at":"2026-07-05T08:23:22.110636+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDKLA5ABJ4NI","created_at":"2026-07-05T08:23:22.110636+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDKLA5ABJ4NI6DN6","created_at":"2026-07-05T08:23:22.110636+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDKLA5AB","created_at":"2026-07-05T08:23:22.110636+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.15555","citing_title":"Distributionally Robust Graph Out-of-Distribution Recommendation via Diffusion Model","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY","json":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY.json","graph_json":"https://pith.science/api/pith-number/GDKLA5ABJ4NI6DN6OEXQRNE7NY/graph.json","events_json":"https://pith.science/api/pith-number/GDKLA5ABJ4NI6DN6OEXQRNE7NY/events.json","paper":"https://pith.science/paper/GDKLA5AB"},"agent_actions":{"view_html":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY","download_json":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY.json","view_paper":"https://pith.science/paper/GDKLA5AB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.01063&json=true","fetch_graph":"https://pith.science/api/pith-number/GDKLA5ABJ4NI6DN6OEXQRNE7NY/graph.json","fetch_events":"https://pith.science/api/pith-number/GDKLA5ABJ4NI6DN6OEXQRNE7NY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY/action/storage_attestation","attest_author":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY/action/author_attestation","sign_citation":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY/action/citation_signature","submit_replication":"https://pith.science/pith/GDKLA5ABJ4NI6DN6OEXQRNE7NY/action/replication_record"}},"created_at":"2026-07-05T08:23:22.110636+00:00","updated_at":"2026-07-05T08:23:22.110636+00:00"}