{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AEYPR4QCUSW4RBW6EK4RZBOWQL","short_pith_number":"pith:AEYPR4QC","schema_version":"1.0","canonical_sha256":"0130f8f202a4adc886de22b91c85d682f05f596771b37ce702698b80bc0b7d93","source":{"kind":"arxiv","id":"1312.5505","version":2},"attestation_state":"computed","paper":{"title":"Optimal Combinatorial Batch Codes based on Block Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anna G\\'al, Natalia Silberstein","submitted_at":"2013-12-19T12:26:14Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1312.5505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-19T12:26:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"61514bfda48e4c5470bc5091358bc12cba375c703a6b9aae1b331e701dc3cabf","abstract_canon_sha256":"24314ea3613b1d42e72f3702d5f280c4dec5554bce1a25eb8451f244b3bafb34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:58.856563Z","signature_b64":"PEHbx/YdjPNdvXRqnmydNcG/yV4Imedc/PNZ64JepI+Ak54CE4l5SYdXccvq3L3R/znbfLZIiyGebSF1zoeiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0130f8f202a4adc886de22b91c85d682f05f596771b37ce702698b80bc0b7d93","last_reissued_at":"2026-05-18T02:37:58.856098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:58.856098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Combinatorial Batch Codes based on Block Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anna G\\'al, Natalia Silberstein","submitted_at":"2013-12-19T12:26:14Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5505","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.5505","created_at":"2026-05-18T02:37:58.856171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5505v2","created_at":"2026-05-18T02:37:58.856171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5505","created_at":"2026-05-18T02:37:58.856171+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEYPR4QCUSW4","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEYPR4QCUSW4RBW6","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEYPR4QC","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL","json":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL.json","graph_json":"https://pith.science/api/pith-number/AEYPR4QCUSW4RBW6EK4RZBOWQL/graph.json","events_json":"https://pith.science/api/pith-number/AEYPR4QCUSW4RBW6EK4RZBOWQL/events.json","paper":"https://pith.science/paper/AEYPR4QC"},"agent_actions":{"view_html":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL","download_json":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL.json","view_paper":"https://pith.science/paper/AEYPR4QC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5505&json=true","fetch_graph":"https://pith.science/api/pith-number/AEYPR4QCUSW4RBW6EK4RZBOWQL/graph.json","fetch_events":"https://pith.science/api/pith-number/AEYPR4QCUSW4RBW6EK4RZBOWQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL/action/storage_attestation","attest_author":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL/action/author_attestation","sign_citation":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL/action/citation_signature","submit_replication":"https://pith.science/pith/AEYPR4QCUSW4RBW6EK4RZBOWQL/action/replication_record"}},"created_at":"2026-05-18T02:37:58.856171+00:00","updated_at":"2026-05-18T02:37:58.856171+00:00"}