{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I2R23PU5PZGRODRXDGQ4OAHPWK","short_pith_number":"pith:I2R23PU5","canonical_record":{"source":{"id":"1704.08891","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-04-28T12:08:39Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"ce65b49bc11507619dab1a0d04fe86de34e24ac432275658282717d8c2e4bd85","abstract_canon_sha256":"388227c57cbb2f1398b89c1a4b4bed3e9ba35548db2296a73462695491c5265c"},"schema_version":"1.0"},"canonical_sha256":"46a3adbe9d7e4d170e3719a1c700efb29a3249e5cb7d9e0b632c1067a8a0d119","source":{"kind":"arxiv","id":"1704.08891","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08891","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08891v2","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08891","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"I2R23PU5PZGR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2R23PU5PZGRODRX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2R23PU5","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I2R23PU5PZGRODRXDGQ4OAHPWK","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08891","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-04-28T12:08:39Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"ce65b49bc11507619dab1a0d04fe86de34e24ac432275658282717d8c2e4bd85","abstract_canon_sha256":"388227c57cbb2f1398b89c1a4b4bed3e9ba35548db2296a73462695491c5265c"},"schema_version":"1.0"},"canonical_sha256":"46a3adbe9d7e4d170e3719a1c700efb29a3249e5cb7d9e0b632c1067a8a0d119","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:15.228706Z","signature_b64":"Uu8IYaeP7IT2boFKPSCqgtS00g4aCTp7Zs/xDqahmkYqPusB+B/jtCLREFJSzfTjUu2+hDRnJlXuEmFRcN7OAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46a3adbe9d7e4d170e3719a1c700efb29a3249e5cb7d9e0b632c1067a8a0d119","last_reissued_at":"2026-05-18T00:34:15.228098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:15.228098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08891","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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53glVN+TGxPSUO/O6Au4UOBO3BzJ0e16PWEuwku3bfBn7qaCr1hBwqG24s4JBAjIxMOgXbaDJyk0gz/By4grDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:27:53.244605Z"},"content_sha256":"c88c16a716a191a80ca2b1887889940dc20efb7f5653b6e464133b6d27936257","schema_version":"1.0","event_id":"sha256:c88c16a716a191a80ca2b1887889940dc20efb7f5653b6e464133b6d27936257"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I2R23PU5PZGRODRXDGQ4OAHPWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Proximal Gradient Algorithms for Penalized Mixed Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Adeline Samson, Edouard Ollier, Gersende Fort","submitted_at":"2017-04-28T12:08:39Z","abstract_excerpt":"Motivated by penalized likelihood maximization in complex models, we study optimization problems where neither the function to optimize nor its gradient have an explicit expression, but its gradient can be approximated by a Monte Carlo technique. We propose a new algorithm based on a stochastic approximation of the Proximal-Gradient (PG) algorithm. This new algorithm, named Stochastic Approximation PG (SAPG) is the combination of a stochastic gradient descent step which - roughly speaking - computes a smoothed approximation of the past gradient along the iterations, and a proximal step. The ch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08891","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:34:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCg4VFstY+9XSd6S+ztE8nduMcLOYLCJbKH7lZDZU617DH/WyzGEzvs066vd8jzlws4yqbCTRdSYrdiyGuO6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:27:53.245014Z"},"content_sha256":"7ce0c92c637adcc55e79f51e37c70fae6bca391adca428c54f17eb48cd43a6cc","schema_version":"1.0","event_id":"sha256:7ce0c92c637adcc55e79f51e37c70fae6bca391adca428c54f17eb48cd43a6cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/bundle.json","state_url":"https://pith.science/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/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-21T10:27:53Z","links":{"resolver":"https://pith.science/pith/I2R23PU5PZGRODRXDGQ4OAHPWK","bundle":"https://pith.science/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/bundle.json","state":"https://pith.science/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2R23PU5PZGRODRXDGQ4OAHPWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I2R23PU5PZGRODRXDGQ4OAHPWK","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":"388227c57cbb2f1398b89c1a4b4bed3e9ba35548db2296a73462695491c5265c","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-04-28T12:08:39Z","title_canon_sha256":"ce65b49bc11507619dab1a0d04fe86de34e24ac432275658282717d8c2e4bd85"},"schema_version":"1.0","source":{"id":"1704.08891","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08891","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08891v2","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08891","created_at":"2026-05-18T00:34:15Z"},{"alias_kind":"pith_short_12","alias_value":"I2R23PU5PZGR","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2R23PU5PZGRODRX","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2R23PU5","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:7ce0c92c637adcc55e79f51e37c70fae6bca391adca428c54f17eb48cd43a6cc","target":"graph","created_at":"2026-05-18T00:34:15Z","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":"Motivated by penalized likelihood maximization in complex models, we study optimization problems where neither the function to optimize nor its gradient have an explicit expression, but its gradient can be approximated by a Monte Carlo technique. We propose a new algorithm based on a stochastic approximation of the Proximal-Gradient (PG) algorithm. This new algorithm, named Stochastic Approximation PG (SAPG) is the combination of a stochastic gradient descent step which - roughly speaking - computes a smoothed approximation of the past gradient along the iterations, and a proximal step. The ch","authors_text":"Adeline Samson, Edouard Ollier, Gersende Fort","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-04-28T12:08:39Z","title":"Stochastic Proximal Gradient Algorithms for Penalized Mixed Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08891","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:c88c16a716a191a80ca2b1887889940dc20efb7f5653b6e464133b6d27936257","target":"record","created_at":"2026-05-18T00:34:15Z","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":"388227c57cbb2f1398b89c1a4b4bed3e9ba35548db2296a73462695491c5265c","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-04-28T12:08:39Z","title_canon_sha256":"ce65b49bc11507619dab1a0d04fe86de34e24ac432275658282717d8c2e4bd85"},"schema_version":"1.0","source":{"id":"1704.08891","kind":"arxiv","version":2}},"canonical_sha256":"46a3adbe9d7e4d170e3719a1c700efb29a3249e5cb7d9e0b632c1067a8a0d119","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46a3adbe9d7e4d170e3719a1c700efb29a3249e5cb7d9e0b632c1067a8a0d119","first_computed_at":"2026-05-18T00:34:15.228098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:15.228098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uu8IYaeP7IT2boFKPSCqgtS00g4aCTp7Zs/xDqahmkYqPusB+B/jtCLREFJSzfTjUu2+hDRnJlXuEmFRcN7OAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:15.228706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08891","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88c16a716a191a80ca2b1887889940dc20efb7f5653b6e464133b6d27936257","sha256:7ce0c92c637adcc55e79f51e37c70fae6bca391adca428c54f17eb48cd43a6cc"],"state_sha256":"82a58dfb757f8fae98b215fe4bc5204cafe95495f1dbb016aed8f3be0a915497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpDj+9MvbfwFpBXG08L7vJNksmJIFgpnQkYDx97GA3qsaTSi+qwnNehSvLVBGC1i/hL6i1MBrwPKr0iUw1AZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T10:27:53.247985Z","bundle_sha256":"931d062899bfa157e2e2c55e454bb038b152ab47750d4f5fbfc13b23c71858ca"}}