{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WY46K3XU5BVG6XMVIDWDIXAUJI","short_pith_number":"pith:WY46K3XU","canonical_record":{"source":{"id":"1710.07746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T03:02:29Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b69c25ebc3d78a4603f72343e05ce177135fd3f1dce18d05bdba2e57f0eb1ba3","abstract_canon_sha256":"085ab83d23d477c5cdd94eabce382111c8f4a563dc7dac74c013380f89041b44"},"schema_version":"1.0"},"canonical_sha256":"b639e56ef4e86a6f5d9540ec345c144a3b2eea3c1d505ffe3bd1dd9bda6be30c","source":{"kind":"arxiv","id":"1710.07746","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07746","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07746v3","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07746","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"WY46K3XU5BVG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WY46K3XU5BVG6XMV","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WY46K3XU","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WY46K3XU5BVG6XMVIDWDIXAUJI","target":"record","payload":{"canonical_record":{"source":{"id":"1710.07746","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T03:02:29Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"b69c25ebc3d78a4603f72343e05ce177135fd3f1dce18d05bdba2e57f0eb1ba3","abstract_canon_sha256":"085ab83d23d477c5cdd94eabce382111c8f4a563dc7dac74c013380f89041b44"},"schema_version":"1.0"},"canonical_sha256":"b639e56ef4e86a6f5d9540ec345c144a3b2eea3c1d505ffe3bd1dd9bda6be30c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:30.468355Z","signature_b64":"LE8ECHaCMg2JCRDEu4TuHUBXQBVWlwEV39xaRak/wczfJItZUZRGVmrvdt9xRjwiwD0/qEe3ZL1PMZhHmaOMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b639e56ef4e86a6f5d9540ec345c144a3b2eea3c1d505ffe3bd1dd9bda6be30c","last_reissued_at":"2026-05-18T00:15:30.467721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:30.467721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.07746","source_version":3,"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:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q42dvg2xgACssVaNY31bGf7TuKAOV1Z/CXU8EwBeB+bj1ChtDSkMu2EfOYgC2lax8e7LMEteBpG7YPzKnPCCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:32:29.186504Z"},"content_sha256":"99b23966cd09f2c519c05fb94e852ede75fa2d18cdba40acd620da3b23f844c5","schema_version":"1.0","event_id":"sha256:99b23966cd09f2c519c05fb94e852ede75fa2d18cdba40acd620da3b23f844c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WY46K3XU5BVG6XMVIDWDIXAUJI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Backward Euler: An Implicit Gradient Descent Algorithm for $k$-means Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Adam Oberman, Minh Pham, Penghang Yin, Stanley Osher","submitted_at":"2017-10-21T03:02:29Z","abstract_excerpt":"In this paper, we propose an implicit gradient descent algorithm for the classic $k$-means problem. The implicit gradient step or backward Euler is solved via stochastic fixed-point iteration, in which we randomly sample a mini-batch gradient in every iteration. It is the average of the fixed-point trajectory that is carried over to the next gradient step. We draw connections between the proposed stochastic backward Euler and the recent entropy stochastic gradient descent (Entropy-SGD) for improving the training of deep neural networks. Numerical experiments on various synthetic and real datas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07746","kind":"arxiv","version":3},"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:15:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMMfBUMYNjlMTQRJ+PQNRt4JCTo7ppGpav5nF3xzMysvM0eBq2+/rz6n/0iEu64YX1ACOBCtGj6f9OxEmX5bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:32:29.187095Z"},"content_sha256":"04613ce6bffdf31bc4c5b6554c9bf3b8e7f2eea934df4ffc71e84eb45d2c5b16","schema_version":"1.0","event_id":"sha256:04613ce6bffdf31bc4c5b6554c9bf3b8e7f2eea934df4ffc71e84eb45d2c5b16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/bundle.json","state_url":"https://pith.science/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/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-31T16:32:29Z","links":{"resolver":"https://pith.science/pith/WY46K3XU5BVG6XMVIDWDIXAUJI","bundle":"https://pith.science/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/bundle.json","state":"https://pith.science/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY46K3XU5BVG6XMVIDWDIXAUJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WY46K3XU5BVG6XMVIDWDIXAUJI","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":"085ab83d23d477c5cdd94eabce382111c8f4a563dc7dac74c013380f89041b44","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T03:02:29Z","title_canon_sha256":"b69c25ebc3d78a4603f72343e05ce177135fd3f1dce18d05bdba2e57f0eb1ba3"},"schema_version":"1.0","source":{"id":"1710.07746","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07746","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07746v3","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07746","created_at":"2026-05-18T00:15:30Z"},{"alias_kind":"pith_short_12","alias_value":"WY46K3XU5BVG","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WY46K3XU5BVG6XMV","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WY46K3XU","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:04613ce6bffdf31bc4c5b6554c9bf3b8e7f2eea934df4ffc71e84eb45d2c5b16","target":"graph","created_at":"2026-05-18T00:15:30Z","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":"In this paper, we propose an implicit gradient descent algorithm for the classic $k$-means problem. The implicit gradient step or backward Euler is solved via stochastic fixed-point iteration, in which we randomly sample a mini-batch gradient in every iteration. It is the average of the fixed-point trajectory that is carried over to the next gradient step. We draw connections between the proposed stochastic backward Euler and the recent entropy stochastic gradient descent (Entropy-SGD) for improving the training of deep neural networks. Numerical experiments on various synthetic and real datas","authors_text":"Adam Oberman, Minh Pham, Penghang Yin, Stanley Osher","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T03:02:29Z","title":"Stochastic Backward Euler: An Implicit Gradient Descent Algorithm for $k$-means Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07746","kind":"arxiv","version":3},"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:99b23966cd09f2c519c05fb94e852ede75fa2d18cdba40acd620da3b23f844c5","target":"record","created_at":"2026-05-18T00:15:30Z","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":"085ab83d23d477c5cdd94eabce382111c8f4a563dc7dac74c013380f89041b44","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-21T03:02:29Z","title_canon_sha256":"b69c25ebc3d78a4603f72343e05ce177135fd3f1dce18d05bdba2e57f0eb1ba3"},"schema_version":"1.0","source":{"id":"1710.07746","kind":"arxiv","version":3}},"canonical_sha256":"b639e56ef4e86a6f5d9540ec345c144a3b2eea3c1d505ffe3bd1dd9bda6be30c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b639e56ef4e86a6f5d9540ec345c144a3b2eea3c1d505ffe3bd1dd9bda6be30c","first_computed_at":"2026-05-18T00:15:30.467721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:30.467721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LE8ECHaCMg2JCRDEu4TuHUBXQBVWlwEV39xaRak/wczfJItZUZRGVmrvdt9xRjwiwD0/qEe3ZL1PMZhHmaOMBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:30.468355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07746","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99b23966cd09f2c519c05fb94e852ede75fa2d18cdba40acd620da3b23f844c5","sha256:04613ce6bffdf31bc4c5b6554c9bf3b8e7f2eea934df4ffc71e84eb45d2c5b16"],"state_sha256":"225adadd52ba4026f6767aa863b67d0119eb8c01c6245ca96225045c51670997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B503QdVmvZYU2Iqgp/SKZ0EOmWJB+bAUQb3V4JDcMngzwTpD7QbEzvqvs/FiAnUPOxCur1S1R3hk6pT4vzcqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:32:29.189808Z","bundle_sha256":"4d2447f18331aa6a2cad8ae143c7a190f5f19f747a6942834d2110278f2ae474"}}