{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IRB4EBZRN5KFNI46ISCI7PDQKK","short_pith_number":"pith:IRB4EBZR","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"},"canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","source":{"kind":"arxiv","id":"1901.09248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09248","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09248v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09248","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"IRB4EBZRN5KF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IRB4EBZRN5KFNI46","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IRB4EBZR","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IRB4EBZRN5KFNI46ISCI7PDQKK","target":"record","payload":{"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"},"canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","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"},"source_kind":"arxiv","source_id":"1901.09248","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:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BGHlidQ7Qfj5KxSKeUXNjmhPvVdrXAnP8kHnxm0a33aJiv4KM82yRYT/xZuhebRe7bED9LzoAvLN2bPUxNW5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:16:43.080166Z"},"content_sha256":"ad890bc32fcb55d0365bf9ba5dfda3067db5f6ec5daa24ff1748d2278a955d1c","schema_version":"1.0","event_id":"sha256:ad890bc32fcb55d0365bf9ba5dfda3067db5f6ec5daa24ff1748d2278a955d1c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IRB4EBZRN5KFNI46ISCI7PDQKK","target":"graph","payload":{"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"},"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:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xIjPy0SEMa4f9z+YNKsOtP9jDAGdB+NoCLjvTw3P9OazZkfPvUVTAjydmVAe8aOVETjBrc2S7cWL8AeSfJbDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:16:43.080608Z"},"content_sha256":"e346ea3e2afb5444566bc3ab3c268a7e7d4a8f6166d9bca5067ebee1760d4a1c","schema_version":"1.0","event_id":"sha256:e346ea3e2afb5444566bc3ab3c268a7e7d4a8f6166d9bca5067ebee1760d4a1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/bundle.json","state_url":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/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-02T14:16:43Z","links":{"resolver":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK","bundle":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/bundle.json","state":"https://pith.science/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRB4EBZRN5KFNI46ISCI7PDQKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IRB4EBZRN5KFNI46ISCI7PDQKK","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":"547ce6ef780ca937e2c335c8abb32fa2962588762f688b3add4a0d909f83f939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-26T17:20:21Z","title_canon_sha256":"6f29590a91d4041bf6be9cda197ebc34bb08c803e0a22d207a87e2ec36ed38ea"},"schema_version":"1.0","source":{"id":"1901.09248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09248","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09248v1","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09248","created_at":"2026-05-17T23:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"IRB4EBZRN5KF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IRB4EBZRN5KFNI46","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IRB4EBZR","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:e346ea3e2afb5444566bc3ab3c268a7e7d4a8f6166d9bca5067ebee1760d4a1c","target":"graph","created_at":"2026-05-17T23:55:26Z","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":"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 ","authors_text":"Alex Sprintson, Anoosheh Heidarzadeh, Fatemeh Kazemi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-26T17:20:21Z","title":"Capacity of Single-Server Single-Message Private Information Retrieval with Private Coded Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09248","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:ad890bc32fcb55d0365bf9ba5dfda3067db5f6ec5daa24ff1748d2278a955d1c","target":"record","created_at":"2026-05-17T23:55:26Z","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":"547ce6ef780ca937e2c335c8abb32fa2962588762f688b3add4a0d909f83f939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-26T17:20:21Z","title_canon_sha256":"6f29590a91d4041bf6be9cda197ebc34bb08c803e0a22d207a87e2ec36ed38ea"},"schema_version":"1.0","source":{"id":"1901.09248","kind":"arxiv","version":1}},"canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4443c207316f5456a39e44848fbc705295db76234bba3c3879774623af7bf5bd","first_computed_at":"2026-05-17T23:55:26.503869Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:26.503869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zNJtNbwjG/L+NZt7stA8D3yr0xwSYv+W1yK4zQvI3+nD4BR2jIX2Y/MrTee0MCjF7cDB2ZMgZQJvdT5GU4H+AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:26.504580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad890bc32fcb55d0365bf9ba5dfda3067db5f6ec5daa24ff1748d2278a955d1c","sha256:e346ea3e2afb5444566bc3ab3c268a7e7d4a8f6166d9bca5067ebee1760d4a1c"],"state_sha256":"3cfec6915fa8342dd548cbe7e63f98e2cde5be4bbdab7d824fe7409719221581"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bkbRAt4gkuofVGH7jR7uTKN/9/zMsbT0kmMerlouSxuR64iIfryvBH4s2sF04OZuYb1f93i2/G2D68++A0nIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:16:43.083772Z","bundle_sha256":"deb6a9c4992b95745d4102a46eccc85e3c4e095137e9fffb36fb2893a9a4aaec"}}