{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LWPLKXJ3T35QVMA566LLTG7WE7","short_pith_number":"pith:LWPLKXJ3","schema_version":"1.0","canonical_sha256":"5d9eb55d3b9efb0ab01df796b99bf627d91763272d3192ae6d05238fb6be757c","source":{"kind":"arxiv","id":"1810.08941","version":2},"attestation_state":"computed","paper":{"title":"Private Information Retrieval over Random Linear Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Camilla Hollanti, Razane Tajeddine","submitted_at":"2018-10-21T13:30:39Z","abstract_excerpt":"In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the multi-terminal destination of the network from the user's perspective, is encoded by a maximum rank distance (MRD) code to store the data on these multiple servers. A private information retrieval (PIR) scheme ensures that a user can request a file without revealing any information on which file is being requested to any of the servers. In this paper, a novel PIR scheme is proposed, allowing the user to recover a file"},"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":"1810.08941","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-21T13:30:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28935166396079831936f71e75b6d16484044f3404e0e9de81bd9d882f5b798d","abstract_canon_sha256":"25b739864ab6e84512eb44f7f353e20d12e7356937d39f8749f271260b54c6eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:48.809764Z","signature_b64":"8elyxl5NlOUtI6h5UYFivIqT+dYG7vqalLF1f4K4aPkyuZffqwZmH0CgMryfEY5aTNtU0wC/mMS/JWLgPjYZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9eb55d3b9efb0ab01df796b99bf627d91763272d3192ae6d05238fb6be757c","last_reissued_at":"2026-05-17T23:42:48.809235Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:48.809235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Private Information Retrieval over Random Linear Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Antonia Wachter-Zeh, Camilla Hollanti, Razane Tajeddine","submitted_at":"2018-10-21T13:30:39Z","abstract_excerpt":"In this paper, the problem of providing privacy to users requesting data over a network from a distributed storage system (DSS) is considered. The DSS, which is considered as the multi-terminal destination of the network from the user's perspective, is encoded by a maximum rank distance (MRD) code to store the data on these multiple servers. A private information retrieval (PIR) scheme ensures that a user can request a file without revealing any information on which file is being requested to any of the servers. In this paper, a novel PIR scheme is proposed, allowing the user to recover a file"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08941","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":"1810.08941","created_at":"2026-05-17T23:42:48.809306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08941v2","created_at":"2026-05-17T23:42:48.809306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08941","created_at":"2026-05-17T23:42:48.809306+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWPLKXJ3T35Q","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWPLKXJ3T35QVMA5","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWPLKXJ3","created_at":"2026-05-18T12:32:37.024351+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/LWPLKXJ3T35QVMA566LLTG7WE7","json":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7.json","graph_json":"https://pith.science/api/pith-number/LWPLKXJ3T35QVMA566LLTG7WE7/graph.json","events_json":"https://pith.science/api/pith-number/LWPLKXJ3T35QVMA566LLTG7WE7/events.json","paper":"https://pith.science/paper/LWPLKXJ3"},"agent_actions":{"view_html":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7","download_json":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7.json","view_paper":"https://pith.science/paper/LWPLKXJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08941&json=true","fetch_graph":"https://pith.science/api/pith-number/LWPLKXJ3T35QVMA566LLTG7WE7/graph.json","fetch_events":"https://pith.science/api/pith-number/LWPLKXJ3T35QVMA566LLTG7WE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7/action/storage_attestation","attest_author":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7/action/author_attestation","sign_citation":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7/action/citation_signature","submit_replication":"https://pith.science/pith/LWPLKXJ3T35QVMA566LLTG7WE7/action/replication_record"}},"created_at":"2026-05-17T23:42:48.809306+00:00","updated_at":"2026-05-17T23:42:48.809306+00:00"}