{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4MJKV44AVP6I6CPU2PDNOC6PTY","short_pith_number":"pith:4MJKV44A","schema_version":"1.0","canonical_sha256":"e312aaf380abfc8f09f4d3c6d70bcf9e0eeb9d3cc7a37219308fff053aa8f750","source":{"kind":"arxiv","id":"1906.09259","version":1},"attestation_state":"computed","paper":{"title":"Multi-Server Private Information Retrieval with Coded Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi","submitted_at":"2019-06-21T17:57:54Z","abstract_excerpt":"In this paper, we study the multi-server setting of the \\emph{Private Information Retrieval with Coded Side Information (PIR-CSI)} problem. In this problem, there are $K$ messages replicated across $N$ servers, and there is a user who wishes to download one message from the servers without revealing any information to any server about the identity of the requested message. The user has a side information which is a linear combination of a subset of $M$ messages in the database. The parameter $M$ is known to all servers in advance, whereas the indices and the coefficients of the messages in the"},"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":"1906.09259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-21T17:57:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b19f88a1225aeacd984e8d18c736d648ca731f391ff1c9bf109f2c13cbfdcb14","abstract_canon_sha256":"8f2750d82ef8237942a9096131643d158ca6f9b6844d2bd37b1fcb9753cb998d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:44.000677Z","signature_b64":"PgJfGCzHO87DQZV1JcMImjuDMOLpQMhF24KF0plfBQ3hXdEE+fGb2ir7f+fKHQq7lXnmRQaTp2OpjGl1cJonBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e312aaf380abfc8f09f4d3c6d70bcf9e0eeb9d3cc7a37219308fff053aa8f750","last_reissued_at":"2026-05-17T23:42:43.999921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:43.999921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Server Private Information Retrieval with Coded Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi","submitted_at":"2019-06-21T17:57:54Z","abstract_excerpt":"In this paper, we study the multi-server setting of the \\emph{Private Information Retrieval with Coded Side Information (PIR-CSI)} problem. In this problem, there are $K$ messages replicated across $N$ servers, and there is a user who wishes to download one message from the servers without revealing any information to any server about the identity of the requested message. The user has a side information which is a linear combination of a subset of $M$ messages in the database. The parameter $M$ is known to all servers in advance, whereas the indices and the coefficients of the messages in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09259","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":"1906.09259","created_at":"2026-05-17T23:42:44.000043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09259v1","created_at":"2026-05-17T23:42:44.000043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09259","created_at":"2026-05-17T23:42:44.000043+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MJKV44AVP6I","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MJKV44AVP6I6CPU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MJKV44A","created_at":"2026-05-18T12:33:10.108867+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/4MJKV44AVP6I6CPU2PDNOC6PTY","json":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY.json","graph_json":"https://pith.science/api/pith-number/4MJKV44AVP6I6CPU2PDNOC6PTY/graph.json","events_json":"https://pith.science/api/pith-number/4MJKV44AVP6I6CPU2PDNOC6PTY/events.json","paper":"https://pith.science/paper/4MJKV44A"},"agent_actions":{"view_html":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY","download_json":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY.json","view_paper":"https://pith.science/paper/4MJKV44A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09259&json=true","fetch_graph":"https://pith.science/api/pith-number/4MJKV44AVP6I6CPU2PDNOC6PTY/graph.json","fetch_events":"https://pith.science/api/pith-number/4MJKV44AVP6I6CPU2PDNOC6PTY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY/action/storage_attestation","attest_author":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY/action/author_attestation","sign_citation":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY/action/citation_signature","submit_replication":"https://pith.science/pith/4MJKV44AVP6I6CPU2PDNOC6PTY/action/replication_record"}},"created_at":"2026-05-17T23:42:44.000043+00:00","updated_at":"2026-05-17T23:42:44.000043+00:00"}