{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5L5NT3HYAELQN6VM3KRJ43GIWR","short_pith_number":"pith:5L5NT3HY","schema_version":"1.0","canonical_sha256":"eafad9ecf8011706faacdaa29e6cc8b447ed625a68451fcb14071018f22878f8","source":{"kind":"arxiv","id":"1106.3652","version":5},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1106.3652","created_at":"2026-05-18T02:21:43.757164+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3652v5","created_at":"2026-05-18T02:21:43.757164+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3652","created_at":"2026-05-18T02:21:43.757164+00:00"},{"alias_kind":"pith_short_12","alias_value":"5L5NT3HYAELQ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5L5NT3HYAELQN6VM","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5L5NT3HY","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR","json":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR.json","graph_json":"https://pith.science/api/pith-number/5L5NT3HYAELQN6VM3KRJ43GIWR/graph.json","events_json":"https://pith.science/api/pith-number/5L5NT3HYAELQN6VM3KRJ43GIWR/events.json","paper":"https://pith.science/paper/5L5NT3HY"},"agent_actions":{"view_html":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR","download_json":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR.json","view_paper":"https://pith.science/paper/5L5NT3HY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3652&json=true","fetch_graph":"https://pith.science/api/pith-number/5L5NT3HYAELQN6VM3KRJ43GIWR/graph.json","fetch_events":"https://pith.science/api/pith-number/5L5NT3HYAELQN6VM3KRJ43GIWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/action/storage_attestation","attest_author":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/action/author_attestation","sign_citation":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/action/citation_signature","submit_replication":"https://pith.science/pith/5L5NT3HYAELQN6VM3KRJ43GIWR/action/replication_record"}},"created_at":"2026-05-18T02:21:43.757164+00:00","updated_at":"2026-05-18T02:21:43.757164+00:00"}