{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5L5NT3HYAELQN6VM3KRJ43GIWR","short_pith_number":"pith:5L5NT3HY","canonical_record":{"source":{"id":"1106.3652","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-06-18T14:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"9392c795750f4e28d27e32ed5b893cb179243d41067877033134f10c0bba5ba1","abstract_canon_sha256":"e7b8bec0f83df6acaec094ad39070698fa5dc7f947aa6a72c5c8b39fc777cc50"},"schema_version":"1.0"},"canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","source":{"kind":"arxiv","id":"1106.3652","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3652","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3652v5","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3652","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"5L5NT3HYAELQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5L5NT3HYAELQN6VM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5L5NT3HY","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5L5NT3HYAELQN6VM3KRJ43GIWR","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3652","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-06-18T14:49:14Z","cross_cats_sorted":[],"title_canon_sha256":"9392c795750f4e28d27e32ed5b893cb179243d41067877033134f10c0bba5ba1","abstract_canon_sha256":"e7b8bec0f83df6acaec094ad39070698fa5dc7f947aa6a72c5c8b39fc777cc50"},"schema_version":"1.0"},"canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:43.757583Z","signature_b64":"xziv31E39A7lt/IuEL7qJje3rdyCYkc5U3xueHKzTYXBY61QXvVqjZl1deZ6D4OeIZEfs4gw4U8w3zhW5VuRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","last_reissued_at":"2026-05-18T02:21:43.757097Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:43.757097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3652","source_version":5,"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgqsY4WQ+wghOATRaNkLt790sBbjzXfftLmUoYOMmas15dTkgRc6rBPtqO6J4sZuc7F+/BtUOJvvo/bB/K93Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:14:06.507452Z"},"content_sha256":"ec1796da427e11858cd9eb48e9338424de0980c2b418dbfcf47019aee419f90d","schema_version":"1.0","event_id":"sha256:ec1796da427e11858cd9eb48e9338424de0980c2b418dbfcf47019aee419f90d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5L5NT3HYAELQN6VM3KRJ43GIWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Practical Oblivious RAM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Dawn Song, Elaine Shi, Emil Stefanov","submitted_at":"2011-06-18T14:49:14Z","abstract_excerpt":"We take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achievi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3652","kind":"arxiv","version":5},"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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZfbdkfqnNpN8rmeK3VmNhoryVSVO2lsZzIiHzQvuLJY09wa+WlbBITS8FQWYpLL61ZM5nc1esqqCrSg59I3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T21:14:06.507803Z"},"content_sha256":"f624e29a76a5024177eff685871289734e96d9315dcca14bc03860fce18afd32","schema_version":"1.0","event_id":"sha256:f624e29a76a5024177eff685871289734e96d9315dcca14bc03860fce18afd32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/bundle.json","state_url":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/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:14:06Z","links":{"resolver":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR","bundle":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/bundle.json","state":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5L5NT3HYAELQN6VM3KRJ43GIWR","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":"e7b8bec0f83df6acaec094ad39070698fa5dc7f947aa6a72c5c8b39fc777cc50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-06-18T14:49:14Z","title_canon_sha256":"9392c795750f4e28d27e32ed5b893cb179243d41067877033134f10c0bba5ba1"},"schema_version":"1.0","source":{"id":"1106.3652","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3652","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3652v5","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3652","created_at":"2026-05-18T02:21:43Z"},{"alias_kind":"pith_short_12","alias_value":"5L5NT3HYAELQ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5L5NT3HYAELQN6VM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5L5NT3HY","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f624e29a76a5024177eff685871289734e96d9315dcca14bc03860fce18afd32","target":"graph","created_at":"2026-05-18T02:21:43Z","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 take an important step forward in making Oblivious RAM (O-RAM) practical. We propose an O-RAM construction achieving an amortized overhead of 20X-35X (for an O-RAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger O-RAM into smaller O-RAMs, and employ a background eviction technique to obliviously evict blocks from the client-side cache into a randomly assigned server-side partition. This novel technique is the key to achievi","authors_text":"Dawn Song, Elaine Shi, Emil Stefanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-06-18T14:49:14Z","title":"Towards Practical Oblivious RAM"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3652","kind":"arxiv","version":5},"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:ec1796da427e11858cd9eb48e9338424de0980c2b418dbfcf47019aee419f90d","target":"record","created_at":"2026-05-18T02:21:43Z","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":"e7b8bec0f83df6acaec094ad39070698fa5dc7f947aa6a72c5c8b39fc777cc50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2011-06-18T14:49:14Z","title_canon_sha256":"9392c795750f4e28d27e32ed5b893cb179243d41067877033134f10c0bba5ba1"},"schema_version":"1.0","source":{"id":"1106.3652","kind":"arxiv","version":5}},"canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","first_computed_at":"2026-05-18T02:21:43.757097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:43.757097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xziv31E39A7lt/IuEL7qJje3rdyCYkc5U3xueHKzTYXBY61QXvVqjZl1deZ6D4OeIZEfs4gw4U8w3zhW5VuRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:43.757583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3652","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec1796da427e11858cd9eb48e9338424de0980c2b418dbfcf47019aee419f90d","sha256:f624e29a76a5024177eff685871289734e96d9315dcca14bc03860fce18afd32"],"state_sha256":"eae7906fe9114d921c41ec0bf7e4ec1f3a05d36f8296ea28542e7b95dc650f7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxn/uuXuTUnFRkCeeOj87xvUnVuIgyaoH9sDCzSp0I88HNNygpH0QWDwWgQqWJzWkocBRvBAaqRtGQAXrodIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T21:14:06.509748Z","bundle_sha256":"bace9ea884df142506095aac9b1c4ac2798573357985d4206d443cc046acabca"}}