{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DNSKEBRYZXVP6QOTHOL3G3WR5A","short_pith_number":"pith:DNSKEBRY","schema_version":"1.0","canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","source":{"kind":"arxiv","id":"1805.02217","version":1},"attestation_state":"computed","paper":{"title":"Generalized Center Problems with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Maryam Negahbani","submitted_at":"2018-05-06T14:10:47Z","abstract_excerpt":"We study the $\\mathcal{F}$-center problem with outliers: given a metric space $(X,d)$, a general down-closed family $\\mathcal{F}$ of subsets of $X$, and a parameter $m$, we need to locate a subset $S\\in \\mathcal{F}$ of centers such that the maximum distance among the closest $m$ points in $X$ to $S$ is minimized. Our main result is a dichotomy theorem. Colloquially, we prove that there is an efficient $3$-approximation for the $\\mathcal{F}$-center problem with outliers if and only if we can efficiently optimize a poly-bounded linear function over $\\mathcal{F}$ subject to a partition constraint"},"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":"1805.02217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-06T14:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"c63118c89b7e4cfc1d8638b6f6c94cc5b044edbb58279195c6cc9320d3d1a9de","abstract_canon_sha256":"4970750127e3012d88e49ac83087cf168074cfd6222a2189efef56c1b286594f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:40.560363Z","signature_b64":"FMBxp1zzNl5bwkvH4U2guUMLULY9cOW6PEFIugmtIT++v6orJjBxlB78nqOKQ+45CSo1oA4E/RHHEoQ7sVXMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","last_reissued_at":"2026-05-18T00:16:40.559886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:40.559886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Center Problems with Outliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Maryam Negahbani","submitted_at":"2018-05-06T14:10:47Z","abstract_excerpt":"We study the $\\mathcal{F}$-center problem with outliers: given a metric space $(X,d)$, a general down-closed family $\\mathcal{F}$ of subsets of $X$, and a parameter $m$, we need to locate a subset $S\\in \\mathcal{F}$ of centers such that the maximum distance among the closest $m$ points in $X$ to $S$ is minimized. Our main result is a dichotomy theorem. Colloquially, we prove that there is an efficient $3$-approximation for the $\\mathcal{F}$-center problem with outliers if and only if we can efficiently optimize a poly-bounded linear function over $\\mathcal{F}$ subject to a partition constraint"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02217","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":"1805.02217","created_at":"2026-05-18T00:16:40.559956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02217v1","created_at":"2026-05-18T00:16:40.559956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02217","created_at":"2026-05-18T00:16:40.559956+00:00"},{"alias_kind":"pith_short_12","alias_value":"DNSKEBRYZXVP","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DNSKEBRYZXVP6QOT","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DNSKEBRY","created_at":"2026-05-18T12:32:19.392346+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/DNSKEBRYZXVP6QOTHOL3G3WR5A","json":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A.json","graph_json":"https://pith.science/api/pith-number/DNSKEBRYZXVP6QOTHOL3G3WR5A/graph.json","events_json":"https://pith.science/api/pith-number/DNSKEBRYZXVP6QOTHOL3G3WR5A/events.json","paper":"https://pith.science/paper/DNSKEBRY"},"agent_actions":{"view_html":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A","download_json":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A.json","view_paper":"https://pith.science/paper/DNSKEBRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02217&json=true","fetch_graph":"https://pith.science/api/pith-number/DNSKEBRYZXVP6QOTHOL3G3WR5A/graph.json","fetch_events":"https://pith.science/api/pith-number/DNSKEBRYZXVP6QOTHOL3G3WR5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/action/storage_attestation","attest_author":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/action/author_attestation","sign_citation":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/action/citation_signature","submit_replication":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/action/replication_record"}},"created_at":"2026-05-18T00:16:40.559956+00:00","updated_at":"2026-05-18T00:16:40.559956+00:00"}