{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HJDGRSHOFQHGBQCBRJNJTCJXFP","short_pith_number":"pith:HJDGRSHO","schema_version":"1.0","canonical_sha256":"3a4668c8ee2c0e60c0418a5a9989372bd9e22be44f991c040a6b9209e6ab6428","source":{"kind":"arxiv","id":"1606.08828","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.08828","created_at":"2026-05-18T00:40:17.511739+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.08828v2","created_at":"2026-05-18T00:40:17.511739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.08828","created_at":"2026-05-18T00:40:17.511739+00:00"},{"alias_kind":"pith_short_12","alias_value":"HJDGRSHOFQHG","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HJDGRSHOFQHGBQCB","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HJDGRSHO","created_at":"2026-05-18T12:30:19.053100+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/HJDGRSHOFQHGBQCBRJNJTCJXFP","json":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP.json","graph_json":"https://pith.science/api/pith-number/HJDGRSHOFQHGBQCBRJNJTCJXFP/graph.json","events_json":"https://pith.science/api/pith-number/HJDGRSHOFQHGBQCBRJNJTCJXFP/events.json","paper":"https://pith.science/paper/HJDGRSHO"},"agent_actions":{"view_html":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP","download_json":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP.json","view_paper":"https://pith.science/paper/HJDGRSHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.08828&json=true","fetch_graph":"https://pith.science/api/pith-number/HJDGRSHOFQHGBQCBRJNJTCJXFP/graph.json","fetch_events":"https://pith.science/api/pith-number/HJDGRSHOFQHGBQCBRJNJTCJXFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/action/storage_attestation","attest_author":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/action/author_attestation","sign_citation":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/action/citation_signature","submit_replication":"https://pith.science/pith/HJDGRSHOFQHGBQCBRJNJTCJXFP/action/replication_record"}},"created_at":"2026-05-18T00:40:17.511739+00:00","updated_at":"2026-05-18T00:40:17.511739+00:00"}