{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FIS334XERNZB7AWYMP4LTPYX5S","short_pith_number":"pith:FIS334XE","schema_version":"1.0","canonical_sha256":"2a25bdf2e48b721f82d863f8b9bf17ecb1eb28c3e63e95c5c99691739b375bac","source":{"kind":"arxiv","id":"1908.10854","version":1},"attestation_state":"computed","paper":{"title":"$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-08-28T17:53:52Z","abstract_excerpt":"The problem of $X$-secure $T$-private information retrieval from MDS coded storage is studied in this paper, where the user wishes to privately retrieve one out of $K$ independent messages that are distributed over $N$ servers according to an MDS code. It is guaranteed that any group of up to $X$ colluding servers learn nothing about the messages and that any group of up to $T$ colluding servers learn nothing about the identity of desired message. A lower bound of achievable rates is proved by presenting a novel scheme based on \\emph{cross-subspace alignment} and a successive decoding with int"},"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":"1908.10854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-28T17:53:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"be83f51425660f72e0e9e3a7c60b2db5ce2abb2766ebb6b30cae18a9d86cb9f0","abstract_canon_sha256":"257e9d63eb636caa5adda6760c4af7be4d899f96929e8522f52800aec6eb89d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:21.771145Z","signature_b64":"9otHo+HRk0wrH6OtK+YCAbqf7flXjfrm2lbLOclPoGXBcxsGGvyNBCFop7VNNcznqByxuMOGvmCCc4RNOZQRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a25bdf2e48b721f82d863f8b9bf17ecb1eb28c3e63e95c5c99691739b375bac","last_reissued_at":"2026-07-05T00:00:21.770762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:21.770762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar, Zhuqing Jia","submitted_at":"2019-08-28T17:53:52Z","abstract_excerpt":"The problem of $X$-secure $T$-private information retrieval from MDS coded storage is studied in this paper, where the user wishes to privately retrieve one out of $K$ independent messages that are distributed over $N$ servers according to an MDS code. It is guaranteed that any group of up to $X$ colluding servers learn nothing about the messages and that any group of up to $T$ colluding servers learn nothing about the identity of desired message. A lower bound of achievable rates is proved by presenting a novel scheme based on \\emph{cross-subspace alignment} and a successive decoding with int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10854","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.10854/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.10854","created_at":"2026-07-05T00:00:21.770818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.10854v1","created_at":"2026-07-05T00:00:21.770818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10854","created_at":"2026-07-05T00:00:21.770818+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIS334XERNZB","created_at":"2026-07-05T00:00:21.770818+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIS334XERNZB7AWY","created_at":"2026-07-05T00:00:21.770818+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIS334XE","created_at":"2026-07-05T00:00:21.770818+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/FIS334XERNZB7AWYMP4LTPYX5S","json":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S.json","graph_json":"https://pith.science/api/pith-number/FIS334XERNZB7AWYMP4LTPYX5S/graph.json","events_json":"https://pith.science/api/pith-number/FIS334XERNZB7AWYMP4LTPYX5S/events.json","paper":"https://pith.science/paper/FIS334XE"},"agent_actions":{"view_html":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S","download_json":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S.json","view_paper":"https://pith.science/paper/FIS334XE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.10854&json=true","fetch_graph":"https://pith.science/api/pith-number/FIS334XERNZB7AWYMP4LTPYX5S/graph.json","fetch_events":"https://pith.science/api/pith-number/FIS334XERNZB7AWYMP4LTPYX5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S/action/storage_attestation","attest_author":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S/action/author_attestation","sign_citation":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S/action/citation_signature","submit_replication":"https://pith.science/pith/FIS334XERNZB7AWYMP4LTPYX5S/action/replication_record"}},"created_at":"2026-07-05T00:00:21.770818+00:00","updated_at":"2026-07-05T00:00:21.770818+00:00"}