{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQM55XMQIKKUCW2M6FI23SBFT3","short_pith_number":"pith:RQM55XMQ","schema_version":"1.0","canonical_sha256":"8c19dedd904295415b4cf151adc8259eebeb4b871ce58972dd0872dece99bfef","source":{"kind":"arxiv","id":"1605.01869","version":2},"attestation_state":"computed","paper":{"title":"Lower Bound on the Redundancy of PIR Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Sankeerth Rao","submitted_at":"2016-05-06T09:23:53Z","abstract_excerpt":"We prove that the redundancy of a $k$-server PIR code of dimension $s$ is $\\Omega(\\sqrt{s})$ for all $k \\ge 3$. This coincides with a known upper bound of $O(\\sqrt{s})$ on the redundancy of PIR codes. Moreover, for $k=3$ and $k = 4$, we determine the lowest possible redundancy of $k$-server PIR codes exactly. Similar results were proved independently by Mary Wootters using a different method."},"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":"1605.01869","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-06T09:23:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4c3bae185f3d5344fb63042721cf275a9e67640616b571116a36eecbeea2f016","abstract_canon_sha256":"5b61d97bd198a7525ec57dbd6d56373c49676c4f6460ce8bc76ad400168e0a19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:52.293463Z","signature_b64":"lN7/VEZFCf0krG2aif5huz4w+YwBtHIiGu1/aB3a7/+CEN63BFc8wDwEiHj4f+eqQ3iYQVMQiVold8qjQWrdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c19dedd904295415b4cf151adc8259eebeb4b871ce58972dd0872dece99bfef","last_reissued_at":"2026-05-18T00:49:52.293027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:52.293027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound on the Redundancy of PIR Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vardy, Sankeerth Rao","submitted_at":"2016-05-06T09:23:53Z","abstract_excerpt":"We prove that the redundancy of a $k$-server PIR code of dimension $s$ is $\\Omega(\\sqrt{s})$ for all $k \\ge 3$. This coincides with a known upper bound of $O(\\sqrt{s})$ on the redundancy of PIR codes. Moreover, for $k=3$ and $k = 4$, we determine the lowest possible redundancy of $k$-server PIR codes exactly. Similar results were proved independently by Mary Wootters using a different method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01869","kind":"arxiv","version":2},"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":"1605.01869","created_at":"2026-05-18T00:49:52.293102+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01869v2","created_at":"2026-05-18T00:49:52.293102+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01869","created_at":"2026-05-18T00:49:52.293102+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQM55XMQIKKU","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQM55XMQIKKUCW2M","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQM55XMQ","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.04041","citing_title":"Serving Every Symbol: All-Symbol PIR and Batch Codes","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3","json":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3.json","graph_json":"https://pith.science/api/pith-number/RQM55XMQIKKUCW2M6FI23SBFT3/graph.json","events_json":"https://pith.science/api/pith-number/RQM55XMQIKKUCW2M6FI23SBFT3/events.json","paper":"https://pith.science/paper/RQM55XMQ"},"agent_actions":{"view_html":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3","download_json":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3.json","view_paper":"https://pith.science/paper/RQM55XMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01869&json=true","fetch_graph":"https://pith.science/api/pith-number/RQM55XMQIKKUCW2M6FI23SBFT3/graph.json","fetch_events":"https://pith.science/api/pith-number/RQM55XMQIKKUCW2M6FI23SBFT3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3/action/storage_attestation","attest_author":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3/action/author_attestation","sign_citation":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3/action/citation_signature","submit_replication":"https://pith.science/pith/RQM55XMQIKKUCW2M6FI23SBFT3/action/replication_record"}},"created_at":"2026-05-18T00:49:52.293102+00:00","updated_at":"2026-05-18T00:49:52.293102+00:00"}