{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IUDQGYUWRRYTUNQZB5RRK22WD3","short_pith_number":"pith:IUDQGYUW","canonical_record":{"source":{"id":"1609.07027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6b9b2fc7634ff0ec8af8b0b5713a84aa553a973827b8b0a428a8ce3af7752099","abstract_canon_sha256":"d590a6ebada0f23d20aef0ae87ee4c86267e97537701165e3a7dcbccaef24d0f"},"schema_version":"1.0"},"canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","source":{"kind":"arxiv","id":"1609.07027","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07027","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07027v4","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07027","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUDQGYUWRRYT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IUDQGYUWRRYTUNQZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IUDQGYUW","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IUDQGYUWRRYTUNQZB5RRK22WD3","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07027","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"6b9b2fc7634ff0ec8af8b0b5713a84aa553a973827b8b0a428a8ce3af7752099","abstract_canon_sha256":"d590a6ebada0f23d20aef0ae87ee4c86267e97537701165e3a7dcbccaef24d0f"},"schema_version":"1.0"},"canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:18.272255Z","signature_b64":"1lVZa9N+WaroW/RSr59aOqEaWPfGcWL4sP2L4R7mOxUfzUBFm0QOi9/SjDqjDCaxb+G+AH8kFzWCIfIYKcIpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","last_reissued_at":"2026-05-17T23:59:18.271633Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:18.271633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07027","source_version":4,"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQiKvm+ov4SHs2QYHQOvE0XK5sy0VPJvDWZTnDiBS+XwwqTN8mmtJrFMXwTgDxEJGQzs2ebWK98mX/BnG537DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:56:52.886569Z"},"content_sha256":"f81727f4daba4d4a993c25856d60e2730bdeed28a6c352b75a40117da0ebebb1","schema_version":"1.0","event_id":"sha256:f81727f4daba4d4a993c25856d60e2730bdeed28a6c352b75a40117da0ebebb1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IUDQGYUWRRYTUNQZB5RRK22WD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PIR schemes with small download complexity and low storage requirements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Maura B. Paterson, Simon R. Blackburn, Tuvi Etzion","submitted_at":"2016-09-22T15:35:46Z","abstract_excerpt":"In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains information about which bit the user is interested in. The aim is to design schemes that minimise communication between the user and the servers. More recently, there have been moves to consider more realistic models where the total storage of the set of servers, or the per server storage, should be minimised (possibly using techniques from distributed storage), an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07027","kind":"arxiv","version":4},"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-17T23:59:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YC/00rd7rvurCyS3mzUrVh2OXV+GI8jR5akMADfMWx+9PdDJNrK2Yiy/5WHWk2FLDXC+xXVQkW7ywjyw3kEPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T18:56:52.886924Z"},"content_sha256":"cab64f1d3b2613ed2ee69d42c0dbc9f6bb359a1b6c737f0f01cbeee6c0f6d5ac","schema_version":"1.0","event_id":"sha256:cab64f1d3b2613ed2ee69d42c0dbc9f6bb359a1b6c737f0f01cbeee6c0f6d5ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/bundle.json","state_url":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/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-06-20T18:56:52Z","links":{"resolver":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3","bundle":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/bundle.json","state":"https://pith.science/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUDQGYUWRRYTUNQZB5RRK22WD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IUDQGYUWRRYTUNQZB5RRK22WD3","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":"d590a6ebada0f23d20aef0ae87ee4c86267e97537701165e3a7dcbccaef24d0f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","title_canon_sha256":"6b9b2fc7634ff0ec8af8b0b5713a84aa553a973827b8b0a428a8ce3af7752099"},"schema_version":"1.0","source":{"id":"1609.07027","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07027","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07027v4","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07027","created_at":"2026-05-17T23:59:18Z"},{"alias_kind":"pith_short_12","alias_value":"IUDQGYUWRRYT","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IUDQGYUWRRYTUNQZ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IUDQGYUW","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:cab64f1d3b2613ed2ee69d42c0dbc9f6bb359a1b6c737f0f01cbeee6c0f6d5ac","target":"graph","created_at":"2026-05-17T23:59:18Z","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":"In the classical model for (information theoretically secure) Private Information Retrieval (PIR), a user wishes to retrieve one bit of a database that is stored on a set of $n$ servers, in such a way that no individual server gains information about which bit the user is interested in. The aim is to design schemes that minimise communication between the user and the servers. More recently, there have been moves to consider more realistic models where the total storage of the set of servers, or the per server storage, should be minimised (possibly using techniques from distributed storage), an","authors_text":"Maura B. Paterson, Simon R. Blackburn, Tuvi Etzion","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","title":"PIR schemes with small download complexity and low storage requirements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07027","kind":"arxiv","version":4},"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:f81727f4daba4d4a993c25856d60e2730bdeed28a6c352b75a40117da0ebebb1","target":"record","created_at":"2026-05-17T23:59:18Z","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":"d590a6ebada0f23d20aef0ae87ee4c86267e97537701165e3a7dcbccaef24d0f","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-22T15:35:46Z","title_canon_sha256":"6b9b2fc7634ff0ec8af8b0b5713a84aa553a973827b8b0a428a8ce3af7752099"},"schema_version":"1.0","source":{"id":"1609.07027","kind":"arxiv","version":4}},"canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45070362968c713a36190f63156b561ee5dc502958ca71ae0ee222c530c3c401","first_computed_at":"2026-05-17T23:59:18.271633Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:18.271633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1lVZa9N+WaroW/RSr59aOqEaWPfGcWL4sP2L4R7mOxUfzUBFm0QOi9/SjDqjDCaxb+G+AH8kFzWCIfIYKcIpAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:18.272255Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07027","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f81727f4daba4d4a993c25856d60e2730bdeed28a6c352b75a40117da0ebebb1","sha256:cab64f1d3b2613ed2ee69d42c0dbc9f6bb359a1b6c737f0f01cbeee6c0f6d5ac"],"state_sha256":"31b292d79aaf739e90195f4548669bef6bda0a232250e3bfcf05c08b31c838cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+s1+tv0QTPii3zDp43UlDSRESa+kHG3xqge+UAppBwhO7OOjUOng13eNR351V1+E0fnmAFtmxwM/nqJ25pTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T18:56:52.889028Z","bundle_sha256":"cf439b60d3667aec4241e71f5f0016a2376be394d5fa8c19ee4cc2d31c4489d4"}}