{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RUPSX5CXQWLGIYSRVWMUPLI42U","short_pith_number":"pith:RUPSX5CX","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"},"canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","source":{"kind":"arxiv","id":"1502.02472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02472","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02472v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02472","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"RUPSX5CXQWLG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUPSX5CXQWLGIYSR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUPSX5CX","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RUPSX5CXQWLGIYSRVWMUPLI42U","target":"record","payload":{"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"},"canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","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"},"source_kind":"arxiv","source_id":"1502.02472","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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HTdxc5SlsaAYhT3P+JnwQG24hCbBxGddCy3WCdhzrps5GkbekAaLNd2tbYu8IDh0CnKA4k+T6BfLnwQ3VVdICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:09:09.111538Z"},"content_sha256":"70fff323a1b06da1c1481f46b4e8d7fff79e2372281dc0c0ccd25bd027c63492","schema_version":"1.0","event_id":"sha256:70fff323a1b06da1c1481f46b4e8d7fff79e2372281dc0c0ccd25bd027c63492"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RUPSX5CXQWLGIYSRVWMUPLI42U","target":"graph","payload":{"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"},"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:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajefGzhfL0lbdF4iO7KYnBn03DrM46ukTsz7WT62+4WRpB1YOhx9WOmiv7FWVukD3n458Me27cuYQS7b3R4EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:09:09.111887Z"},"content_sha256":"1b5613c7d68f257ec2c87df1f0e9cb236b2402a7722d8501bf59e850823fe324","schema_version":"1.0","event_id":"sha256:1b5613c7d68f257ec2c87df1f0e9cb236b2402a7722d8501bf59e850823fe324"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/bundle.json","state_url":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/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-25T11:09:09Z","links":{"resolver":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U","bundle":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/bundle.json","state":"https://pith.science/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUPSX5CXQWLGIYSRVWMUPLI42U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RUPSX5CXQWLGIYSRVWMUPLI42U","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":"d05208af71e4ca5d1667545b186377d9002008606a8f2ae798087cc6e4c5aee1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-09T13:09:59Z","title_canon_sha256":"08213d40fc9e75d262f3dd1c21540545973209011a1fa2fadf2201b9dfb90065"},"schema_version":"1.0","source":{"id":"1502.02472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02472","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02472v1","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02472","created_at":"2026-05-18T02:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"RUPSX5CXQWLG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RUPSX5CXQWLGIYSR","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RUPSX5CX","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:1b5613c7d68f257ec2c87df1f0e9cb236b2402a7722d8501bf59e850823fe324","target":"graph","created_at":"2026-05-18T02:27:42Z","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":"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)","authors_text":"Srimanta Bhattacharya","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-09T13:09:59Z","title":"Derandomized Construction of Combinatorial Batch Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02472","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:70fff323a1b06da1c1481f46b4e8d7fff79e2372281dc0c0ccd25bd027c63492","target":"record","created_at":"2026-05-18T02:27:42Z","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":"d05208af71e4ca5d1667545b186377d9002008606a8f2ae798087cc6e4c5aee1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-02-09T13:09:59Z","title_canon_sha256":"08213d40fc9e75d262f3dd1c21540545973209011a1fa2fadf2201b9dfb90065"},"schema_version":"1.0","source":{"id":"1502.02472","kind":"arxiv","version":1}},"canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1f2bf4578596646251ad9947ad1cd50e431ed94414b45aad0814caa231c5ef","first_computed_at":"2026-05-18T02:27:42.208414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:42.208414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5zLXLgtKCBtk7jCL/sRrVZnUZ2nc3DTt5vviBLGN1ZAXARysQJ5TSpf/J2Y+BHFnkHt9yyTjqXhi0hVxMLHZDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:42.209167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fff323a1b06da1c1481f46b4e8d7fff79e2372281dc0c0ccd25bd027c63492","sha256:1b5613c7d68f257ec2c87df1f0e9cb236b2402a7722d8501bf59e850823fe324"],"state_sha256":"636ae51b87595f8fa38d135c682be9114da9f8f34b907902048f1d9e168c0c7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEFwKKxgoyGM096dIT4o4BMwyNRtHrOK0ai94toRJN2rD0wnFSzek+/NNw2OOJ384abNfgOdFLWJW9Oa2iBoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:09:09.113857Z","bundle_sha256":"5e96c073af594543f72c3ace141cfc4ad0d8e88b7ea4437f12d5cbe4f4f17f16"}}