{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7AFURXD7DJZHCVBMGQHJKQUKIE","short_pith_number":"pith:7AFURXD7","schema_version":"1.0","canonical_sha256":"f80b48dc7f1a7271542c340e95428a4124348bcb30b4d51ce9eced1282aab8e2","source":{"kind":"arxiv","id":"1302.6542","version":2},"attestation_state":"computed","paper":{"title":"A lower bound on dimension reduction for trees in \\ell_1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.MG","authors_text":"James R. Lee, Mohammad Moharrami","submitted_at":"2013-02-26T19:13:55Z","abstract_excerpt":"There is a constant c > 0 such that for every $\\epsilon \\in (0,1)$ and $n \\geq 1/\\epsilon^2$, the following holds. Any mapping from the $n$-point star metric into $\\ell_1^d$ with bi-Lipschitz distortion $1+\\epsilon$ requires dimension $$d \\geq {c\\log n\\over \\epsilon^2\\log (1/\\epsilon)}.$$"},"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":"1302.6542","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-02-26T19:13:55Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f1f750a0742b141a93f1649722b3ca494fc07ee39cbd38c7bbf6f88777ff6a03","abstract_canon_sha256":"c2e8ca243c1a6a2a0a8428a407461e8af8bc5835bb6897df105e0489c681261d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:19.465144Z","signature_b64":"PEp8PTS5ODBpSw9YKIgFOc4Wfnj9zdkYAYGMlgbPwMxeOy6VXw4F5JbCrBVfq33mLkPxF3GCMa7MLGR0R9fXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f80b48dc7f1a7271542c340e95428a4124348bcb30b4d51ce9eced1282aab8e2","last_reissued_at":"2026-05-18T03:32:19.462997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:19.462997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A lower bound on dimension reduction for trees in \\ell_1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.MG","authors_text":"James R. Lee, Mohammad Moharrami","submitted_at":"2013-02-26T19:13:55Z","abstract_excerpt":"There is a constant c > 0 such that for every $\\epsilon \\in (0,1)$ and $n \\geq 1/\\epsilon^2$, the following holds. Any mapping from the $n$-point star metric into $\\ell_1^d$ with bi-Lipschitz distortion $1+\\epsilon$ requires dimension $$d \\geq {c\\log n\\over \\epsilon^2\\log (1/\\epsilon)}.$$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6542","kind":"arxiv","version":2},"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":"1302.6542","created_at":"2026-05-18T03:32:19.463253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6542v2","created_at":"2026-05-18T03:32:19.463253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6542","created_at":"2026-05-18T03:32:19.463253+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AFURXD7DJZH","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AFURXD7DJZHCVBM","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AFURXD7","created_at":"2026-05-18T12:27:36.564083+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/7AFURXD7DJZHCVBMGQHJKQUKIE","json":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE.json","graph_json":"https://pith.science/api/pith-number/7AFURXD7DJZHCVBMGQHJKQUKIE/graph.json","events_json":"https://pith.science/api/pith-number/7AFURXD7DJZHCVBMGQHJKQUKIE/events.json","paper":"https://pith.science/paper/7AFURXD7"},"agent_actions":{"view_html":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE","download_json":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE.json","view_paper":"https://pith.science/paper/7AFURXD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6542&json=true","fetch_graph":"https://pith.science/api/pith-number/7AFURXD7DJZHCVBMGQHJKQUKIE/graph.json","fetch_events":"https://pith.science/api/pith-number/7AFURXD7DJZHCVBMGQHJKQUKIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE/action/storage_attestation","attest_author":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE/action/author_attestation","sign_citation":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE/action/citation_signature","submit_replication":"https://pith.science/pith/7AFURXD7DJZHCVBMGQHJKQUKIE/action/replication_record"}},"created_at":"2026-05-18T03:32:19.463253+00:00","updated_at":"2026-05-18T03:32:19.463253+00:00"}