{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:AEYPR4QCUSW4RBW6EK4RZBOWQL","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":"24314ea3613b1d42e72f3702d5f280c4dec5554bce1a25eb8451f244b3bafb34","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-19T12:26:14Z","title_canon_sha256":"61514bfda48e4c5470bc5091358bc12cba375c703a6b9aae1b331e701dc3cabf"},"schema_version":"1.0","source":{"id":"1312.5505","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5505","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5505v2","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5505","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"AEYPR4QCUSW4","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"AEYPR4QCUSW4RBW6","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"AEYPR4QC","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:2e8c567716e2af9aee6818ac73427d9e988241eed5b57502cb0e5f5443346696","target":"graph","created_at":"2026-05-18T02:37:58Z","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":"Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai, represent the distributed storage of an $n$-element data set on $m$ servers in such a way that any batch of $k$ data items can be retrieved by reading at most one (or more generally, $t$) items from each server, while keeping the total storage over $m$ servers equal to $N$. This paper considers a class of batch codes (for $t=1$), called combinatorial batch codes (CBC), where each server stores a subset of a database. A CBC is called optimal if the total storage $N$ is minimal for given $n,m$, and $k$. A $c$-uniform CBC is a co","authors_text":"Anna G\\'al, Natalia Silberstein","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-19T12:26:14Z","title":"Optimal Combinatorial Batch Codes based on Block Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5505","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:382ecd1f521b290c7e5e2ee67d123d34707d75c07bb2f29c2e929238c5f6dac3","target":"record","created_at":"2026-05-18T02:37:58Z","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":"24314ea3613b1d42e72f3702d5f280c4dec5554bce1a25eb8451f244b3bafb34","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-19T12:26:14Z","title_canon_sha256":"61514bfda48e4c5470bc5091358bc12cba375c703a6b9aae1b331e701dc3cabf"},"schema_version":"1.0","source":{"id":"1312.5505","kind":"arxiv","version":2}},"canonical_sha256":"0130f8f202a4adc886de22b91c85d682f05f596771b37ce702698b80bc0b7d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0130f8f202a4adc886de22b91c85d682f05f596771b37ce702698b80bc0b7d93","first_computed_at":"2026-05-18T02:37:58.856098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:58.856098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PEHbx/YdjPNdvXRqnmydNcG/yV4Imedc/PNZ64JepI+Ak54CE4l5SYdXccvq3L3R/znbfLZIiyGebSF1zoeiDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:58.856563Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5505","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:382ecd1f521b290c7e5e2ee67d123d34707d75c07bb2f29c2e929238c5f6dac3","sha256:2e8c567716e2af9aee6818ac73427d9e988241eed5b57502cb0e5f5443346696"],"state_sha256":"52fb181f0ac105976b14823427618cfc5ae9a840a7a535696191d9122cfa381d"}