{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3XM4WYJWDXF3AMZYWCB7XI74KC","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":"8217295324e064e4e5b75a44e575602051beec82ff6a68e7d27dce3c26dbca7a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T18:09:41Z","title_canon_sha256":"ad3bd4a9c3c3e1b13af4d98bae2d5dbf5306a1d294b8c6e4c583b0d432e7c222"},"schema_version":"1.0","source":{"id":"1901.07490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07490","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07490v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07490","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"3XM4WYJWDXF3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3XM4WYJWDXF3AMZY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3XM4WYJW","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:406d7cb89c6f9c9bfd187e3dcf375ee275f65f26be33d5719c7aeeeee0475d4a","target":"graph","created_at":"2026-05-17T23:55:44Z","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":"Private information retrieval (PIR) allows a user to download one of $K$ messages from $N$ databases without revealing to any database which of the $K$ messages is being downloaded. In general, the databases can be storage constrained where each database can only store up to $\\mu K L$ bits where $\\frac{1}{N} \\leq \\mu \\leq 1$ and $L$ is the size of each message in bits. Let $t= \\mu N$, a recent work showed that the capacity of Storage Constrained PIR (SC-PIR) is $\\left( 1+ \\frac{1}{t} + \\frac{1}{t^2} + \\cdots + \\frac{1}{t^{K-1}} \\right)^{-1}$, which is achieved by a storage placement scheme ins","authors_text":"Mingyue Ji, Nicholas Woolsey, Rong-Rong Chen","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T18:09:41Z","title":"A New Design of Private Information Retrieval for Storage Constrained Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07490","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:c1e7e0c125ba74ed552e1a818eaebc72ee352ee09e8cedf7ad70468c5a8cc6b2","target":"record","created_at":"2026-05-17T23:55:44Z","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":"8217295324e064e4e5b75a44e575602051beec82ff6a68e7d27dce3c26dbca7a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-22T18:09:41Z","title_canon_sha256":"ad3bd4a9c3c3e1b13af4d98bae2d5dbf5306a1d294b8c6e4c583b0d432e7c222"},"schema_version":"1.0","source":{"id":"1901.07490","kind":"arxiv","version":1}},"canonical_sha256":"ddd9cb61361dcbb03338b083fba3fc50b58e47c9664640b2e3d8abea4fecc5cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddd9cb61361dcbb03338b083fba3fc50b58e47c9664640b2e3d8abea4fecc5cf","first_computed_at":"2026-05-17T23:55:44.640658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:44.640658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L/0obuFsBMwuwrqh8Sshx6OmyBvtfCF//NRFgEz44Kyq8wH4uJ1mBtuDX8OV2gORqzIFv0uejENr9QP/kWrGAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:44.641353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1e7e0c125ba74ed552e1a818eaebc72ee352ee09e8cedf7ad70468c5a8cc6b2","sha256:406d7cb89c6f9c9bfd187e3dcf375ee275f65f26be33d5719c7aeeeee0475d4a"],"state_sha256":"3e7a669479a50b66d34369ad3f32a4629d2cfcb3b046e75e007cdb67f17f892d"}