{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ID2P74A6CLVY23EXNLVY3S5YES","short_pith_number":"pith:ID2P74A6","canonical_record":{"source":{"id":"1202.5150","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-23T11:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"be2d7ab37d52cf62d0d87c45b70852286bd72debb05bdd5aee1271656c574731","abstract_canon_sha256":"a614172c53f2d54d2a7fe60c3b413e44b71b1f4c5d0c0561fb59be5d254fe93f"},"schema_version":"1.0"},"canonical_sha256":"40f4fff01e12eb8d6c976aeb8dcbb824b4a4adcc52f661405e477be841916bc6","source":{"kind":"arxiv","id":"1202.5150","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5150","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5150v3","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5150","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"ID2P74A6CLVY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ID2P74A6CLVY23EX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ID2P74A6","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ID2P74A6CLVY23EXNLVY3S5YES","target":"record","payload":{"canonical_record":{"source":{"id":"1202.5150","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-23T11:05:34Z","cross_cats_sorted":[],"title_canon_sha256":"be2d7ab37d52cf62d0d87c45b70852286bd72debb05bdd5aee1271656c574731","abstract_canon_sha256":"a614172c53f2d54d2a7fe60c3b413e44b71b1f4c5d0c0561fb59be5d254fe93f"},"schema_version":"1.0"},"canonical_sha256":"40f4fff01e12eb8d6c976aeb8dcbb824b4a4adcc52f661405e477be841916bc6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:21.421855Z","signature_b64":"2Yd8nBStmfRZCJ6HwA6mQDGVREnPIQ9TASoHv8cCFUfUDqyj0KcAN2BcBi5s+kGKdVUMI+VBvcMGVvSjMaOIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40f4fff01e12eb8d6c976aeb8dcbb824b4a4adcc52f661405e477be841916bc6","last_reissued_at":"2026-05-18T03:02:21.421173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:21.421173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.5150","source_version":3,"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-18T03:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQFRcj7P3yQzArPClVx4j5tfb1Vip7Fi27hlotdLpmkxK2zBs9YhPJx2RJccePRydYeSwVzn5w9x5Df4w4ZZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:03.094492Z"},"content_sha256":"284ed07cc315889ed5e5ea51343a14633cda3be5c8b7dbf4c637d7b82e7e66cd","schema_version":"1.0","event_id":"sha256:284ed07cc315889ed5e5ea51343a14633cda3be5c8b7dbf4c637d7b82e7e66cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ID2P74A6CLVY23EXNLVY3S5YES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Path ORAM: An Extremely Simple Oblivious RAM Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christopher Fletcher, Elaine Shi, Emil Stefanov, Ling Ren, Marten van Dijk, Srinivas Devadas, T-H. Hubert Chan, Xiangyao Yu","submitted_at":"2012-02-23T11:05:34Z","abstract_excerpt":"We present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Omega(log^2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5150","kind":"arxiv","version":3},"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-18T03:02:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6Pjza1zLxDIFEyW/QlBTiAxaDVLfHkVqN9W0XfdMqIa4wz5rnEXEb/sx3452m94sb6lNnp2PCnaJCJyULpIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:28:03.094877Z"},"content_sha256":"ea34e130e941949b94b7227010bf7589985a96a39b6cc401b121eb288cc7735f","schema_version":"1.0","event_id":"sha256:ea34e130e941949b94b7227010bf7589985a96a39b6cc401b121eb288cc7735f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ID2P74A6CLVY23EXNLVY3S5YES/bundle.json","state_url":"https://pith.science/pith/ID2P74A6CLVY23EXNLVY3S5YES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ID2P74A6CLVY23EXNLVY3S5YES/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-26T20:28:03Z","links":{"resolver":"https://pith.science/pith/ID2P74A6CLVY23EXNLVY3S5YES","bundle":"https://pith.science/pith/ID2P74A6CLVY23EXNLVY3S5YES/bundle.json","state":"https://pith.science/pith/ID2P74A6CLVY23EXNLVY3S5YES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ID2P74A6CLVY23EXNLVY3S5YES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ID2P74A6CLVY23EXNLVY3S5YES","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":"a614172c53f2d54d2a7fe60c3b413e44b71b1f4c5d0c0561fb59be5d254fe93f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-23T11:05:34Z","title_canon_sha256":"be2d7ab37d52cf62d0d87c45b70852286bd72debb05bdd5aee1271656c574731"},"schema_version":"1.0","source":{"id":"1202.5150","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.5150","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"arxiv_version","alias_value":"1202.5150v3","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5150","created_at":"2026-05-18T03:02:21Z"},{"alias_kind":"pith_short_12","alias_value":"ID2P74A6CLVY","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ID2P74A6CLVY23EX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ID2P74A6","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:ea34e130e941949b94b7227010bf7589985a96a39b6cc401b121eb288cc7735f","target":"graph","created_at":"2026-05-18T03:02:21Z","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 present Path ORAM, an extremely simple Oblivious RAM protocol with a small amount of client storage. Partly due to its simplicity, Path ORAM is the most practical ORAM scheme known to date with small client storage. We formally prove that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Omega(log^2 N) bits. For such block sizes, Path ORAM is asymptotically better than the best known ORAM schemes with small client storage. Due to its practicality, Path ORAM has been adopted in the design of secure processors since its proposal.","authors_text":"Christopher Fletcher, Elaine Shi, Emil Stefanov, Ling Ren, Marten van Dijk, Srinivas Devadas, T-H. Hubert Chan, Xiangyao Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-23T11:05:34Z","title":"Path ORAM: An Extremely Simple Oblivious RAM Protocol"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5150","kind":"arxiv","version":3},"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:284ed07cc315889ed5e5ea51343a14633cda3be5c8b7dbf4c637d7b82e7e66cd","target":"record","created_at":"2026-05-18T03:02:21Z","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":"a614172c53f2d54d2a7fe60c3b413e44b71b1f4c5d0c0561fb59be5d254fe93f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-23T11:05:34Z","title_canon_sha256":"be2d7ab37d52cf62d0d87c45b70852286bd72debb05bdd5aee1271656c574731"},"schema_version":"1.0","source":{"id":"1202.5150","kind":"arxiv","version":3}},"canonical_sha256":"40f4fff01e12eb8d6c976aeb8dcbb824b4a4adcc52f661405e477be841916bc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40f4fff01e12eb8d6c976aeb8dcbb824b4a4adcc52f661405e477be841916bc6","first_computed_at":"2026-05-18T03:02:21.421173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:21.421173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Yd8nBStmfRZCJ6HwA6mQDGVREnPIQ9TASoHv8cCFUfUDqyj0KcAN2BcBi5s+kGKdVUMI+VBvcMGVvSjMaOIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:21.421855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.5150","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:284ed07cc315889ed5e5ea51343a14633cda3be5c8b7dbf4c637d7b82e7e66cd","sha256:ea34e130e941949b94b7227010bf7589985a96a39b6cc401b121eb288cc7735f"],"state_sha256":"2f84e3e4ee91869ce65225d1c498873a16ef223e54989540146cc14bb8fc828e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XT4+YxFj1Hu+yS1m+PJdbyvWsFgGVMbTiHz3je+NI18i/FkdQKhKSwu73TO3a+t+ImSwJtP4tAzfxk9Bc24Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:28:03.098067Z","bundle_sha256":"88121d830a239a93335ced12213431ccb21c2929128108dc3be5a305194a20be"}}