{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2ROORRA5ZEU54BFLKI2J72FFZA","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":"43f1e93094845cb517704319b8f4ffd2b76084016dd19bc5b07c3b709927d621","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-29T17:52:01Z","title_canon_sha256":"7918e27fcf9dc97195238702eeafc5b7a70e82ae0d2be3a2fd979b03ba45c4e2"},"schema_version":"1.0","source":{"id":"1908.11366","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11366","created_at":"2026-07-05T00:00:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11366v1","created_at":"2026-07-05T00:00:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11366","created_at":"2026-07-05T00:00:32Z"},{"alias_kind":"pith_short_12","alias_value":"2ROORRA5ZEU5","created_at":"2026-07-05T00:00:32Z"},{"alias_kind":"pith_short_16","alias_value":"2ROORRA5ZEU54BFL","created_at":"2026-07-05T00:00:32Z"},{"alias_kind":"pith_short_8","alias_value":"2ROORRA5","created_at":"2026-07-05T00:00:32Z"}],"graph_snapshots":[{"event_id":"sha256:d155428976c21f15aa3992e4eb9dc9d2d7f0abd107229d0861ec4417d245942e","target":"graph","created_at":"2026-07-05T00:00: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.11366/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of private information retrieval from $N$ \\emph{storage-constrained} databases. In this problem, a user wishes to retrieve a single message out of $M$ messages (of size $L$) without revealing any information about the identity of the message to individual databases. Each database stores $\\mu ML$ symbols, i.e., a $\\mu$ fraction of the entire library, where $\\frac{1}{N} \\leq \\mu \\leq 1$. Our goal is to characterize the optimal tradeoff curve for the storage cost (captured by $\\mu$) and the normalized download cost ($D/L$). We show that the download cost can be reduced by ","authors_text":"Batuhan Arasli, Karim Banawan, Sennur Ulukus","cross_cats":["cs.CR","cs.DB","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-29T17:52:01Z","title":"Improved Storage for Efficient Private Information Retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11366","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:72b9094d20dcf1420575abdce2bf456540e2be7d395ccee0e4ac4ad390a0ee15","target":"record","created_at":"2026-07-05T00:00: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":"43f1e93094845cb517704319b8f4ffd2b76084016dd19bc5b07c3b709927d621","cross_cats_sorted":["cs.CR","cs.DB","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-29T17:52:01Z","title_canon_sha256":"7918e27fcf9dc97195238702eeafc5b7a70e82ae0d2be3a2fd979b03ba45c4e2"},"schema_version":"1.0","source":{"id":"1908.11366","kind":"arxiv","version":1}},"canonical_sha256":"d45ce8c41dc929de04ab52349fe8a5c81d8bb3e3d114f39e1b0a1d74ebf0769f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d45ce8c41dc929de04ab52349fe8a5c81d8bb3e3d114f39e1b0a1d74ebf0769f","first_computed_at":"2026-07-05T00:00:32.935302Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:32.935302Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6QnJVODXmqg/HkzHzcyuowiN5Hwe1/BH+tFWtIRw5Cu6PBwOH11WnrGC1AgbE/q/ZGE9QsZT0w4ZYU2RmcGHDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:32.935758Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.11366","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72b9094d20dcf1420575abdce2bf456540e2be7d395ccee0e4ac4ad390a0ee15","sha256:d155428976c21f15aa3992e4eb9dc9d2d7f0abd107229d0861ec4417d245942e"],"state_sha256":"af7841bde05f7194f12117a896f225e786a81519f579fef68164aef3c2d32ed5"}