{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FIS334XERNZB7AWYMP4LTPYX5S","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":"257e9d63eb636caa5adda6760c4af7be4d899f96929e8522f52800aec6eb89d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-28T17:53:52Z","title_canon_sha256":"be83f51425660f72e0e9e3a7c60b2db5ce2abb2766ebb6b30cae18a9d86cb9f0"},"schema_version":"1.0","source":{"id":"1908.10854","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.10854","created_at":"2026-07-05T00:00:21Z"},{"alias_kind":"arxiv_version","alias_value":"1908.10854v1","created_at":"2026-07-05T00:00:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.10854","created_at":"2026-07-05T00:00:21Z"},{"alias_kind":"pith_short_12","alias_value":"FIS334XERNZB","created_at":"2026-07-05T00:00:21Z"},{"alias_kind":"pith_short_16","alias_value":"FIS334XERNZB7AWY","created_at":"2026-07-05T00:00:21Z"},{"alias_kind":"pith_short_8","alias_value":"FIS334XE","created_at":"2026-07-05T00:00:21Z"}],"graph_snapshots":[{"event_id":"sha256:37b6edf4daa294725f9a2b5d07bc37c18bfb1c934db4706bf30821cdc281274c","target":"graph","created_at":"2026-07-05T00:00:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.10854/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Syed A. Jafar, Zhuqing Jia","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-28T17:53:52Z","title":"$X$-secure $T$-private Information Retrieval from MDS Coded Storage with Byzantine and Unresponsive Servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.10854","kind":"arxiv","version":1},"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:6dd5def985d9d307ec9e97c7a3c404098666fec9628990c42cc5ba956ee91932","target":"record","created_at":"2026-07-05T00:00:21Z","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":"257e9d63eb636caa5adda6760c4af7be4d899f96929e8522f52800aec6eb89d8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-28T17:53:52Z","title_canon_sha256":"be83f51425660f72e0e9e3a7c60b2db5ce2abb2766ebb6b30cae18a9d86cb9f0"},"schema_version":"1.0","source":{"id":"1908.10854","kind":"arxiv","version":1}},"canonical_sha256":"2a25bdf2e48b721f82d863f8b9bf17ecb1eb28c3e63e95c5c99691739b375bac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a25bdf2e48b721f82d863f8b9bf17ecb1eb28c3e63e95c5c99691739b375bac","first_computed_at":"2026-07-05T00:00:21.770762Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:21.770762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9otHo+HRk0wrH6OtK+YCAbqf7flXjfrm2lbLOclPoGXBcxsGGvyNBCFop7VNNcznqByxuMOGvmCCc4RNOZQRBg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:21.771145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.10854","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6dd5def985d9d307ec9e97c7a3c404098666fec9628990c42cc5ba956ee91932","sha256:37b6edf4daa294725f9a2b5d07bc37c18bfb1c934db4706bf30821cdc281274c"],"state_sha256":"bd343e3b2893e08352b836cd8a46ac9c855749e5bba7eb4f89c534db918f8a75"}