{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MDF2GEU3NGHB2BAX576LMM66EY","short_pith_number":"pith:MDF2GEU3","canonical_record":{"source":{"id":"1509.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-22T04:25:54Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"1a143c724125ef1ffe0e5ae453c46913e08b8d64f37dec4a4f4178d0f36f57b7","abstract_canon_sha256":"09deb30f25f2500cb9743c5ebe27f2bdb84dfe4804a136a1a2de62e27c519c60"},"schema_version":"1.0"},"canonical_sha256":"60cba3129b698e1d0417effcb633de263dbbf2c07faa86fa6a6799acdfe4e5d6","source":{"kind":"arxiv","id":"1509.06459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06459","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06459v1","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06459","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"MDF2GEU3NGHB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MDF2GEU3NGHB2BAX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MDF2GEU3","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MDF2GEU3NGHB2BAX576LMM66EY","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-22T04:25:54Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"1a143c724125ef1ffe0e5ae453c46913e08b8d64f37dec4a4f4178d0f36f57b7","abstract_canon_sha256":"09deb30f25f2500cb9743c5ebe27f2bdb84dfe4804a136a1a2de62e27c519c60"},"schema_version":"1.0"},"canonical_sha256":"60cba3129b698e1d0417effcb633de263dbbf2c07faa86fa6a6799acdfe4e5d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:20.231583Z","signature_b64":"EgzqT953cJcCSmL4uFGldWPMNSK8mpzGhOp6hZf0jUCeIWW7Rs6KdE1P7u2ykSnZAl7hh5b7Z96OmLzwPiFNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60cba3129b698e1d0417effcb633de263dbbf2c07faa86fa6a6799acdfe4e5d6","last_reissued_at":"2026-05-18T01:32:20.230627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:20.230627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06459","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8EjNHeqPh+V8X+W1YjME3mqmX9VAsSnwSv5KT/sjVY/mONHs1EzL8UxWTsNT0N5Ig35RMsizMnGZHNIKoFpaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:57:42.232341Z"},"content_sha256":"0a5f7f4ec209f3da6036c3b20af7172d9b74a395da5996c8031a85909fb40b71","schema_version":"1.0","event_id":"sha256:0a5f7f4ec209f3da6036c3b20af7172d9b74a395da5996c8031a85909fb40b71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MDF2GEU3NGHB2BAX576LMM66EY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic gradient descent methods for estimation with large data sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"stat.CO","authors_text":"Dustin Tran, Edoardo M. Airoldi, Panos Toulis","submitted_at":"2015-09-22T04:25:54Z","abstract_excerpt":"We develop methods for parameter estimation in settings with large-scale data sets, where traditional methods are no longer tenable. Our methods rely on stochastic approximations, which are computationally efficient as they maintain one iterate as a parameter estimate, and successively update that iterate based on a single data point. When the update is based on a noisy gradient, the stochastic approximation is known as standard stochastic gradient descent, which has been fundamental in modern applications with large data sets. Additionally, our methods are numerically stable because they empl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06459","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TrzXj0JPaKCbt4v2UgsmnItiH+Bh1A/hCXodCB+wKv1w0hCT99+J3ktBzEy8d33X+1CJGN4gkKv3m+1EowtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:57:42.233016Z"},"content_sha256":"36417c15ab4fe50bb21e53aacb4f56b9d700daa2ec83db406dbca63a242bb710","schema_version":"1.0","event_id":"sha256:36417c15ab4fe50bb21e53aacb4f56b9d700daa2ec83db406dbca63a242bb710"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDF2GEU3NGHB2BAX576LMM66EY/bundle.json","state_url":"https://pith.science/pith/MDF2GEU3NGHB2BAX576LMM66EY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDF2GEU3NGHB2BAX576LMM66EY/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-07T04:57:42Z","links":{"resolver":"https://pith.science/pith/MDF2GEU3NGHB2BAX576LMM66EY","bundle":"https://pith.science/pith/MDF2GEU3NGHB2BAX576LMM66EY/bundle.json","state":"https://pith.science/pith/MDF2GEU3NGHB2BAX576LMM66EY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDF2GEU3NGHB2BAX576LMM66EY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MDF2GEU3NGHB2BAX576LMM66EY","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":"09deb30f25f2500cb9743c5ebe27f2bdb84dfe4804a136a1a2de62e27c519c60","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-22T04:25:54Z","title_canon_sha256":"1a143c724125ef1ffe0e5ae453c46913e08b8d64f37dec4a4f4178d0f36f57b7"},"schema_version":"1.0","source":{"id":"1509.06459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06459","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06459v1","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06459","created_at":"2026-05-18T01:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"MDF2GEU3NGHB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MDF2GEU3NGHB2BAX","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MDF2GEU3","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:36417c15ab4fe50bb21e53aacb4f56b9d700daa2ec83db406dbca63a242bb710","target":"graph","created_at":"2026-05-18T01:32:20Z","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":"We develop methods for parameter estimation in settings with large-scale data sets, where traditional methods are no longer tenable. Our methods rely on stochastic approximations, which are computationally efficient as they maintain one iterate as a parameter estimate, and successively update that iterate based on a single data point. When the update is based on a noisy gradient, the stochastic approximation is known as standard stochastic gradient descent, which has been fundamental in modern applications with large data sets. Additionally, our methods are numerically stable because they empl","authors_text":"Dustin Tran, Edoardo M. Airoldi, Panos Toulis","cross_cats":["stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-22T04:25:54Z","title":"Stochastic gradient descent methods for estimation with large data sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06459","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:0a5f7f4ec209f3da6036c3b20af7172d9b74a395da5996c8031a85909fb40b71","target":"record","created_at":"2026-05-18T01:32:20Z","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":"09deb30f25f2500cb9743c5ebe27f2bdb84dfe4804a136a1a2de62e27c519c60","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-09-22T04:25:54Z","title_canon_sha256":"1a143c724125ef1ffe0e5ae453c46913e08b8d64f37dec4a4f4178d0f36f57b7"},"schema_version":"1.0","source":{"id":"1509.06459","kind":"arxiv","version":1}},"canonical_sha256":"60cba3129b698e1d0417effcb633de263dbbf2c07faa86fa6a6799acdfe4e5d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60cba3129b698e1d0417effcb633de263dbbf2c07faa86fa6a6799acdfe4e5d6","first_computed_at":"2026-05-18T01:32:20.230627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:20.230627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EgzqT953cJcCSmL4uFGldWPMNSK8mpzGhOp6hZf0jUCeIWW7Rs6KdE1P7u2ykSnZAl7hh5b7Z96OmLzwPiFNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:20.231583Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a5f7f4ec209f3da6036c3b20af7172d9b74a395da5996c8031a85909fb40b71","sha256:36417c15ab4fe50bb21e53aacb4f56b9d700daa2ec83db406dbca63a242bb710"],"state_sha256":"7d31c976e09bbaf08a6bf45c5c1f33862f4e9d6cab98de205b49537a3f3aa8d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7yY9TUpUocqvh7paeGUwNI+ECNO2kV5w1sHDvySEEuKT1koAPTAroZByO1A/MzKADHVeCULqeNJ1PqLmJ5MWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:57:42.236256Z","bundle_sha256":"76641abad0b462969dd7837833fe6f2d0e5b74e8e50b2732eea36a80145c7f3f"}}