{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7J223DN2643F6UHHLPNZHSPCD5","short_pith_number":"pith:7J223DN2","schema_version":"1.0","canonical_sha256":"fa75ad8dbaf7365f50e75bdb93c9e21f628efc5b10c2d4d93eac5698ccadd442","source":{"kind":"arxiv","id":"1812.01566","version":2},"attestation_state":"computed","paper":{"title":"Private Information Retrieval in Graph Based Replication Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Itzhak Tamo, Netanel Raviv","submitted_at":"2018-12-04T18:13:26Z","abstract_excerpt":"In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called $t$-private if the identity of the file remains concealed even if $t$ of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving erasure robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval "},"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":"1812.01566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-12-04T18:13:26Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"cd437e117e0345c0d91753c1731136e7a4c28c0e7236f687c9a5d072a85c082d","abstract_canon_sha256":"8188c0c1aada3decdc8ba0a6869379d7d33f228b34d18d05be7bad2b320154d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:03.799585Z","signature_b64":"FRmFFou0cKOdxj91rBqLC+mA7J4AJkWQ2+cF3V9/9KinKP6T/qo141gYvOtBv+TNUdSEfhiTDX2th4jsM+ElBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa75ad8dbaf7365f50e75bdb93c9e21f628efc5b10c2d4d93eac5698ccadd442","last_reissued_at":"2026-05-17T23:52:03.799133Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:03.799133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval in Graph Based Replication Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Itzhak Tamo, Netanel Raviv","submitted_at":"2018-12-04T18:13:26Z","abstract_excerpt":"In a Private Information Retrieval (PIR) protocol, a user can download a file from a database without revealing the identity of the file to each individual server. A PIR protocol is called $t$-private if the identity of the file remains concealed even if $t$ of the servers collude. Graph based replication is a simple technique, which is prevalent in both theory and practice, for achieving erasure robustness in storage systems. In this technique each file is replicated on two or more storage servers, giving rise to a (hyper-)graph structure. In this paper we study private information retrieval "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01566","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":"1812.01566","created_at":"2026-05-17T23:52:03.799207+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01566v2","created_at":"2026-05-17T23:52:03.799207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01566","created_at":"2026-05-17T23:52:03.799207+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J223DN2643F","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J223DN2643F6UHH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J223DN2","created_at":"2026-05-18T12:32:11.075285+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/7J223DN2643F6UHHLPNZHSPCD5","json":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5.json","graph_json":"https://pith.science/api/pith-number/7J223DN2643F6UHHLPNZHSPCD5/graph.json","events_json":"https://pith.science/api/pith-number/7J223DN2643F6UHHLPNZHSPCD5/events.json","paper":"https://pith.science/paper/7J223DN2"},"agent_actions":{"view_html":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5","download_json":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5.json","view_paper":"https://pith.science/paper/7J223DN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01566&json=true","fetch_graph":"https://pith.science/api/pith-number/7J223DN2643F6UHHLPNZHSPCD5/graph.json","fetch_events":"https://pith.science/api/pith-number/7J223DN2643F6UHHLPNZHSPCD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5/action/storage_attestation","attest_author":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5/action/author_attestation","sign_citation":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5/action/citation_signature","submit_replication":"https://pith.science/pith/7J223DN2643F6UHHLPNZHSPCD5/action/replication_record"}},"created_at":"2026-05-17T23:52:03.799207+00:00","updated_at":"2026-05-17T23:52:03.799207+00:00"}