{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DWW3PQD3XDWEEBTLL6YSTFVBRF","short_pith_number":"pith:DWW3PQD3","schema_version":"1.0","canonical_sha256":"1dadb7c07bb8ec42066b5fb12996a1894ce7b554dd81b5a2021b4adb66f0c724","source":{"kind":"arxiv","id":"1102.4951","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Batch Codes: A Lower Bound and Optimal Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bimal Roy, Srimanta Bhattacharya, Sushmita Ruj","submitted_at":"2011-02-24T10:39:46Z","abstract_excerpt":"Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in such a way that any k of the n items can be retrieved by reading at most t items from each server, and that the total number of items stored in m servers is N . A Combinatorial batch code (CBC) is a batch code where each data item is stored without change, i.e., each stored data item is a copy of one of the n data items. One of the basic yet challenging problems is to find optimal CBCs, i.e., CBCs for which total st"},"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":"1102.4951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-02-24T10:39:46Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"50b5f78c98b91ecb92f7693d4040951ca0f3fc9b693e3fb1906b13fbc8f43fb8","abstract_canon_sha256":"23f4abc63cfce8b96b922b4e1109f2f01211886ab3040154e665c1cc5f6a0327"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:57.697206Z","signature_b64":"Sosf0wa3fTgXG6sJsx0pwupn5A9fuTf5dVuFZfNDp4otz/t/SWk9lcuD0lOqsZIcmw+6TdDJBuOw7DGaHN3+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dadb7c07bb8ec42066b5fb12996a1894ce7b554dd81b5a2021b4adb66f0c724","last_reissued_at":"2026-05-18T04:27:57.696557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:57.696557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Batch Codes: A Lower Bound and Optimal Constructions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bimal Roy, Srimanta Bhattacharya, Sushmita Ruj","submitted_at":"2011-02-24T10:39:46Z","abstract_excerpt":"Batch codes, introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [1], are methods for solving the following data storage problem: n data items are to be stored in m servers in such a way that any k of the n items can be retrieved by reading at most t items from each server, and that the total number of items stored in m servers is N . A Combinatorial batch code (CBC) is a batch code where each data item is stored without change, i.e., each stored data item is a copy of one of the n data items. One of the basic yet challenging problems is to find optimal CBCs, i.e., CBCs for which total st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4951","kind":"arxiv","version":1},"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":"1102.4951","created_at":"2026-05-18T04:27:57.696664+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4951v1","created_at":"2026-05-18T04:27:57.696664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4951","created_at":"2026-05-18T04:27:57.696664+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWW3PQD3XDWE","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWW3PQD3XDWEEBTL","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWW3PQD3","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.04041","citing_title":"Serving Every Symbol: All-Symbol PIR and Batch Codes","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF","json":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF.json","graph_json":"https://pith.science/api/pith-number/DWW3PQD3XDWEEBTLL6YSTFVBRF/graph.json","events_json":"https://pith.science/api/pith-number/DWW3PQD3XDWEEBTLL6YSTFVBRF/events.json","paper":"https://pith.science/paper/DWW3PQD3"},"agent_actions":{"view_html":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF","download_json":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF.json","view_paper":"https://pith.science/paper/DWW3PQD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4951&json=true","fetch_graph":"https://pith.science/api/pith-number/DWW3PQD3XDWEEBTLL6YSTFVBRF/graph.json","fetch_events":"https://pith.science/api/pith-number/DWW3PQD3XDWEEBTLL6YSTFVBRF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF/action/storage_attestation","attest_author":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF/action/author_attestation","sign_citation":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF/action/citation_signature","submit_replication":"https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF/action/replication_record"}},"created_at":"2026-05-18T04:27:57.696664+00:00","updated_at":"2026-05-18T04:27:57.696664+00:00"}