{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A5KE4HW5NPUAPFV3W7D3PQL3A7","short_pith_number":"pith:A5KE4HW5","canonical_record":{"source":{"id":"1712.02029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-06T04:19:14Z","cross_cats_sorted":["cs.CV","cs.DC","stat.ML"],"title_canon_sha256":"5fe58d15f60cdab5d55ec0fa3e1a3eaba2c1696d3f95d9b0226330342c3016d6","abstract_canon_sha256":"7d050bfa8e36256f0a37f9312bb53dc2873f07b1fce9219b3461875f02343c4e"},"schema_version":"1.0"},"canonical_sha256":"07544e1edd6be80796bbb7c7b7c17b07c1d84aeff71194f46b86cb7767ea72f5","source":{"kind":"arxiv","id":"1712.02029","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02029","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02029v2","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02029","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"A5KE4HW5NPUA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A5KE4HW5NPUAPFV3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A5KE4HW5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A5KE4HW5NPUAPFV3W7D3PQL3A7","target":"record","payload":{"canonical_record":{"source":{"id":"1712.02029","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-06T04:19:14Z","cross_cats_sorted":["cs.CV","cs.DC","stat.ML"],"title_canon_sha256":"5fe58d15f60cdab5d55ec0fa3e1a3eaba2c1696d3f95d9b0226330342c3016d6","abstract_canon_sha256":"7d050bfa8e36256f0a37f9312bb53dc2873f07b1fce9219b3461875f02343c4e"},"schema_version":"1.0"},"canonical_sha256":"07544e1edd6be80796bbb7c7b7c17b07c1d84aeff71194f46b86cb7767ea72f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:22.799374Z","signature_b64":"ODhYqYOCfx2/IGjxJR4qkiB0oPtr/SWNYnpgBoSf1t170ufA0m4GlpGM2T4Fdg/Gzg2bxzwP3gzD6EcjAQyWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07544e1edd6be80796bbb7c7b7c17b07c1d84aeff71194f46b86cb7767ea72f5","last_reissued_at":"2026-05-18T00:23:22.798655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:22.798655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.02029","source_version":2,"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:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCMmR5YTS6GaODiYeQ2tDCnoyNhgUmNxU3J+jKItbaceRP33oNFEeZIMSAQvUV8Ai1skum3lkhu5cKrQkEE8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:56.832171Z"},"content_sha256":"61c5ce72649eeeb1fe26ffcdbda46249d685fa93fc9b02e117bd2f78c28bd8b7","schema_version":"1.0","event_id":"sha256:61c5ce72649eeeb1fe26ffcdbda46249d685fa93fc9b02e117bd2f78c28bd8b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A5KE4HW5NPUAPFV3W7D3PQL3A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaBatch: Adaptive Batch Sizes for Training Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aditya Devarakonda, Maxim Naumov, Michael Garland","submitted_at":"2017-12-06T04:19:14Z","abstract_excerpt":"Training deep neural networks with Stochastic Gradient Descent, or its variants, requires careful choice of both learning rate and batch size. While smaller batch sizes generally converge in fewer training epochs, larger batch sizes offer more parallelism and hence better computational efficiency. We have developed a new training approach that, rather than statically choosing a single batch size for all epochs, adaptively increases the batch size during the training process. Our method delivers the convergence rate of small batch sizes while achieving performance similar to large batch sizes. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02029","kind":"arxiv","version":2},"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:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DreUTDAcJVZxG+9xCISfsj9I0hNR67hKtXA2M6bYeAtvOvqxEMK3dBz+9NSYpx0N37gp7BUfIIiPQbZp+oknBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:44:56.832858Z"},"content_sha256":"663ea24e261ea205d198ffcf7f7321455b9f4c68d68a9686e17f5e02bbae0f4e","schema_version":"1.0","event_id":"sha256:663ea24e261ea205d198ffcf7f7321455b9f4c68d68a9686e17f5e02bbae0f4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/bundle.json","state_url":"https://pith.science/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/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-25T21:44:56Z","links":{"resolver":"https://pith.science/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7","bundle":"https://pith.science/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/bundle.json","state":"https://pith.science/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5KE4HW5NPUAPFV3W7D3PQL3A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A5KE4HW5NPUAPFV3W7D3PQL3A7","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":"7d050bfa8e36256f0a37f9312bb53dc2873f07b1fce9219b3461875f02343c4e","cross_cats_sorted":["cs.CV","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-06T04:19:14Z","title_canon_sha256":"5fe58d15f60cdab5d55ec0fa3e1a3eaba2c1696d3f95d9b0226330342c3016d6"},"schema_version":"1.0","source":{"id":"1712.02029","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.02029","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1712.02029v2","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02029","created_at":"2026-05-18T00:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"A5KE4HW5NPUA","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A5KE4HW5NPUAPFV3","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A5KE4HW5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:663ea24e261ea205d198ffcf7f7321455b9f4c68d68a9686e17f5e02bbae0f4e","target":"graph","created_at":"2026-05-18T00:23:22Z","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":"Training deep neural networks with Stochastic Gradient Descent, or its variants, requires careful choice of both learning rate and batch size. While smaller batch sizes generally converge in fewer training epochs, larger batch sizes offer more parallelism and hence better computational efficiency. We have developed a new training approach that, rather than statically choosing a single batch size for all epochs, adaptively increases the batch size during the training process. Our method delivers the convergence rate of small batch sizes while achieving performance similar to large batch sizes. ","authors_text":"Aditya Devarakonda, Maxim Naumov, Michael Garland","cross_cats":["cs.CV","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-06T04:19:14Z","title":"AdaBatch: Adaptive Batch Sizes for Training Deep Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02029","kind":"arxiv","version":2},"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:61c5ce72649eeeb1fe26ffcdbda46249d685fa93fc9b02e117bd2f78c28bd8b7","target":"record","created_at":"2026-05-18T00:23:22Z","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":"7d050bfa8e36256f0a37f9312bb53dc2873f07b1fce9219b3461875f02343c4e","cross_cats_sorted":["cs.CV","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-12-06T04:19:14Z","title_canon_sha256":"5fe58d15f60cdab5d55ec0fa3e1a3eaba2c1696d3f95d9b0226330342c3016d6"},"schema_version":"1.0","source":{"id":"1712.02029","kind":"arxiv","version":2}},"canonical_sha256":"07544e1edd6be80796bbb7c7b7c17b07c1d84aeff71194f46b86cb7767ea72f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07544e1edd6be80796bbb7c7b7c17b07c1d84aeff71194f46b86cb7767ea72f5","first_computed_at":"2026-05-18T00:23:22.798655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:22.798655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODhYqYOCfx2/IGjxJR4qkiB0oPtr/SWNYnpgBoSf1t170ufA0m4GlpGM2T4Fdg/Gzg2bxzwP3gzD6EcjAQyWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:22.799374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.02029","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61c5ce72649eeeb1fe26ffcdbda46249d685fa93fc9b02e117bd2f78c28bd8b7","sha256:663ea24e261ea205d198ffcf7f7321455b9f4c68d68a9686e17f5e02bbae0f4e"],"state_sha256":"bd39621da89ec45cc5a0bbd8a799bc6e1a1d6032928fa4ee8bd56df07e4bb869"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dYfb0k0Lz60okTbNaXE9K/D2mhVqTydqg0v04t9Adw++6cVdItoyy7E6aG2JaanEt4f2JH56ymC0vcD268jBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:44:56.836279Z","bundle_sha256":"a1947c1b43d9f501611610db3ad201dc9782b9541108306dba97ece7a1f7da57"}}