{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Q5PBWN5WNAJ6ELBY2LMHWVRWVR","short_pith_number":"pith:Q5PBWN5W","schema_version":"1.0","canonical_sha256":"875e1b37b66813e22c38d2d87b5636ac4b4797d3a720b06c4a1bb59e97dce5c6","source":{"kind":"arxiv","id":"1609.09167","version":1},"attestation_state":"computed","paper":{"title":"On private information retrieval array codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Hengjia Wei, Xin Wang, Yiwei Zhang","submitted_at":"2016-09-29T01:40:05Z","abstract_excerpt":"Given a database, the private information retrieval (PIR) protocol allows a user to make queries to several servers and retrieve a certain item of the database via the feedbacks, without revealing the privacy of the specific item to any single server. Classical models of PIR protocols require that each server stores a whole copy of the database. Recently new PIR models are proposed with coding techniques arising from distributed storage system. In these new models each server only stores a fraction $1/s$ of the whole database, where $s>1$ is a given rational number. PIR array codes are recentl"},"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.09167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-29T01:40:05Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b0f37c6f7f3e67f7b09fc3f22fbb5df364f1e1f8ad12148950fa5190474b365c","abstract_canon_sha256":"0e97a23cdbc7ac4f2f2df4c5281364cc0a9aefb79a7b3a02295132c9d3fe52d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:38.619304Z","signature_b64":"cN19qALdNUPr8E3hyNeDCSZKxh+4jlqkUdtNkqWlg3xCbxD/+YC+3EF1x1DFrunGEpl6OsoZgWjEQERkyZQHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"875e1b37b66813e22c38d2d87b5636ac4b4797d3a720b06c4a1bb59e97dce5c6","last_reissued_at":"2026-05-18T01:03:38.618627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:38.618627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On private information retrieval array codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Gennian Ge, Hengjia Wei, Xin Wang, Yiwei Zhang","submitted_at":"2016-09-29T01:40:05Z","abstract_excerpt":"Given a database, the private information retrieval (PIR) protocol allows a user to make queries to several servers and retrieve a certain item of the database via the feedbacks, without revealing the privacy of the specific item to any single server. Classical models of PIR protocols require that each server stores a whole copy of the database. Recently new PIR models are proposed with coding techniques arising from distributed storage system. In these new models each server only stores a fraction $1/s$ of the whole database, where $s>1$ is a given rational number. PIR array codes are recentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09167","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.09167","created_at":"2026-05-18T01:03:38.618735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.09167v1","created_at":"2026-05-18T01:03:38.618735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09167","created_at":"2026-05-18T01:03:38.618735+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5PBWN5WNAJ6","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5PBWN5WNAJ6ELBY","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5PBWN5W","created_at":"2026-05-18T12:30:39.010887+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/Q5PBWN5WNAJ6ELBY2LMHWVRWVR","json":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR.json","graph_json":"https://pith.science/api/pith-number/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/graph.json","events_json":"https://pith.science/api/pith-number/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/events.json","paper":"https://pith.science/paper/Q5PBWN5W"},"agent_actions":{"view_html":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR","download_json":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR.json","view_paper":"https://pith.science/paper/Q5PBWN5W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.09167&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/action/storage_attestation","attest_author":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/action/author_attestation","sign_citation":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/action/citation_signature","submit_replication":"https://pith.science/pith/Q5PBWN5WNAJ6ELBY2LMHWVRWVR/action/replication_record"}},"created_at":"2026-05-18T01:03:38.618735+00:00","updated_at":"2026-05-18T01:03:38.618735+00:00"}