{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:42J3H2YFRA2J4F2XE2GAYGDAJR","short_pith_number":"pith:42J3H2YF","schema_version":"1.0","canonical_sha256":"e693b3eb0588349e1757268c0c18604c7857e0ddf64e7fb822ad410b100591dd","source":{"kind":"arxiv","id":"2407.04804","version":1},"attestation_state":"computed","paper":{"title":"Fair Submodular Cover","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.DS"],"primary_cat":"cs.LG","authors_text":"Samson Zhou, Shuo Xing, Victoria G. Crawford, Wenjing Chen","submitted_at":"2024-07-05T18:37:09Z","abstract_excerpt":"Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender or age. In such settings, it is often desirable to produce a diverse solution set that is fairly distributed with respect to these attributes. Motivated by this, we initiate the study of Fair Submodular Cover (FSC), where given a ground set $U$, a monotone submodular function $f:2^U\\to\\mathbb{R}_{\\ge 0}$, a threshold $\\tau$, the goal is to find a balanced subset of $S$ with minimum cardinality such that $f(S)\\ge\\tau$"},"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":"2407.04804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-07-05T18:37:09Z","cross_cats_sorted":["cs.CY","cs.DS"],"title_canon_sha256":"df6ad8d3f032800d90d089eff067b930f63ba1e5202910258fc97c89225cdfb6","abstract_canon_sha256":"9b8cd6fde18fe89bf271d5c084982cb15a6a16351bf2568d074b9766f9e4e922"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:06.160459Z","signature_b64":"zbtzYykilP4f852pDY55GoKN3f3etajMnQ9fC96OC7W7LXY7qcWREYbIrQXRct/hvdtAZ2Piu5jXOPDqKB8ECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e693b3eb0588349e1757268c0c18604c7857e0ddf64e7fb822ad410b100591dd","last_reissued_at":"2026-07-05T08:41:06.159966Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:06.159966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Submodular Cover","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CY","cs.DS"],"primary_cat":"cs.LG","authors_text":"Samson Zhou, Shuo Xing, Victoria G. Crawford, Wenjing Chen","submitted_at":"2024-07-05T18:37:09Z","abstract_excerpt":"Submodular optimization is a fundamental problem with many applications in machine learning, often involving decision-making over datasets with sensitive attributes such as gender or age. In such settings, it is often desirable to produce a diverse solution set that is fairly distributed with respect to these attributes. Motivated by this, we initiate the study of Fair Submodular Cover (FSC), where given a ground set $U$, a monotone submodular function $f:2^U\\to\\mathbb{R}_{\\ge 0}$, a threshold $\\tau$, the goal is to find a balanced subset of $S$ with minimum cardinality such that $f(S)\\ge\\tau$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.04804","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/2407.04804/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":"2407.04804","created_at":"2026-07-05T08:41:06.160036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.04804v1","created_at":"2026-07-05T08:41:06.160036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.04804","created_at":"2026-07-05T08:41:06.160036+00:00"},{"alias_kind":"pith_short_12","alias_value":"42J3H2YFRA2J","created_at":"2026-07-05T08:41:06.160036+00:00"},{"alias_kind":"pith_short_16","alias_value":"42J3H2YFRA2J4F2X","created_at":"2026-07-05T08:41:06.160036+00:00"},{"alias_kind":"pith_short_8","alias_value":"42J3H2YF","created_at":"2026-07-05T08:41:06.160036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.18539","citing_title":"TimePre: Bridging Accuracy, Efficiency, and Stability in Probabilistic Time-Series Forecasting","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR","json":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR.json","graph_json":"https://pith.science/api/pith-number/42J3H2YFRA2J4F2XE2GAYGDAJR/graph.json","events_json":"https://pith.science/api/pith-number/42J3H2YFRA2J4F2XE2GAYGDAJR/events.json","paper":"https://pith.science/paper/42J3H2YF"},"agent_actions":{"view_html":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR","download_json":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR.json","view_paper":"https://pith.science/paper/42J3H2YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.04804&json=true","fetch_graph":"https://pith.science/api/pith-number/42J3H2YFRA2J4F2XE2GAYGDAJR/graph.json","fetch_events":"https://pith.science/api/pith-number/42J3H2YFRA2J4F2XE2GAYGDAJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR/action/storage_attestation","attest_author":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR/action/author_attestation","sign_citation":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR/action/citation_signature","submit_replication":"https://pith.science/pith/42J3H2YFRA2J4F2XE2GAYGDAJR/action/replication_record"}},"created_at":"2026-07-05T08:41:06.160036+00:00","updated_at":"2026-07-05T08:41:06.160036+00:00"}