{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GO3UJUCXJJ6MRSSCF6KU3TMVZW","short_pith_number":"pith:GO3UJUCX","canonical_record":{"source":{"id":"1410.2920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T22:21:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"857aeeddd66755a597f9a95ecec2d8d3ef3b9d3209d84fafab2e8a4ccbbf52b8","abstract_canon_sha256":"36344d275c8e45a8c105ef8840ac92a78757034959e180a5665944df4b9506bb"},"schema_version":"1.0"},"canonical_sha256":"33b744d0574a7cc8ca422f954dcd95cdb74fdc11236d596a1b0d9abed38561e4","source":{"kind":"arxiv","id":"1410.2920","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2920","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2920v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2920","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"GO3UJUCXJJ6M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO3UJUCXJJ6MRSSC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO3UJUCX","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GO3UJUCXJJ6MRSSCF6KU3TMVZW","target":"record","payload":{"canonical_record":{"source":{"id":"1410.2920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T22:21:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"857aeeddd66755a597f9a95ecec2d8d3ef3b9d3209d84fafab2e8a4ccbbf52b8","abstract_canon_sha256":"36344d275c8e45a8c105ef8840ac92a78757034959e180a5665944df4b9506bb"},"schema_version":"1.0"},"canonical_sha256":"33b744d0574a7cc8ca422f954dcd95cdb74fdc11236d596a1b0d9abed38561e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:17.443376Z","signature_b64":"YlsmLGUL1OQnQW0G0rcGed3vyHcn3B49SKrrq53aKMRo6VLUth1GhHTLpwEHOA5e0p/KybtgXZ1umHHuD18rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33b744d0574a7cc8ca422f954dcd95cdb74fdc11236d596a1b0d9abed38561e4","last_reissued_at":"2026-05-18T02:40:17.442888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:17.442888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.2920","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-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AOAMH34aMUsZtsa6Mmw/tpcCiNlLuukxQ8uZ79XE3iYfbSSYjrDFKHZ8JYtx9kUCrQgYriiunrgqAIb1VDSPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:32:20.488888Z"},"content_sha256":"620ae05e597bf552e515024c561cf8f8bc612834f0238cbbec25a60006fcb046","schema_version":"1.0","event_id":"sha256:620ae05e597bf552e515024c561cf8f8bc612834f0238cbbec25a60006fcb046"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GO3UJUCXJJ6MRSSCF6KU3TMVZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batch Codes through Dense Graphs without Short Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandros G. Dimakis, Ankit Singh Rawat, Anna Gal, Zhao Song","submitted_at":"2014-10-10T22:21:59Z","abstract_excerpt":"Consider a large database of $n$ data items that need to be stored using $m$ servers. We study how to encode information so that a large number $k$ of read requests can be performed in parallel while the rate remains constant (and ideally approaches one). This problem is equivalent to the design of multiset Batch Codes introduced by Ishai, Kushilevitz, Ostrovsky and Sahai [17].\n  We give families of multiset batch codes with asymptotically optimal rates of the form $1-1/\\text{poly}(k)$ and a number of servers $m$ scaling polynomially in the number of read requests $k$. An advantage of our batc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2920","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-18T02:40:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mmjiwv33xFDIWqww1oSWX7GhGVh6ggvLKGjtF1ImrO56K2CnKgjEl9qXRz3cXKMsPKH5mLgBW+LwzdjXmgX1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T16:32:20.489240Z"},"content_sha256":"f0402f544bbee77a157523def31e1fc97b511e351f0c4b8e3bbdd70f5da6098e","schema_version":"1.0","event_id":"sha256:f0402f544bbee77a157523def31e1fc97b511e351f0c4b8e3bbdd70f5da6098e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/bundle.json","state_url":"https://pith.science/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/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-07-03T16:32:20Z","links":{"resolver":"https://pith.science/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW","bundle":"https://pith.science/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/bundle.json","state":"https://pith.science/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GO3UJUCXJJ6MRSSCF6KU3TMVZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GO3UJUCXJJ6MRSSCF6KU3TMVZW","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":"36344d275c8e45a8c105ef8840ac92a78757034959e180a5665944df4b9506bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T22:21:59Z","title_canon_sha256":"857aeeddd66755a597f9a95ecec2d8d3ef3b9d3209d84fafab2e8a4ccbbf52b8"},"schema_version":"1.0","source":{"id":"1410.2920","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.2920","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"arxiv_version","alias_value":"1410.2920v1","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.2920","created_at":"2026-05-18T02:40:17Z"},{"alias_kind":"pith_short_12","alias_value":"GO3UJUCXJJ6M","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GO3UJUCXJJ6MRSSC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GO3UJUCX","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:f0402f544bbee77a157523def31e1fc97b511e351f0c4b8e3bbdd70f5da6098e","target":"graph","created_at":"2026-05-18T02:40:17Z","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":"Consider a large database of $n$ data items that need to be stored using $m$ servers. We study how to encode information so that a large number $k$ of read requests can be performed in parallel while the rate remains constant (and ideally approaches one). This problem is equivalent to the design of multiset Batch Codes introduced by Ishai, Kushilevitz, Ostrovsky and Sahai [17].\n  We give families of multiset batch codes with asymptotically optimal rates of the form $1-1/\\text{poly}(k)$ and a number of servers $m$ scaling polynomially in the number of read requests $k$. An advantage of our batc","authors_text":"Alexandros G. Dimakis, Ankit Singh Rawat, Anna Gal, Zhao Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T22:21:59Z","title":"Batch Codes through Dense Graphs without Short Cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.2920","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:620ae05e597bf552e515024c561cf8f8bc612834f0238cbbec25a60006fcb046","target":"record","created_at":"2026-05-18T02:40:17Z","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":"36344d275c8e45a8c105ef8840ac92a78757034959e180a5665944df4b9506bb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-10T22:21:59Z","title_canon_sha256":"857aeeddd66755a597f9a95ecec2d8d3ef3b9d3209d84fafab2e8a4ccbbf52b8"},"schema_version":"1.0","source":{"id":"1410.2920","kind":"arxiv","version":1}},"canonical_sha256":"33b744d0574a7cc8ca422f954dcd95cdb74fdc11236d596a1b0d9abed38561e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33b744d0574a7cc8ca422f954dcd95cdb74fdc11236d596a1b0d9abed38561e4","first_computed_at":"2026-05-18T02:40:17.442888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:17.442888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YlsmLGUL1OQnQW0G0rcGed3vyHcn3B49SKrrq53aKMRo6VLUth1GhHTLpwEHOA5e0p/KybtgXZ1umHHuD18rDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:17.443376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.2920","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:620ae05e597bf552e515024c561cf8f8bc612834f0238cbbec25a60006fcb046","sha256:f0402f544bbee77a157523def31e1fc97b511e351f0c4b8e3bbdd70f5da6098e"],"state_sha256":"2cd1d73490acc094264ee6febae1984421c588671d594076f99fbcc86142b616"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27PPPeD1O0Mod7kYmifwlAtaJvZsGcxjOVT1Gajhe3iKpBvEohGkMZoeW5FPoJ8mEB3lYEfBqJnSMU/Q+uWFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T16:32:20.491233Z","bundle_sha256":"84a763c6d36b8e56bd554926e7039ae8b88ca7ecc0d8a7c4d7a85b9083d7310f"}}