{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NMDXFPHCVMFGZYL73NTQ6BE5OY","short_pith_number":"pith:NMDXFPHC","schema_version":"1.0","canonical_sha256":"6b0772bce2ab0a6ce17fdb670f049d760da1a14366fddd6595a9ae6c66c8d828","source":{"kind":"arxiv","id":"1511.06644","version":6},"attestation_state":"computed","paper":{"title":"Recurrent Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Damianou, C\\'esar Lincoln C. Mattos, Guilherme A. Barreto, Jeremy Forth, Neil D. Lawrence, Zhenwen Dai","submitted_at":"2015-11-20T15:37:24Z","abstract_excerpt":"We define Recurrent Gaussian Processes (RGP) models, a general family of Bayesian nonparametric models with recurrent GP priors which are able to learn dynamical patterns from sequential data. Similar to Recurrent Neural Networks (RNNs), RGPs can have different formulations for their internal states, distinct inference methods and be extended with deep structures. In such context, we propose a novel deep RGP model whose autoregressive states are latent, thereby performing representation and dynamical learning simultaneously. To fully exploit the Bayesian nature of the RGP model we develop the "},"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":"1511.06644","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-20T15:37:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"50625d96220c77ef41cf02b5c4f117bfdc68eb972be68389350bd1b03154f5bf","abstract_canon_sha256":"f67d97520d9e462d8f2eb6ce77ff27874a200c83164c42a22820a361a06df52a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:03.327065Z","signature_b64":"NFY3ps8ULR7Wv9C5lw6H8WCj5hL64f54tz5M78pnS3n6GmKeE9WR3iM+mZkEE7QuPM5TXbGdqLTSEkjRBLzhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b0772bce2ab0a6ce17fdb670f049d760da1a14366fddd6595a9ae6c66c8d828","last_reissued_at":"2026-05-18T01:20:03.326400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:03.326400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andreas Damianou, C\\'esar Lincoln C. Mattos, Guilherme A. Barreto, Jeremy Forth, Neil D. Lawrence, Zhenwen Dai","submitted_at":"2015-11-20T15:37:24Z","abstract_excerpt":"We define Recurrent Gaussian Processes (RGP) models, a general family of Bayesian nonparametric models with recurrent GP priors which are able to learn dynamical patterns from sequential data. Similar to Recurrent Neural Networks (RNNs), RGPs can have different formulations for their internal states, distinct inference methods and be extended with deep structures. In such context, we propose a novel deep RGP model whose autoregressive states are latent, thereby performing representation and dynamical learning simultaneously. To fully exploit the Bayesian nature of the RGP model we develop the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06644","kind":"arxiv","version":6},"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":"1511.06644","created_at":"2026-05-18T01:20:03.326507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06644v6","created_at":"2026-05-18T01:20:03.326507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06644","created_at":"2026-05-18T01:20:03.326507+00:00"},{"alias_kind":"pith_short_12","alias_value":"NMDXFPHCVMFG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NMDXFPHCVMFGZYL7","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NMDXFPHC","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00650","citing_title":"Neural Dynamics Discovery via Gaussian Process Recurrent Neural Networks","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY","json":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY.json","graph_json":"https://pith.science/api/pith-number/NMDXFPHCVMFGZYL73NTQ6BE5OY/graph.json","events_json":"https://pith.science/api/pith-number/NMDXFPHCVMFGZYL73NTQ6BE5OY/events.json","paper":"https://pith.science/paper/NMDXFPHC"},"agent_actions":{"view_html":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY","download_json":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY.json","view_paper":"https://pith.science/paper/NMDXFPHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06644&json=true","fetch_graph":"https://pith.science/api/pith-number/NMDXFPHCVMFGZYL73NTQ6BE5OY/graph.json","fetch_events":"https://pith.science/api/pith-number/NMDXFPHCVMFGZYL73NTQ6BE5OY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY/action/storage_attestation","attest_author":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY/action/author_attestation","sign_citation":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY/action/citation_signature","submit_replication":"https://pith.science/pith/NMDXFPHCVMFGZYL73NTQ6BE5OY/action/replication_record"}},"created_at":"2026-05-18T01:20:03.326507+00:00","updated_at":"2026-05-18T01:20:03.326507+00:00"}