{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W5HYZBFYBN3X5RDYAC5PEH5G33","short_pith_number":"pith:W5HYZBFY","canonical_record":{"source":{"id":"1801.05768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T05:29:38Z","cross_cats_sorted":["cs.CR","cs.DS","math.IT"],"title_canon_sha256":"3a31e6a944b86ddbf4aa8d0d22956c1ea5dd92ba6ddebfda791fac1531f1792d","abstract_canon_sha256":"c349ce74fbefcb3c0aefe1fc1dc61ac2fb4abc3d6ebcdeed903b0287eccb1345"},"schema_version":"1.0"},"canonical_sha256":"b74f8c84b80b777ec47800baf21fa6def5a5df89ada86c6ebf2867b77c7bf3fd","source":{"kind":"arxiv","id":"1801.05768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05768","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05768v2","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05768","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"W5HYZBFYBN3X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W5HYZBFYBN3X5RDY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W5HYZBFY","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W5HYZBFYBN3X5RDYAC5PEH5G33","target":"record","payload":{"canonical_record":{"source":{"id":"1801.05768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T05:29:38Z","cross_cats_sorted":["cs.CR","cs.DS","math.IT"],"title_canon_sha256":"3a31e6a944b86ddbf4aa8d0d22956c1ea5dd92ba6ddebfda791fac1531f1792d","abstract_canon_sha256":"c349ce74fbefcb3c0aefe1fc1dc61ac2fb4abc3d6ebcdeed903b0287eccb1345"},"schema_version":"1.0"},"canonical_sha256":"b74f8c84b80b777ec47800baf21fa6def5a5df89ada86c6ebf2867b77c7bf3fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:36.547604Z","signature_b64":"dYpggkW4L7K+3GDpZUpLpZU7ozodRinmroVGZigCpepUcNobxnngMcdJmV43f/0S8ncFg1OqP0qhuMz26Sx7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b74f8c84b80b777ec47800baf21fa6def5a5df89ada86c6ebf2867b77c7bf3fd","last_reissued_at":"2026-05-18T00:25:36.546823Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:36.546823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.05768","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-18T00:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMXTXtIsyNAavf6oPRRp+o1upSQGj7C2kBYbVia4gdGp2Sl7IBk9gdlI0avfsTg07MjjmTruRELimN2+Mx0FDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:03:40.467284Z"},"content_sha256":"cc32d46ca3d50a792291d98b1441717e9f75bfd8e2e8334d2e1b364a5c19da26","schema_version":"1.0","event_id":"sha256:cc32d46ca3d50a792291d98b1441717e9f75bfd8e2e8334d2e1b364a5c19da26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W5HYZBFYBN3X5RDYAC5PEH5G33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Asymptotic Capacity of Private Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Jafar, Zhen Chen, Zhiying Wang","submitted_at":"2018-01-12T05:29:38Z","abstract_excerpt":"The private search problem is introduced, where a dataset comprised of $L$ i.i.d. records is replicated across $N$ non-colluding servers, each record takes values uniformly from an alphabet of size $K$, and a user wishes to search for all records that match a privately chosen value, without revealing any information about the chosen value to any individual server. The capacity of private search is the maximum number of bits of desired information that can be retrieved per bit of download. The asymptotic (large $K$) capacity of private search is shown to be $1-1/N$, even as the scope of private"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05768","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-18T00:25:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jZTyenTbDW8VbvQC8Xfgz595CJWJB4uomp8bsbeXZAEg9O0DRM3VKwbxd3yBNHTXtBJ684sCGAKKo3OeKJ8GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T17:03:40.467655Z"},"content_sha256":"e9ce64967f3d8991f3ada40999c8d28894ecf76e753e42da1a21c79fa4177e56","schema_version":"1.0","event_id":"sha256:e9ce64967f3d8991f3ada40999c8d28894ecf76e753e42da1a21c79fa4177e56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/bundle.json","state_url":"https://pith.science/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/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-06-20T17:03:40Z","links":{"resolver":"https://pith.science/pith/W5HYZBFYBN3X5RDYAC5PEH5G33","bundle":"https://pith.science/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/bundle.json","state":"https://pith.science/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5HYZBFYBN3X5RDYAC5PEH5G33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W5HYZBFYBN3X5RDYAC5PEH5G33","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":"c349ce74fbefcb3c0aefe1fc1dc61ac2fb4abc3d6ebcdeed903b0287eccb1345","cross_cats_sorted":["cs.CR","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T05:29:38Z","title_canon_sha256":"3a31e6a944b86ddbf4aa8d0d22956c1ea5dd92ba6ddebfda791fac1531f1792d"},"schema_version":"1.0","source":{"id":"1801.05768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05768","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05768v2","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05768","created_at":"2026-05-18T00:25:36Z"},{"alias_kind":"pith_short_12","alias_value":"W5HYZBFYBN3X","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W5HYZBFYBN3X5RDY","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W5HYZBFY","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:e9ce64967f3d8991f3ada40999c8d28894ecf76e753e42da1a21c79fa4177e56","target":"graph","created_at":"2026-05-18T00:25:36Z","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":"The private search problem is introduced, where a dataset comprised of $L$ i.i.d. records is replicated across $N$ non-colluding servers, each record takes values uniformly from an alphabet of size $K$, and a user wishes to search for all records that match a privately chosen value, without revealing any information about the chosen value to any individual server. The capacity of private search is the maximum number of bits of desired information that can be retrieved per bit of download. The asymptotic (large $K$) capacity of private search is shown to be $1-1/N$, even as the scope of private","authors_text":"Syed Jafar, Zhen Chen, Zhiying Wang","cross_cats":["cs.CR","cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T05:29:38Z","title":"The Asymptotic Capacity of Private Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05768","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:cc32d46ca3d50a792291d98b1441717e9f75bfd8e2e8334d2e1b364a5c19da26","target":"record","created_at":"2026-05-18T00:25:36Z","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":"c349ce74fbefcb3c0aefe1fc1dc61ac2fb4abc3d6ebcdeed903b0287eccb1345","cross_cats_sorted":["cs.CR","cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-12T05:29:38Z","title_canon_sha256":"3a31e6a944b86ddbf4aa8d0d22956c1ea5dd92ba6ddebfda791fac1531f1792d"},"schema_version":"1.0","source":{"id":"1801.05768","kind":"arxiv","version":2}},"canonical_sha256":"b74f8c84b80b777ec47800baf21fa6def5a5df89ada86c6ebf2867b77c7bf3fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b74f8c84b80b777ec47800baf21fa6def5a5df89ada86c6ebf2867b77c7bf3fd","first_computed_at":"2026-05-18T00:25:36.546823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:36.546823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dYpggkW4L7K+3GDpZUpLpZU7ozodRinmroVGZigCpepUcNobxnngMcdJmV43f/0S8ncFg1OqP0qhuMz26Sx7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:36.547604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc32d46ca3d50a792291d98b1441717e9f75bfd8e2e8334d2e1b364a5c19da26","sha256:e9ce64967f3d8991f3ada40999c8d28894ecf76e753e42da1a21c79fa4177e56"],"state_sha256":"3f24734dc61a088b3d691cf193163828da2e26188af104203f7e5545a012bac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oADIsFsHU1tWAtMjLhpECCcc01aChI8UF74aYGlAVrF4yfWy/5ERTtmr+Xmn9ahHWf4VxTuT7iEd8MBjA6bFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T17:03:40.469694Z","bundle_sha256":"7f189ba3d280cc344e3d03e2a70da35a199afdf639b5d686660cb7ea254d75d0"}}