{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RYUZ6BGIPMEGEBS32XMD7ODG3I","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":"a2111c9b8823d0e3b4090d7ad23c2197b8ee104561663b3ed485a1e2edc1f4ef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-06T20:51:26Z","title_canon_sha256":"161a4d0715f21d1b329cd07525b9f272129df5e9183a18aa79dbf5e5308a8662"},"schema_version":"1.0","source":{"id":"1901.01605","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01605","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01605v2","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01605","created_at":"2026-05-17T23:48:39Z"},{"alias_kind":"pith_short_12","alias_value":"RYUZ6BGIPMEG","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RYUZ6BGIPMEGEBS3","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RYUZ6BGI","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:ba29db9fbcea05e42ce8b7efffd5c7edac8720d186e4be65073be5e227c8b6a4","target":"graph","created_at":"2026-05-17T23:48:39Z","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":"A functional $k$-PIR code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information symbols. Any linear combination of the $s$ information symbols can be recovered by $k$ disjoint subsets of servers. The goal is to find the smallest number of servers for given $k$ and $s$. We provide lower bounds on the number of servers and constructions which yield upper bounds on this number. For $k \\leq 4$, exact bounds on the number of servers are proved. Furthermore, we provide some asymptotic bounds. The problem coincides with the well known private inf","authors_text":"Eitan Yaakobi, Tuvi Etzion, Yiwei Zhang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-06T20:51:26Z","title":"Bounds on the Length of Functional PIR and Batch codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01605","kind":"arxiv","version":2},"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:392a981fe65d1cb4ad9cd5980587016939d9a48391ed2117a9eb764eb79b5ddc","target":"record","created_at":"2026-05-17T23:48:39Z","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":"a2111c9b8823d0e3b4090d7ad23c2197b8ee104561663b3ed485a1e2edc1f4ef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-06T20:51:26Z","title_canon_sha256":"161a4d0715f21d1b329cd07525b9f272129df5e9183a18aa79dbf5e5308a8662"},"schema_version":"1.0","source":{"id":"1901.01605","kind":"arxiv","version":2}},"canonical_sha256":"8e299f04c87b0862065bd5d83fb866da36c3c8b2b288faa0df42818466e4119d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e299f04c87b0862065bd5d83fb866da36c3c8b2b288faa0df42818466e4119d","first_computed_at":"2026-05-17T23:48:39.606201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:39.606201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uSQQzLtCyPGJpGES17QqWIrXKJXlF4lX40JbFBUVHpTp6gkG0CCkR6SaKEqGIZX4hbO2fs8DqT3fUJoG+CbuDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:39.606807Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01605","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:392a981fe65d1cb4ad9cd5980587016939d9a48391ed2117a9eb764eb79b5ddc","sha256:ba29db9fbcea05e42ce8b7efffd5c7edac8720d186e4be65073be5e227c8b6a4"],"state_sha256":"3e0773f90f2228855fb0994fa953489cfcd9fb33ed448fb8fb0e4625ce218490"}