{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZPBMUAQUIYD4K67CXODV2DPX37","short_pith_number":"pith:ZPBMUAQU","schema_version":"1.0","canonical_sha256":"cbc2ca02144607c57be2bb875d0df7dfeb172576bc97334e0f0681e4be8d0198","source":{"kind":"arxiv","id":"1905.06982","version":1},"attestation_state":"computed","paper":{"title":"Efficient Deep Gaussian Process Models for Variable-Sized Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Issam H. Laradji, Mark Schmidt, Minyoung Kim, Vladimir Pavlovic","submitted_at":"2019-05-16T18:26:53Z","abstract_excerpt":"Deep Gaussian processes (DGP) have appealing Bayesian properties, can handle variable-sized data, and learn deep features. Their limitation is that they do not scale well with the size of the data. Existing approaches address this using a deep random feature (DRF) expansion model, which makes inference tractable by approximating DGPs. However, DRF is not suitable for variable-sized input data such as trees, graphs, and sequences. We introduce the GP-DRF, a novel Bayesian model with an input layer of GPs, followed by DRF layers. The key advantage is that the combination of GP and DRF leads to a"},"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":"1905.06982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-16T18:26:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b5d486b786d3367761e05fe40dddb77e35f6bd5357269e625b292dbcdd1878fb","abstract_canon_sha256":"b5ce73146521f3841e0b3f284470f496f2b1b000a6e6ba729a441fae39a4bac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.593192Z","signature_b64":"AlDDUVSIQIVFtg201pl5QLkiiiPEnCBIDUraY8E6urasCDFXgn+k+K6cQs5KkexofOFg+WYtzHyPAwwgbFrBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbc2ca02144607c57be2bb875d0df7dfeb172576bc97334e0f0681e4be8d0198","last_reissued_at":"2026-05-17T23:45:57.592708Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.592708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Deep Gaussian Process Models for Variable-Sized Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Issam H. Laradji, Mark Schmidt, Minyoung Kim, Vladimir Pavlovic","submitted_at":"2019-05-16T18:26:53Z","abstract_excerpt":"Deep Gaussian processes (DGP) have appealing Bayesian properties, can handle variable-sized data, and learn deep features. Their limitation is that they do not scale well with the size of the data. Existing approaches address this using a deep random feature (DRF) expansion model, which makes inference tractable by approximating DGPs. However, DRF is not suitable for variable-sized input data such as trees, graphs, and sequences. We introduce the GP-DRF, a novel Bayesian model with an input layer of GPs, followed by DRF layers. The key advantage is that the combination of GP and DRF leads to a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06982","kind":"arxiv","version":1},"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":"1905.06982","created_at":"2026-05-17T23:45:57.592778+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.06982v1","created_at":"2026-05-17T23:45:57.592778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06982","created_at":"2026-05-17T23:45:57.592778+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZPBMUAQUIYD4","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZPBMUAQUIYD4K67C","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZPBMUAQU","created_at":"2026-05-18T12:33:33.725879+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/ZPBMUAQUIYD4K67CXODV2DPX37","json":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37.json","graph_json":"https://pith.science/api/pith-number/ZPBMUAQUIYD4K67CXODV2DPX37/graph.json","events_json":"https://pith.science/api/pith-number/ZPBMUAQUIYD4K67CXODV2DPX37/events.json","paper":"https://pith.science/paper/ZPBMUAQU"},"agent_actions":{"view_html":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37","download_json":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37.json","view_paper":"https://pith.science/paper/ZPBMUAQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/ZPBMUAQUIYD4K67CXODV2DPX37/graph.json","fetch_events":"https://pith.science/api/pith-number/ZPBMUAQUIYD4K67CXODV2DPX37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37/action/storage_attestation","attest_author":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37/action/author_attestation","sign_citation":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37/action/citation_signature","submit_replication":"https://pith.science/pith/ZPBMUAQUIYD4K67CXODV2DPX37/action/replication_record"}},"created_at":"2026-05-17T23:45:57.592778+00:00","updated_at":"2026-05-17T23:45:57.592778+00:00"}