{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UE4NFTAZSI3TXYZXGJH2SDSXCR","short_pith_number":"pith:UE4NFTAZ","canonical_record":{"source":{"id":"1110.1851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"5abfb54fa84904b603084727b376d3d6464d4e32355d3e07e915c97b9661443c","abstract_canon_sha256":"223d4fd4d840b5ecf47e818b02c5eadaf9eaa2f9a84aba35ad0ab5999ae30002"},"schema_version":"1.0"},"canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","source":{"kind":"arxiv","id":"1110.1851","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1851","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1851v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1851","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"UE4NFTAZSI3T","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UE4NFTAZSI3TXYZX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UE4NFTAZ","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UE4NFTAZSI3TXYZXGJH2SDSXCR","target":"record","payload":{"canonical_record":{"source":{"id":"1110.1851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"5abfb54fa84904b603084727b376d3d6464d4e32355d3e07e915c97b9661443c","abstract_canon_sha256":"223d4fd4d840b5ecf47e818b02c5eadaf9eaa2f9a84aba35ad0ab5999ae30002"},"schema_version":"1.0"},"canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:19.522155Z","signature_b64":"NK2VFNmzDg81EgVzBVD4uQCM6vp9t8K7cj2LlteXLG2C/X6M5lo0y0Hh9RrqyiX57iii56FIZquXkRsugQ9BAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","last_reissued_at":"2026-05-18T04:11:19.521407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:19.521407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.1851","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-18T04:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VWnUrBsw4ULLrC/zdhklp5r5jKAi/w/l7A+/c6ZCZcfbyGr8kr5Nlhj2iLBnh+LcdhUoKIPCb6pvSCiAeDNSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:36:45.026336Z"},"content_sha256":"d90f6913e6048e59af61a660bf5b6ffc0b1cf88989733361e91867012cf40750","schema_version":"1.0","event_id":"sha256:d90f6913e6048e59af61a660bf5b6ffc0b1cf88989733361e91867012cf40750"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UE4NFTAZSI3TXYZXGJH2SDSXCR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oblivious Storage with Low I/O Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Michael Mitzenmacher, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","submitted_at":"2011-10-09T15:47:33Z","abstract_excerpt":"We study oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1851","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-18T04:11:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X2yq7GjzGZ0cSQFv6Pm3wlG0XLnDOAzcaAPiY1eRiXxh9CH3cJyYVpeR69p+XvH8f0r7Tu4jpxAvkWoRKPPVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:36:45.026676Z"},"content_sha256":"a84754bd3f6786177ab110fe4ac89bcea3ec4e0e606475fa740f8a771933ddb2","schema_version":"1.0","event_id":"sha256:a84754bd3f6786177ab110fe4ac89bcea3ec4e0e606475fa740f8a771933ddb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/bundle.json","state_url":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/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-28T08:36:45Z","links":{"resolver":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR","bundle":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/bundle.json","state":"https://pith.science/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UE4NFTAZSI3TXYZXGJH2SDSXCR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UE4NFTAZSI3TXYZXGJH2SDSXCR","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":"223d4fd4d840b5ecf47e818b02c5eadaf9eaa2f9a84aba35ad0ab5999ae30002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","title_canon_sha256":"5abfb54fa84904b603084727b376d3d6464d4e32355d3e07e915c97b9661443c"},"schema_version":"1.0","source":{"id":"1110.1851","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1851","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1851v1","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1851","created_at":"2026-05-18T04:11:19Z"},{"alias_kind":"pith_short_12","alias_value":"UE4NFTAZSI3T","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UE4NFTAZSI3TXYZX","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UE4NFTAZ","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:a84754bd3f6786177ab110fe4ac89bcea3ec4e0e606475fa740f8a771933ddb2","target":"graph","created_at":"2026-05-18T04:11:19Z","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 oblivious storage (OS), a natural way to model privacy-preserving data outsourcing where a client, Alice, stores sensitive data at an honest-but-curious server, Bob. We show that Alice can hide both the content of her data and the pattern in which she accesses her data, with high probability, using a method that achieves O(1) amortized rounds of communication between her and Bob for each data access. We assume that Alice and Bob exchange small messages, of size $O(N^{1/c})$, for some constant $c\\ge2$, in a single round, where $N$ is the size of the data set that Alice is storing with ","authors_text":"Michael Mitzenmacher, Michael T. Goodrich, Olga Ohrimenko, Roberto Tamassia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","title":"Oblivious Storage with Low I/O Overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1851","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:d90f6913e6048e59af61a660bf5b6ffc0b1cf88989733361e91867012cf40750","target":"record","created_at":"2026-05-18T04:11:19Z","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":"223d4fd4d840b5ecf47e818b02c5eadaf9eaa2f9a84aba35ad0ab5999ae30002","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-10-09T15:47:33Z","title_canon_sha256":"5abfb54fa84904b603084727b376d3d6464d4e32355d3e07e915c97b9661443c"},"schema_version":"1.0","source":{"id":"1110.1851","kind":"arxiv","version":1}},"canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a138d2cc1992373be337324fa90e57144ee971adbd65374c5f1154d1b009ba8a","first_computed_at":"2026-05-18T04:11:19.521407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:19.521407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NK2VFNmzDg81EgVzBVD4uQCM6vp9t8K7cj2LlteXLG2C/X6M5lo0y0Hh9RrqyiX57iii56FIZquXkRsugQ9BAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:19.522155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1851","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d90f6913e6048e59af61a660bf5b6ffc0b1cf88989733361e91867012cf40750","sha256:a84754bd3f6786177ab110fe4ac89bcea3ec4e0e606475fa740f8a771933ddb2"],"state_sha256":"c50414808d292a0fed52c6a7e6e5c6e2ab509a7db5883a9bf14dd8b46df9e6e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohlQcyZY8GWKvU2Ga17d3wOLShbS7Pq8diF8ebgQ7Yxe3EOGhc7nvRjD8ZKQA9jtkl+oYjZU2XkDzYJkIkCCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:36:45.028531Z","bundle_sha256":"fd16f68c78975556fe149a863263c19aa6933a239d511693479bdcdfb915f600"}}