{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PAW2YGKK7HABU4C4DGP63MI4PD","short_pith_number":"pith:PAW2YGKK","canonical_record":{"source":{"id":"1906.11278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T18:12:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"740a6c93d1cd7795bde427ed82707b0df3772aa70899076e3af13c5a3c0c5077","abstract_canon_sha256":"901fb3209a5c8999aa8c553803598fe24c4c5204b8e27019d8153ae8eab5caeb"},"schema_version":"1.0"},"canonical_sha256":"782dac194af9c01a705c199fedb11c78c8667b3d49415b03265732c3f1cb0f30","source":{"kind":"arxiv","id":"1906.11278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11278","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11278v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11278","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAW2YGKK7HAB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PAW2YGKK7HABU4C4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PAW2YGKK","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PAW2YGKK7HABU4C4DGP63MI4PD","target":"record","payload":{"canonical_record":{"source":{"id":"1906.11278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T18:12:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"740a6c93d1cd7795bde427ed82707b0df3772aa70899076e3af13c5a3c0c5077","abstract_canon_sha256":"901fb3209a5c8999aa8c553803598fe24c4c5204b8e27019d8153ae8eab5caeb"},"schema_version":"1.0"},"canonical_sha256":"782dac194af9c01a705c199fedb11c78c8667b3d49415b03265732c3f1cb0f30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.605556Z","signature_b64":"I3PPdkm0GQAKgrFMwt9jBkF5RJHb6euemCc2MgtVkZT3tHrLzw03EA+GW0yzExsao3DTHyC0YpTOTRycGIDsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"782dac194af9c01a705c199fedb11c78c8667b3d49415b03265732c3f1cb0f30","last_reissued_at":"2026-05-17T23:42:07.604810Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.604810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.11278","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1y6TWpPaFAZs4kjgU0k1M0AfSZVPdDXQv86qp5MVArXSYVbv0+Tkk7KBFVGkaqjAa6qYUf77S8GlANWuFXZmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:39.104782Z"},"content_sha256":"dde00c83aae87ad6e97cfda9f2dd0c5f8c9d23a156cf36225311073a9fd3561d","schema_version":"1.0","event_id":"sha256:dde00c83aae87ad6e97cfda9f2dd0c5f8c9d23a156cf36225311073a9fd3561d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PAW2YGKK7HABU4C4DGP63MI4PD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case","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-26T18:12:01Z","abstract_excerpt":"In this paper, we consider the multi-server setting of Private Information Retrieval with Private Coded Side Information (PIR-PCSI) problem. In this problem, there is a database of $K$ messages whose copies are replicated across $N$ servers, and there is a user who knows a random linear combination of a random subset of $M$ messages in the database as side information. The user wishes to download one message from the servers, while protecting the identities of both the demand message and the messages forming the side information. We assume that the servers know the number of messages forming t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11278","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Ymv8Q3hT7NRtv+TWPPlT6125txmjBQqkz07vFezT8c+O16muH3K2jfcEl7w9tn9R+3Ex7XW4iQAz7zn6NuxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:39.105140Z"},"content_sha256":"c8f10183c8638ad1f3fa5cfb570ab8b1cb382ac9178e3426e0b5d5a464437732","schema_version":"1.0","event_id":"sha256:c8f10183c8638ad1f3fa5cfb570ab8b1cb382ac9178e3426e0b5d5a464437732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAW2YGKK7HABU4C4DGP63MI4PD/bundle.json","state_url":"https://pith.science/pith/PAW2YGKK7HABU4C4DGP63MI4PD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAW2YGKK7HABU4C4DGP63MI4PD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T16:53:39Z","links":{"resolver":"https://pith.science/pith/PAW2YGKK7HABU4C4DGP63MI4PD","bundle":"https://pith.science/pith/PAW2YGKK7HABU4C4DGP63MI4PD/bundle.json","state":"https://pith.science/pith/PAW2YGKK7HABU4C4DGP63MI4PD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAW2YGKK7HABU4C4DGP63MI4PD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PAW2YGKK7HABU4C4DGP63MI4PD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"901fb3209a5c8999aa8c553803598fe24c4c5204b8e27019d8153ae8eab5caeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T18:12:01Z","title_canon_sha256":"740a6c93d1cd7795bde427ed82707b0df3772aa70899076e3af13c5a3c0c5077"},"schema_version":"1.0","source":{"id":"1906.11278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.11278","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1906.11278v1","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11278","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"PAW2YGKK7HAB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PAW2YGKK7HABU4C4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PAW2YGKK","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:c8f10183c8638ad1f3fa5cfb570ab8b1cb382ac9178e3426e0b5d5a464437732","target":"graph","created_at":"2026-05-17T23:42:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we consider the multi-server setting of Private Information Retrieval with Private Coded Side Information (PIR-PCSI) problem. In this problem, there is a database of $K$ messages whose copies are replicated across $N$ servers, and there is a user who knows a random linear combination of a random subset of $M$ messages in the database as side information. The user wishes to download one message from the servers, while protecting the identities of both the demand message and the messages forming the side information. We assume that the servers know the number of messages forming t","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Esmaeil Karimi, Fatemeh Kazemi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T18:12:01Z","title":"Private Information Retrieval with Private Coded Side Information: The Multi-Server Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11278","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dde00c83aae87ad6e97cfda9f2dd0c5f8c9d23a156cf36225311073a9fd3561d","target":"record","created_at":"2026-05-17T23:42:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"901fb3209a5c8999aa8c553803598fe24c4c5204b8e27019d8153ae8eab5caeb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T18:12:01Z","title_canon_sha256":"740a6c93d1cd7795bde427ed82707b0df3772aa70899076e3af13c5a3c0c5077"},"schema_version":"1.0","source":{"id":"1906.11278","kind":"arxiv","version":1}},"canonical_sha256":"782dac194af9c01a705c199fedb11c78c8667b3d49415b03265732c3f1cb0f30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"782dac194af9c01a705c199fedb11c78c8667b3d49415b03265732c3f1cb0f30","first_computed_at":"2026-05-17T23:42:07.604810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:07.604810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I3PPdkm0GQAKgrFMwt9jBkF5RJHb6euemCc2MgtVkZT3tHrLzw03EA+GW0yzExsao3DTHyC0YpTOTRycGIDsBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:07.605556Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.11278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dde00c83aae87ad6e97cfda9f2dd0c5f8c9d23a156cf36225311073a9fd3561d","sha256:c8f10183c8638ad1f3fa5cfb570ab8b1cb382ac9178e3426e0b5d5a464437732"],"state_sha256":"2540a0c14cfcf2405df7ecde3bb416b43654d3d1f961f4baa238808c96ff95d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3fVI70U+Pr63PhW0vpIR/INMGnRutlSgngXIvHPybrdUfd43NAamtAj3u+H88KfAfc6qKZPBXPNzYaF745vAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:53:39.107105Z","bundle_sha256":"71536b18c18a84876d8b6a024accbce1be408abbe1731ccac01689af7c917a75"}}