{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:W7J6NCYFZAY5VJ7VUMHUZOCUL4","short_pith_number":"pith:W7J6NCYF","schema_version":"1.0","canonical_sha256":"b7d3e68b05c831daa7f5a30f4cb8545f191107e415b3173bade763ad3cd2b53b","source":{"kind":"arxiv","id":"1808.07457","version":2},"attestation_state":"computed","paper":{"title":"Cross Subspace Alignment and the Asymptotic Capacity of $X$-Secure $T$-Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar, Zhuqing Jia","submitted_at":"2018-08-22T17:47:30Z","abstract_excerpt":"$X$-secure and $T$-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the user's privacy is guaranteed against collusion among up to $T$ servers. The capacity of XSTPIR is characterized for arbitrary number of servers $N$, and arbitrary security and privacy thresholds $X$ and $T$, in the limit as the number of messages $K\\rightarrow\\infty$. Capacity is also characterized for any number of messages if either $N=3, X=T=1$ or if $N\\leq X+T$. Insights are drawn from these results, about a"},"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":"1808.07457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-08-22T17:47:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a8121b25af516773376f16757b9414d69e4d7735302db4e69b38f6b5858797ed","abstract_canon_sha256":"cd22c0b8dfd2cf474934cadd9d6a7db02a53fd757f0add9e47693b8c99d48273"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:15.730671Z","signature_b64":"zNlUwjmaOsQOJhkxaoQCQzaejBl2T6Ls3Bw4IKl8S45PO3GCnp3cmaYo+GA4fD5l205byMlYtC8A/2Wl6TQIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7d3e68b05c831daa7f5a30f4cb8545f191107e415b3173bade763ad3cd2b53b","last_reissued_at":"2026-05-17T23:52:15.730079Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:15.730079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cross Subspace Alignment and the Asymptotic Capacity of $X$-Secure $T$-Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar, Zhuqing Jia","submitted_at":"2018-08-22T17:47:30Z","abstract_excerpt":"$X$-secure and $T$-private information retrieval (XSTPIR) is a form of private information retrieval where data security is guaranteed against collusion among up to $X$ servers and the user's privacy is guaranteed against collusion among up to $T$ servers. The capacity of XSTPIR is characterized for arbitrary number of servers $N$, and arbitrary security and privacy thresholds $X$ and $T$, in the limit as the number of messages $K\\rightarrow\\infty$. Capacity is also characterized for any number of messages if either $N=3, X=T=1$ or if $N\\leq X+T$. Insights are drawn from these results, about a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07457","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":"1808.07457","created_at":"2026-05-17T23:52:15.730176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07457v2","created_at":"2026-05-17T23:52:15.730176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07457","created_at":"2026-05-17T23:52:15.730176+00:00"},{"alias_kind":"pith_short_12","alias_value":"W7J6NCYFZAY5","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"W7J6NCYFZAY5VJ7V","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"W7J6NCYF","created_at":"2026-05-18T12:32:59.047623+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/W7J6NCYFZAY5VJ7VUMHUZOCUL4","json":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4.json","graph_json":"https://pith.science/api/pith-number/W7J6NCYFZAY5VJ7VUMHUZOCUL4/graph.json","events_json":"https://pith.science/api/pith-number/W7J6NCYFZAY5VJ7VUMHUZOCUL4/events.json","paper":"https://pith.science/paper/W7J6NCYF"},"agent_actions":{"view_html":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4","download_json":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4.json","view_paper":"https://pith.science/paper/W7J6NCYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07457&json=true","fetch_graph":"https://pith.science/api/pith-number/W7J6NCYFZAY5VJ7VUMHUZOCUL4/graph.json","fetch_events":"https://pith.science/api/pith-number/W7J6NCYFZAY5VJ7VUMHUZOCUL4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4/action/storage_attestation","attest_author":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4/action/author_attestation","sign_citation":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4/action/citation_signature","submit_replication":"https://pith.science/pith/W7J6NCYFZAY5VJ7VUMHUZOCUL4/action/replication_record"}},"created_at":"2026-05-17T23:52:15.730176+00:00","updated_at":"2026-05-17T23:52:15.730176+00:00"}