{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ULQZLDAK2VMDG7ZZGPPG55UTY7","short_pith_number":"pith:ULQZLDAK","schema_version":"1.0","canonical_sha256":"a2e1958c0ad558337f3933de6ef693c7f6240d1ab00bfebe1f884e1511a4623e","source":{"kind":"arxiv","id":"1707.03495","version":3},"attestation_state":"computed","paper":{"title":"Lengthening and Extending Binary Private Information Retrieval Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes, Hsuan-Yin Lin","submitted_at":"2017-07-11T23:28:55Z","abstract_excerpt":"It was recently shown by Fazeli et al. that the storage overhead of a traditional $t$-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a $t$-server PIR code. In this work, we show that a family of $t$-server PIR codes (with increasing dimensions and blocklengths) can be constructed from an existing $t$-server PIR code through lengthening by a single information symbol and code extension by at most $\\bigl\\lceil t/2\\bigr\\rceil$ code symbols. Furthermore, by extending a code construction notion from Steiner systems by Fazeli et al., we obtain a"},"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":"1707.03495","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-11T23:28:55Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8defccabcf593e5564a33297cd10832511ec86b22e8c55a44c79d8e4a84e732a","abstract_canon_sha256":"b7c25e7a302b4c043498ae5a1bd06779c114f98ffc7d66b6986d4717066c4fe9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:18.037291Z","signature_b64":"GY+uL+7aiJ0gLvx1b8GOOoaG+HzxIgzPCSLAD7PmuZUwDRp0SerhOC4CVgkdk8uhgPuQs04JOXPXJCO4PawUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2e1958c0ad558337f3933de6ef693c7f6240d1ab00bfebe1f884e1511a4623e","last_reissued_at":"2026-05-18T00:25:18.036735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:18.036735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lengthening and Extending Binary Private Information Retrieval Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eirik Rosnes, Hsuan-Yin Lin","submitted_at":"2017-07-11T23:28:55Z","abstract_excerpt":"It was recently shown by Fazeli et al. that the storage overhead of a traditional $t$-server private information retrieval (PIR) protocol can be significantly reduced using the concept of a $t$-server PIR code. In this work, we show that a family of $t$-server PIR codes (with increasing dimensions and blocklengths) can be constructed from an existing $t$-server PIR code through lengthening by a single information symbol and code extension by at most $\\bigl\\lceil t/2\\bigr\\rceil$ code symbols. Furthermore, by extending a code construction notion from Steiner systems by Fazeli et al., we obtain a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.03495","kind":"arxiv","version":3},"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":"1707.03495","created_at":"2026-05-18T00:25:18.036823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.03495v3","created_at":"2026-05-18T00:25:18.036823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.03495","created_at":"2026-05-18T00:25:18.036823+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULQZLDAK2VMD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULQZLDAK2VMDG7ZZ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULQZLDAK","created_at":"2026-05-18T12:31:46.661854+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/ULQZLDAK2VMDG7ZZGPPG55UTY7","json":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7.json","graph_json":"https://pith.science/api/pith-number/ULQZLDAK2VMDG7ZZGPPG55UTY7/graph.json","events_json":"https://pith.science/api/pith-number/ULQZLDAK2VMDG7ZZGPPG55UTY7/events.json","paper":"https://pith.science/paper/ULQZLDAK"},"agent_actions":{"view_html":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7","download_json":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7.json","view_paper":"https://pith.science/paper/ULQZLDAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.03495&json=true","fetch_graph":"https://pith.science/api/pith-number/ULQZLDAK2VMDG7ZZGPPG55UTY7/graph.json","fetch_events":"https://pith.science/api/pith-number/ULQZLDAK2VMDG7ZZGPPG55UTY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7/action/storage_attestation","attest_author":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7/action/author_attestation","sign_citation":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7/action/citation_signature","submit_replication":"https://pith.science/pith/ULQZLDAK2VMDG7ZZGPPG55UTY7/action/replication_record"}},"created_at":"2026-05-18T00:25:18.036823+00:00","updated_at":"2026-05-18T00:25:18.036823+00:00"}