{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BF3BDVXC2VGRPWJSZE4GZ4IAWB","short_pith_number":"pith:BF3BDVXC","schema_version":"1.0","canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","source":{"kind":"arxiv","id":"1810.10635","version":1},"attestation_state":"computed","paper":{"title":"Lower Bounds for Oblivious Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jesper Buus Nielsen, Kasper Green Larsen, Riko Jacob","submitted_at":"2018-10-24T21:43:32Z","abstract_excerpt":"An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for situations where one wishes to store the data structure at an untrusted server. One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). Until very recently, this resulted in an overhead of $\\omega(\\lg n)$ for the most natural setting of parameters. Moreover, a recent lower bound for ORAMs by Larsen and Niels"},"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":"1810.10635","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T21:43:32Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"b91d4a4b9f9662749bc76adcad9538c5bdcdc3e0c88083d61a669e891aeb59e3","abstract_canon_sha256":"02ae1d67662eec00b90030a37542f48eb2104a6aa07825a9c52883aaffb89023"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:20.022517Z","signature_b64":"nq0NksXkbYVlzThQtgP3DM2SCk9Te+tYsSwNyqYvIsTYCLgPTTczUh5g+gaQESTcOyYg1eMlbi6vQabWMt/xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","last_reissued_at":"2026-05-18T00:02:20.022142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:20.022142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bounds for Oblivious Data Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Jesper Buus Nielsen, Kasper Green Larsen, Riko Jacob","submitted_at":"2018-10-24T21:43:32Z","abstract_excerpt":"An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for situations where one wishes to store the data structure at an untrusted server. One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). Until very recently, this resulted in an overhead of $\\omega(\\lg n)$ for the most natural setting of parameters. Moreover, a recent lower bound for ORAMs by Larsen and Niels"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10635","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.10635","created_at":"2026-05-18T00:02:20.022199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10635v1","created_at":"2026-05-18T00:02:20.022199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10635","created_at":"2026-05-18T00:02:20.022199+00:00"},{"alias_kind":"pith_short_12","alias_value":"BF3BDVXC2VGR","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BF3BDVXC2VGRPWJS","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BF3BDVXC","created_at":"2026-05-18T12:32:16.446611+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/BF3BDVXC2VGRPWJSZE4GZ4IAWB","json":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB.json","graph_json":"https://pith.science/api/pith-number/BF3BDVXC2VGRPWJSZE4GZ4IAWB/graph.json","events_json":"https://pith.science/api/pith-number/BF3BDVXC2VGRPWJSZE4GZ4IAWB/events.json","paper":"https://pith.science/paper/BF3BDVXC"},"agent_actions":{"view_html":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB","download_json":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB.json","view_paper":"https://pith.science/paper/BF3BDVXC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10635&json=true","fetch_graph":"https://pith.science/api/pith-number/BF3BDVXC2VGRPWJSZE4GZ4IAWB/graph.json","fetch_events":"https://pith.science/api/pith-number/BF3BDVXC2VGRPWJSZE4GZ4IAWB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/action/storage_attestation","attest_author":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/action/author_attestation","sign_citation":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/action/citation_signature","submit_replication":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/action/replication_record"}},"created_at":"2026-05-18T00:02:20.022199+00:00","updated_at":"2026-05-18T00:02:20.022199+00:00"}