{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TZFB6KRC5TFMVXD7IFVRWVRIHQ","short_pith_number":"pith:TZFB6KRC","canonical_record":{"source":{"id":"1711.11280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-30T09:27:52Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2fa779c2dab7e848a37db1c785aebb3b7f278cdb8d3c373dfdd97a70b60298a4","abstract_canon_sha256":"fe1e9400f93e5fed3d383999656353dad4ffc45d977b1b038a125140a0ef31ec"},"schema_version":"1.0"},"canonical_sha256":"9e4a1f2a22eccacadc7f416b1b56283c2efcd2a8b38e8c495ecee73cd135fd05","source":{"kind":"arxiv","id":"1711.11280","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11280","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11280v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11280","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"TZFB6KRC5TFM","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TZFB6KRC5TFMVXD7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TZFB6KRC","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TZFB6KRC5TFMVXD7IFVRWVRIHQ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11280","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-30T09:27:52Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2fa779c2dab7e848a37db1c785aebb3b7f278cdb8d3c373dfdd97a70b60298a4","abstract_canon_sha256":"fe1e9400f93e5fed3d383999656353dad4ffc45d977b1b038a125140a0ef31ec"},"schema_version":"1.0"},"canonical_sha256":"9e4a1f2a22eccacadc7f416b1b56283c2efcd2a8b38e8c495ecee73cd135fd05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:55.450222Z","signature_b64":"2gv4y8rfjbEmnHPF9Jiv+LirwV25vqNa0KMkxfafvRMBJtnAJNYyQSy1vuJ3rwo1cRx+AE2a31wJnqh3ATVHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e4a1f2a22eccacadc7f416b1b56283c2efcd2a8b38e8c495ecee73cd135fd05","last_reissued_at":"2026-05-18T00:07:55.449703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:55.449703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11280","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:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKjWJLXraSLL54OvaZEd7gm0wr8zrc0HhcDRX0Gha16aPn9Y1mby7vLCRl/eAmrSOzWxnBgCHzx0E/kQEQ0vCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:05.283321Z"},"content_sha256":"22b65342ff5fbe401993b097bbeaf6e1fe9cf55ebeb61914263cd44dcc54306d","schema_version":"1.0","event_id":"sha256:22b65342ff5fbe401993b097bbeaf6e1fe9cf55ebeb61914263cd44dcc54306d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TZFB6KRC5TFMVXD7IFVRWVRIHQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Deep Are Deep Gaussian Processes?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Andrew M. Stuart, Aretha L. Teckentrup, Mark A. Girolami, Matthew M. Dunlop","submitted_at":"2017-11-30T09:27:52Z","abstract_excerpt":"Recent research has shown the potential utility of Deep Gaussian Processes. These deep structures are probability distributions, designed through hierarchical construction, which are conditionally Gaussian. In this paper, the current published body of work is placed in a common framework and, through recursion, several classes of deep Gaussian processes are defined. The resulting samples generated from a deep Gaussian process have a Markovian structure with respect to the depth parameter, and the effective depth of the resulting process is interpreted in terms of the ergodicity, or non-ergodic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11280","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:07:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12yms+X5Nf4BtxltchIAt5IHJivUAhbPcOx2pPPoyFmSDYx75pCFtXyUVXg0dG5gZYG4vCWZ6Up/Ftt0WBkXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:05.283673Z"},"content_sha256":"cdf98147eaa7039793fd4eec789346e8a0082c9fdaf661083934902cdd1cb54a","schema_version":"1.0","event_id":"sha256:cdf98147eaa7039793fd4eec789346e8a0082c9fdaf661083934902cdd1cb54a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/bundle.json","state_url":"https://pith.science/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/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-04T15:32:05Z","links":{"resolver":"https://pith.science/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ","bundle":"https://pith.science/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/bundle.json","state":"https://pith.science/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TZFB6KRC5TFMVXD7IFVRWVRIHQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TZFB6KRC5TFMVXD7IFVRWVRIHQ","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":"fe1e9400f93e5fed3d383999656353dad4ffc45d977b1b038a125140a0ef31ec","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-30T09:27:52Z","title_canon_sha256":"2fa779c2dab7e848a37db1c785aebb3b7f278cdb8d3c373dfdd97a70b60298a4"},"schema_version":"1.0","source":{"id":"1711.11280","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11280","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11280v2","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11280","created_at":"2026-05-18T00:07:55Z"},{"alias_kind":"pith_short_12","alias_value":"TZFB6KRC5TFM","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TZFB6KRC5TFMVXD7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TZFB6KRC","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:cdf98147eaa7039793fd4eec789346e8a0082c9fdaf661083934902cdd1cb54a","target":"graph","created_at":"2026-05-18T00:07:55Z","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":"Recent research has shown the potential utility of Deep Gaussian Processes. These deep structures are probability distributions, designed through hierarchical construction, which are conditionally Gaussian. In this paper, the current published body of work is placed in a common framework and, through recursion, several classes of deep Gaussian processes are defined. The resulting samples generated from a deep Gaussian process have a Markovian structure with respect to the depth parameter, and the effective depth of the resulting process is interpreted in terms of the ergodicity, or non-ergodic","authors_text":"Andrew M. Stuart, Aretha L. Teckentrup, Mark A. Girolami, Matthew M. Dunlop","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-30T09:27:52Z","title":"How Deep Are Deep Gaussian Processes?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11280","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:22b65342ff5fbe401993b097bbeaf6e1fe9cf55ebeb61914263cd44dcc54306d","target":"record","created_at":"2026-05-18T00:07:55Z","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":"fe1e9400f93e5fed3d383999656353dad4ffc45d977b1b038a125140a0ef31ec","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-30T09:27:52Z","title_canon_sha256":"2fa779c2dab7e848a37db1c785aebb3b7f278cdb8d3c373dfdd97a70b60298a4"},"schema_version":"1.0","source":{"id":"1711.11280","kind":"arxiv","version":2}},"canonical_sha256":"9e4a1f2a22eccacadc7f416b1b56283c2efcd2a8b38e8c495ecee73cd135fd05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e4a1f2a22eccacadc7f416b1b56283c2efcd2a8b38e8c495ecee73cd135fd05","first_computed_at":"2026-05-18T00:07:55.449703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:55.449703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2gv4y8rfjbEmnHPF9Jiv+LirwV25vqNa0KMkxfafvRMBJtnAJNYyQSy1vuJ3rwo1cRx+AE2a31wJnqh3ATVHAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:55.450222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11280","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:22b65342ff5fbe401993b097bbeaf6e1fe9cf55ebeb61914263cd44dcc54306d","sha256:cdf98147eaa7039793fd4eec789346e8a0082c9fdaf661083934902cdd1cb54a"],"state_sha256":"dc5fba15e123b2f5f62d360f7d881b7d113328ba6fe085cda569658d13e40081"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXKKcYZOq59DHwsbalQTTZ+yvfKnyG/mcmUaPREM1f2Z4sZ8br6L7DneZQ3CvsvpAOzeSDJ5g7+j2r4MprMLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:32:05.285995Z","bundle_sha256":"039a9c1ab598e52c776cc6fad2c3adcf856f36cb01e7aea4bb703d73f6d17ecb"}}