{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IOMIZR6MMYTDKOIW4CCWNR77U7","short_pith_number":"pith:IOMIZR6M","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"},"canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","source":{"kind":"arxiv","id":"1710.00287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00287","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00287v1","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00287","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"pith_short_12","alias_value":"IOMIZR6MMYTD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOMIZR6MMYTDKOIW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOMIZR6M","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IOMIZR6MMYTDKOIW4CCWNR77U7","target":"record","payload":{"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"},"canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","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"},"source_kind":"arxiv","source_id":"1710.00287","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-05-18T00:33:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/29+3HSDryst/irkJMYM8IPRqvWDLFm8/uYRXmNJjz3XChanPNoapyYZ31MRAn+vk70s7bEPetPJYlr1Hk6HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:09:40.542193Z"},"content_sha256":"6eb4722c80a790cd29f6f90a7b6d41913a14008b915bc5993b0b5f0608dcab85","schema_version":"1.0","event_id":"sha256:6eb4722c80a790cd29f6f90a7b6d41913a14008b915bc5993b0b5f0608dcab85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IOMIZR6MMYTDKOIW4CCWNR77U7","target":"graph","payload":{"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"},"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-05-18T00:33:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcBZawqhyd58jDDB378AcXGtUL4kQcizU/j375YJOfv2IjCqByTW7FDOD8wlRHMmiStbidtKUpS8R5aEC2ucAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:09:40.542887Z"},"content_sha256":"44cbe0a970260cd3e724a2151e956bf64ab5d975dd2313a5e10a3d165a41e538","schema_version":"1.0","event_id":"sha256:44cbe0a970260cd3e724a2151e956bf64ab5d975dd2313a5e10a3d165a41e538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/bundle.json","state_url":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/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-06-06T18:09:40Z","links":{"resolver":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7","bundle":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/bundle.json","state":"https://pith.science/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IOMIZR6MMYTDKOIW4CCWNR77U7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IOMIZR6MMYTDKOIW4CCWNR77U7","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":"f034359c760086b8dab8e9d0945ee0f2b3d8aa5e6d180323ef81732c9cc73c61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-01T03:52:38Z","title_canon_sha256":"f70b2646517447f058c93257b1b9b656f65b8718510ac45b71fa1ab93c8923f2"},"schema_version":"1.0","source":{"id":"1710.00287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00287","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00287v1","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00287","created_at":"2026-05-18T00:33:55Z"},{"alias_kind":"pith_short_12","alias_value":"IOMIZR6MMYTD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IOMIZR6MMYTDKOIW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IOMIZR6M","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:44cbe0a970260cd3e724a2151e956bf64ab5d975dd2313a5e10a3d165a41e538","target":"graph","created_at":"2026-05-18T00:33:55Z","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"},"paper":{"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","authors_text":"Aravind Srinivasan, David G. Harris, Khoa Trinh, Thomas Pensyl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-01T03:52:38Z","title":"A Lottery Model for Center-type Problems With Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00287","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:6eb4722c80a790cd29f6f90a7b6d41913a14008b915bc5993b0b5f0608dcab85","target":"record","created_at":"2026-05-18T00:33:55Z","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":"f034359c760086b8dab8e9d0945ee0f2b3d8aa5e6d180323ef81732c9cc73c61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-01T03:52:38Z","title_canon_sha256":"f70b2646517447f058c93257b1b9b656f65b8718510ac45b71fa1ab93c8923f2"},"schema_version":"1.0","source":{"id":"1710.00287","kind":"arxiv","version":1}},"canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43988cc7cc6626353916e08566c7ffa7ec094cea2ecdf80884a89bf9b27c7bf3","first_computed_at":"2026-05-18T00:33:55.279404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:55.279404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c6taA3GJ8+sMJ0ln3svtOrsKDpHYKFTpNB9ALcrYYEImGTb9JtKp2mxgfrvuLFJ8v61gDb75DtWw6lFMesUXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:55.280035Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6eb4722c80a790cd29f6f90a7b6d41913a14008b915bc5993b0b5f0608dcab85","sha256:44cbe0a970260cd3e724a2151e956bf64ab5d975dd2313a5e10a3d165a41e538"],"state_sha256":"fb17bbb7bed599ee801e84d543fea6a4ac85181ba59ab3b01e60f5bea8181230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ah3ZPT3lseSbTpUG2oFK1qOwT7nctDyovtyiAlWVyXkZrLdAX7HKwtw9gJ/9citBzeqfVlfbBJChs/l9jBjIBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:09:40.546642Z","bundle_sha256":"8b95043d7244258b90c630ccc382f51a867fbe07afe776e3061dcdfd5452e3e8"}}