{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KCWTCNKV56BPK3R3FLZHACWQ7O","short_pith_number":"pith:KCWTCNKV","canonical_record":{"source":{"id":"1809.00825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"2f15895218df5f82b26f395cfd63448e49c81630ce0ba835d87260f7ba2ef07e","abstract_canon_sha256":"f3b9e4a7ddd647f83a740130d58021aa3fa315b499cda1112e2b743a486b3e44"},"schema_version":"1.0"},"canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","source":{"kind":"arxiv","id":"1809.00825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00825","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00825v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00825","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"KCWTCNKV56BP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KCWTCNKV56BPK3R3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KCWTCNKV","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KCWTCNKV56BPK3R3FLZHACWQ7O","target":"record","payload":{"canonical_record":{"source":{"id":"1809.00825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"2f15895218df5f82b26f395cfd63448e49c81630ce0ba835d87260f7ba2ef07e","abstract_canon_sha256":"f3b9e4a7ddd647f83a740130d58021aa3fa315b499cda1112e2b743a486b3e44"},"schema_version":"1.0"},"canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:32.408302Z","signature_b64":"Dek8cz+M4MtyUFvP9163WN6Kw/quDazfl85RKBT4UI+kfBYsec09o1zveAEKHW4TWbq7KQ09H5+R1fPxMpjSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","last_reissued_at":"2026-05-18T00:06:32.407900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:32.407900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.00825","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRV7xyqXzQSNjeT6zvirXRSjFeAAJWsvRw8wlZEVZ6lK/ChHojA3maX36nh4PoaDw8YYtofVyNwuL8N334VEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:43:23.712424Z"},"content_sha256":"bb79354d46e9193144c26b7ecf357cd4e5246605b9a936a79037aea8a2fddd91","schema_version":"1.0","event_id":"sha256:bb79354d46e9193144c26b7ecf357cd4e5246605b9a936a79037aea8a2fddd91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KCWTCNKV56BPK3R3FLZHACWQ7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Antigoni Polychroniadou, Elaine Shi, Jonathan Katz, Kartik Nayak, T-H. Hubert Chan","submitted_at":"2018-09-04T07:59:35Z","abstract_excerpt":"The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case.\n  In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00825","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:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuCZE4Y0LaG0tpr3uRsy2t/FFZMzXULkPISsPc5kqBvlVroZGAGsItaoNny8ETpxYUyCDgYFItBzPfZCMbybAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:43:23.712920Z"},"content_sha256":"0510335d37cfd8c4b12e2c237998b9dfa29e457c2f9c5cac5fe0b8d2bb8d50ac","schema_version":"1.0","event_id":"sha256:0510335d37cfd8c4b12e2c237998b9dfa29e457c2f9c5cac5fe0b8d2bb8d50ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/bundle.json","state_url":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/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-27T00:43:23Z","links":{"resolver":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O","bundle":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/bundle.json","state":"https://pith.science/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCWTCNKV56BPK3R3FLZHACWQ7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KCWTCNKV56BPK3R3FLZHACWQ7O","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":"f3b9e4a7ddd647f83a740130d58021aa3fa315b499cda1112e2b743a486b3e44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","title_canon_sha256":"2f15895218df5f82b26f395cfd63448e49c81630ce0ba835d87260f7ba2ef07e"},"schema_version":"1.0","source":{"id":"1809.00825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00825","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00825v1","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00825","created_at":"2026-05-18T00:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"KCWTCNKV56BP","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KCWTCNKV56BPK3R3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KCWTCNKV","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:0510335d37cfd8c4b12e2c237998b9dfa29e457c2f9c5cac5fe0b8d2bb8d50ac","target":"graph","created_at":"2026-05-18T00:06:32Z","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":"The problem of Oblivious RAM (ORAM) has traditionally been studied in a single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether the multi-server setting has any inherent advantages, e.g., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case.\n  In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor. In the process, we also show, for the first","authors_text":"Antigoni Polychroniadou, Elaine Shi, Jonathan Katz, Kartik Nayak, T-H. Hubert Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","title":"More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00825","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:bb79354d46e9193144c26b7ecf357cd4e5246605b9a936a79037aea8a2fddd91","target":"record","created_at":"2026-05-18T00:06:32Z","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":"f3b9e4a7ddd647f83a740130d58021aa3fa315b499cda1112e2b743a486b3e44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-04T07:59:35Z","title_canon_sha256":"2f15895218df5f82b26f395cfd63448e49c81630ce0ba835d87260f7ba2ef07e"},"schema_version":"1.0","source":{"id":"1809.00825","kind":"arxiv","version":1}},"canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50ad313555ef82f56e3b2af2700ad0fb847448b586d3b895a5212c21726ffc17","first_computed_at":"2026-05-18T00:06:32.407900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:32.407900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Dek8cz+M4MtyUFvP9163WN6Kw/quDazfl85RKBT4UI+kfBYsec09o1zveAEKHW4TWbq7KQ09H5+R1fPxMpjSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:32.408302Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb79354d46e9193144c26b7ecf357cd4e5246605b9a936a79037aea8a2fddd91","sha256:0510335d37cfd8c4b12e2c237998b9dfa29e457c2f9c5cac5fe0b8d2bb8d50ac"],"state_sha256":"266d04b385180d20e986ddcb9135df4700c7328ce918cd09a10cced0e3f3e8d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3TizwC1npaYXLuDc3afugeZ8ba2Tnzjjn9YWVv6k9lX3hlILi5VidEXRmn+lW1/gG56AmfMQCW8uVYLONgtCAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:43:23.715742Z","bundle_sha256":"3cd031ae87e4fec1c9d308baef31825d4c76eb8e7ad82f501a551a3845ee9fa3"}}