{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IOMIZR6MMYTDKOIW4CCWNR77U7","short_pith_number":"pith:IOMIZR6M","schema_version":"1.0","canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","source":{"kind":"arxiv","id":"1710.00287","version":1},"attestation_state":"computed","paper":{"title":"A Lottery Model for Center-type Problems With Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, David G. Harris, Khoa Trinh, Thomas Pensyl","submitted_at":"2017-10-01T03:52:38Z","abstract_excerpt":"In this paper, we give tight approximation algorithms for the $k$-center and matroid center problems with outliers. Unfairness arises naturally in this setting: certain clients could always be considered as outliers. To address this issue, we introduce a lottery model in which each client $j$ is allowed to submit a parameter $p_j \\in [0,1]$ and we look for a random solution that covers every client $j$ with probability at least $p_j$. Our techniques include a randomized rounding procedure to round a point inside a matroid intersection polytope to a basis plus at most one extra item such that a"},"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":"1710.00287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-01T03:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"f70b2646517447f058c93257b1b9b656f65b8718510ac45b71fa1ab93c8923f2","abstract_canon_sha256":"f034359c760086b8dab8e9d0945ee0f2b3d8aa5e6d180323ef81732c9cc73c61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:55.280035Z","signature_b64":"c6taA3GJ8+sMJ0ln3svtOrsKDpHYKFTpNB9ALcrYYEImGTb9JtKp2mxgfrvuLFJ8v61gDb75DtWw6lFMesUXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","last_reissued_at":"2026-05-18T00:33:55.279404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:55.279404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lottery Model for Center-type Problems With Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aravind Srinivasan, David G. Harris, Khoa Trinh, Thomas Pensyl","submitted_at":"2017-10-01T03:52:38Z","abstract_excerpt":"In this paper, we give tight approximation algorithms for the $k$-center and matroid center problems with outliers. Unfairness arises naturally in this setting: certain clients could always be considered as outliers. To address this issue, we introduce a lottery model in which each client $j$ is allowed to submit a parameter $p_j \\in [0,1]$ and we look for a random solution that covers every client $j$ with probability at least $p_j$. Our techniques include a randomized rounding procedure to round a point inside a matroid intersection polytope to a basis plus at most one extra item such that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00287","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":""},"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":"1710.00287","created_at":"2026-05-18T00:33:55.279507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00287v1","created_at":"2026-05-18T00:33:55.279507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00287","created_at":"2026-05-18T00:33:55.279507+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOMIZR6MMYTD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOMIZR6MMYTDKOIW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOMIZR6M","created_at":"2026-05-18T12:31:21.493067+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/IOMIZR6MMYTDKOIW4CCWNR77U7","json":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7.json","graph_json":"https://pith.science/api/pith-number/IOMIZR6MMYTDKOIW4CCWNR77U7/graph.json","events_json":"https://pith.science/api/pith-number/IOMIZR6MMYTDKOIW4CCWNR77U7/events.json","paper":"https://pith.science/paper/IOMIZR6M"},"agent_actions":{"view_html":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7","download_json":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7.json","view_paper":"https://pith.science/paper/IOMIZR6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00287&json=true","fetch_graph":"https://pith.science/api/pith-number/IOMIZR6MMYTDKOIW4CCWNR77U7/graph.json","fetch_events":"https://pith.science/api/pith-number/IOMIZR6MMYTDKOIW4CCWNR77U7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/action/storage_attestation","attest_author":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/action/author_attestation","sign_citation":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/action/citation_signature","submit_replication":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/action/replication_record"}},"created_at":"2026-05-18T00:33:55.279507+00:00","updated_at":"2026-05-18T00:33:55.279507+00:00"}