{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XL5YA52RSYS4XZUXMY43VLVGMN","short_pith_number":"pith:XL5YA52R","schema_version":"1.0","canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","source":{"kind":"arxiv","id":"2412.06063","version":1},"attestation_state":"computed","paper":{"title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Vakilian, David P. Woodruff, Samson Zhou, Zhao Song","submitted_at":"2024-12-08T20:34:16Z","abstract_excerpt":"Low-rank approximation and column subset selection are two fundamental and related problems that are applied across a wealth of machine learning applications. In this paper, we study the question of socially fair low-rank approximation and socially fair column subset selection, where the goal is to minimize the loss over all sub-populations of the data. We show that surprisingly, even constant-factor approximation to fair low-rank approximation requires exponential time under certain standard complexity hypotheses. On the positive side, we give an algorithm for fair low-rank approximation that"},"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":"2412.06063","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-08T20:34:16Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"cd491eac601dc7baef83aad03b9ab9031540f7c051a9498c5ec5cddca3bbc980","abstract_canon_sha256":"ac55a6591231671d0f78d5d97403bde272b9d548cbf750e57c3aa42ae9dd3c94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:14.103521Z","signature_b64":"POGrfas/sZIfIkdmxJJZD3osUS1lLlrgjU5R6eOZDPG2fs8x/+lmeeWV+9H026DMPnUqMZ7cJwgBHgQsXVj2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","last_reissued_at":"2026-07-05T09:46:14.103138Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:14.103138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Socially Fair Low-Rank Approximation and Column Subset Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ali Vakilian, David P. Woodruff, Samson Zhou, Zhao Song","submitted_at":"2024-12-08T20:34:16Z","abstract_excerpt":"Low-rank approximation and column subset selection are two fundamental and related problems that are applied across a wealth of machine learning applications. In this paper, we study the question of socially fair low-rank approximation and socially fair column subset selection, where the goal is to minimize the loss over all sub-populations of the data. We show that surprisingly, even constant-factor approximation to fair low-rank approximation requires exponential time under certain standard complexity hypotheses. On the positive side, we give an algorithm for fair low-rank approximation that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06063","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/2412.06063/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":"2412.06063","created_at":"2026-07-05T09:46:14.103194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.06063v1","created_at":"2026-07-05T09:46:14.103194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06063","created_at":"2026-07-05T09:46:14.103194+00:00"},{"alias_kind":"pith_short_12","alias_value":"XL5YA52RSYS4","created_at":"2026-07-05T09:46:14.103194+00:00"},{"alias_kind":"pith_short_16","alias_value":"XL5YA52RSYS4XZUX","created_at":"2026-07-05T09:46:14.103194+00:00"},{"alias_kind":"pith_short_8","alias_value":"XL5YA52R","created_at":"2026-07-05T09:46:14.103194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN","json":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN.json","graph_json":"https://pith.science/api/pith-number/XL5YA52RSYS4XZUXMY43VLVGMN/graph.json","events_json":"https://pith.science/api/pith-number/XL5YA52RSYS4XZUXMY43VLVGMN/events.json","paper":"https://pith.science/paper/XL5YA52R"},"agent_actions":{"view_html":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN","download_json":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN.json","view_paper":"https://pith.science/paper/XL5YA52R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.06063&json=true","fetch_graph":"https://pith.science/api/pith-number/XL5YA52RSYS4XZUXMY43VLVGMN/graph.json","fetch_events":"https://pith.science/api/pith-number/XL5YA52RSYS4XZUXMY43VLVGMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/action/storage_attestation","attest_author":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/action/author_attestation","sign_citation":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/action/citation_signature","submit_replication":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/action/replication_record"}},"created_at":"2026-07-05T09:46:14.103194+00:00","updated_at":"2026-07-05T09:46:14.103194+00:00"}