{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BF3BDVXC2VGRPWJSZE4GZ4IAWB","short_pith_number":"pith:BF3BDVXC","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"},"canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","source":{"kind":"arxiv","id":"1810.10635","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10635","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10635v1","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10635","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"BF3BDVXC2VGR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BF3BDVXC2VGRPWJS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BF3BDVXC","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BF3BDVXC2VGRPWJSZE4GZ4IAWB","target":"record","payload":{"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"},"canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","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"},"source_kind":"arxiv","source_id":"1810.10635","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-18T00:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"an/gu3Mrbw+tEKiIz3JOWANi6sEB+BBhal3mKhmyT6P1MptwVoI3bbTB5sKu8XetN0wSF1bGILITDslFGESfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:08.723355Z"},"content_sha256":"6d3ff5a6519af1de11014aac8e0fd7191f29a22a41aec16bbe133b5afe8018fd","schema_version":"1.0","event_id":"sha256:6d3ff5a6519af1de11014aac8e0fd7191f29a22a41aec16bbe133b5afe8018fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BF3BDVXC2VGRPWJSZE4GZ4IAWB","target":"graph","payload":{"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"},"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-18T00:02:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUQ85Z4huVRwYcxIZ1BZ1HhQ+iDYLx2D78aH0AKZyZ+w788jLPXd4iSIylV0C7+ugUIAY1rik7lsHmbhW53OBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:33:08.724066Z"},"content_sha256":"b34a6b4aa0c96886fe0251a150997e20db02a8885e87fb986b619c1337e55f6b","schema_version":"1.0","event_id":"sha256:b34a6b4aa0c96886fe0251a150997e20db02a8885e87fb986b619c1337e55f6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/bundle.json","state_url":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/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-05-28T22:33:08Z","links":{"resolver":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB","bundle":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/bundle.json","state":"https://pith.science/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BF3BDVXC2VGRPWJSZE4GZ4IAWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BF3BDVXC2VGRPWJSZE4GZ4IAWB","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":"02ae1d67662eec00b90030a37542f48eb2104a6aa07825a9c52883aaffb89023","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T21:43:32Z","title_canon_sha256":"b91d4a4b9f9662749bc76adcad9538c5bdcdc3e0c88083d61a669e891aeb59e3"},"schema_version":"1.0","source":{"id":"1810.10635","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10635","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10635v1","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10635","created_at":"2026-05-18T00:02:20Z"},{"alias_kind":"pith_short_12","alias_value":"BF3BDVXC2VGR","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BF3BDVXC2VGRPWJS","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BF3BDVXC","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:b34a6b4aa0c96886fe0251a150997e20db02a8885e87fb986b619c1337e55f6b","target":"graph","created_at":"2026-05-18T00:02:20Z","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":"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","authors_text":"Jesper Buus Nielsen, Kasper Green Larsen, Riko Jacob","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T21:43:32Z","title":"Lower Bounds for Oblivious Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10635","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:6d3ff5a6519af1de11014aac8e0fd7191f29a22a41aec16bbe133b5afe8018fd","target":"record","created_at":"2026-05-18T00:02:20Z","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":"02ae1d67662eec00b90030a37542f48eb2104a6aa07825a9c52883aaffb89023","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-24T21:43:32Z","title_canon_sha256":"b91d4a4b9f9662749bc76adcad9538c5bdcdc3e0c88083d61a669e891aeb59e3"},"schema_version":"1.0","source":{"id":"1810.10635","kind":"arxiv","version":1}},"canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"097611d6e2d54d17d932c9386cf100b0661dd3f59f44671635310f6c1308941b","first_computed_at":"2026-05-18T00:02:20.022142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:20.022142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nq0NksXkbYVlzThQtgP3DM2SCk9Te+tYsSwNyqYvIsTYCLgPTTczUh5g+gaQESTcOyYg1eMlbi6vQabWMt/xBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:20.022517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10635","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d3ff5a6519af1de11014aac8e0fd7191f29a22a41aec16bbe133b5afe8018fd","sha256:b34a6b4aa0c96886fe0251a150997e20db02a8885e87fb986b619c1337e55f6b"],"state_sha256":"f8cf7eb85e38552af742f02306dd2c08b6abf723bb78a672d0f0f5d59fa2b59e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFdVrSnRwLeoproOtNptLjgIMeOtTHihaVfHyra0JjQ4hQQz9ZUHUYEAZOjdRgYjFE3ripdzCrXo5EeSKqtrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:33:08.727628Z","bundle_sha256":"e0136c115b36f1ff5e85d16a92dd67eec41768b3298509646d37e96381dbe4ac"}}