{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:WHJIEEMY7CPMZ26UXRDX6D3QDR","short_pith_number":"pith:WHJIEEMY","schema_version":"1.0","canonical_sha256":"b1d2821198f89eccebd4bc477f0f701c559ece57cb322545704b0636857f49db","source":{"kind":"arxiv","id":"cs/0511084","version":3},"attestation_state":"computed","paper":{"title":"Ramsey partitions and proximity data structures","license":"","headline":"","cross_cats":["cs.CG","math.FA","math.MG"],"primary_cat":"cs.DS","authors_text":"Assaf Naor, Manor Mendel","submitted_at":"2005-11-23T20:06:15Z","abstract_excerpt":"This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (a.k.a. the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman). We then proceed to construct optimal Ramsey partitions, "},"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":"cs/0511084","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2005-11-23T20:06:15Z","cross_cats_sorted":["cs.CG","math.FA","math.MG"],"title_canon_sha256":"a656c38d56c771d1ff6d31a36eb506bc7da351fce4c31eed7a5a95f10674e6ab","abstract_canon_sha256":"764b631103b2949c55fa1795a0338df361d3def14f7b77a899c4aaeda1ecbc21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.022947Z","signature_b64":"mnkjJB7qyUBybavkc1ffBmYI4AwZ1lsTTLL/NwKc5tztM2SHzG3it5Vvj96St8BxK2aVzK22/pgDpA1ark8PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1d2821198f89eccebd4bc477f0f701c559ece57cb322545704b0636857f49db","last_reissued_at":"2026-05-18T03:40:50.022250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.022250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey partitions and proximity data structures","license":"","headline":"","cross_cats":["cs.CG","math.FA","math.MG"],"primary_cat":"cs.DS","authors_text":"Assaf Naor, Manor Mendel","submitted_at":"2005-11-23T20:06:15Z","abstract_excerpt":"This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion. We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (a.k.a. the non-linear version of the isomorphic Dvoretzky theorem, as introduced by Bourgain, Figiel, and Milman). We then proceed to construct optimal Ramsey partitions, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0511084","kind":"arxiv","version":3},"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":"cs/0511084","created_at":"2026-05-18T03:40:50.022361+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0511084v3","created_at":"2026-05-18T03:40:50.022361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0511084","created_at":"2026-05-18T03:40:50.022361+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHJIEEMY7CPM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHJIEEMY7CPMZ26U","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHJIEEMY","created_at":"2026-05-18T12:25:53.939244+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/WHJIEEMY7CPMZ26UXRDX6D3QDR","json":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR.json","graph_json":"https://pith.science/api/pith-number/WHJIEEMY7CPMZ26UXRDX6D3QDR/graph.json","events_json":"https://pith.science/api/pith-number/WHJIEEMY7CPMZ26UXRDX6D3QDR/events.json","paper":"https://pith.science/paper/WHJIEEMY"},"agent_actions":{"view_html":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR","download_json":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR.json","view_paper":"https://pith.science/paper/WHJIEEMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0511084&json=true","fetch_graph":"https://pith.science/api/pith-number/WHJIEEMY7CPMZ26UXRDX6D3QDR/graph.json","fetch_events":"https://pith.science/api/pith-number/WHJIEEMY7CPMZ26UXRDX6D3QDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR/action/storage_attestation","attest_author":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR/action/author_attestation","sign_citation":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR/action/citation_signature","submit_replication":"https://pith.science/pith/WHJIEEMY7CPMZ26UXRDX6D3QDR/action/replication_record"}},"created_at":"2026-05-18T03:40:50.022361+00:00","updated_at":"2026-05-18T03:40:50.022361+00:00"}