{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:CQXJY6Y3SYANSV75BR6GJKLXUD","short_pith_number":"pith:CQXJY6Y3","canonical_record":{"source":{"id":"2106.02163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-03T22:37:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3f7760710b08f6d462a8dd314b777adf8d3561d11c73bb52d20040c7f8dcdd1","abstract_canon_sha256":"a3eac4e9ef8374c5df4b96fec5f8931f7914543f31217c10a5fd7192ec7018cd"},"schema_version":"1.0"},"canonical_sha256":"142e9c7b1b9600d957fd0c7c64a977a0cfea6a649932b2f023d8816751f2595e","source":{"kind":"arxiv","id":"2106.02163","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.02163","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2106.02163v1","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02163","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"CQXJY6Y3SYAN","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQXJY6Y3SYANSV75","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQXJY6Y3","created_at":"2026-07-05T02:46:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:CQXJY6Y3SYANSV75BR6GJKLXUD","target":"record","payload":{"canonical_record":{"source":{"id":"2106.02163","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-03T22:37:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3f7760710b08f6d462a8dd314b777adf8d3561d11c73bb52d20040c7f8dcdd1","abstract_canon_sha256":"a3eac4e9ef8374c5df4b96fec5f8931f7914543f31217c10a5fd7192ec7018cd"},"schema_version":"1.0"},"canonical_sha256":"142e9c7b1b9600d957fd0c7c64a977a0cfea6a649932b2f023d8816751f2595e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:46:15.999678Z","signature_b64":"d9+rq47TEbBtldhI/NZHvG0YyXV7xN8oSMTwMg8aM2QZNcz0yWLFJMXVolPUruEYUVxfX9leAnaVNZg6E9ahAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142e9c7b1b9600d957fd0c7c64a977a0cfea6a649932b2f023d8816751f2595e","last_reissued_at":"2026-07-05T02:46:15.999217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:46:15.999217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.02163","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TpnfyZ2voj8H07ebb8kd2YKxc1Kj8ARUWWEaDs9QWfCBxUExeLFdktZO7RYd9PFRUbWp8ag4vB4CDuoASuDuAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T03:11:48.908740Z"},"content_sha256":"769abe7b776938dccd1dca60832c5cce6945afe5d5807695d63bbd70d0dfd6d7","schema_version":"1.0","event_id":"sha256:769abe7b776938dccd1dca60832c5cce6945afe5d5807695d63bbd70d0dfd6d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:CQXJY6Y3SYANSV75BR6GJKLXUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved batch code lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mary Wootters, Ray Li","submitted_at":"2021-06-03T22:37:06Z","abstract_excerpt":"Batch codes are a useful notion of locality for error correcting codes, originally introduced in the context of distributed storage and cryptography. Many constructions of batch codes have been given, but few lower bound (limitation) results are known, leaving gaps between the best known constructions and best known lower bounds. Towards determining the optimal redundancy of batch codes, we prove a new lower bound on the redundancy of batch codes. Specifically, we study (primitive, multiset) linear batch codes that systematically encode $n$ information symbols into $N$ codeword symbols, with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02163","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.02163/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:46:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bWt0ZFfWl/8wafH0F/bLIp6IswwckW2gLnnraThwpm0IIWUc+J59HLQ64cmGXRpR/EoeMEjOU0fzm97I/labAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T03:11:48.909153Z"},"content_sha256":"db4d4ab7d1d6d3b5643aff6557a7e97ae88b3c1d5532d4cde973083d956338b8","schema_version":"1.0","event_id":"sha256:db4d4ab7d1d6d3b5643aff6557a7e97ae88b3c1d5532d4cde973083d956338b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/bundle.json","state_url":"https://pith.science/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T03:11:48Z","links":{"resolver":"https://pith.science/pith/CQXJY6Y3SYANSV75BR6GJKLXUD","bundle":"https://pith.science/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/bundle.json","state":"https://pith.science/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQXJY6Y3SYANSV75BR6GJKLXUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:CQXJY6Y3SYANSV75BR6GJKLXUD","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":"a3eac4e9ef8374c5df4b96fec5f8931f7914543f31217c10a5fd7192ec7018cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-03T22:37:06Z","title_canon_sha256":"a3f7760710b08f6d462a8dd314b777adf8d3561d11c73bb52d20040c7f8dcdd1"},"schema_version":"1.0","source":{"id":"2106.02163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.02163","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"arxiv_version","alias_value":"2106.02163v1","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.02163","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_12","alias_value":"CQXJY6Y3SYAN","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_16","alias_value":"CQXJY6Y3SYANSV75","created_at":"2026-07-05T02:46:15Z"},{"alias_kind":"pith_short_8","alias_value":"CQXJY6Y3","created_at":"2026-07-05T02:46:15Z"}],"graph_snapshots":[{"event_id":"sha256:db4d4ab7d1d6d3b5643aff6557a7e97ae88b3c1d5532d4cde973083d956338b8","target":"graph","created_at":"2026-07-05T02:46:15Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.02163/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Batch codes are a useful notion of locality for error correcting codes, originally introduced in the context of distributed storage and cryptography. Many constructions of batch codes have been given, but few lower bound (limitation) results are known, leaving gaps between the best known constructions and best known lower bounds. Towards determining the optimal redundancy of batch codes, we prove a new lower bound on the redundancy of batch codes. Specifically, we study (primitive, multiset) linear batch codes that systematically encode $n$ information symbols into $N$ codeword symbols, with t","authors_text":"Mary Wootters, Ray Li","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-03T22:37:06Z","title":"Improved batch code lower bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.02163","kind":"arxiv","version":1},"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:769abe7b776938dccd1dca60832c5cce6945afe5d5807695d63bbd70d0dfd6d7","target":"record","created_at":"2026-07-05T02:46:15Z","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":"a3eac4e9ef8374c5df4b96fec5f8931f7914543f31217c10a5fd7192ec7018cd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2021-06-03T22:37:06Z","title_canon_sha256":"a3f7760710b08f6d462a8dd314b777adf8d3561d11c73bb52d20040c7f8dcdd1"},"schema_version":"1.0","source":{"id":"2106.02163","kind":"arxiv","version":1}},"canonical_sha256":"142e9c7b1b9600d957fd0c7c64a977a0cfea6a649932b2f023d8816751f2595e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142e9c7b1b9600d957fd0c7c64a977a0cfea6a649932b2f023d8816751f2595e","first_computed_at":"2026-07-05T02:46:15.999217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:46:15.999217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d9+rq47TEbBtldhI/NZHvG0YyXV7xN8oSMTwMg8aM2QZNcz0yWLFJMXVolPUruEYUVxfX9leAnaVNZg6E9ahAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:46:15.999678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.02163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:769abe7b776938dccd1dca60832c5cce6945afe5d5807695d63bbd70d0dfd6d7","sha256:db4d4ab7d1d6d3b5643aff6557a7e97ae88b3c1d5532d4cde973083d956338b8"],"state_sha256":"04aab51b9c86574bf046b66df5170b0e1dc362133948b6a39d4d7b265efe2af7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QSt/6Pw/NYixMCEFJNgTfSlUWWmNz0ft/UP0LLWlz/TlNTI+rZnO4FHCaUAu7hzEqXleKN6q8ZAGhnse3+s6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T03:11:48.911946Z","bundle_sha256":"725dbd55d048a72110cd4d1c76c1bee7b40bac31a8254820c6725c1dffe69816"}}