{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S56KKJ5Z4CB7NZYCZSCGZ7TVXJ","short_pith_number":"pith:S56KKJ5Z","canonical_record":{"source":{"id":"1710.07386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T01:02:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15e46834779d1e535091582c5c1b4afdefe9f26d86a524856c9dca3db9f85698","abstract_canon_sha256":"c8e62aa65760ff7f4bfc32d4d1b99b9d5150759016b12d8b624b4bbc5396ba95"},"schema_version":"1.0"},"canonical_sha256":"977ca527b9e083f6e702cc846cfe75ba533c4f366eb4a8c2547e9e6e7eab21e1","source":{"kind":"arxiv","id":"1710.07386","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07386","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07386v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07386","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"S56KKJ5Z4CB7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S56KKJ5Z4CB7NZYC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S56KKJ5Z","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S56KKJ5Z4CB7NZYCZSCGZ7TVXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T01:02:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"15e46834779d1e535091582c5c1b4afdefe9f26d86a524856c9dca3db9f85698","abstract_canon_sha256":"c8e62aa65760ff7f4bfc32d4d1b99b9d5150759016b12d8b624b4bbc5396ba95"},"schema_version":"1.0"},"canonical_sha256":"977ca527b9e083f6e702cc846cfe75ba533c4f366eb4a8c2547e9e6e7eab21e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:24.978535Z","signature_b64":"QAiKnrx51Pe2ogy4mfnKxTvWUwCc8nq7b0XVJfJAQnkOG7QFNRj8//fCazdnwdi+5YsxJuW05xVpURNciu11BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977ca527b9e083f6e702cc846cfe75ba533c4f366eb4a8c2547e9e6e7eab21e1","last_reissued_at":"2026-05-18T00:32:24.977938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:24.977938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07386","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-05-18T00:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzYKxD5LxPz9TUGfbXSsgJO/ocNdA6CJDWODvkdkn9ZtaS7UzVHqerpDEwJVSMpa4cVstVf86U1VIK608PPvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:40:20.599066Z"},"content_sha256":"59781a4c5afadd55ec45a49363d2539e205db23905d0b884b3500348e0438434","schema_version":"1.0","event_id":"sha256:59781a4c5afadd55ec45a49363d2539e205db23905d0b884b3500348e0438434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S56KKJ5Z4CB7NZYCZSCGZ7TVXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batch Codes from Hamming and Reed-M\\\"uller Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexander Vetter, Felice Manganiello, Sophia Friesenhahn, Travis Baumbaugh, Yariana Diaz","submitted_at":"2017-10-20T01:02:43Z","abstract_excerpt":"Batch codes, introduced by Ishai et al. encode a string $x \\in \\Sigma^{k}$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this work provides batch properties of Reed-M\\\"uller codes. We look at locality and availability properties of first order Reed-M\\\"uller codes over any finite field. We then show that binary first order Reed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07386","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"},"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-05-18T00:32:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OxMWMz8/CkuuaG9WDQAa+ghIEW8+ncKLgbZPrzkAOx8e9hX0nr7LKdIrLHJ+1kBrvKtx1i5og5wCAnhgGek/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:40:20.599561Z"},"content_sha256":"8b7e884bd384a3dbf3b2cc85ade18f69827c527bc6b72a092573796f0dc866a8","schema_version":"1.0","event_id":"sha256:8b7e884bd384a3dbf3b2cc85ade18f69827c527bc6b72a092573796f0dc866a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/bundle.json","state_url":"https://pith.science/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/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-06-01T00:40:20Z","links":{"resolver":"https://pith.science/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ","bundle":"https://pith.science/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/bundle.json","state":"https://pith.science/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S56KKJ5Z4CB7NZYCZSCGZ7TVXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S56KKJ5Z4CB7NZYCZSCGZ7TVXJ","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":"c8e62aa65760ff7f4bfc32d4d1b99b9d5150759016b12d8b624b4bbc5396ba95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T01:02:43Z","title_canon_sha256":"15e46834779d1e535091582c5c1b4afdefe9f26d86a524856c9dca3db9f85698"},"schema_version":"1.0","source":{"id":"1710.07386","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07386","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07386v1","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07386","created_at":"2026-05-18T00:32:24Z"},{"alias_kind":"pith_short_12","alias_value":"S56KKJ5Z4CB7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S56KKJ5Z4CB7NZYC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S56KKJ5Z","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8b7e884bd384a3dbf3b2cc85ade18f69827c527bc6b72a092573796f0dc866a8","target":"graph","created_at":"2026-05-18T00:32:24Z","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"},"paper":{"abstract_excerpt":"Batch codes, introduced by Ishai et al. encode a string $x \\in \\Sigma^{k}$ into an $m$-tuple of strings, called buckets. In this paper we consider multiset batch codes wherein a set of $t$-users wish to access one bit of information each from the original string. We introduce a concept of optimal batch codes. We first show that binary Hamming codes are optimal batch codes. The main body of this work provides batch properties of Reed-M\\\"uller codes. We look at locality and availability properties of first order Reed-M\\\"uller codes over any finite field. We then show that binary first order Reed","authors_text":"Alexander Vetter, Felice Manganiello, Sophia Friesenhahn, Travis Baumbaugh, Yariana Diaz","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T01:02:43Z","title":"Batch Codes from Hamming and Reed-M\\\"uller Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07386","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:59781a4c5afadd55ec45a49363d2539e205db23905d0b884b3500348e0438434","target":"record","created_at":"2026-05-18T00:32:24Z","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":"c8e62aa65760ff7f4bfc32d4d1b99b9d5150759016b12d8b624b4bbc5396ba95","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-20T01:02:43Z","title_canon_sha256":"15e46834779d1e535091582c5c1b4afdefe9f26d86a524856c9dca3db9f85698"},"schema_version":"1.0","source":{"id":"1710.07386","kind":"arxiv","version":1}},"canonical_sha256":"977ca527b9e083f6e702cc846cfe75ba533c4f366eb4a8c2547e9e6e7eab21e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977ca527b9e083f6e702cc846cfe75ba533c4f366eb4a8c2547e9e6e7eab21e1","first_computed_at":"2026-05-18T00:32:24.977938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:24.977938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QAiKnrx51Pe2ogy4mfnKxTvWUwCc8nq7b0XVJfJAQnkOG7QFNRj8//fCazdnwdi+5YsxJuW05xVpURNciu11BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:24.978535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07386","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59781a4c5afadd55ec45a49363d2539e205db23905d0b884b3500348e0438434","sha256:8b7e884bd384a3dbf3b2cc85ade18f69827c527bc6b72a092573796f0dc866a8"],"state_sha256":"649f9638fb2b7a9b33858f5aa1916aa9eaea4031b2f631614625c4d81fe97b1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmjiZTbpvFtQjoVDlUgfEYErW9Jg54qLS3AhlcYb0yXKKIIyQU8UB6lKVw4TpvfFU8GsTKSQgM2N+JozN1N/DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:40:20.603345Z","bundle_sha256":"21e574646612ada9df5d268dad492e40c0233cc98b612d70034f674c9210ccdb"}}