{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:3V6AZZDV5ITMR6GMZME3HETHIB","short_pith_number":"pith:3V6AZZDV","schema_version":"1.0","canonical_sha256":"dd7c0ce475ea26c8f8cccb09b392674043bad163a9174dbe0b2e6a711aa31640","source":{"kind":"arxiv","id":"cs/0606109","version":4},"attestation_state":"computed","paper":{"title":"Maximum gradient embeddings and monotone clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Assaf Naor, Manor Mendel","submitted_at":"2006-06-26T19:32:29Z","abstract_excerpt":"Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y)) / d_X(x,y) is at most C (log n)^2, where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, incl"},"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/0606109","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2006-06-26T19:32:29Z","cross_cats_sorted":[],"title_canon_sha256":"88c67303351f79cc6aec88e813c17fcadb8d32458a5ad875797a92f71465a92b","abstract_canon_sha256":"40620b7c980a21d5a2ca531fc1e9a6c888ce133e8289b5f4e4ce569784bb02a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.011800Z","signature_b64":"ToD+LBcZWLi+BsJ4bd2VSTMY4DiAU48hYEaJkwzQotaigjM6QTZNg6FVNEP+Yb6KOmDnBrp6ptfQPKuRZL9uAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7c0ce475ea26c8f8cccb09b392674043bad163a9174dbe0b2e6a711aa31640","last_reissued_at":"2026-05-18T03:40:50.011020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.011020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum gradient embeddings and monotone clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Assaf Naor, Manor Mendel","submitted_at":"2006-06-26T19:32:29Z","abstract_excerpt":"Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y)) / d_X(x,y) is at most C (log n)^2, where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, incl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0606109","kind":"arxiv","version":4},"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/0606109","created_at":"2026-05-18T03:40:50.011152+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0606109v4","created_at":"2026-05-18T03:40:50.011152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0606109","created_at":"2026-05-18T03:40:50.011152+00:00"},{"alias_kind":"pith_short_12","alias_value":"3V6AZZDV5ITM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"3V6AZZDV5ITMR6GM","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"3V6AZZDV","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/3V6AZZDV5ITMR6GMZME3HETHIB","json":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB.json","graph_json":"https://pith.science/api/pith-number/3V6AZZDV5ITMR6GMZME3HETHIB/graph.json","events_json":"https://pith.science/api/pith-number/3V6AZZDV5ITMR6GMZME3HETHIB/events.json","paper":"https://pith.science/paper/3V6AZZDV"},"agent_actions":{"view_html":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB","download_json":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB.json","view_paper":"https://pith.science/paper/3V6AZZDV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0606109&json=true","fetch_graph":"https://pith.science/api/pith-number/3V6AZZDV5ITMR6GMZME3HETHIB/graph.json","fetch_events":"https://pith.science/api/pith-number/3V6AZZDV5ITMR6GMZME3HETHIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB/action/storage_attestation","attest_author":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB/action/author_attestation","sign_citation":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB/action/citation_signature","submit_replication":"https://pith.science/pith/3V6AZZDV5ITMR6GMZME3HETHIB/action/replication_record"}},"created_at":"2026-05-18T03:40:50.011152+00:00","updated_at":"2026-05-18T03:40:50.011152+00:00"}