{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5U3UPOBYP2TGC4HRDAQYEEU3MJ","short_pith_number":"pith:5U3UPOBY","schema_version":"1.0","canonical_sha256":"ed3747b8387ea66170f1182182129b6273b59e1671e4ff78f643d8f0ca53ee11","source":{"kind":"arxiv","id":"1204.2606","version":1},"attestation_state":"computed","paper":{"title":"Privacy via the Johnson-Lindenstrauss Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DB","cs.SI"],"primary_cat":"cs.DS","authors_text":"Aleksandra Korolova, Ilya Mironov, Krishnaram Kenthapadi, Nina Mishra","submitted_at":"2012-04-12T03:06:58Z","abstract_excerpt":"Suppose that party A collects private information about its users, where each user's data is represented as a bit vector. Suppose that party B has a proprietary data mining algorithm that requires estimating the distance between users, such as clustering or nearest neighbors. We ask if it is possible for party A to publish some information about each user so that B can estimate the distance between users without being able to infer any private bit of a user. Our method involves projecting each user's representation into a random, lower-dimensional space via a sparse Johnson-Lindenstrauss trans"},"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":"1204.2606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-12T03:06:58Z","cross_cats_sorted":["cs.CY","cs.DB","cs.SI"],"title_canon_sha256":"4226cb78416c4372347569a0b8f25549ccd0e8337e8a6c24a2259df806f895ac","abstract_canon_sha256":"e02384ce90050c5eaea4b8203ab459057f8f257e7e322bbf5c92140e787c9348"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:52.540789Z","signature_b64":"kWIkoACChszmLdnBb2e/sR+/LPfL6TK3rGJS4wmWeTjd1senJFdTvFuvd0MHg+iARy4zsd+qnXcDSgSfhqClCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed3747b8387ea66170f1182182129b6273b59e1671e4ff78f643d8f0ca53ee11","last_reissued_at":"2026-05-18T00:10:52.540000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:52.540000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Privacy via the Johnson-Lindenstrauss Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DB","cs.SI"],"primary_cat":"cs.DS","authors_text":"Aleksandra Korolova, Ilya Mironov, Krishnaram Kenthapadi, Nina Mishra","submitted_at":"2012-04-12T03:06:58Z","abstract_excerpt":"Suppose that party A collects private information about its users, where each user's data is represented as a bit vector. Suppose that party B has a proprietary data mining algorithm that requires estimating the distance between users, such as clustering or nearest neighbors. We ask if it is possible for party A to publish some information about each user so that B can estimate the distance between users without being able to infer any private bit of a user. Our method involves projecting each user's representation into a random, lower-dimensional space via a sparse Johnson-Lindenstrauss trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2606","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":""},"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":"1204.2606","created_at":"2026-05-18T00:10:52.540159+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.2606v1","created_at":"2026-05-18T00:10:52.540159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2606","created_at":"2026-05-18T00:10:52.540159+00:00"},{"alias_kind":"pith_short_12","alias_value":"5U3UPOBYP2TG","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5U3UPOBYP2TGC4HR","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5U3UPOBY","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.15460","citing_title":"Differentially Private Motif-Preserving Multi-modal Hashing","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2510.07136","citing_title":"Differentially Private Spectral Graph Clustering: Balancing Privacy, Accuracy, and Efficiency","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ","json":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ.json","graph_json":"https://pith.science/api/pith-number/5U3UPOBYP2TGC4HRDAQYEEU3MJ/graph.json","events_json":"https://pith.science/api/pith-number/5U3UPOBYP2TGC4HRDAQYEEU3MJ/events.json","paper":"https://pith.science/paper/5U3UPOBY"},"agent_actions":{"view_html":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ","download_json":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ.json","view_paper":"https://pith.science/paper/5U3UPOBY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.2606&json=true","fetch_graph":"https://pith.science/api/pith-number/5U3UPOBYP2TGC4HRDAQYEEU3MJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5U3UPOBYP2TGC4HRDAQYEEU3MJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ/action/storage_attestation","attest_author":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ/action/author_attestation","sign_citation":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ/action/citation_signature","submit_replication":"https://pith.science/pith/5U3UPOBYP2TGC4HRDAQYEEU3MJ/action/replication_record"}},"created_at":"2026-05-18T00:10:52.540159+00:00","updated_at":"2026-05-18T00:10:52.540159+00:00"}