{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FBWXSDAI53PRULXSN4UKNM5YOS","short_pith_number":"pith:FBWXSDAI","canonical_record":{"source":{"id":"1804.02692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-08T14:06:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"199517b6a9a1dda863448fc52c5f184ff1eabf023b38449872a21dedabda9011","abstract_canon_sha256":"136152744ac6d168c457ed2c481e524df86a71e1d5f0fba95087e10852de30bf"},"schema_version":"1.0"},"canonical_sha256":"286d790c08eedf1a2ef26f28a6b3b874bf09a76d0a812d5e8b5df296c952a14d","source":{"kind":"arxiv","id":"1804.02692","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02692","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02692v2","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02692","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"FBWXSDAI53PR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBWXSDAI53PRULXS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBWXSDAI","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FBWXSDAI53PRULXSN4UKNM5YOS","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02692","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-08T14:06:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"199517b6a9a1dda863448fc52c5f184ff1eabf023b38449872a21dedabda9011","abstract_canon_sha256":"136152744ac6d168c457ed2c481e524df86a71e1d5f0fba95087e10852de30bf"},"schema_version":"1.0"},"canonical_sha256":"286d790c08eedf1a2ef26f28a6b3b874bf09a76d0a812d5e8b5df296c952a14d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:42.914003Z","signature_b64":"c3gwjwG2zBsKM5Zt6V3wKEp1bItnB27RDYCJqiJT5TnIiaieeP2Yr374nVDggGDTJUScnmQIsqr6jCf/OuEfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"286d790c08eedf1a2ef26f28a6b3b874bf09a76d0a812d5e8b5df296c952a14d","last_reissued_at":"2026-05-17T23:55:42.913294Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:42.913294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02692","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-17T23:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT9dACY5fqa71hykr6jjyoo/klZzOGA/Nze9oEI9p2ge6RVD5fAAdicoC9gwpudfKmzR/2pQMddpCQLWGol4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:17:24.125112Z"},"content_sha256":"4307c3689a41acdbc641cf20a8c5ae3468e94f8909d275cd6c91166cf5893234","schema_version":"1.0","event_id":"sha256:4307c3689a41acdbc641cf20a8c5ae3468e94f8909d275cd6c91166cf5893234"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FBWXSDAI53PRULXSN4UKNM5YOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Access Complexity of PIR Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eitan Yaakobi, Moshe Schwartz, Tuvi Etzion, Yiwei Zhang","submitted_at":"2018-04-08T14:06:09Z","abstract_excerpt":"Private information retrieval has been reformulated in an information-theoretic perspective in recent years. The two most important parameters considered for a PIR scheme in a distributed storage system are the storage overhead and PIR rate. The complexity of the computations done by the servers for the various tasks of the distributed storage system is an important parameter in such systems which didn't get enough attention in PIR schemes. As a consequence, we take into consideration a third parameter, the access complexity of a PIR scheme, which characterizes the total amount of data to be a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02692","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-17T23:55:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qs/Wx+rmP4GQZD0rKhEBdgJ+jB7OClt4yI6ni++tR8JF+IUXcoDUtwuGnSpWQVBOHV77C2a0i4YK4wDmFuppBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:17:24.125833Z"},"content_sha256":"68e0c6a4b3662b19f1ea198026ee5af96a09a3f89199563571b44ac21f9bdf25","schema_version":"1.0","event_id":"sha256:68e0c6a4b3662b19f1ea198026ee5af96a09a3f89199563571b44ac21f9bdf25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBWXSDAI53PRULXSN4UKNM5YOS/bundle.json","state_url":"https://pith.science/pith/FBWXSDAI53PRULXSN4UKNM5YOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBWXSDAI53PRULXSN4UKNM5YOS/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-05-30T01:17:24Z","links":{"resolver":"https://pith.science/pith/FBWXSDAI53PRULXSN4UKNM5YOS","bundle":"https://pith.science/pith/FBWXSDAI53PRULXSN4UKNM5YOS/bundle.json","state":"https://pith.science/pith/FBWXSDAI53PRULXSN4UKNM5YOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBWXSDAI53PRULXSN4UKNM5YOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FBWXSDAI53PRULXSN4UKNM5YOS","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":"136152744ac6d168c457ed2c481e524df86a71e1d5f0fba95087e10852de30bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-08T14:06:09Z","title_canon_sha256":"199517b6a9a1dda863448fc52c5f184ff1eabf023b38449872a21dedabda9011"},"schema_version":"1.0","source":{"id":"1804.02692","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02692","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02692v2","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02692","created_at":"2026-05-17T23:55:42Z"},{"alias_kind":"pith_short_12","alias_value":"FBWXSDAI53PR","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FBWXSDAI53PRULXS","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FBWXSDAI","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:68e0c6a4b3662b19f1ea198026ee5af96a09a3f89199563571b44ac21f9bdf25","target":"graph","created_at":"2026-05-17T23:55:42Z","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 has been reformulated in an information-theoretic perspective in recent years. The two most important parameters considered for a PIR scheme in a distributed storage system are the storage overhead and PIR rate. The complexity of the computations done by the servers for the various tasks of the distributed storage system is an important parameter in such systems which didn't get enough attention in PIR schemes. As a consequence, we take into consideration a third parameter, the access complexity of a PIR scheme, which characterizes the total amount of data to be a","authors_text":"Eitan Yaakobi, Moshe Schwartz, Tuvi Etzion, Yiwei Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-08T14:06:09Z","title":"On the Access Complexity of PIR Schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02692","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:4307c3689a41acdbc641cf20a8c5ae3468e94f8909d275cd6c91166cf5893234","target":"record","created_at":"2026-05-17T23:55:42Z","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":"136152744ac6d168c457ed2c481e524df86a71e1d5f0fba95087e10852de30bf","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-08T14:06:09Z","title_canon_sha256":"199517b6a9a1dda863448fc52c5f184ff1eabf023b38449872a21dedabda9011"},"schema_version":"1.0","source":{"id":"1804.02692","kind":"arxiv","version":2}},"canonical_sha256":"286d790c08eedf1a2ef26f28a6b3b874bf09a76d0a812d5e8b5df296c952a14d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"286d790c08eedf1a2ef26f28a6b3b874bf09a76d0a812d5e8b5df296c952a14d","first_computed_at":"2026-05-17T23:55:42.913294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:42.913294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c3gwjwG2zBsKM5Zt6V3wKEp1bItnB27RDYCJqiJT5TnIiaieeP2Yr374nVDggGDTJUScnmQIsqr6jCf/OuEfBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:42.914003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02692","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4307c3689a41acdbc641cf20a8c5ae3468e94f8909d275cd6c91166cf5893234","sha256:68e0c6a4b3662b19f1ea198026ee5af96a09a3f89199563571b44ac21f9bdf25"],"state_sha256":"7471621aa6ca718b6312dc47d85c1b99cf75be05958289793437480cc0b9be3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rP3ulGgT05XdTO3PNU8FtlJ2def6ktzS1Zw5p8OX8tXlVhIgO01FvTrlaenfdqnNJ7upi5oNKgmK4bs9qTPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:17:24.129452Z","bundle_sha256":"7c38835984bdc2b4d16cb82346da80d30d4bf6d0efe137c49efa8e271b37b4fd"}}