{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DNSKEBRYZXVP6QOTHOL3G3WR5A","short_pith_number":"pith:DNSKEBRY","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"},"canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","source":{"kind":"arxiv","id":"1805.02217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02217","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02217v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02217","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"DNSKEBRYZXVP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DNSKEBRYZXVP6QOT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DNSKEBRY","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DNSKEBRYZXVP6QOTHOL3G3WR5A","target":"record","payload":{"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"},"canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","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"},"source_kind":"arxiv","source_id":"1805.02217","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:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SAC0hjSUwQD4F61VEFoCFpUHbr7ecqWh3AIWdIewtqk5IVJnMfPaKpvbhk3DM+5WDdeXGN4otxmVaSMu2QhHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:48:04.995552Z"},"content_sha256":"66e6768bfcbebd80ccf631ea054eac5bd72f4f3a6c077456cc87707c6f3fdca8","schema_version":"1.0","event_id":"sha256:66e6768bfcbebd80ccf631ea054eac5bd72f4f3a6c077456cc87707c6f3fdca8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DNSKEBRYZXVP6QOTHOL3G3WR5A","target":"graph","payload":{"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"},"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:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mTwc+1PmaPF68cWnsU8Aq5NmYih4TETMb/9di1xrQjFB4NXztkaNO/0MBlEMkIS139UHNC5ptTf4Vl2/lGJfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:48:04.995893Z"},"content_sha256":"612c0b1b29029b2cd9b6a32bf35ef6a78cafd0441b55ae8a9b7bbcedfeaa2a98","schema_version":"1.0","event_id":"sha256:612c0b1b29029b2cd9b6a32bf35ef6a78cafd0441b55ae8a9b7bbcedfeaa2a98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/bundle.json","state_url":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/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-01T18:48:04Z","links":{"resolver":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A","bundle":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/bundle.json","state":"https://pith.science/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNSKEBRYZXVP6QOTHOL3G3WR5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DNSKEBRYZXVP6QOTHOL3G3WR5A","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":"4970750127e3012d88e49ac83087cf168074cfd6222a2189efef56c1b286594f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-06T14:10:47Z","title_canon_sha256":"c63118c89b7e4cfc1d8638b6f6c94cc5b044edbb58279195c6cc9320d3d1a9de"},"schema_version":"1.0","source":{"id":"1805.02217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02217","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02217v1","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02217","created_at":"2026-05-18T00:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"DNSKEBRYZXVP","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DNSKEBRYZXVP6QOT","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DNSKEBRY","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:612c0b1b29029b2cd9b6a32bf35ef6a78cafd0441b55ae8a9b7bbcedfeaa2a98","target":"graph","created_at":"2026-05-18T00:16:40Z","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":"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","authors_text":"Deeparnab Chakrabarty, Maryam Negahbani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-06T14:10:47Z","title":"Generalized Center Problems with Outliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02217","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:66e6768bfcbebd80ccf631ea054eac5bd72f4f3a6c077456cc87707c6f3fdca8","target":"record","created_at":"2026-05-18T00:16:40Z","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":"4970750127e3012d88e49ac83087cf168074cfd6222a2189efef56c1b286594f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-06T14:10:47Z","title_canon_sha256":"c63118c89b7e4cfc1d8638b6f6c94cc5b044edbb58279195c6cc9320d3d1a9de"},"schema_version":"1.0","source":{"id":"1805.02217","kind":"arxiv","version":1}},"canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b64a20638cdeaff41d33b97b36ed1e81f31fd91ccb3bcc9563ebf56d0a19a50","first_computed_at":"2026-05-18T00:16:40.559886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:40.559886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FMBxp1zzNl5bwkvH4U2guUMLULY9cOW6PEFIugmtIT++v6orJjBxlB78nqOKQ+45CSo1oA4E/RHHEoQ7sVXMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:40.560363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66e6768bfcbebd80ccf631ea054eac5bd72f4f3a6c077456cc87707c6f3fdca8","sha256:612c0b1b29029b2cd9b6a32bf35ef6a78cafd0441b55ae8a9b7bbcedfeaa2a98"],"state_sha256":"218c93c5fc3814687db1ba9c091fd89378b807506c64d4f6d5acc41017fc84fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ak+jQI9hGK3KUe0Ds6b2ns1kFdi2pWGkqXjm6nvctejlrTWnG0ACrYOuWzdug9nlw1egc1NjkBXiW2Ypg3SBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:48:04.997776Z","bundle_sha256":"dbe8c105babc9f01c83e318cb3813e57abf5525f605326dc0374fbda2ab5e356"}}