{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IRB4EBZRN5KFNI46ISCI7PDQKK","short_pith_number":"pith:IRB4EBZR","schema_version":"1.0","canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","source":{"kind":"arxiv","id":"1901.09248","version":1},"attestation_state":"computed","paper":{"title":"Capacity of Single-Server Single-Message Private Information Retrieval with Private 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, Fatemeh Kazemi","submitted_at":"2019-01-26T17:20:21Z","abstract_excerpt":"We study the problem of single-server single-message Private Information Retrieval with Private Coded Side Information (PIR-PCSI). In this problem, there is a server that stores a database, and a user who knows a random linear combination of a random subset of messages in the database. The number of messages contributing to the user's side information is known to the server a priori, whereas their indices and coefficients are unknown to the server a priori. The user wants to retrieve a message from the server (with minimum download cost), while protecting the identities of both the demand and "},"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.09248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-26T17:20:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f29590a91d4041bf6be9cda197ebc34bb08c803e0a22d207a87e2ec36ed38ea","abstract_canon_sha256":"547ce6ef780ca937e2c335c8abb32fa2962588762f688b3add4a0d909f83f939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:26.504580Z","signature_b64":"zNJtNbwjG/L+NZt7stA8D3yr0xwSYv+W1yK4zQvI3+nD4BR2jIX2Y/MrTee0MCjF7cDB2ZMgZQJvdT5GU4H+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","last_reissued_at":"2026-05-17T23:55:26.503869Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:26.503869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity of Single-Server Single-Message Private Information Retrieval with Private 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, Fatemeh Kazemi","submitted_at":"2019-01-26T17:20:21Z","abstract_excerpt":"We study the problem of single-server single-message Private Information Retrieval with Private Coded Side Information (PIR-PCSI). In this problem, there is a server that stores a database, and a user who knows a random linear combination of a random subset of messages in the database. The number of messages contributing to the user's side information is known to the server a priori, whereas their indices and coefficients are unknown to the server a priori. The user wants to retrieve a message from the server (with minimum download cost), while protecting the identities of both the demand and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09248","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.09248","created_at":"2026-05-17T23:55:26.503989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.09248v1","created_at":"2026-05-17T23:55:26.503989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09248","created_at":"2026-05-17T23:55:26.503989+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRB4EBZRN5KF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRB4EBZRN5KFNI46","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRB4EBZR","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.09259","citing_title":"Multi-Server Private Information Retrieval with Coded Side Information","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"1906.11278","citing_title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK","json":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK.json","graph_json":"https://pith.science/api/pith-number/IRB4EBZRN5KFNI46ISCI7PDQKK/graph.json","events_json":"https://pith.science/api/pith-number/IRB4EBZRN5KFNI46ISCI7PDQKK/events.json","paper":"https://pith.science/paper/IRB4EBZR"},"agent_actions":{"view_html":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK","download_json":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK.json","view_paper":"https://pith.science/paper/IRB4EBZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.09248&json=true","fetch_graph":"https://pith.science/api/pith-number/IRB4EBZRN5KFNI46ISCI7PDQKK/graph.json","fetch_events":"https://pith.science/api/pith-number/IRB4EBZRN5KFNI46ISCI7PDQKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/action/storage_attestation","attest_author":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/action/author_attestation","sign_citation":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/action/citation_signature","submit_replication":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/action/replication_record"}},"created_at":"2026-05-17T23:55:26.503989+00:00","updated_at":"2026-05-17T23:55:26.503989+00:00"}