{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KQZKQMZT7URDAP36KV6UXVPCLF","short_pith_number":"pith:KQZKQMZT","canonical_record":{"source":{"id":"1307.3699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-14T04:32:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a956774b5c1d804c2484e650743ce00de44848dddb5a703f7a27032e6243ebe1","abstract_canon_sha256":"115f74142ba8f404ab4370edc79a97caf04a8e87a6c73cba8795b5e25c1b0cd0"},"schema_version":"1.0"},"canonical_sha256":"5432a83333fd22303f7e557d4bd5e2596d42ae44d1de0e91078b832006eac4b4","source":{"kind":"arxiv","id":"1307.3699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3699","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3699v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3699","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"KQZKQMZT7URD","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KQZKQMZT7URDAP36","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KQZKQMZT","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KQZKQMZT7URDAP36KV6UXVPCLF","target":"record","payload":{"canonical_record":{"source":{"id":"1307.3699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-14T04:32:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a956774b5c1d804c2484e650743ce00de44848dddb5a703f7a27032e6243ebe1","abstract_canon_sha256":"115f74142ba8f404ab4370edc79a97caf04a8e87a6c73cba8795b5e25c1b0cd0"},"schema_version":"1.0"},"canonical_sha256":"5432a83333fd22303f7e557d4bd5e2596d42ae44d1de0e91078b832006eac4b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.156718Z","signature_b64":"d1eqXuDQbOYTID3mk8tI4387lNjeeZ/S9xWDe5E8YY1qo956l3XU8hUIiZB/DQAjmRc7a/t0guMySAV6C2VCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5432a83333fd22303f7e557d4bd5e2596d42ae44d1de0e91078b832006eac4b4","last_reissued_at":"2026-05-18T03:18:28.156195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.156195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.3699","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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAys1jo47S8bwKg0yf7V/CTn0sR4uR/xyNGzzEyvXZt15hGZtD2EJMvd0g07GjiY1XvPzPgWGJfRBVy8ij3JAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:26.084020Z"},"content_sha256":"d51f25d04d9b2e58bde9a30a95a8ec2845e276b8c0e66ac0fe16f2799ea30b53","schema_version":"1.0","event_id":"sha256:d51f25d04d9b2e58bde9a30a95a8ec2845e276b8c0e66ac0fe16f2799ea30b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KQZKQMZT7URDAP36KV6UXVPCLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistically-secure ORAM with $\\tilde{O}(\\log^2 n)$ Overhead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Kai-Min Chung, Rafael Pass, Zhenming Liu","submitted_at":"2013-07-14T04:32:12Z","abstract_excerpt":"We demonstrate a simple, statistically secure, ORAM with computational overhead $\\tilde{O}(\\log^2 n)$; previous ORAM protocols achieve only computational security (under computational assumptions) or require $\\tilde{\\Omega}(\\log^3 n)$ overheard. An additional benefit of our ORAM is its conceptual simplicity, which makes it easy to implement in both software and (commercially available) hardware.\n  Our construction is based on recent ORAM constructions due to Shi, Chan, Stefanov, and Li (Asiacrypt 2011) and Stefanov and Shi (ArXiv 2012), but with some crucial modifications in the algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3699","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-18T03:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5mo8NgR8GhL5mErmq+7xAdjaoQisHG6mVA5ZXF8l1X6wac2r/3kylf8OfWnaDKvA7o+P8nKZo+pNdGWadBuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:11:26.084730Z"},"content_sha256":"6b1b1f00c2e383492c6d3246d7590b6dc2b7f8eafdec8f28313b0c199dffc072","schema_version":"1.0","event_id":"sha256:6b1b1f00c2e383492c6d3246d7590b6dc2b7f8eafdec8f28313b0c199dffc072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQZKQMZT7URDAP36KV6UXVPCLF/bundle.json","state_url":"https://pith.science/pith/KQZKQMZT7URDAP36KV6UXVPCLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQZKQMZT7URDAP36KV6UXVPCLF/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-25T20:11:26Z","links":{"resolver":"https://pith.science/pith/KQZKQMZT7URDAP36KV6UXVPCLF","bundle":"https://pith.science/pith/KQZKQMZT7URDAP36KV6UXVPCLF/bundle.json","state":"https://pith.science/pith/KQZKQMZT7URDAP36KV6UXVPCLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQZKQMZT7URDAP36KV6UXVPCLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KQZKQMZT7URDAP36KV6UXVPCLF","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":"115f74142ba8f404ab4370edc79a97caf04a8e87a6c73cba8795b5e25c1b0cd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-14T04:32:12Z","title_canon_sha256":"a956774b5c1d804c2484e650743ce00de44848dddb5a703f7a27032e6243ebe1"},"schema_version":"1.0","source":{"id":"1307.3699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.3699","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1307.3699v1","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.3699","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"KQZKQMZT7URD","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KQZKQMZT7URDAP36","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KQZKQMZT","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:6b1b1f00c2e383492c6d3246d7590b6dc2b7f8eafdec8f28313b0c199dffc072","target":"graph","created_at":"2026-05-18T03:18:28Z","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 demonstrate a simple, statistically secure, ORAM with computational overhead $\\tilde{O}(\\log^2 n)$; previous ORAM protocols achieve only computational security (under computational assumptions) or require $\\tilde{\\Omega}(\\log^3 n)$ overheard. An additional benefit of our ORAM is its conceptual simplicity, which makes it easy to implement in both software and (commercially available) hardware.\n  Our construction is based on recent ORAM constructions due to Shi, Chan, Stefanov, and Li (Asiacrypt 2011) and Stefanov and Shi (ArXiv 2012), but with some crucial modifications in the algorithm that","authors_text":"Kai-Min Chung, Rafael Pass, Zhenming Liu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-14T04:32:12Z","title":"Statistically-secure ORAM with $\\tilde{O}(\\log^2 n)$ Overhead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.3699","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:d51f25d04d9b2e58bde9a30a95a8ec2845e276b8c0e66ac0fe16f2799ea30b53","target":"record","created_at":"2026-05-18T03:18:28Z","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":"115f74142ba8f404ab4370edc79a97caf04a8e87a6c73cba8795b5e25c1b0cd0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-07-14T04:32:12Z","title_canon_sha256":"a956774b5c1d804c2484e650743ce00de44848dddb5a703f7a27032e6243ebe1"},"schema_version":"1.0","source":{"id":"1307.3699","kind":"arxiv","version":1}},"canonical_sha256":"5432a83333fd22303f7e557d4bd5e2596d42ae44d1de0e91078b832006eac4b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5432a83333fd22303f7e557d4bd5e2596d42ae44d1de0e91078b832006eac4b4","first_computed_at":"2026-05-18T03:18:28.156195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:28.156195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1eqXuDQbOYTID3mk8tI4387lNjeeZ/S9xWDe5E8YY1qo956l3XU8hUIiZB/DQAjmRc7a/t0guMySAV6C2VCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:28.156718Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.3699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d51f25d04d9b2e58bde9a30a95a8ec2845e276b8c0e66ac0fe16f2799ea30b53","sha256:6b1b1f00c2e383492c6d3246d7590b6dc2b7f8eafdec8f28313b0c199dffc072"],"state_sha256":"1f67f4c0143dd5286b32f46df73d4d6bf0156149918fb8e63d3665859ab12b8f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CQNxKqaW9aLKEEIu0F3HeOEGXJu4M/OsGKs1givr00rC7NIX3wnr8MThxah0ClP+tzvQ7tecVL7BP5cQfCHGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:11:26.088614Z","bundle_sha256":"c5c2371e75fe791b14845e9b26add0af06981f568e779f1b26043a3ce673cbd9"}}