{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5RLOTNI7XCH5ZBBBYELNPKTG67","short_pith_number":"pith:5RLOTNI7","canonical_record":{"source":{"id":"1605.00635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-02T19:41:15Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"53b295fd95779a36d3503c6cbd66f0c3c488da1af78fe4bf137bdfbf786f52c5","abstract_canon_sha256":"6dfb6921e5db3f2d593496dfab534afe143bce4242d54ca290fc6216e598b196"},"schema_version":"1.0"},"canonical_sha256":"ec56e9b51fb88fdc8421c116d7aa66f7d8936003313a9bc9b817bb8940124dd4","source":{"kind":"arxiv","id":"1605.00635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00635","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00635v1","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00635","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"5RLOTNI7XCH5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5RLOTNI7XCH5ZBBB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5RLOTNI7","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5RLOTNI7XCH5ZBBBYELNPKTG67","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-05-02T19:41:15Z","cross_cats_sorted":["cs.CR","cs.IR","math.IT"],"title_canon_sha256":"53b295fd95779a36d3503c6cbd66f0c3c488da1af78fe4bf137bdfbf786f52c5","abstract_canon_sha256":"6dfb6921e5db3f2d593496dfab534afe143bce4242d54ca290fc6216e598b196"},"schema_version":"1.0"},"canonical_sha256":"ec56e9b51fb88fdc8421c116d7aa66f7d8936003313a9bc9b817bb8940124dd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:53.701551Z","signature_b64":"BZZm/s0l+fl2DnLh4Q9knHbR7IWgFBplmKvU1gehVkNRyOoJi4T9YvbB2ZiXEg31skQs6906sVPs4j2Jr7odAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec56e9b51fb88fdc8421c116d7aa66f7d8936003313a9bc9b817bb8940124dd4","last_reissued_at":"2026-05-18T01:15:53.700787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:53.700787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00635","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-18T01:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Idg41/aPfAGzr33K+ZbyZm8Zs1VdFEDEw3K3oB8bdsQ3pVxqGShfqgnGIFLWyNOyiZKhnwofiBGT7QrjGKRtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:18:34.228272Z"},"content_sha256":"3b4557fbf962ccc87f01468f860b06d2b2b63b1773772db277ae6f3e8b5886fb","schema_version":"1.0","event_id":"sha256:3b4557fbf962ccc87f01468f860b06d2b2b63b1773772db277ae6f3e8b5886fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5RLOTNI7XCH5ZBBBYELNPKTG67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Capacity of Robust Private Information Retrieval with Colluding Databases","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-05-02T19:41:15Z","abstract_excerpt":"Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of $K$ messages from $N$ non-communicating replicated databases (each holds all $K$ messages) while keeping the identity of the desired message index a secret from each individual database. The information theoretic capacity of PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. $T$-private PIR is a generalization of PIR to include the requirement that even if any $T$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00635","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-18T01:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pTqzHoRUu/FP+D8IepZ8NzAuJcKcHHr1ZGwv+5LJq0KPqCVMjGhpCV1XY9e4XdKzRSo6nfu/401kbDqc0zEhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:18:34.228671Z"},"content_sha256":"db5950bfc2e4c327dff9584bc4edf0146b3a3b4cd76d30efe108585d63539afc","schema_version":"1.0","event_id":"sha256:db5950bfc2e4c327dff9584bc4edf0146b3a3b4cd76d30efe108585d63539afc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/bundle.json","state_url":"https://pith.science/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/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-20T05:18:34Z","links":{"resolver":"https://pith.science/pith/5RLOTNI7XCH5ZBBBYELNPKTG67","bundle":"https://pith.science/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/bundle.json","state":"https://pith.science/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RLOTNI7XCH5ZBBBYELNPKTG67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5RLOTNI7XCH5ZBBBYELNPKTG67","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":"6dfb6921e5db3f2d593496dfab534afe143bce4242d54ca290fc6216e598b196","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-05-02T19:41:15Z","title_canon_sha256":"53b295fd95779a36d3503c6cbd66f0c3c488da1af78fe4bf137bdfbf786f52c5"},"schema_version":"1.0","source":{"id":"1605.00635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00635","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00635v1","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00635","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"5RLOTNI7XCH5","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5RLOTNI7XCH5ZBBB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5RLOTNI7","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:db5950bfc2e4c327dff9584bc4edf0146b3a3b4cd76d30efe108585d63539afc","target":"graph","created_at":"2026-05-18T01:15:53Z","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":"Private information retrieval (PIR) is the problem of retrieving as efficiently as possible, one out of $K$ messages from $N$ non-communicating replicated databases (each holds all $K$ messages) while keeping the identity of the desired message index a secret from each individual database. The information theoretic capacity of PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired information that can be privately retrieved per bit of downloaded information. $T$-private PIR is a generalization of PIR to include the requirement that even if any $T$ ","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-05-02T19:41:15Z","title":"The Capacity of Robust Private Information Retrieval with Colluding Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00635","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:3b4557fbf962ccc87f01468f860b06d2b2b63b1773772db277ae6f3e8b5886fb","target":"record","created_at":"2026-05-18T01:15:53Z","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":"6dfb6921e5db3f2d593496dfab534afe143bce4242d54ca290fc6216e598b196","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-05-02T19:41:15Z","title_canon_sha256":"53b295fd95779a36d3503c6cbd66f0c3c488da1af78fe4bf137bdfbf786f52c5"},"schema_version":"1.0","source":{"id":"1605.00635","kind":"arxiv","version":1}},"canonical_sha256":"ec56e9b51fb88fdc8421c116d7aa66f7d8936003313a9bc9b817bb8940124dd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec56e9b51fb88fdc8421c116d7aa66f7d8936003313a9bc9b817bb8940124dd4","first_computed_at":"2026-05-18T01:15:53.700787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:53.700787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BZZm/s0l+fl2DnLh4Q9knHbR7IWgFBplmKvU1gehVkNRyOoJi4T9YvbB2ZiXEg31skQs6906sVPs4j2Jr7odAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:53.701551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b4557fbf962ccc87f01468f860b06d2b2b63b1773772db277ae6f3e8b5886fb","sha256:db5950bfc2e4c327dff9584bc4edf0146b3a3b4cd76d30efe108585d63539afc"],"state_sha256":"c0ea422ee15dd31f0f48d09f95db341dc4c91cb52241a48c2315e0fefbfbf3db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pm7l0O2F61SrB9J7vYlRytawR6E4oFYwy6mdznGR63uQqGCU1MOWU5EsBGzGmtdc2bakf+EX1HJasZ/Bh/wnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:18:34.230842Z","bundle_sha256":"971a69d0ffddd52b237ebb3e428addcf5bb4103c96467badef3e4639ac50b653"}}