{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:CSK7JCKTIMTA7TDVBNZUGU5RES","short_pith_number":"pith:CSK7JCKT","schema_version":"1.0","canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","source":{"kind":"arxiv","id":"1901.05772","version":1},"attestation_state":"computed","paper":{"title":"A Capacity-Achieving $T$-PIR Scheme Based On MDS Array Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingke Xu, Yaqian Zhang, Zhifang Zhang","submitted_at":"2019-01-17T12:59:45Z","abstract_excerpt":"Suppose a database containing $M$ records is replicated in each of $N$ servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to $T$ servers. A scheme designed for this purpose is called a $T$-private information retrieval ($T$-PIR) scheme.\n  In this paper we focus on the field size of $T$-PIR schemes. We design a generalcapacity-achieving $T$-PIR scheme whose queries are generated by using some {\\rm MDS } array codes. It only requires field size $q\\geq\\sqrt[\\ell]{N}$, where $\\ell=\\min\\{t^{M-2},(n-"},"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":"1901.05772","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T12:59:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fd5f5b0ae423c041e2fa995ad5019371eb36a7b6bf0fb2f87b4f66581a399b39","abstract_canon_sha256":"a29231c491a6103f6a11065aad89f115dd7f02c5e96f112d145e4252e9c86590"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:06.206312Z","signature_b64":"MxCyfu0QojX7NXSwg2Zps1ykUfSRC7g1yPaq+UJTjcyxD0ZS/EtPIrz6TbJaHlpYiCw6WwGTuWkKjcatBgavCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","last_reissued_at":"2026-05-17T23:56:06.205647Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:06.205647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Capacity-Achieving $T$-PIR Scheme Based On MDS Array Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingke Xu, Yaqian Zhang, Zhifang Zhang","submitted_at":"2019-01-17T12:59:45Z","abstract_excerpt":"Suppose a database containing $M$ records is replicated in each of $N$ servers, and a user wants to privately retrieve one record by accessing the servers such that identity of the retrieved record is secret against any up to $T$ servers. A scheme designed for this purpose is called a $T$-private information retrieval ($T$-PIR) scheme.\n  In this paper we focus on the field size of $T$-PIR schemes. We design a generalcapacity-achieving $T$-PIR scheme whose queries are generated by using some {\\rm MDS } array codes. It only requires field size $q\\geq\\sqrt[\\ell]{N}$, where $\\ell=\\min\\{t^{M-2},(n-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05772","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":""},"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":"1901.05772","created_at":"2026-05-17T23:56:06.205763+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05772v1","created_at":"2026-05-17T23:56:06.205763+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05772","created_at":"2026-05-17T23:56:06.205763+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSK7JCKTIMTA","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSK7JCKTIMTA7TDV","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSK7JCKT","created_at":"2026-05-18T12:33:15.570797+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/CSK7JCKTIMTA7TDVBNZUGU5RES","json":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES.json","graph_json":"https://pith.science/api/pith-number/CSK7JCKTIMTA7TDVBNZUGU5RES/graph.json","events_json":"https://pith.science/api/pith-number/CSK7JCKTIMTA7TDVBNZUGU5RES/events.json","paper":"https://pith.science/paper/CSK7JCKT"},"agent_actions":{"view_html":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES","download_json":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES.json","view_paper":"https://pith.science/paper/CSK7JCKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05772&json=true","fetch_graph":"https://pith.science/api/pith-number/CSK7JCKTIMTA7TDVBNZUGU5RES/graph.json","fetch_events":"https://pith.science/api/pith-number/CSK7JCKTIMTA7TDVBNZUGU5RES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/action/storage_attestation","attest_author":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/action/author_attestation","sign_citation":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/action/citation_signature","submit_replication":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/action/replication_record"}},"created_at":"2026-05-17T23:56:06.205763+00:00","updated_at":"2026-05-17T23:56:06.205763+00:00"}