{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MBYGSJ46XUV3DIASC3NH7DIBHX","short_pith_number":"pith:MBYGSJ46","schema_version":"1.0","canonical_sha256":"607069279ebd2bb1a01216da7f8d013dc237ba4842b2f02fc532b7ddaf46b2db","source":{"kind":"arxiv","id":"2506.00165","version":1},"attestation_state":"computed","paper":{"title":"Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Benedikt Kolbe, Chris Schwiegelshohn, Erik Waingarten, Jie Gao, Rajesh Jayaram, Sandeep Silwal, Shay Sapir","submitted_at":"2025-05-30T19:11:03Z","abstract_excerpt":"Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, including max-matching, max-spanning tree, max TSP, as well as various measures for dataset diversity. For these problems, we show that the effect of dimension reduction is intimately tied to the \\emph{doubling dimension} $\\lambda_X$ of the underlying dataset $X$ -- a quantity measuring intrinsic dimensionality of point sets. Specifically, we prove that a target dimension of $O"},"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":"2506.00165","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-30T19:11:03Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b9e60ea2231145d87505aaa0a7e845e9cd6d0716259d23412f6656c370a1e37f","abstract_canon_sha256":"a75acd5a8e2af5739fb57213f3917dd7e76f4d9de4eda5452dd209d920316f86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:30.047929Z","signature_b64":"VSVzLKNOl3WBAXfieI3syrfbT4VSJkko1WUTa4s5On/uXAfoQyS1K+/l1xtLorzUO3Gip/6ZC+EPCQtvhDUxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"607069279ebd2bb1a01216da7f8d013dc237ba4842b2f02fc532b7ddaf46b2db","last_reissued_at":"2026-07-05T11:13:30.047461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:30.047461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Dimensionality Reduction for Euclidean Maximization and Diversity Measures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Benedikt Kolbe, Chris Schwiegelshohn, Erik Waingarten, Jie Gao, Rajesh Jayaram, Sandeep Silwal, Shay Sapir","submitted_at":"2025-05-30T19:11:03Z","abstract_excerpt":"Randomized dimensionality reduction is a widely-used algorithmic technique for speeding up large-scale Euclidean optimization problems. In this paper, we study dimension reduction for a variety of maximization problems, including max-matching, max-spanning tree, max TSP, as well as various measures for dataset diversity. For these problems, we show that the effect of dimension reduction is intimately tied to the \\emph{doubling dimension} $\\lambda_X$ of the underlying dataset $X$ -- a quantity measuring intrinsic dimensionality of point sets. Specifically, we prove that a target dimension of $O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00165","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/2506.00165/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":"2506.00165","created_at":"2026-07-05T11:13:30.047534+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00165v1","created_at":"2026-07-05T11:13:30.047534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00165","created_at":"2026-07-05T11:13:30.047534+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBYGSJ46XUV3","created_at":"2026-07-05T11:13:30.047534+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBYGSJ46XUV3DIAS","created_at":"2026-07-05T11:13:30.047534+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBYGSJ46","created_at":"2026-07-05T11:13:30.047534+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/MBYGSJ46XUV3DIASC3NH7DIBHX","json":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX.json","graph_json":"https://pith.science/api/pith-number/MBYGSJ46XUV3DIASC3NH7DIBHX/graph.json","events_json":"https://pith.science/api/pith-number/MBYGSJ46XUV3DIASC3NH7DIBHX/events.json","paper":"https://pith.science/paper/MBYGSJ46"},"agent_actions":{"view_html":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX","download_json":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX.json","view_paper":"https://pith.science/paper/MBYGSJ46","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00165&json=true","fetch_graph":"https://pith.science/api/pith-number/MBYGSJ46XUV3DIASC3NH7DIBHX/graph.json","fetch_events":"https://pith.science/api/pith-number/MBYGSJ46XUV3DIASC3NH7DIBHX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX/action/storage_attestation","attest_author":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX/action/author_attestation","sign_citation":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX/action/citation_signature","submit_replication":"https://pith.science/pith/MBYGSJ46XUV3DIASC3NH7DIBHX/action/replication_record"}},"created_at":"2026-07-05T11:13:30.047534+00:00","updated_at":"2026-07-05T11:13:30.047534+00:00"}