{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TS33M47YKCDVJK7RAMH6JEORNP","short_pith_number":"pith:TS33M47Y","canonical_record":{"source":{"id":"1906.08771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T17:53:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"91eb9f4ccb7dca28e120d3b0d6fecc90e895afb0699b1451f5e20e52036de851","abstract_canon_sha256":"ba23dd8d15edfddeb3bcb5e68299dabc850a1152acac511e4a5ae58fe8d3917b"},"schema_version":"1.0"},"canonical_sha256":"9cb7b673f8508754abf1030fe491d16bc59848e4fe9dc594a402c6c104346e6e","source":{"kind":"arxiv","id":"1906.08771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08771","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08771v1","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08771","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"TS33M47YKCDV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TS33M47YKCDVJK7R","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TS33M47Y","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TS33M47YKCDVJK7RAMH6JEORNP","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08771","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T17:53:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"91eb9f4ccb7dca28e120d3b0d6fecc90e895afb0699b1451f5e20e52036de851","abstract_canon_sha256":"ba23dd8d15edfddeb3bcb5e68299dabc850a1152acac511e4a5ae58fe8d3917b"},"schema_version":"1.0"},"canonical_sha256":"9cb7b673f8508754abf1030fe491d16bc59848e4fe9dc594a402c6c104346e6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.387460Z","signature_b64":"9HiwN6HkJHMwU7LmOB0hRmJupFYci/tHFlG9EnTUjjQTYjgDNtHw7mhkXp13kBEUwwgO/r79HqCOa8fOyvKvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cb7b673f8508754abf1030fe491d16bc59848e4fe9dc594a402c6c104346e6e","last_reissued_at":"2026-05-17T23:42:49.386919Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.386919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08771","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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INquguFnLlfyLIykaTqfzE6dyp8su1+XVm0i9sLiHTYOKnMkX3sFYkpH+dbGnEvbbQLBTBhh6mWmlKTTE80oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:43:24.850479Z"},"content_sha256":"7b8d62fea40b13f1d675318926978f72bd1f454b9ace409f62d9ac90d9d26c2b","schema_version":"1.0","event_id":"sha256:7b8d62fea40b13f1d675318926978f72bd1f454b9ace409f62d9ac90d9d26c2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TS33M47YKCDVJK7RAMH6JEORNP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Batch Selection for Training Deep Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"K J Joseph, Krishnakant Singh, Vamshi Teja R, Vineeth N Balasubramanian","submitted_at":"2019-06-20T17:53:15Z","abstract_excerpt":"Mini-batch gradient descent based methods are the de facto algorithms for training neural network architectures today. We introduce a mini-batch selection strategy based on submodular function maximization. Our novel submodular formulation captures the informativeness of each sample and diversity of the whole subset. We design an efficient, greedy algorithm which can give high-quality solutions to this NP-hard combinatorial optimization problem. Our extensive experiments on standard datasets show that the deep models trained using the proposed batch selection strategy provide better generaliza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08771","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-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1USoV3Gf9D0MRmvWVzarzuB3PYy8cSfcuzN0++zMx9tpCylqmaRIJrCjQ3JU7eqQJuJ8xOgo5wbvhap8fbluCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:43:24.851149Z"},"content_sha256":"55268ddd2d90986b51dadca6f2c233c285a2e3f58de97572ccb5d485a9f6421f","schema_version":"1.0","event_id":"sha256:55268ddd2d90986b51dadca6f2c233c285a2e3f58de97572ccb5d485a9f6421f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TS33M47YKCDVJK7RAMH6JEORNP/bundle.json","state_url":"https://pith.science/pith/TS33M47YKCDVJK7RAMH6JEORNP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TS33M47YKCDVJK7RAMH6JEORNP/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-05-26T13:43:24Z","links":{"resolver":"https://pith.science/pith/TS33M47YKCDVJK7RAMH6JEORNP","bundle":"https://pith.science/pith/TS33M47YKCDVJK7RAMH6JEORNP/bundle.json","state":"https://pith.science/pith/TS33M47YKCDVJK7RAMH6JEORNP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TS33M47YKCDVJK7RAMH6JEORNP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TS33M47YKCDVJK7RAMH6JEORNP","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":"ba23dd8d15edfddeb3bcb5e68299dabc850a1152acac511e4a5ae58fe8d3917b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T17:53:15Z","title_canon_sha256":"91eb9f4ccb7dca28e120d3b0d6fecc90e895afb0699b1451f5e20e52036de851"},"schema_version":"1.0","source":{"id":"1906.08771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08771","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08771v1","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08771","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"TS33M47YKCDV","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TS33M47YKCDVJK7R","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TS33M47Y","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:55268ddd2d90986b51dadca6f2c233c285a2e3f58de97572ccb5d485a9f6421f","target":"graph","created_at":"2026-05-17T23:42:49Z","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":"Mini-batch gradient descent based methods are the de facto algorithms for training neural network architectures today. We introduce a mini-batch selection strategy based on submodular function maximization. Our novel submodular formulation captures the informativeness of each sample and diversity of the whole subset. We design an efficient, greedy algorithm which can give high-quality solutions to this NP-hard combinatorial optimization problem. Our extensive experiments on standard datasets show that the deep models trained using the proposed batch selection strategy provide better generaliza","authors_text":"K J Joseph, Krishnakant Singh, Vamshi Teja R, Vineeth N Balasubramanian","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T17:53:15Z","title":"Submodular Batch Selection for Training Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08771","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:7b8d62fea40b13f1d675318926978f72bd1f454b9ace409f62d9ac90d9d26c2b","target":"record","created_at":"2026-05-17T23:42:49Z","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":"ba23dd8d15edfddeb3bcb5e68299dabc850a1152acac511e4a5ae58fe8d3917b","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2019-06-20T17:53:15Z","title_canon_sha256":"91eb9f4ccb7dca28e120d3b0d6fecc90e895afb0699b1451f5e20e52036de851"},"schema_version":"1.0","source":{"id":"1906.08771","kind":"arxiv","version":1}},"canonical_sha256":"9cb7b673f8508754abf1030fe491d16bc59848e4fe9dc594a402c6c104346e6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cb7b673f8508754abf1030fe491d16bc59848e4fe9dc594a402c6c104346e6e","first_computed_at":"2026-05-17T23:42:49.386919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.386919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9HiwN6HkJHMwU7LmOB0hRmJupFYci/tHFlG9EnTUjjQTYjgDNtHw7mhkXp13kBEUwwgO/r79HqCOa8fOyvKvAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.387460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b8d62fea40b13f1d675318926978f72bd1f454b9ace409f62d9ac90d9d26c2b","sha256:55268ddd2d90986b51dadca6f2c233c285a2e3f58de97572ccb5d485a9f6421f"],"state_sha256":"649c855eed1b573e7b7c3888e53e66eb89332afcbf8cd512faaf17fcd20450e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/A/H/ayvuO9OXpVO72oFMfZMSRS6wQT92FYy3hYBze/ONEMGWlh5yb4srO/3et1fqinPfBCTH3kiP8EZSzCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:43:24.854926Z","bundle_sha256":"45ec06d021a6325a0664bc5ed7803c1103a4cf417cfd025bd9f9439df6ddf250"}}