{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FVUD4E2RA6TBFR6ZRVDXDFJ5RL","short_pith_number":"pith:FVUD4E2R","schema_version":"1.0","canonical_sha256":"2d683e135107a612c7d98d4771953d8af07f4b8c034b5c1ce10e42a3f4345a6e","source":{"kind":"arxiv","id":"2411.05432","version":1},"attestation_state":"computed","paper":{"title":"Near-Optimal Dimension Reduction for Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Yue, Lingxiao Huang, Robert Krauthgamer, Shaofeng H.-C. Jiang","submitted_at":"2024-11-08T09:28:53Z","abstract_excerpt":"Oblivious dimension reduction, \\`{a} la the Johnson-Lindenstrauss (JL) Lemma, is a fundamental approach for processing high-dimensional data. We study this approach for Uniform Facility Location (UFL) on a Euclidean input $X\\subset\\mathbb{R}^d$, where facilities can lie in the ambient space (not restricted to $X$). Our main result is that target dimension $m=\\tilde{O}(\\epsilon^{-2}\\mathrm{ddim})$ suffices to $(1+\\epsilon)$-approximate the optimal value of UFL on inputs whose doubling dimension is bounded by $\\mathrm{ddim}$. It significantly improves over previous results, that could only achie"},"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":"2411.05432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-08T09:28:53Z","cross_cats_sorted":[],"title_canon_sha256":"b972164088136e9bd1973675e261acf4ff886f573efa301832981eb743cb383a","abstract_canon_sha256":"114412a093fd428fa872a3c71c5debd5689570921d8cfddb8839ab4e3472f05c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:00.853846Z","signature_b64":"lUfInAnApLvgqyw4uVaRqJ+8n7i+StvM/2/hHcKUeiDjsHsK9z4utD5KWZzafq++ovqWB2ATvPpe1gKmbw/hAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d683e135107a612c7d98d4771953d8af07f4b8c034b5c1ce10e42a3f4345a6e","last_reissued_at":"2026-07-05T09:33:00.853371Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:00.853371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Dimension Reduction for Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Yue, Lingxiao Huang, Robert Krauthgamer, Shaofeng H.-C. Jiang","submitted_at":"2024-11-08T09:28:53Z","abstract_excerpt":"Oblivious dimension reduction, \\`{a} la the Johnson-Lindenstrauss (JL) Lemma, is a fundamental approach for processing high-dimensional data. We study this approach for Uniform Facility Location (UFL) on a Euclidean input $X\\subset\\mathbb{R}^d$, where facilities can lie in the ambient space (not restricted to $X$). Our main result is that target dimension $m=\\tilde{O}(\\epsilon^{-2}\\mathrm{ddim})$ suffices to $(1+\\epsilon)$-approximate the optimal value of UFL on inputs whose doubling dimension is bounded by $\\mathrm{ddim}$. It significantly improves over previous results, that could only achie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.05432","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/2411.05432/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":"2411.05432","created_at":"2026-07-05T09:33:00.853434+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.05432v1","created_at":"2026-07-05T09:33:00.853434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.05432","created_at":"2026-07-05T09:33:00.853434+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVUD4E2RA6TB","created_at":"2026-07-05T09:33:00.853434+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVUD4E2RA6TBFR6Z","created_at":"2026-07-05T09:33:00.853434+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVUD4E2R","created_at":"2026-07-05T09:33:00.853434+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00165","citing_title":"Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL","json":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL.json","graph_json":"https://pith.science/api/pith-number/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/graph.json","events_json":"https://pith.science/api/pith-number/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/events.json","paper":"https://pith.science/paper/FVUD4E2R"},"agent_actions":{"view_html":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL","download_json":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL.json","view_paper":"https://pith.science/paper/FVUD4E2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.05432&json=true","fetch_graph":"https://pith.science/api/pith-number/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/graph.json","fetch_events":"https://pith.science/api/pith-number/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/action/storage_attestation","attest_author":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/action/author_attestation","sign_citation":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/action/citation_signature","submit_replication":"https://pith.science/pith/FVUD4E2RA6TBFR6ZRVDXDFJ5RL/action/replication_record"}},"created_at":"2026-07-05T09:33:00.853434+00:00","updated_at":"2026-07-05T09:33:00.853434+00:00"}