{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UPHQSGM4D5NBNEA3XH7DA6SS3V","short_pith_number":"pith:UPHQSGM4","canonical_record":{"source":{"id":"1602.09134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T20:51:37Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"03d14d8222c47d7a54d8c9e8ee035699176abe8c78440f82d41de1f8d791506c","abstract_canon_sha256":"a14c56fa83bc977b7cf430b047fb6a51009815b81f49b4ee1fdf3ec8829a783d"},"schema_version":"1.0"},"canonical_sha256":"a3cf09199c1f5a16901bb9fe307a52dd4b786b3a79045c1145a1ef651ee194d1","source":{"kind":"arxiv","id":"1602.09134","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.09134","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.09134v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09134","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"UPHQSGM4D5NB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPHQSGM4D5NBNEA3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPHQSGM4","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UPHQSGM4D5NBNEA3XH7DA6SS3V","target":"record","payload":{"canonical_record":{"source":{"id":"1602.09134","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T20:51:37Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"03d14d8222c47d7a54d8c9e8ee035699176abe8c78440f82d41de1f8d791506c","abstract_canon_sha256":"a14c56fa83bc977b7cf430b047fb6a51009815b81f49b4ee1fdf3ec8829a783d"},"schema_version":"1.0"},"canonical_sha256":"a3cf09199c1f5a16901bb9fe307a52dd4b786b3a79045c1145a1ef651ee194d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.561180Z","signature_b64":"NmKBpDxWgzC/HGp/HekiWXmzhvdNLVguG3zEjVNKlKAIvJAeVCkvDYYY+fywVxvR114IlWpCz3WWzpU7rb8FCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3cf09199c1f5a16901bb9fe307a52dd4b786b3a79045c1145a1ef651ee194d1","last_reissued_at":"2026-05-18T00:50:01.560522Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.560522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.09134","source_version":2,"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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhaE+VHdDvc1/hWi/fjLbGdgDdn0G/RfDDL4dm6QyJ86eteklyU6DZTK0piXCFD3/6f/6BA8t68F/2TNhyKxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:00:58.652284Z"},"content_sha256":"ff2454b1439427539575f0e68911c58b08d15b48410d85e591b26be31554fbc8","schema_version":"1.0","event_id":"sha256:ff2454b1439427539575f0e68911c58b08d15b48410d85e591b26be31554fbc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UPHQSGM4D5NBNEA3XH7DA6SS3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Private Information Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Hua Sun, Syed A. Jafar","submitted_at":"2016-02-29T20:51:37Z","abstract_excerpt":"In the private information retrieval (PIR) problem a user wishes to retrieve, as efficiently as possible, one out of $K$ messages from $N$ non-communicating databases (each holds all $K$ messages) while revealing nothing about the identity of the desired message index to any individual database. The information theoretic capacity of PIR is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. For $K$ messages and $N$ databases, we show that the PIR capacity is $(1+1/N+1/N^2+\\cdots+1/N^{K-1})^{-1}$. A remarkable feature of the capac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09134","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"},"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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acm2AhQ4LnZKyXEurmsiTxxBambmsm+dV4cFuWHksW9NhQzTgZT2HhEHVR7cgEBaUkKMrGtkRbartgRNXRSaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:00:58.652662Z"},"content_sha256":"9630dab7fe971b6b4e1345bed6eb18a55e9cf1125f98b11448537b9ca948bdb1","schema_version":"1.0","event_id":"sha256:9630dab7fe971b6b4e1345bed6eb18a55e9cf1125f98b11448537b9ca948bdb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/bundle.json","state_url":"https://pith.science/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/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-02T21:00:58Z","links":{"resolver":"https://pith.science/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V","bundle":"https://pith.science/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/bundle.json","state":"https://pith.science/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPHQSGM4D5NBNEA3XH7DA6SS3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UPHQSGM4D5NBNEA3XH7DA6SS3V","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":"a14c56fa83bc977b7cf430b047fb6a51009815b81f49b4ee1fdf3ec8829a783d","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T20:51:37Z","title_canon_sha256":"03d14d8222c47d7a54d8c9e8ee035699176abe8c78440f82d41de1f8d791506c"},"schema_version":"1.0","source":{"id":"1602.09134","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.09134","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.09134v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.09134","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"UPHQSGM4D5NB","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UPHQSGM4D5NBNEA3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UPHQSGM4","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:9630dab7fe971b6b4e1345bed6eb18a55e9cf1125f98b11448537b9ca948bdb1","target":"graph","created_at":"2026-05-18T00:50:01Z","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 the private information retrieval (PIR) problem a user wishes to retrieve, as efficiently as possible, one out of $K$ messages from $N$ non-communicating databases (each holds all $K$ messages) while revealing nothing about the identity of the desired message index to any individual database. The information theoretic capacity of PIR is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. For $K$ messages and $N$ databases, we show that the PIR capacity is $(1+1/N+1/N^2+\\cdots+1/N^{K-1})^{-1}$. A remarkable feature of the capac","authors_text":"Hua Sun, Syed A. Jafar","cross_cats":["cs.CR","cs.IR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T20:51:37Z","title":"The Capacity of Private Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.09134","kind":"arxiv","version":2},"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:ff2454b1439427539575f0e68911c58b08d15b48410d85e591b26be31554fbc8","target":"record","created_at":"2026-05-18T00:50:01Z","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":"a14c56fa83bc977b7cf430b047fb6a51009815b81f49b4ee1fdf3ec8829a783d","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-29T20:51:37Z","title_canon_sha256":"03d14d8222c47d7a54d8c9e8ee035699176abe8c78440f82d41de1f8d791506c"},"schema_version":"1.0","source":{"id":"1602.09134","kind":"arxiv","version":2}},"canonical_sha256":"a3cf09199c1f5a16901bb9fe307a52dd4b786b3a79045c1145a1ef651ee194d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3cf09199c1f5a16901bb9fe307a52dd4b786b3a79045c1145a1ef651ee194d1","first_computed_at":"2026-05-18T00:50:01.560522Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.560522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NmKBpDxWgzC/HGp/HekiWXmzhvdNLVguG3zEjVNKlKAIvJAeVCkvDYYY+fywVxvR114IlWpCz3WWzpU7rb8FCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.561180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.09134","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff2454b1439427539575f0e68911c58b08d15b48410d85e591b26be31554fbc8","sha256:9630dab7fe971b6b4e1345bed6eb18a55e9cf1125f98b11448537b9ca948bdb1"],"state_sha256":"19f589059ea858af5fd4e5440ce48767fbcb3088a463e0cf6d7eea83573e9194"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VV1kOowHLj2IeF0cv0rUSRzUiYQxlxxvDCiDZXA5ikYeyW+WQpIVJr6Z00OuuTtmN0iGOY54WzrWJ9D58PCqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:00:58.654674Z","bundle_sha256":"14b889fc7c7e8e18b7cde4d72ccb805e4c51b5bbf4c2fcebea4be5ade181f68c"}}