{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QNBHY5TYJ6NGYHL6ZFXSYW7GJV","short_pith_number":"pith:QNBHY5TY","schema_version":"1.0","canonical_sha256":"83427c76784f9a6c1d7ec96f2c5be64d60c2fa4489e7fec45bf6631dc0e945d7","source":{"kind":"arxiv","id":"1709.03022","version":3},"attestation_state":"computed","paper":{"title":"The Capacity of $T$-Private Information Retrieval with Private Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Jafar, Zhen Chen, Zhiying Wang","submitted_at":"2017-09-10T00:49:08Z","abstract_excerpt":"We consider the problem of $T$-Private Information Retrieval with private side information (TPIR-PSI). In this problem, $N$ replicated databases store $K$ independent messages, and a user, equipped with a local cache that holds $M$ messages as side information, wishes to retrieve one of the other $K-M$ messages. The desired message index and the side information must remain jointly private even if any $T$ of the $N$ databases collude. We show that the capacity of TPIR-PSI is $\\left(1+\\frac{T}{N}+\\cdots+\\left(\\frac{T}{N}\\right)^{K-M-1}\\right)^{-1}$. As a special case obtained by setting $T=1$, "},"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":"1709.03022","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-10T00:49:08Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"3c7121657cb94291476ad97e32eabf343520f7935bb8fa7c1dae77084613b74b","abstract_canon_sha256":"55f270fd50db21778c67796bb680146ba6ab91d8b44ccaa20fd8ae983447f7e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.407569Z","signature_b64":"3xafRb6xhmmG4Vj89aad36BgFOJo6e0/En1h87JJikn9uv0Gt45UHB+15LFziuP7ewRgM8p98dx36s/5y0ooBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83427c76784f9a6c1d7ec96f2c5be64d60c2fa4489e7fec45bf6631dc0e945d7","last_reissued_at":"2026-05-17T23:44:38.407200Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.407200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Capacity of $T$-Private Information Retrieval with Private Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Syed Jafar, Zhen Chen, Zhiying Wang","submitted_at":"2017-09-10T00:49:08Z","abstract_excerpt":"We consider the problem of $T$-Private Information Retrieval with private side information (TPIR-PSI). In this problem, $N$ replicated databases store $K$ independent messages, and a user, equipped with a local cache that holds $M$ messages as side information, wishes to retrieve one of the other $K-M$ messages. The desired message index and the side information must remain jointly private even if any $T$ of the $N$ databases collude. We show that the capacity of TPIR-PSI is $\\left(1+\\frac{T}{N}+\\cdots+\\left(\\frac{T}{N}\\right)^{K-M-1}\\right)^{-1}$. As a special case obtained by setting $T=1$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.03022","kind":"arxiv","version":3},"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":"1709.03022","created_at":"2026-05-17T23:44:38.407256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.03022v3","created_at":"2026-05-17T23:44:38.407256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.03022","created_at":"2026-05-17T23:44:38.407256+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNBHY5TYJ6NG","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNBHY5TYJ6NGYHL6","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNBHY5TY","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.09259","citing_title":"Multi-Server Private Information Retrieval with Coded Side Information","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1906.11278","citing_title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV","json":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV.json","graph_json":"https://pith.science/api/pith-number/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/graph.json","events_json":"https://pith.science/api/pith-number/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/events.json","paper":"https://pith.science/paper/QNBHY5TY"},"agent_actions":{"view_html":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV","download_json":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV.json","view_paper":"https://pith.science/paper/QNBHY5TY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.03022&json=true","fetch_graph":"https://pith.science/api/pith-number/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/graph.json","fetch_events":"https://pith.science/api/pith-number/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/action/storage_attestation","attest_author":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/action/author_attestation","sign_citation":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/action/citation_signature","submit_replication":"https://pith.science/pith/QNBHY5TYJ6NGYHL6ZFXSYW7GJV/action/replication_record"}},"created_at":"2026-05-17T23:44:38.407256+00:00","updated_at":"2026-05-17T23:44:38.407256+00:00"}