{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WBIOCNTKH65QM7ZKJE7Y2TPH3G","short_pith_number":"pith:WBIOCNTK","canonical_record":{"source":{"id":"1904.02773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T20:03:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"128654d8d213d286ef7b6a0ac4bcdcd32167f2ab44858457c98d3a2430fdd3a5","abstract_canon_sha256":"52908f8d08a5969854ac79a4c3990ee73a3e14611f87b5d942036a406408779e"},"schema_version":"1.0"},"canonical_sha256":"b050e1366a3fbb067f2a493f8d4de7d9bf75daef87afcf16bdbf1bf31c16cf9c","source":{"kind":"arxiv","id":"1904.02773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02773","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02773v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02773","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"WBIOCNTKH65Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WBIOCNTKH65QM7ZK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WBIOCNTK","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WBIOCNTKH65QM7ZKJE7Y2TPH3G","target":"record","payload":{"canonical_record":{"source":{"id":"1904.02773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T20:03:46Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"128654d8d213d286ef7b6a0ac4bcdcd32167f2ab44858457c98d3a2430fdd3a5","abstract_canon_sha256":"52908f8d08a5969854ac79a4c3990ee73a3e14611f87b5d942036a406408779e"},"schema_version":"1.0"},"canonical_sha256":"b050e1366a3fbb067f2a493f8d4de7d9bf75daef87afcf16bdbf1bf31c16cf9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:19.686591Z","signature_b64":"BQznyOxg0UsbFYslz9jUstXHrKl9rPrmthyIkMFRCrb9Cf7Tl8fFnyPVh8J84SMapRUgjiSdrtRwxkH73e9jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b050e1366a3fbb067f2a493f8d4de7d9bf75daef87afcf16bdbf1bf31c16cf9c","last_reissued_at":"2026-05-17T23:49:19.686074Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:19.686074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.02773","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvNosFh4Yc5pqLlZPXeKewTYRYgL6FAQrdwnmUkC5g3o9ei1YrPUiCK4CPAUlkp1F4JLHdVof4P59s/cOMgtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:36:37.551741Z"},"content_sha256":"adf64fe526ffd5e76742bfb622d3f6886112980ddcbd29143c66df1d80e39227","schema_version":"1.0","event_id":"sha256:adf64fe526ffd5e76742bfb622d3f6886112980ddcbd29143c66df1d80e39227"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WBIOCNTKH65QM7ZKJE7Y2TPH3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Sequential Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Craig Wilson, Venugopal Veeravalli, Yuheng Bu","submitted_at":"2019-04-04T20:03:46Z","abstract_excerpt":"A framework previously introduced in [3] for solving a sequence of stochastic optimization problems with bounded changes in the minimizers is extended and applied to machine learning problems such as regression and classification. The stochastic optimization problems arising in these machine learning problems is solved using algorithms such as stochastic gradient descent (SGD). A method based on estimates of the change in the minimizers and properties of the optimization algorithm is introduced for adaptively selecting the number of samples at each time step to ensure that the excess risk, i.e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02773","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:49:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BIVcM3t6ZkABUOPk6lZKmREeb3jNQBI7/xdPah8RVXp44/rDIl+KlWGtARfRvPPJuGX595lRoMz9UWOQtK6HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:36:37.552174Z"},"content_sha256":"e03c81d8a54517dc802ee34b72e58b60693a1f78bb3c5a6fa9c406a9ef009e2b","schema_version":"1.0","event_id":"sha256:e03c81d8a54517dc802ee34b72e58b60693a1f78bb3c5a6fa9c406a9ef009e2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/bundle.json","state_url":"https://pith.science/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/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-01T15:36:37Z","links":{"resolver":"https://pith.science/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G","bundle":"https://pith.science/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/bundle.json","state":"https://pith.science/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBIOCNTKH65QM7ZKJE7Y2TPH3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WBIOCNTKH65QM7ZKJE7Y2TPH3G","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":"52908f8d08a5969854ac79a4c3990ee73a3e14611f87b5d942036a406408779e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T20:03:46Z","title_canon_sha256":"128654d8d213d286ef7b6a0ac4bcdcd32167f2ab44858457c98d3a2430fdd3a5"},"schema_version":"1.0","source":{"id":"1904.02773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02773","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02773v1","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02773","created_at":"2026-05-17T23:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"WBIOCNTKH65Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WBIOCNTKH65QM7ZK","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WBIOCNTK","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:e03c81d8a54517dc802ee34b72e58b60693a1f78bb3c5a6fa9c406a9ef009e2b","target":"graph","created_at":"2026-05-17T23:49:19Z","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":"A framework previously introduced in [3] for solving a sequence of stochastic optimization problems with bounded changes in the minimizers is extended and applied to machine learning problems such as regression and classification. The stochastic optimization problems arising in these machine learning problems is solved using algorithms such as stochastic gradient descent (SGD). A method based on estimates of the change in the minimizers and properties of the optimization algorithm is introduced for adaptively selecting the number of samples at each time step to ensure that the excess risk, i.e","authors_text":"Craig Wilson, Venugopal Veeravalli, Yuheng Bu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T20:03:46Z","title":"Adaptive Sequential Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02773","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:adf64fe526ffd5e76742bfb622d3f6886112980ddcbd29143c66df1d80e39227","target":"record","created_at":"2026-05-17T23:49:19Z","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":"52908f8d08a5969854ac79a4c3990ee73a3e14611f87b5d942036a406408779e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-04T20:03:46Z","title_canon_sha256":"128654d8d213d286ef7b6a0ac4bcdcd32167f2ab44858457c98d3a2430fdd3a5"},"schema_version":"1.0","source":{"id":"1904.02773","kind":"arxiv","version":1}},"canonical_sha256":"b050e1366a3fbb067f2a493f8d4de7d9bf75daef87afcf16bdbf1bf31c16cf9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b050e1366a3fbb067f2a493f8d4de7d9bf75daef87afcf16bdbf1bf31c16cf9c","first_computed_at":"2026-05-17T23:49:19.686074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:19.686074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BQznyOxg0UsbFYslz9jUstXHrKl9rPrmthyIkMFRCrb9Cf7Tl8fFnyPVh8J84SMapRUgjiSdrtRwxkH73e9jCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:19.686591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adf64fe526ffd5e76742bfb622d3f6886112980ddcbd29143c66df1d80e39227","sha256:e03c81d8a54517dc802ee34b72e58b60693a1f78bb3c5a6fa9c406a9ef009e2b"],"state_sha256":"0813065bae80f8cd5447c82ae75e41e95bbc085791501ff1dd07a15bd0646eff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+2WFcqQkNQPSwPzuO3YEQcCY/VQuzwZbFdIRxI+vFy96SZHVpUtiKu3bezhmgybHc9jtA5GZDdeWug+Wq1LCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:36:37.554312Z","bundle_sha256":"3b4ea85ffbb464a84a55bffdd66d76ea654beaa4991a380d8db05471a609b5f4"}}