{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:6U5UCBNZMQ4YFA2WKHCIC26KFN","short_pith_number":"pith:6U5UCBNZ","canonical_record":{"source":{"id":"1107.5093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-25T23:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"5589149efe891c20315c43940fc06c6b8038f1c555e501f9e3cd4fabf390c924","abstract_canon_sha256":"20e9195e2f709d122430a01dc3054a48be99959bc191a41f4df421e8ca2a3527"},"schema_version":"1.0"},"canonical_sha256":"f53b4105b9643982835651c4816bca2b743b2b0bd1aaa8afe73dd1e059b2fc47","source":{"kind":"arxiv","id":"1107.5093","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5093","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5093v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5093","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"6U5UCBNZMQ4Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6U5UCBNZMQ4YFA2W","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6U5UCBNZ","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:6U5UCBNZMQ4YFA2WKHCIC26KFN","target":"record","payload":{"canonical_record":{"source":{"id":"1107.5093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-25T23:28:44Z","cross_cats_sorted":[],"title_canon_sha256":"5589149efe891c20315c43940fc06c6b8038f1c555e501f9e3cd4fabf390c924","abstract_canon_sha256":"20e9195e2f709d122430a01dc3054a48be99959bc191a41f4df421e8ca2a3527"},"schema_version":"1.0"},"canonical_sha256":"f53b4105b9643982835651c4816bca2b743b2b0bd1aaa8afe73dd1e059b2fc47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:42.640385Z","signature_b64":"obn9OdWp3V0IvDpq2AZMJin8dkWYF6UrjDdKGf62xx/pU58UQAPWEQP6j/YFcSvJhiAyXsrEMilN6bnOF9i4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f53b4105b9643982835651c4816bca2b743b2b0bd1aaa8afe73dd1e059b2fc47","last_reissued_at":"2026-05-18T02:21:42.639980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:42.639980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.5093","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5a/5O5pTjZAlr/zoteYwNOiRy7TI7mfEo2mwrXoioMvrBmSQWkG4f3dXHDqxj2Hp6AiPqEmddtq4WDnvdmrvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:03:54.062846Z"},"content_sha256":"b9fb06af8206d895c45ac8688b5abeeb67bbf6680ce4347f1fa9f4e6c0b9021c","schema_version":"1.0","event_id":"sha256:b9fb06af8206d895c45ac8688b5abeeb67bbf6680ce4347f1fa9f4e6c0b9021c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:6U5UCBNZMQ4YFA2WKHCIC26KFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Oblivious RAM Simulation with Efficient Worst-Case Access 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-07-25T23:28:44Z","abstract_excerpt":"Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5093","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-18T02:21:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnBe01Iooq/6ZYe+45aNLWOA7mXo1oeIwkA/kL7B00D345UKWwOBgtkTz+S2LNHnJe515tB3nVlhvM4hJNbYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:03:54.063181Z"},"content_sha256":"e722d6fa9065f92251453f1b02350c3d00afaaa7049c75c0492f286e31bb799d","schema_version":"1.0","event_id":"sha256:e722d6fa9065f92251453f1b02350c3d00afaaa7049c75c0492f286e31bb799d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/bundle.json","state_url":"https://pith.science/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/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:03:54Z","links":{"resolver":"https://pith.science/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN","bundle":"https://pith.science/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/bundle.json","state":"https://pith.science/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6U5UCBNZMQ4YFA2WKHCIC26KFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:6U5UCBNZMQ4YFA2WKHCIC26KFN","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":"20e9195e2f709d122430a01dc3054a48be99959bc191a41f4df421e8ca2a3527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-25T23:28:44Z","title_canon_sha256":"5589149efe891c20315c43940fc06c6b8038f1c555e501f9e3cd4fabf390c924"},"schema_version":"1.0","source":{"id":"1107.5093","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.5093","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"arxiv_version","alias_value":"1107.5093v1","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5093","created_at":"2026-05-18T02:21:42Z"},{"alias_kind":"pith_short_12","alias_value":"6U5UCBNZMQ4Y","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"6U5UCBNZMQ4YFA2W","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"6U5UCBNZ","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:e722d6fa9065f92251453f1b02350c3d00afaaa7049c75c0492f286e31bb799d","target":"graph","created_at":"2026-05-18T02:21: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":"Oblivious RAM simulation is a method for achieving confidentiality and privacy in cloud computing environments. It involves obscuring the access patterns to a remote storage so that the manager of that storage cannot infer information about its contents. Existing solutions typically involve small amortized overheads for achieving this goal, but nevertheless involve potentially huge variations in access times, depending on when they occur. In this paper, we show how to de-amortize oblivious RAM simulations, so that each access takes a worst-case bounded amount of time.","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-07-25T23:28:44Z","title":"Oblivious RAM Simulation with Efficient Worst-Case Access Overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5093","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:b9fb06af8206d895c45ac8688b5abeeb67bbf6680ce4347f1fa9f4e6c0b9021c","target":"record","created_at":"2026-05-18T02:21: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":"20e9195e2f709d122430a01dc3054a48be99959bc191a41f4df421e8ca2a3527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-07-25T23:28:44Z","title_canon_sha256":"5589149efe891c20315c43940fc06c6b8038f1c555e501f9e3cd4fabf390c924"},"schema_version":"1.0","source":{"id":"1107.5093","kind":"arxiv","version":1}},"canonical_sha256":"f53b4105b9643982835651c4816bca2b743b2b0bd1aaa8afe73dd1e059b2fc47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f53b4105b9643982835651c4816bca2b743b2b0bd1aaa8afe73dd1e059b2fc47","first_computed_at":"2026-05-18T02:21:42.639980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:42.639980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"obn9OdWp3V0IvDpq2AZMJin8dkWYF6UrjDdKGf62xx/pU58UQAPWEQP6j/YFcSvJhiAyXsrEMilN6bnOF9i4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:42.640385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.5093","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9fb06af8206d895c45ac8688b5abeeb67bbf6680ce4347f1fa9f4e6c0b9021c","sha256:e722d6fa9065f92251453f1b02350c3d00afaaa7049c75c0492f286e31bb799d"],"state_sha256":"7e320e48d707ff3dd6e4146330dd079a5928f29128ea4d51924a73dc48a89dee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/H6yGBpSQdmlrY8PMvzVxg0aLcVLbJJZsLRL+ObCCNDzHvY8HH+2ALUhwjCB0z3GWwer5x+3r3oXDoIP7zSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:03:54.065127Z","bundle_sha256":"5c0b7f4686e2eade45fc5b5877f8dbbc78b119928ed76d8eb879b18370e819a9"}}