{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6MDOYRK46NRNAWFPK5SK6RKZCB","short_pith_number":"pith:6MDOYRK4","canonical_record":{"source":{"id":"1509.07422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-24T16:19:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ef1c2ca284a727dcf3f2a7da689f198d6462df4be421f6eae96f77b2ef79c132","abstract_canon_sha256":"f9fa2a291fd379e4feb5df34a7fb74e67bd37d06433cda76ec6750586538a328"},"schema_version":"1.0"},"canonical_sha256":"f306ec455cf362d058af5764af4559104e141e0892a0cd8ad9d4542d7fbb466e","source":{"kind":"arxiv","id":"1509.07422","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07422","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07422v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07422","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"6MDOYRK46NRN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6MDOYRK46NRNAWFP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6MDOYRK4","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6MDOYRK46NRNAWFPK5SK6RKZCB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-24T16:19:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ef1c2ca284a727dcf3f2a7da689f198d6462df4be421f6eae96f77b2ef79c132","abstract_canon_sha256":"f9fa2a291fd379e4feb5df34a7fb74e67bd37d06433cda76ec6750586538a328"},"schema_version":"1.0"},"canonical_sha256":"f306ec455cf362d058af5764af4559104e141e0892a0cd8ad9d4542d7fbb466e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.025787Z","signature_b64":"878B1cDZc80Vs6XWMWOg1Liirxg8HJzPiFgAHUQtdvmzm3XfRBtLesCeAMmEcfJdyBDbSBIHtiHvDL/HBhx+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f306ec455cf362d058af5764af4559104e141e0892a0cd8ad9d4542d7fbb466e","last_reissued_at":"2026-05-18T01:32:09.025056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.025056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07422","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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bx6o4aRD5bipnAScsOvCpW6//4e7VSkiTa12sBDgmxtPDDXJA93ql6z97N9t5O051k+RVkd/HvrL0eNAFbfHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:05.238834Z"},"content_sha256":"35b625eeb5e584f7e448b6c1a2e1c7981839a0352e18fce47c12b8e5a7678091","schema_version":"1.0","event_id":"sha256:35b625eeb5e584f7e448b6c1a2e1c7981839a0352e18fce47c12b8e5a7678091"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6MDOYRK46NRNAWFPK5SK6RKZCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Sequential Optimization with Applications to Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Craig Wilson, Venugopal V. Veeravalli","submitted_at":"2015-09-24T16:19:43Z","abstract_excerpt":"A framework is introduced for solving a sequence of slowly changing optimization problems, including those arising in regression and classification applications, using optimization algorithms such as stochastic gradient descent (SGD). The optimization problems change slowly in the sense that the minimizers change at either a fixed or bounded rate. 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 needed from the distributions underlying each problem in order to ensure that the ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07422","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-18T01:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiIKrQkTSBmCEzfLIQGDZmxjKrXM9P2RuivuoFrHdS9PN2RIvd6Qtn4bajk1NZV1GMV2x48RbVBmS93bYTY8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:19:05.239191Z"},"content_sha256":"4d36daddeeef411fccf69c37a5e4a5583796a87b701c04423f76e00e627887d4","schema_version":"1.0","event_id":"sha256:4d36daddeeef411fccf69c37a5e4a5583796a87b701c04423f76e00e627887d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/bundle.json","state_url":"https://pith.science/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/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-04T17:19:05Z","links":{"resolver":"https://pith.science/pith/6MDOYRK46NRNAWFPK5SK6RKZCB","bundle":"https://pith.science/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/bundle.json","state":"https://pith.science/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MDOYRK46NRNAWFPK5SK6RKZCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6MDOYRK46NRNAWFPK5SK6RKZCB","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":"f9fa2a291fd379e4feb5df34a7fb74e67bd37d06433cda76ec6750586538a328","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-24T16:19:43Z","title_canon_sha256":"ef1c2ca284a727dcf3f2a7da689f198d6462df4be421f6eae96f77b2ef79c132"},"schema_version":"1.0","source":{"id":"1509.07422","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07422","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07422v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07422","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"6MDOYRK46NRN","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6MDOYRK46NRNAWFP","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6MDOYRK4","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:4d36daddeeef411fccf69c37a5e4a5583796a87b701c04423f76e00e627887d4","target":"graph","created_at":"2026-05-18T01:32:09Z","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 is introduced for solving a sequence of slowly changing optimization problems, including those arising in regression and classification applications, using optimization algorithms such as stochastic gradient descent (SGD). The optimization problems change slowly in the sense that the minimizers change at either a fixed or bounded rate. 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 needed from the distributions underlying each problem in order to ensure that the ex","authors_text":"Craig Wilson, Venugopal V. Veeravalli","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-24T16:19:43Z","title":"Adaptive Sequential Optimization with Applications to Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07422","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:35b625eeb5e584f7e448b6c1a2e1c7981839a0352e18fce47c12b8e5a7678091","target":"record","created_at":"2026-05-18T01:32:09Z","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":"f9fa2a291fd379e4feb5df34a7fb74e67bd37d06433cda76ec6750586538a328","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-24T16:19:43Z","title_canon_sha256":"ef1c2ca284a727dcf3f2a7da689f198d6462df4be421f6eae96f77b2ef79c132"},"schema_version":"1.0","source":{"id":"1509.07422","kind":"arxiv","version":1}},"canonical_sha256":"f306ec455cf362d058af5764af4559104e141e0892a0cd8ad9d4542d7fbb466e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f306ec455cf362d058af5764af4559104e141e0892a0cd8ad9d4542d7fbb466e","first_computed_at":"2026-05-18T01:32:09.025056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.025056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"878B1cDZc80Vs6XWMWOg1Liirxg8HJzPiFgAHUQtdvmzm3XfRBtLesCeAMmEcfJdyBDbSBIHtiHvDL/HBhx+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.025787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07422","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35b625eeb5e584f7e448b6c1a2e1c7981839a0352e18fce47c12b8e5a7678091","sha256:4d36daddeeef411fccf69c37a5e4a5583796a87b701c04423f76e00e627887d4"],"state_sha256":"0dbc57d7af2354649183c18d905c7d895b987c7ad3e10d43de5514047cffd654"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N1Cd843Nblzklfr4LkccHf5Q/YaOdwEjs1YJvkHUOmup5348+OufA8GihwUwel+Ku6TlyXVcL+nRoNR4Eg4hBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:19:05.241361Z","bundle_sha256":"da0eaf1eea8a8418f5b523debfd1368a13c50f6f332e8e8c6f315a25cbc924a5"}}