{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HJDGRSHOFQHGBQCBRJNJTCJXFP","short_pith_number":"pith:HJDGRSHO","canonical_record":{"source":{"id":"1606.08828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-28T19:19:13Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"7de711e617814f5cd7efdb7f77f59221fd098a8f3b5f6feacabc4a5a333992e5","abstract_canon_sha256":"4754ccf8954296d7534d74303e90c0bcfd5ecad664b5c6ebea3c658e0e1f4570"},"schema_version":"1.0"},"canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","source":{"kind":"arxiv","id":"1606.08828","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08828","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08828v2","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08828","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"HJDGRSHOFQHG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJDGRSHOFQHGBQCB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJDGRSHO","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HJDGRSHOFQHGBQCBRJNJTCJXFP","target":"record","payload":{"canonical_record":{"source":{"id":"1606.08828","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-28T19:19:13Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"7de711e617814f5cd7efdb7f77f59221fd098a8f3b5f6feacabc4a5a333992e5","abstract_canon_sha256":"4754ccf8954296d7534d74303e90c0bcfd5ecad664b5c6ebea3c658e0e1f4570"},"schema_version":"1.0"},"canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:17.512297Z","signature_b64":"BY+b3oUow7sqv7bpMRmv3Oa6JyD2drLQEIOjCEK0OBmJIWsm4o2zrP/p6pB9NP3GoslTw5FpiHi/ToUxaLwBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","last_reissued_at":"2026-05-18T00:40:17.511637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:17.511637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.08828","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:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRPypGjQNx1jKt6ZACVJsgFx0RC/nEDHKqCWOy+hLoX7oVKmrohk9k3wIDlXGs6ghp98TbsYteTlLOK2HQXxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:45:53.136750Z"},"content_sha256":"ef85157e9c6c6dab6a673899c752d112ae22d5c8c5435f7cf5e7f5eeb47940e6","schema_version":"1.0","event_id":"sha256:ef85157e9c6c6dab6a673899c752d112ae22d5c8c5435f7cf5e7f5eeb47940e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HJDGRSHOFQHGBQCBRJNJTCJXFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Symmetric Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2016-06-28T19:19:13Z","abstract_excerpt":"Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of $K$ messages from $N$ non-communicating replicated databases (each holds all $K$ messages) while keeping the identity of the desired message index a secret from each individual database. Symmetric PIR (SPIR) is a generalization of PIR to include the requirement that beyond the desired message, the user learns nothing about the other $K-1$ messages. The information theoretic capacity of SPIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired infor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08828","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:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fy3dDfBGU8Bc7c6sUlEsC0R7ICwfWiRHgcigP/KMtiWibEhBUZ/13FQSE3rVfvDge7UayalmoA3hFgHjycLyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T09:45:53.137101Z"},"content_sha256":"16e8ea517ae3ca8a6e3e6a39bb5b93d8737232ae199a3b55b648c10418c9f9cc","schema_version":"1.0","event_id":"sha256:16e8ea517ae3ca8a6e3e6a39bb5b93d8737232ae199a3b55b648c10418c9f9cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/bundle.json","state_url":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/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-20T09:45:53Z","links":{"resolver":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP","bundle":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/bundle.json","state":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HJDGRSHOFQHGBQCBRJNJTCJXFP","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":"4754ccf8954296d7534d74303e90c0bcfd5ecad664b5c6ebea3c658e0e1f4570","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-28T19:19:13Z","title_canon_sha256":"7de711e617814f5cd7efdb7f77f59221fd098a8f3b5f6feacabc4a5a333992e5"},"schema_version":"1.0","source":{"id":"1606.08828","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.08828","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1606.08828v2","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08828","created_at":"2026-05-18T00:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"HJDGRSHOFQHG","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HJDGRSHOFQHGBQCB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HJDGRSHO","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:16e8ea517ae3ca8a6e3e6a39bb5b93d8737232ae199a3b55b648c10418c9f9cc","target":"graph","created_at":"2026-05-18T00:40:17Z","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":"Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of $K$ messages from $N$ non-communicating replicated databases (each holds all $K$ messages) while keeping the identity of the desired message index a secret from each individual database. Symmetric PIR (SPIR) is a generalization of PIR to include the requirement that beyond the desired message, the user learns nothing about the other $K-1$ messages. The information theoretic capacity of SPIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired infor","authors_text":"Hua Sun, Syed A. Jafar","cross_cats":["cs.CR","cs.IR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-28T19:19:13Z","title":"The Capacity of Symmetric Private Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.08828","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:ef85157e9c6c6dab6a673899c752d112ae22d5c8c5435f7cf5e7f5eeb47940e6","target":"record","created_at":"2026-05-18T00:40:17Z","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":"4754ccf8954296d7534d74303e90c0bcfd5ecad664b5c6ebea3c658e0e1f4570","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-28T19:19:13Z","title_canon_sha256":"7de711e617814f5cd7efdb7f77f59221fd098a8f3b5f6feacabc4a5a333992e5"},"schema_version":"1.0","source":{"id":"1606.08828","kind":"arxiv","version":2}},"canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","first_computed_at":"2026-05-18T00:40:17.511637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:17.511637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BY+b3oUow7sqv7bpMRmv3Oa6JyD2drLQEIOjCEK0OBmJIWsm4o2zrP/p6pB9NP3GoslTw5FpiHi/ToUxaLwBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:17.512297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.08828","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef85157e9c6c6dab6a673899c752d112ae22d5c8c5435f7cf5e7f5eeb47940e6","sha256:16e8ea517ae3ca8a6e3e6a39bb5b93d8737232ae199a3b55b648c10418c9f9cc"],"state_sha256":"87fa3909741e71d408053a11fd202a084b000ce133224771bb067cc105aa1f70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EtKIgiRQWdMwcECdc+IWlc38uwlY/CXFwDV2ieAkhCne4ZvMHkJlTHpzHc6XSck2ZtRaorfAYN2vnY27mfyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T09:45:53.139648Z","bundle_sha256":"eee5973e680fb6a316af7d8c78ce0d59a1a57aae1e99e9e6a06faff930e84e42"}}