{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EPUJAAHNRSZIXPUFH2ZE3L6JP5","short_pith_number":"pith:EPUJAAHN","schema_version":"1.0","canonical_sha256":"23e89000ed8cb28bbe853eb24dafc97f6ce40f9bc83ae70581f82fdfbb7ed29e","source":{"kind":"arxiv","id":"1901.00004","version":1},"attestation_state":"computed","paper":{"title":"Private Information Retrieval from Non-Replicated Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2018-12-31T18:52:00Z","abstract_excerpt":"We consider the problem of private information retrieval (PIR) of a single message out of $K$ messages from $N$ non-colluding and non-replicated databases. Different from the majority of the existing literature, which considers the case of replicated databases where all databases store the same content in the form of all $K$ messages, here, we consider the case of non-replicated databases under a special non-replication structure where each database stores $M$ out of $K$ messages and each message is stored across $R$ different databases. This generates an $R$-regular graph structure for the st"},"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":"1901.00004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-31T18:52:00Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"ad31a424830628e88a92e9d3aea9b5f5a1dc168a0dfcfea573ec374e40ad33ee","abstract_canon_sha256":"6e47f01248a300ce69a7d3b71f933119d585942f006ac63307798a11a88bb5ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.096465Z","signature_b64":"k84UTSkr/8X/PNIiMNySjpIfdUIb1SlEG58Kc0+rWiIXMyScykXM6hqXDw+Ho2veHrF4A1luQJtAhWsDABaiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e89000ed8cb28bbe853eb24dafc97f6ce40f9bc83ae70581f82fdfbb7ed29e","last_reissued_at":"2026-05-17T23:57:07.096086Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.096086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval from Non-Replicated Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Karim Banawan, Sennur Ulukus","submitted_at":"2018-12-31T18:52:00Z","abstract_excerpt":"We consider the problem of private information retrieval (PIR) of a single message out of $K$ messages from $N$ non-colluding and non-replicated databases. Different from the majority of the existing literature, which considers the case of replicated databases where all databases store the same content in the form of all $K$ messages, here, we consider the case of non-replicated databases under a special non-replication structure where each database stores $M$ out of $K$ messages and each message is stored across $R$ different databases. This generates an $R$-regular graph structure for the st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00004","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":"1901.00004","created_at":"2026-05-17T23:57:07.096150+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.00004v1","created_at":"2026-05-17T23:57:07.096150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00004","created_at":"2026-05-17T23:57:07.096150+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPUJAAHNRSZI","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPUJAAHNRSZIXPUF","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPUJAAHN","created_at":"2026-05-18T12:32:22.470017+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/EPUJAAHNRSZIXPUFH2ZE3L6JP5","json":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5.json","graph_json":"https://pith.science/api/pith-number/EPUJAAHNRSZIXPUFH2ZE3L6JP5/graph.json","events_json":"https://pith.science/api/pith-number/EPUJAAHNRSZIXPUFH2ZE3L6JP5/events.json","paper":"https://pith.science/paper/EPUJAAHN"},"agent_actions":{"view_html":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5","download_json":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5.json","view_paper":"https://pith.science/paper/EPUJAAHN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.00004&json=true","fetch_graph":"https://pith.science/api/pith-number/EPUJAAHNRSZIXPUFH2ZE3L6JP5/graph.json","fetch_events":"https://pith.science/api/pith-number/EPUJAAHNRSZIXPUFH2ZE3L6JP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5/action/storage_attestation","attest_author":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5/action/author_attestation","sign_citation":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5/action/citation_signature","submit_replication":"https://pith.science/pith/EPUJAAHNRSZIXPUFH2ZE3L6JP5/action/replication_record"}},"created_at":"2026-05-17T23:57:07.096150+00:00","updated_at":"2026-05-17T23:57:07.096150+00:00"}