{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CIYOSNFDINMVAKRDJ4I3S2ULN3","short_pith_number":"pith:CIYOSNFD","schema_version":"1.0","canonical_sha256":"1230e934a34359502a234f11b96a8b6ede5b7e0d1b85fbb04edff585d6f099c2","source":{"kind":"arxiv","id":"1811.02898","version":2},"attestation_state":"computed","paper":{"title":"Private Information Retrieval Schemes with Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Julien Lavauzelle, Ragnar Freij-Hollanti, Razane Tajeddine","submitted_at":"2018-11-07T14:15:39Z","abstract_excerpt":"A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes have been proposed for several kinds of storage systems, including replicated and MDS-coded data. In this paper, the problem of constructing a PIR scheme on regenerating codes is considered.\n  A regenerating code is a storage code whose codewords are distributed among $n$ nodes, enabling efficient storage of files, as well as low-bandwidth retrieval of files and repair of nodes. In this work, a PIR scheme on regenera"},"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":"1811.02898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-07T14:15:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"259414fb2e871ba5b65bb38b3567b931533f95f6d3559689db7fa2efdb316897","abstract_canon_sha256":"8d5447c939414fe75b2ba0ed56e81ee3467af967c548be58a1816c98c6ff2f97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:55.861782Z","signature_b64":"9aRjvFYwnB+Fyt3JPDdvm4OOWS2pYRDD5dn+gKRKnrG3mXLJfFFC3nLx7N+FXHdzTSimJ6S+C9nehQiHs8rFCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1230e934a34359502a234f11b96a8b6ede5b7e0d1b85fbb04edff585d6f099c2","last_reissued_at":"2026-05-17T23:58:55.861188Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:55.861188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval Schemes with Regenerating Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Camilla Hollanti, Julien Lavauzelle, Ragnar Freij-Hollanti, Razane Tajeddine","submitted_at":"2018-11-07T14:15:39Z","abstract_excerpt":"A private information retrieval (PIR) scheme allows a user to retrieve a file from a database without revealing any information on the file being requested. As of now, PIR schemes have been proposed for several kinds of storage systems, including replicated and MDS-coded data. In this paper, the problem of constructing a PIR scheme on regenerating codes is considered.\n  A regenerating code is a storage code whose codewords are distributed among $n$ nodes, enabling efficient storage of files, as well as low-bandwidth retrieval of files and repair of nodes. In this work, a PIR scheme on regenera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02898","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":"1811.02898","created_at":"2026-05-17T23:58:55.861273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02898v2","created_at":"2026-05-17T23:58:55.861273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02898","created_at":"2026-05-17T23:58:55.861273+00:00"},{"alias_kind":"pith_short_12","alias_value":"CIYOSNFDINMV","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CIYOSNFDINMVAKRD","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CIYOSNFD","created_at":"2026-05-18T12:32:16.446611+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/CIYOSNFDINMVAKRDJ4I3S2ULN3","json":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3.json","graph_json":"https://pith.science/api/pith-number/CIYOSNFDINMVAKRDJ4I3S2ULN3/graph.json","events_json":"https://pith.science/api/pith-number/CIYOSNFDINMVAKRDJ4I3S2ULN3/events.json","paper":"https://pith.science/paper/CIYOSNFD"},"agent_actions":{"view_html":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3","download_json":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3.json","view_paper":"https://pith.science/paper/CIYOSNFD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02898&json=true","fetch_graph":"https://pith.science/api/pith-number/CIYOSNFDINMVAKRDJ4I3S2ULN3/graph.json","fetch_events":"https://pith.science/api/pith-number/CIYOSNFDINMVAKRDJ4I3S2ULN3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3/action/storage_attestation","attest_author":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3/action/author_attestation","sign_citation":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3/action/citation_signature","submit_replication":"https://pith.science/pith/CIYOSNFDINMVAKRDJ4I3S2ULN3/action/replication_record"}},"created_at":"2026-05-17T23:58:55.861273+00:00","updated_at":"2026-05-17T23:58:55.861273+00:00"}