{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZGL3EFV73BCQMQW6O6DZEPRSTC","short_pith_number":"pith:ZGL3EFV7","canonical_record":{"source":{"id":"1710.00578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-02T11:01:53Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"25b3e244decb28aae3f0652ff6fb965a1c2f1bc93dd1c0e0b07eeb2855ddbe8f","abstract_canon_sha256":"5148cb4f8aa73222a7604e79a57b2a75492a88aa6dfe2491240aedb8d48f8e11"},"schema_version":"1.0"},"canonical_sha256":"c997b216bfd8450642de7787923e3298a64a0eae14e10501775c4fc3a3fb8d98","source":{"kind":"arxiv","id":"1710.00578","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00578","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00578v3","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00578","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZGL3EFV73BCQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGL3EFV73BCQMQW6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGL3EFV7","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZGL3EFV73BCQMQW6O6DZEPRSTC","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00578","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-02T11:01:53Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"25b3e244decb28aae3f0652ff6fb965a1c2f1bc93dd1c0e0b07eeb2855ddbe8f","abstract_canon_sha256":"5148cb4f8aa73222a7604e79a57b2a75492a88aa6dfe2491240aedb8d48f8e11"},"schema_version":"1.0"},"canonical_sha256":"c997b216bfd8450642de7787923e3298a64a0eae14e10501775c4fc3a3fb8d98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:35.991375Z","signature_b64":"8fqC3BF3HN86HUYN/wenxNAkadumlePacg0tyeVwaaEQCOtsDtph+jYVEOu9v8PEOOMf1vTvz8+m6XitM8izDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c997b216bfd8450642de7787923e3298a64a0eae14e10501775c4fc3a3fb8d98","last_reissued_at":"2026-05-18T00:18:35.990894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:35.990894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00578","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:18:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rpOeSgaaLM52N1Usor87iFSpyTNKFOtB7s34GVCZ7py/Sctguj4D8SRnJx47kpJNrJ6OReUCLrFqH+/5BEMbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:25.932720Z"},"content_sha256":"ac0ecc28e7896f6c7fe94f9ba435532f3403c4be3909ccd77b52a603fed215ce","schema_version":"1.0","event_id":"sha256:ac0ecc28e7896f6c7fe94f9ba435532f3403c4be3909ccd77b52a603fed215ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZGL3EFV73BCQMQW6O6DZEPRSTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"sgmcmc: An R Package for Stochastic Gradient Markov Chain Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"stat.CO","authors_text":"Christopher Nemeth, Emily B. Fox, Jack Baker, Paul Fearnhead","submitted_at":"2017-10-02T11:01:53Z","abstract_excerpt":"This paper introduces the R package sgmcmc; which can be used for Bayesian inference on problems with large datasets using stochastic gradient Markov chain Monte Carlo (SGMCMC). Traditional Markov chain Monte Carlo (MCMC) methods, such as Metropolis-Hastings, are known to run prohibitively slowly as the dataset size increases. SGMCMC solves this issue by only using a subset of data at each iteration. SGMCMC requires calculating gradients of the log likelihood and log priors, which can be time consuming and error prone to perform by hand. The sgmcmc package calculates these gradients itself usi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00578","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:18:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qh5+xTMxr1MiAY0M52V0qRSpe40O1q0JrYyj2q3r0zxRHHpr6WIIQ2L/N0qb6LjMZcZEMTx7JZJuOTEzpjulDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:25:25.933068Z"},"content_sha256":"30b9a6ac42fb1cc8c0827d487ce6c28a1184b82aa63c434ed3fedf9c26188f60","schema_version":"1.0","event_id":"sha256:30b9a6ac42fb1cc8c0827d487ce6c28a1184b82aa63c434ed3fedf9c26188f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/bundle.json","state_url":"https://pith.science/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/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-02T18:25:25Z","links":{"resolver":"https://pith.science/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC","bundle":"https://pith.science/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/bundle.json","state":"https://pith.science/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGL3EFV73BCQMQW6O6DZEPRSTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZGL3EFV73BCQMQW6O6DZEPRSTC","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":"5148cb4f8aa73222a7604e79a57b2a75492a88aa6dfe2491240aedb8d48f8e11","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-02T11:01:53Z","title_canon_sha256":"25b3e244decb28aae3f0652ff6fb965a1c2f1bc93dd1c0e0b07eeb2855ddbe8f"},"schema_version":"1.0","source":{"id":"1710.00578","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00578","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00578v3","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00578","created_at":"2026-05-18T00:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"ZGL3EFV73BCQ","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGL3EFV73BCQMQW6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGL3EFV7","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:30b9a6ac42fb1cc8c0827d487ce6c28a1184b82aa63c434ed3fedf9c26188f60","target":"graph","created_at":"2026-05-18T00:18:35Z","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":"This paper introduces the R package sgmcmc; which can be used for Bayesian inference on problems with large datasets using stochastic gradient Markov chain Monte Carlo (SGMCMC). Traditional Markov chain Monte Carlo (MCMC) methods, such as Metropolis-Hastings, are known to run prohibitively slowly as the dataset size increases. SGMCMC solves this issue by only using a subset of data at each iteration. SGMCMC requires calculating gradients of the log likelihood and log priors, which can be time consuming and error prone to perform by hand. The sgmcmc package calculates these gradients itself usi","authors_text":"Christopher Nemeth, Emily B. Fox, Jack Baker, Paul Fearnhead","cross_cats":["stat.AP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-02T11:01:53Z","title":"sgmcmc: An R Package for Stochastic Gradient Markov Chain Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00578","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:ac0ecc28e7896f6c7fe94f9ba435532f3403c4be3909ccd77b52a603fed215ce","target":"record","created_at":"2026-05-18T00:18:35Z","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":"5148cb4f8aa73222a7604e79a57b2a75492a88aa6dfe2491240aedb8d48f8e11","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-02T11:01:53Z","title_canon_sha256":"25b3e244decb28aae3f0652ff6fb965a1c2f1bc93dd1c0e0b07eeb2855ddbe8f"},"schema_version":"1.0","source":{"id":"1710.00578","kind":"arxiv","version":3}},"canonical_sha256":"c997b216bfd8450642de7787923e3298a64a0eae14e10501775c4fc3a3fb8d98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c997b216bfd8450642de7787923e3298a64a0eae14e10501775c4fc3a3fb8d98","first_computed_at":"2026-05-18T00:18:35.990894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:35.990894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8fqC3BF3HN86HUYN/wenxNAkadumlePacg0tyeVwaaEQCOtsDtph+jYVEOu9v8PEOOMf1vTvz8+m6XitM8izDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:35.991375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00578","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac0ecc28e7896f6c7fe94f9ba435532f3403c4be3909ccd77b52a603fed215ce","sha256:30b9a6ac42fb1cc8c0827d487ce6c28a1184b82aa63c434ed3fedf9c26188f60"],"state_sha256":"9da288db63c30b1e6f1d9a6e3772dfaf6380de0d02e8be8c93f12a4584d1814b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dHdewf06JXZd7+/imta86XZGAl09fcGoV9PdHDk+FmsFA5YYGOOqM5z6YW1KtmUUO6L4YI7HWNuRKVkssAjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:25:25.935075Z","bundle_sha256":"5adae3e1ca8933f723330c33fdb3ea3602ead2f99069acaccd261a8e85143ac6"}}