{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IUDQGYUWRRYTUNQZB5RRK22WD3","short_pith_number":"pith:IUDQGYUW","schema_version":"1.0","canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","source":{"kind":"arxiv","id":"1609.07027","version":4},"attestation_state":"computed","paper":{"title":"PIR schemes with small download complexity and low storage requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Maura B. Paterson, Simon R. Blackburn, Tuvi Etzion","submitted_at":"2016-09-22T15:35:46Z","abstract_excerpt":"In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains information about which bit the user is interested in. The aim is to design schemes that minimise communication between the user and the servers. More recently, there have been moves to consider more realistic models where the total storage of the set of servers, or the per server storage, should be minimised (possibly using techniques from distributed storage), an"},"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":"1609.07027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6b9b2fc7634ff0ec8af8b0b5713a84aa553a973827b8b0a428a8ce3af7752099","abstract_canon_sha256":"d590a6ebada0f23d20aef0ae87ee4c86267e97537701165e3a7dcbccaef24d0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.272255Z","signature_b64":"1lVZa9N+WaroW/RSr59aOqEaWPfGcWL4sP2L4R7mOxUfzUBFm0QOi9/SjDqjDCaxb+G+AH8kFzWCIfIYKcIpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","last_reissued_at":"2026-05-17T23:59:18.271633Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.271633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIR schemes with small download complexity and low storage requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Maura B. Paterson, Simon R. Blackburn, Tuvi Etzion","submitted_at":"2016-09-22T15:35:46Z","abstract_excerpt":"In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains information about which bit the user is interested in. The aim is to design schemes that minimise communication between the user and the servers. More recently, there have been moves to consider more realistic models where the total storage of the set of servers, or the per server storage, should be minimised (possibly using techniques from distributed storage), an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07027","kind":"arxiv","version":4},"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":"1609.07027","created_at":"2026-05-17T23:59:18.271748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07027v4","created_at":"2026-05-17T23:59:18.271748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07027","created_at":"2026-05-17T23:59:18.271748+00:00"},{"alias_kind":"pith_short_12","alias_value":"IUDQGYUWRRYT","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IUDQGYUWRRYTUNQZ","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IUDQGYUW","created_at":"2026-05-18T12:30:22.444734+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/IUDQGYUWRRYTUNQZB5RRK22WD3","json":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3.json","graph_json":"https://pith.science/api/pith-number/IUDQGYUWRRYTUNQZB5RRK22WD3/graph.json","events_json":"https://pith.science/api/pith-number/IUDQGYUWRRYTUNQZB5RRK22WD3/events.json","paper":"https://pith.science/paper/IUDQGYUW"},"agent_actions":{"view_html":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3","download_json":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3.json","view_paper":"https://pith.science/paper/IUDQGYUW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07027&json=true","fetch_graph":"https://pith.science/api/pith-number/IUDQGYUWRRYTUNQZB5RRK22WD3/graph.json","fetch_events":"https://pith.science/api/pith-number/IUDQGYUWRRYTUNQZB5RRK22WD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/action/storage_attestation","attest_author":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/action/author_attestation","sign_citation":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/action/citation_signature","submit_replication":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/action/replication_record"}},"created_at":"2026-05-17T23:59:18.271748+00:00","updated_at":"2026-05-17T23:59:18.271748+00:00"}