{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:BT6OEDCBHGTR2PT2P5FDIR6EUL","short_pith_number":"pith:BT6OEDCB","canonical_record":{"source":{"id":"1512.05665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-17T16:46:10Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"72f56bfd8c9c5711bc72c0664c1bb7cbe2813b0b2cfab21294f9d9f74cecfed4","abstract_canon_sha256":"5705cb80df4753e283de68e957ed7eeed7da6550f40f60ef54e931ede8e1c38a"},"schema_version":"1.0"},"canonical_sha256":"0cfce20c4139a71d3e7a7f4a3447c4a2f6969cc31cf9b176ac3dc2f22295c19a","source":{"kind":"arxiv","id":"1512.05665","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05665","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05665v2","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05665","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"BT6OEDCBHGTR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BT6OEDCBHGTR2PT2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BT6OEDCB","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:BT6OEDCBHGTR2PT2P5FDIR6EUL","target":"record","payload":{"canonical_record":{"source":{"id":"1512.05665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-17T16:46:10Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"72f56bfd8c9c5711bc72c0664c1bb7cbe2813b0b2cfab21294f9d9f74cecfed4","abstract_canon_sha256":"5705cb80df4753e283de68e957ed7eeed7da6550f40f60ef54e931ede8e1c38a"},"schema_version":"1.0"},"canonical_sha256":"0cfce20c4139a71d3e7a7f4a3447c4a2f6969cc31cf9b176ac3dc2f22295c19a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:22.471006Z","signature_b64":"InziZyNdjoSsqmS3m5GPzk//DdoTjXZm5D68qAglNOJsztNYOxX4b7a9xpigq1M1grRvwHtRJ1FvtXXgdMPyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cfce20c4139a71d3e7a7f4a3447c4a2f6969cc31cf9b176ac3dc2f22295c19a","last_reissued_at":"2026-05-18T01:23:22.470399Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:22.470399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.05665","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-18T01:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmwraDUZINZLmBCuRJhFrMKe/ZLk0jTp0WM7mnUoDWb6v2H7UZ1zjntzvN7WNOHjtFP4vaDBNEmQAxACr8zeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:46:48.529888Z"},"content_sha256":"508c484546c455e4bcb8df3d63a724ec1898c127e5fa2f495668712261700d43","schema_version":"1.0","event_id":"sha256:508c484546c455e4bcb8df3d63a724ec1898c127e5fa2f495668712261700d43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:BT6OEDCBHGTR2PT2P5FDIR6EUL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic Programming with Gaussian Process Memoization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexey Radul, Ben Zinberg, Kostas Stathis, Ulrich Schaechtle, Vikash K. Mansinghka","submitted_at":"2015-12-17T16:46:10Z","abstract_excerpt":"Gaussian Processes (GPs) are widely used tools in statistics, machine learning, robotics, computer vision, and scientific computation. However, despite their popularity, they can be difficult to apply; all but the simplest classification or regression applications require specification and inference over complex covariance functions that do not admit simple analytical posteriors. This paper shows how to embed Gaussian processes in any higher-order probabilistic programming language, using an idiom based on memoization, and demonstrates its utility by implementing and extending classic and stat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05665","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-18T01:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QjNSyEdY/Lf83iSGdxj+z9DC1hZlXtUtFAwi8lDnvzDF5MpBmY5V/EPDzeiWcu+6xxSTBN8sPgUH8zic1ngJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:46:48.530424Z"},"content_sha256":"212c78b225d2377ecb3df719a2464482f06df9cf3c6b621764a40284e780db4c","schema_version":"1.0","event_id":"sha256:212c78b225d2377ecb3df719a2464482f06df9cf3c6b621764a40284e780db4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/bundle.json","state_url":"https://pith.science/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/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-30T07:46:48Z","links":{"resolver":"https://pith.science/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL","bundle":"https://pith.science/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/bundle.json","state":"https://pith.science/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BT6OEDCBHGTR2PT2P5FDIR6EUL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:BT6OEDCBHGTR2PT2P5FDIR6EUL","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":"5705cb80df4753e283de68e957ed7eeed7da6550f40f60ef54e931ede8e1c38a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-17T16:46:10Z","title_canon_sha256":"72f56bfd8c9c5711bc72c0664c1bb7cbe2813b0b2cfab21294f9d9f74cecfed4"},"schema_version":"1.0","source":{"id":"1512.05665","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.05665","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"1512.05665v2","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.05665","created_at":"2026-05-18T01:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"BT6OEDCBHGTR","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"BT6OEDCBHGTR2PT2","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"BT6OEDCB","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:212c78b225d2377ecb3df719a2464482f06df9cf3c6b621764a40284e780db4c","target":"graph","created_at":"2026-05-18T01:23:22Z","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":"Gaussian Processes (GPs) are widely used tools in statistics, machine learning, robotics, computer vision, and scientific computation. However, despite their popularity, they can be difficult to apply; all but the simplest classification or regression applications require specification and inference over complex covariance functions that do not admit simple analytical posteriors. This paper shows how to embed Gaussian processes in any higher-order probabilistic programming language, using an idiom based on memoization, and demonstrates its utility by implementing and extending classic and stat","authors_text":"Alexey Radul, Ben Zinberg, Kostas Stathis, Ulrich Schaechtle, Vikash K. Mansinghka","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-17T16:46:10Z","title":"Probabilistic Programming with Gaussian Process Memoization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.05665","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:508c484546c455e4bcb8df3d63a724ec1898c127e5fa2f495668712261700d43","target":"record","created_at":"2026-05-18T01:23:22Z","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":"5705cb80df4753e283de68e957ed7eeed7da6550f40f60ef54e931ede8e1c38a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-12-17T16:46:10Z","title_canon_sha256":"72f56bfd8c9c5711bc72c0664c1bb7cbe2813b0b2cfab21294f9d9f74cecfed4"},"schema_version":"1.0","source":{"id":"1512.05665","kind":"arxiv","version":2}},"canonical_sha256":"0cfce20c4139a71d3e7a7f4a3447c4a2f6969cc31cf9b176ac3dc2f22295c19a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cfce20c4139a71d3e7a7f4a3447c4a2f6969cc31cf9b176ac3dc2f22295c19a","first_computed_at":"2026-05-18T01:23:22.470399Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:22.470399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"InziZyNdjoSsqmS3m5GPzk//DdoTjXZm5D68qAglNOJsztNYOxX4b7a9xpigq1M1grRvwHtRJ1FvtXXgdMPyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:22.471006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.05665","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:508c484546c455e4bcb8df3d63a724ec1898c127e5fa2f495668712261700d43","sha256:212c78b225d2377ecb3df719a2464482f06df9cf3c6b621764a40284e780db4c"],"state_sha256":"8068598b51e57c70ba3f00b72987d0a92c0e10bcfa185f7c4d41fb240917b4b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ooUqNvS9FAVPGTGEY64PvEPIlGyd380I4bxAGRDM30a/+5UGuzKtIHockzDSYX94Cl1qasg+Pk3FFDNGs7wBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:46:48.534156Z","bundle_sha256":"7f53a5747f85c6bab56e18095e82e89369423d90d48803819f9784d6f4a5ac23"}}