{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CSK7JCKTIMTA7TDVBNZUGU5RES","short_pith_number":"pith:CSK7JCKT","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"},"canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","source":{"kind":"arxiv","id":"1901.05772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05772","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05772v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05772","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"CSK7JCKTIMTA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CSK7JCKTIMTA7TDV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CSK7JCKT","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CSK7JCKTIMTA7TDVBNZUGU5RES","target":"record","payload":{"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"},"canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","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"},"source_kind":"arxiv","source_id":"1901.05772","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeamE59LIRG/8XhqDvCkAAOS0teTiZ4hWf9r3vcAPgPuHBGZIEqdDPAOWPbh3yXcMyCaSxOq7JMHDnnboy5VDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:42:09.474730Z"},"content_sha256":"dc5cce6d03e1a256bad78ff242b1211774814d2fc003e72a70a3225220011bcb","schema_version":"1.0","event_id":"sha256:dc5cce6d03e1a256bad78ff242b1211774814d2fc003e72a70a3225220011bcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CSK7JCKTIMTA7TDVBNZUGU5RES","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:56:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hqAfJozGFJiPtXB+mpUgf9W2MkQLfsozVPrm3V9Jvw0Q693R6GUJGp14rAyecAYPA7vqAGRGSmba1Rvy8trvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:42:09.475596Z"},"content_sha256":"f425d4761b0d4aa41a312b8039d515216db11d8fc49b46a05853982feaf209f2","schema_version":"1.0","event_id":"sha256:f425d4761b0d4aa41a312b8039d515216db11d8fc49b46a05853982feaf209f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/bundle.json","state_url":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T00:42:09Z","links":{"resolver":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES","bundle":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/bundle.json","state":"https://pith.science/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSK7JCKTIMTA7TDVBNZUGU5RES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CSK7JCKTIMTA7TDVBNZUGU5RES","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":"a29231c491a6103f6a11065aad89f115dd7f02c5e96f112d145e4252e9c86590","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T12:59:45Z","title_canon_sha256":"fd5f5b0ae423c041e2fa995ad5019371eb36a7b6bf0fb2f87b4f66581a399b39"},"schema_version":"1.0","source":{"id":"1901.05772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.05772","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"arxiv_version","alias_value":"1901.05772v1","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05772","created_at":"2026-05-17T23:56:06Z"},{"alias_kind":"pith_short_12","alias_value":"CSK7JCKTIMTA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"CSK7JCKTIMTA7TDV","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"CSK7JCKT","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:f425d4761b0d4aa41a312b8039d515216db11d8fc49b46a05853982feaf209f2","target":"graph","created_at":"2026-05-17T23:56:06Z","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"},"paper":{"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-","authors_text":"Jingke Xu, Yaqian Zhang, Zhifang Zhang","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T12:59:45Z","title":"A Capacity-Achieving $T$-PIR Scheme Based On MDS Array Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05772","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:dc5cce6d03e1a256bad78ff242b1211774814d2fc003e72a70a3225220011bcb","target":"record","created_at":"2026-05-17T23:56:06Z","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":"a29231c491a6103f6a11065aad89f115dd7f02c5e96f112d145e4252e9c86590","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-17T12:59:45Z","title_canon_sha256":"fd5f5b0ae423c041e2fa995ad5019371eb36a7b6bf0fb2f87b4f66581a399b39"},"schema_version":"1.0","source":{"id":"1901.05772","kind":"arxiv","version":1}},"canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1495f4895343260fcc750b734353b12486b3c75c01618bf7411c04c2351c1f17","first_computed_at":"2026-05-17T23:56:06.205647Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:06.205647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MxCyfu0QojX7NXSwg2Zps1ykUfSRC7g1yPaq+UJTjcyxD0ZS/EtPIrz6TbJaHlpYiCw6WwGTuWkKjcatBgavCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:06.206312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.05772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc5cce6d03e1a256bad78ff242b1211774814d2fc003e72a70a3225220011bcb","sha256:f425d4761b0d4aa41a312b8039d515216db11d8fc49b46a05853982feaf209f2"],"state_sha256":"25458830e61e143b265fcfcd650923ca7e3dbcd43a9ced0a446e8804daf215e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWWfo5/cxf+2Bp/GVV5un4epQN/zJIPvQbZMWaff+ed7nqd4cxs+P/Fx59LPup1rqEUL8tqhTAioGItnrx2EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:42:09.481505Z","bundle_sha256":"68466d0a9c807123d5f2fd49927a5a37f896fd579f75c56ab96b5abda82d43e1"}}