{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XL5YA52RSYS4XZUXMY43VLVGMN","short_pith_number":"pith:XL5YA52R","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"},"canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","source":{"kind":"arxiv","id":"2412.06063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06063","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06063v1","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06063","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"XL5YA52RSYS4","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"XL5YA52RSYS4XZUX","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"XL5YA52R","created_at":"2026-07-05T09:46:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XL5YA52RSYS4XZUXMY43VLVGMN","target":"record","payload":{"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"},"canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","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"},"source_kind":"arxiv","source_id":"2412.06063","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-07-05T09:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3NrutfB27VeaqsnolTkcTXwZxs9W5SoRGpoGW5630b2li9yf4Vdli2dlvn5j9pEh9LRPtBmTp0yJTWBj+V+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:06:11.992451Z"},"content_sha256":"02c7792ac6e5b2d929694f5e232e67bb3e0f4069f40dba67e8aa16657f4b278a","schema_version":"1.0","event_id":"sha256:02c7792ac6e5b2d929694f5e232e67bb3e0f4069f40dba67e8aa16657f4b278a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XL5YA52RSYS4XZUXMY43VLVGMN","target":"graph","payload":{"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"},"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-07-05T09:46:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v76QjjiobG+1BPfHVKT7rvSyLI+DlckT7CJTYh7+U6wUO3Y5VRU4wpSDmwt0nb8rln8dMKnKjXG9MHMCdwSQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:06:11.993008Z"},"content_sha256":"eb7e010bfd34622a7b7934ecef07dd63551f5a6153abb1ca48894b68bd359760","schema_version":"1.0","event_id":"sha256:eb7e010bfd34622a7b7934ecef07dd63551f5a6153abb1ca48894b68bd359760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/bundle.json","state_url":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XL5YA52RSYS4XZUXMY43VLVGMN/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-08-18T15:06:11Z","links":{"resolver":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN","bundle":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/bundle.json","state":"https://pith.science/pith/XL5YA52RSYS4XZUXMY43VLVGMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XL5YA52RSYS4XZUXMY43VLVGMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XL5YA52RSYS4XZUXMY43VLVGMN","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":"ac55a6591231671d0f78d5d97403bde272b9d548cbf750e57c3aa42ae9dd3c94","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-08T20:34:16Z","title_canon_sha256":"cd491eac601dc7baef83aad03b9ab9031540f7c051a9498c5ec5cddca3bbc980"},"schema_version":"1.0","source":{"id":"2412.06063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.06063","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"arxiv_version","alias_value":"2412.06063v1","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.06063","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_12","alias_value":"XL5YA52RSYS4","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_16","alias_value":"XL5YA52RSYS4XZUX","created_at":"2026-07-05T09:46:14Z"},{"alias_kind":"pith_short_8","alias_value":"XL5YA52R","created_at":"2026-07-05T09:46:14Z"}],"graph_snapshots":[{"event_id":"sha256:eb7e010bfd34622a7b7934ecef07dd63551f5a6153abb1ca48894b68bd359760","target":"graph","created_at":"2026-07-05T09:46:14Z","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/2412.06063/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ali Vakilian, David P. Woodruff, Samson Zhou, Zhao Song","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-08T20:34:16Z","title":"On Socially Fair Low-Rank Approximation and Column Subset Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.06063","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:02c7792ac6e5b2d929694f5e232e67bb3e0f4069f40dba67e8aa16657f4b278a","target":"record","created_at":"2026-07-05T09:46:14Z","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":"ac55a6591231671d0f78d5d97403bde272b9d548cbf750e57c3aa42ae9dd3c94","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-12-08T20:34:16Z","title_canon_sha256":"cd491eac601dc7baef83aad03b9ab9031540f7c051a9498c5ec5cddca3bbc980"},"schema_version":"1.0","source":{"id":"2412.06063","kind":"arxiv","version":1}},"canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bafb8077519625cbe6976639baaea6634a3fbbb3ad432e87996f46fd9b41444b","first_computed_at":"2026-07-05T09:46:14.103138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:14.103138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"POGrfas/sZIfIkdmxJJZD3osUS1lLlrgjU5R6eOZDPG2fs8x/+lmeeWV+9H026DMPnUqMZ7cJwgBHgQsXVj2Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:14.103521Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.06063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02c7792ac6e5b2d929694f5e232e67bb3e0f4069f40dba67e8aa16657f4b278a","sha256:eb7e010bfd34622a7b7934ecef07dd63551f5a6153abb1ca48894b68bd359760"],"state_sha256":"c648b040d10d5aaa60daaf0045cf80497fb826bb8971eba76bdaddefc1fca5fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FH92kpnhaNyqqHpmxSsHaBzqh0OYbCWRtVx0epGajIKLtnon7uXeNi8t6ieh/GXJpyN0hopx+n3x41fhG5RzAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T15:06:12.003453Z","bundle_sha256":"60fadf07223c7f6ba2958233928a5b517d049ad2cccb72ed798cf7cf82e3de92"}}