{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OYU4GZ3Z2HTHNOH6GSWG5KZ73H","short_pith_number":"pith:OYU4GZ3Z","schema_version":"1.0","canonical_sha256":"7629c36779d1e676b8fe34ac6eab3fd9f2f750f667a8aee6510e6cce938983ff","source":{"kind":"arxiv","id":"1607.00235","version":6},"attestation_state":"computed","paper":{"title":"PIR Array Codes with Optimal Virtual Server Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Simon Blackburn, Tuvi Etzion","submitted_at":"2016-07-01T13:25:52Z","abstract_excerpt":"There has been much recent interest in Private information Retrieval (PIR) in models where a database is stored across several servers using coding techniques from distributed storage, rather than being simply replicated. In particular, a recent breakthrough result of Fazelli, Vardy and Yaakobi introduces the notion of a PIR code and a PIR array code, and uses this notion to produce efficient PIR protocols.\n  In this paper we are interested in designing PIR array codes. We consider the case when we have $m$ servers, with each server storing a fraction $(1/s)$ of the bits of the database; here "},"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":"1607.00235","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-01T13:25:52Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2d900be2d1288abc1ced0ef6afd4a5e5df989a543e79a51774ab0bb9c4fd72ec","abstract_canon_sha256":"5a2bff48791f8cf1607c2eba7dad33681bf81b5eefe98ca02285bf851a0eb66f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:22.829073Z","signature_b64":"5HRhADRZxVJF/y+xwzkawDRCqZ3ToVz8GExFpqC8rB7udbnlwibWrXMql9kkvIi+MZUmM4RzmuOwt7MsWMWYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7629c36779d1e676b8fe34ac6eab3fd9f2f750f667a8aee6510e6cce938983ff","last_reissued_at":"2026-05-18T00:24:22.828606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:22.828606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIR Array Codes with Optimal Virtual Server Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Simon Blackburn, Tuvi Etzion","submitted_at":"2016-07-01T13:25:52Z","abstract_excerpt":"There has been much recent interest in Private information Retrieval (PIR) in models where a database is stored across several servers using coding techniques from distributed storage, rather than being simply replicated. In particular, a recent breakthrough result of Fazelli, Vardy and Yaakobi introduces the notion of a PIR code and a PIR array code, and uses this notion to produce efficient PIR protocols.\n  In this paper we are interested in designing PIR array codes. We consider the case when we have $m$ servers, with each server storing a fraction $(1/s)$ of the bits of the database; here "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00235","kind":"arxiv","version":6},"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":"1607.00235","created_at":"2026-05-18T00:24:22.828671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00235v6","created_at":"2026-05-18T00:24:22.828671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00235","created_at":"2026-05-18T00:24:22.828671+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYU4GZ3Z2HTH","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYU4GZ3Z2HTHNOH6","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYU4GZ3Z","created_at":"2026-05-18T12:30:36.002864+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/OYU4GZ3Z2HTHNOH6GSWG5KZ73H","json":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H.json","graph_json":"https://pith.science/api/pith-number/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/graph.json","events_json":"https://pith.science/api/pith-number/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/events.json","paper":"https://pith.science/paper/OYU4GZ3Z"},"agent_actions":{"view_html":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H","download_json":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H.json","view_paper":"https://pith.science/paper/OYU4GZ3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00235&json=true","fetch_graph":"https://pith.science/api/pith-number/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/graph.json","fetch_events":"https://pith.science/api/pith-number/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/action/storage_attestation","attest_author":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/action/author_attestation","sign_citation":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/action/citation_signature","submit_replication":"https://pith.science/pith/OYU4GZ3Z2HTHNOH6GSWG5KZ73H/action/replication_record"}},"created_at":"2026-05-18T00:24:22.828671+00:00","updated_at":"2026-05-18T00:24:22.828671+00:00"}