{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RUPSX5CXQWLGIYSRVWMUPLI42U","short_pith_number":"pith:RUPSX5CX","schema_version":"1.0","canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","source":{"kind":"arxiv","id":"1502.02472","version":1},"attestation_state":"computed","paper":{"title":"Derandomized Construction of Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Srimanta Bhattacharya","submitted_at":"2015-02-09T13:09:59Z","abstract_excerpt":"Combinatorial Batch Codes (CBCs), replication-based variant of Batch Codes introduced by Ishai et al. in STOC 2004, abstracts the following data distribution problem: $n$ data items are to be replicated among $m$ servers in such a way that any $k$ of the $n$ data items can be retrieved by reading at most one item from each server with the total amount of storage over $m$ servers restricted to $N$. Given parameters $m, c,$ and $k$, where $c$ and $k$ are constants, one of the challenging problems is to construct $c$-uniform CBCs (CBCs where each data item is replicated among exactly $c$ servers)"},"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":"1502.02472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-09T13:09:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"08213d40fc9e75d262f3dd1c21540545973209011a1fa2fadf2201b9dfb90065","abstract_canon_sha256":"d05208af71e4ca5d1667545b186377d9002008606a8f2ae798087cc6e4c5aee1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:42.209167Z","signature_b64":"5zLXLgtKCBtk7jCL/sRrVZnUZ2nc3DTt5vviBLGN1ZAXARysQJ5TSpf/J2Y+BHFnkHt9yyTjqXhi0hVxMLHZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","last_reissued_at":"2026-05-18T02:27:42.208414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:42.208414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Derandomized Construction of Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Srimanta Bhattacharya","submitted_at":"2015-02-09T13:09:59Z","abstract_excerpt":"Combinatorial Batch Codes (CBCs), replication-based variant of Batch Codes introduced by Ishai et al. in STOC 2004, abstracts the following data distribution problem: $n$ data items are to be replicated among $m$ servers in such a way that any $k$ of the $n$ data items can be retrieved by reading at most one item from each server with the total amount of storage over $m$ servers restricted to $N$. Given parameters $m, c,$ and $k$, where $c$ and $k$ are constants, one of the challenging problems is to construct $c$-uniform CBCs (CBCs where each data item is replicated among exactly $c$ servers)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02472","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":"1502.02472","created_at":"2026-05-18T02:27:42.208533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.02472v1","created_at":"2026-05-18T02:27:42.208533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02472","created_at":"2026-05-18T02:27:42.208533+00:00"},{"alias_kind":"pith_short_12","alias_value":"RUPSX5CXQWLG","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RUPSX5CXQWLGIYSR","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RUPSX5CX","created_at":"2026-05-18T12:29:39.896362+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/RUPSX5CXQWLGIYSRVWMUPLI42U","json":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U.json","graph_json":"https://pith.science/api/pith-number/RUPSX5CXQWLGIYSRVWMUPLI42U/graph.json","events_json":"https://pith.science/api/pith-number/RUPSX5CXQWLGIYSRVWMUPLI42U/events.json","paper":"https://pith.science/paper/RUPSX5CX"},"agent_actions":{"view_html":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U","download_json":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U.json","view_paper":"https://pith.science/paper/RUPSX5CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.02472&json=true","fetch_graph":"https://pith.science/api/pith-number/RUPSX5CXQWLGIYSRVWMUPLI42U/graph.json","fetch_events":"https://pith.science/api/pith-number/RUPSX5CXQWLGIYSRVWMUPLI42U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/action/storage_attestation","attest_author":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/action/author_attestation","sign_citation":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/action/citation_signature","submit_replication":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/action/replication_record"}},"created_at":"2026-05-18T02:27:42.208533+00:00","updated_at":"2026-05-18T02:27:42.208533+00:00"}