{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NMLYQFYDHYWNENXXYJAJTOYNJQ","short_pith_number":"pith:NMLYQFYD","schema_version":"1.0","canonical_sha256":"6b178817033e2cd236f7c24099bb0d4c3949e1d2a4d99d24bdb13add154e2084","source":{"kind":"arxiv","id":"1506.02267","version":2},"attestation_state":"computed","paper":{"title":"Computationally Efficient Bayesian Learning of Gaussian Process State Space Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Andreas Svensson, Arno Solin, Simo S\\\"arkk\\\"a, Thomas B. Sch\\\"on","submitted_at":"2015-06-07T13:57:51Z","abstract_excerpt":"Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models can be conducted using a carefully crafted particle MCMC algorithm. This scheme is computationally efficient and yet allows for a fully Bayesian treatment of the problem. Compared to conventional system id"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1506.02267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-06-07T13:57:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0c25e8b72b9b8da97c5aa87a192d83525c3dda7985f5f3a7e5be15fe8ff21c16","abstract_canon_sha256":"5915631b5623b0b4067d94c42efa55451f80d282a2b9235128e5921c9edb4f5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:05.339661Z","signature_b64":"zvZ28PFxPSz+cW7jYEn6eBVYe5NLkS9n2n37/JPpGKjxwB4vImgwZgEh7WhztG0Xs7+EMjhLrchKYgeLYPF2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b178817033e2cd236f7c24099bb0d4c3949e1d2a4d99d24bdb13add154e2084","last_reissued_at":"2026-05-18T01:17:05.338905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:05.338905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computationally Efficient Bayesian Learning of Gaussian Process State Space Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Andreas Svensson, Arno Solin, Simo S\\\"arkk\\\"a, Thomas B. Sch\\\"on","submitted_at":"2015-06-07T13:57:51Z","abstract_excerpt":"Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models can be conducted using a carefully crafted particle MCMC algorithm. This scheme is computationally efficient and yet allows for a fully Bayesian treatment of the problem. Compared to conventional system id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02267","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.02267","created_at":"2026-05-18T01:17:05.339031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.02267v2","created_at":"2026-05-18T01:17:05.339031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02267","created_at":"2026-05-18T01:17:05.339031+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMLYQFYDHYWN","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMLYQFYDHYWNENXX","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMLYQFYD","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ","json":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ.json","graph_json":"https://pith.science/api/pith-number/NMLYQFYDHYWNENXXYJAJTOYNJQ/graph.json","events_json":"https://pith.science/api/pith-number/NMLYQFYDHYWNENXXYJAJTOYNJQ/events.json","paper":"https://pith.science/paper/NMLYQFYD"},"agent_actions":{"view_html":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ","download_json":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ.json","view_paper":"https://pith.science/paper/NMLYQFYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.02267&json=true","fetch_graph":"https://pith.science/api/pith-number/NMLYQFYDHYWNENXXYJAJTOYNJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NMLYQFYDHYWNENXXYJAJTOYNJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ/action/storage_attestation","attest_author":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ/action/author_attestation","sign_citation":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ/action/citation_signature","submit_replication":"https://pith.science/pith/NMLYQFYDHYWNENXXYJAJTOYNJQ/action/replication_record"}},"created_at":"2026-05-18T01:17:05.339031+00:00","updated_at":"2026-05-18T01:17:05.339031+00:00"}