{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E3MJ77R2SSBGO5IKL7XZ64DY7S","short_pith_number":"pith:E3MJ77R2","canonical_record":{"source":{"id":"1502.05746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T23:15:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e34600e7465dfb09c1ae06a87bb4ed35040a4831f6204726e4ab9088560eddd6","abstract_canon_sha256":"98c6cb1ad5478375b3d43c582c16bcc140bcdec36b1bbef439f3eab666d0f86b"},"schema_version":"1.0"},"canonical_sha256":"26d89ffe3a948267750a5fef9f7078fc9388ba0895ead3c98bffc81250b9da7d","source":{"kind":"arxiv","id":"1502.05746","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05746","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05746v2","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05746","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"E3MJ77R2SSBG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E3MJ77R2SSBGO5IK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E3MJ77R2","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E3MJ77R2SSBGO5IKL7XZ64DY7S","target":"record","payload":{"canonical_record":{"source":{"id":"1502.05746","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T23:15:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e34600e7465dfb09c1ae06a87bb4ed35040a4831f6204726e4ab9088560eddd6","abstract_canon_sha256":"98c6cb1ad5478375b3d43c582c16bcc140bcdec36b1bbef439f3eab666d0f86b"},"schema_version":"1.0"},"canonical_sha256":"26d89ffe3a948267750a5fef9f7078fc9388ba0895ead3c98bffc81250b9da7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:43.522208Z","signature_b64":"5S28evVoMcTCOYcpesfABhSF/jEuljcNm7J4tfpwGKYPyWNOgzq2eAKNriVPIZcfLZwuD20VbZM0JphhP3YTDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d89ffe3a948267750a5fef9f7078fc9388ba0895ead3c98bffc81250b9da7d","last_reissued_at":"2026-05-17T23:55:43.521528Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:43.521528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.05746","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8MiIWEDZwVTByvlw6iSptRdlEbNP0fJrtHn20B54j8AfUf/UaurnQpzwayOmAkycHQvX7NBooW9dNOBzd9KDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:11:49.394456Z"},"content_sha256":"efcbb0e8a2fb4a5d6f0811d64bafaa9f3f272b7d51aba505cebe92d663c8c7e2","schema_version":"1.0","event_id":"sha256:efcbb0e8a2fb4a5d6f0811d64bafaa9f3f272b7d51aba505cebe92d663c8c7e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E3MJ77R2SSBGO5IKL7XZ64DY7S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary Embedding: Fundamental Limits and Fast Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Constantine Caramanis, Eric Price, Xinyang Yi","submitted_at":"2015-02-19T23:15:02Z","abstract_excerpt":"Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in $\\mathbb{S}^{p-1}$, our goal is to encode each point using $m$-dimensional binary strings such that we can reconstruct their geodesic distance up to $\\delta$ uniform distortion. Existing binary embedding algorithms either lack theoretical guarantees or suffer from running time $O\\big(mp\\big)$. We make three contributions: (1) we establish a lower bound that shows"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05746","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veTGMdo4FX44jzR+e9R6+qgNig1h3jDjKgugbUDyf85kyNERdvteMsbKpKozIqU+1OlB6gLjNFWX8fhrBEbjBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T13:11:49.394811Z"},"content_sha256":"2f3eb7ab072ca29b0770c3690576a267e74dd7472e184e8e7b7d9c26ad2b76fd","schema_version":"1.0","event_id":"sha256:2f3eb7ab072ca29b0770c3690576a267e74dd7472e184e8e7b7d9c26ad2b76fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/bundle.json","state_url":"https://pith.science/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-20T13:11:49Z","links":{"resolver":"https://pith.science/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S","bundle":"https://pith.science/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/bundle.json","state":"https://pith.science/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3MJ77R2SSBGO5IKL7XZ64DY7S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E3MJ77R2SSBGO5IKL7XZ64DY7S","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"98c6cb1ad5478375b3d43c582c16bcc140bcdec36b1bbef439f3eab666d0f86b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T23:15:02Z","title_canon_sha256":"e34600e7465dfb09c1ae06a87bb4ed35040a4831f6204726e4ab9088560eddd6"},"schema_version":"1.0","source":{"id":"1502.05746","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.05746","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"arxiv_version","alias_value":"1502.05746v2","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05746","created_at":"2026-05-17T23:55:43Z"},{"alias_kind":"pith_short_12","alias_value":"E3MJ77R2SSBG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E3MJ77R2SSBGO5IK","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E3MJ77R2","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2f3eb7ab072ca29b0770c3690576a267e74dd7472e184e8e7b7d9c26ad2b76fd","target":"graph","created_at":"2026-05-17T23:55:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in $\\mathbb{S}^{p-1}$, our goal is to encode each point using $m$-dimensional binary strings such that we can reconstruct their geodesic distance up to $\\delta$ uniform distortion. Existing binary embedding algorithms either lack theoretical guarantees or suffer from running time $O\\big(mp\\big)$. We make three contributions: (1) we establish a lower bound that shows","authors_text":"Constantine Caramanis, Eric Price, Xinyang Yi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T23:15:02Z","title":"Binary Embedding: Fundamental Limits and Fast Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05746","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:efcbb0e8a2fb4a5d6f0811d64bafaa9f3f272b7d51aba505cebe92d663c8c7e2","target":"record","created_at":"2026-05-17T23:55:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"98c6cb1ad5478375b3d43c582c16bcc140bcdec36b1bbef439f3eab666d0f86b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-19T23:15:02Z","title_canon_sha256":"e34600e7465dfb09c1ae06a87bb4ed35040a4831f6204726e4ab9088560eddd6"},"schema_version":"1.0","source":{"id":"1502.05746","kind":"arxiv","version":2}},"canonical_sha256":"26d89ffe3a948267750a5fef9f7078fc9388ba0895ead3c98bffc81250b9da7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d89ffe3a948267750a5fef9f7078fc9388ba0895ead3c98bffc81250b9da7d","first_computed_at":"2026-05-17T23:55:43.521528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:43.521528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5S28evVoMcTCOYcpesfABhSF/jEuljcNm7J4tfpwGKYPyWNOgzq2eAKNriVPIZcfLZwuD20VbZM0JphhP3YTDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:43.522208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.05746","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efcbb0e8a2fb4a5d6f0811d64bafaa9f3f272b7d51aba505cebe92d663c8c7e2","sha256:2f3eb7ab072ca29b0770c3690576a267e74dd7472e184e8e7b7d9c26ad2b76fd"],"state_sha256":"c54b5688935da69877985ab1a16b09c1297a365ef7ff697c43ec4f704acb404d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1gv8hhPXU7MyPGjRqBcHk/tUG4x+uSVmbBdENNZ1zhy06qJyXu2aiDk47kHUslddwEqFJGmYcp7NEnXgCCICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T13:11:49.396905Z","bundle_sha256":"938521f913253d9a973553a6238989da238d9488c70354e7fa102896653baf25"}}