{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NPNYKFYUUKHGJSDXDGG2IRPES7","short_pith_number":"pith:NPNYKFYU","schema_version":"1.0","canonical_sha256":"6bdb851714a28e64c877198da445e497d11d5a8ef2e8f84a19b958708c3c82f0","source":{"kind":"arxiv","id":"1511.04580","version":2},"attestation_state":"computed","paper":{"title":"On Erasure Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Mummert, Elizabeth Niese, JiYoon Jung, Michael W. Schroeder","submitted_at":"2015-11-14T17:09:15Z","abstract_excerpt":"Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers, each of which stores a subset of the items. A batch code is an arrangement for storing items on servers so that, for prescribed integers $k$ and $t$, any $k$ items can be retrieved by reading at most $t$ items from each server. Silberstein defined an erasure batch code (with redundancy $r$) as a batch code in which any $k$ items can be retrieved by reading at most $t$ items from each"},"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":"1511.04580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-14T17:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"58f0c4595fe620a6b6205286d6202571dcc842a95b0044cbf700313c85de8d49","abstract_canon_sha256":"abe2195d85bf70454f5d522a51561c1737da481dcfe7d518259d947f21026fe7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.843255Z","signature_b64":"lYUgRTLYx6b7fiTSI9SVZKQAObwD992aGPPujjj922K4XTekjbQ2/hgs837mfGadxcnOlw3trwF7lY/lopqrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bdb851714a28e64c877198da445e497d11d5a8ef2e8f84a19b958708c3c82f0","last_reissued_at":"2026-05-18T00:07:55.842491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.842491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Erasure Combinatorial Batch Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl Mummert, Elizabeth Niese, JiYoon Jung, Michael W. Schroeder","submitted_at":"2015-11-14T17:09:15Z","abstract_excerpt":"Combinatorial batch codes were defined by Paterson, Stinson, and Wei as purely combinatorial versions of the batch codes introduced by Ishai, Kushilevitz, Ostrovsky, and Sahai. There are $n$ items and $m$ servers, each of which stores a subset of the items. A batch code is an arrangement for storing items on servers so that, for prescribed integers $k$ and $t$, any $k$ items can be retrieved by reading at most $t$ items from each server. Silberstein defined an erasure batch code (with redundancy $r$) as a batch code in which any $k$ items can be retrieved by reading at most $t$ items from each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04580","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":"1511.04580","created_at":"2026-05-18T00:07:55.842621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.04580v2","created_at":"2026-05-18T00:07:55.842621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04580","created_at":"2026-05-18T00:07:55.842621+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPNYKFYUUKHG","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPNYKFYUUKHGJSDX","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPNYKFYU","created_at":"2026-05-18T12:29:34.919912+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/NPNYKFYUUKHGJSDXDGG2IRPES7","json":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7.json","graph_json":"https://pith.science/api/pith-number/NPNYKFYUUKHGJSDXDGG2IRPES7/graph.json","events_json":"https://pith.science/api/pith-number/NPNYKFYUUKHGJSDXDGG2IRPES7/events.json","paper":"https://pith.science/paper/NPNYKFYU"},"agent_actions":{"view_html":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7","download_json":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7.json","view_paper":"https://pith.science/paper/NPNYKFYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.04580&json=true","fetch_graph":"https://pith.science/api/pith-number/NPNYKFYUUKHGJSDXDGG2IRPES7/graph.json","fetch_events":"https://pith.science/api/pith-number/NPNYKFYUUKHGJSDXDGG2IRPES7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7/action/storage_attestation","attest_author":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7/action/author_attestation","sign_citation":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7/action/citation_signature","submit_replication":"https://pith.science/pith/NPNYKFYUUKHGJSDXDGG2IRPES7/action/replication_record"}},"created_at":"2026-05-18T00:07:55.842621+00:00","updated_at":"2026-05-18T00:07:55.842621+00:00"}