{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FC6D4TUWMAWBQL5DNAHYTOODMV","short_pith_number":"pith:FC6D4TUW","canonical_record":{"source":{"id":"1706.06544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cdf98c8b1a3630e384c3f44ab41e7ee075dea9593e8638cc7b568880b22f4556","abstract_canon_sha256":"01f75109fe0b6cf7302a4d5c00051ca44c2e46658a6f5fc5855303754e91f407"},"schema_version":"1.0"},"canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","source":{"kind":"arxiv","id":"1706.06544","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06544","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06544v3","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06544","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"FC6D4TUWMAWB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FC6D4TUWMAWBQL5D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FC6D4TUW","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FC6D4TUWMAWBQL5DNAHYTOODMV","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"cdf98c8b1a3630e384c3f44ab41e7ee075dea9593e8638cc7b568880b22f4556","abstract_canon_sha256":"01f75109fe0b6cf7302a4d5c00051ca44c2e46658a6f5fc5855303754e91f407"},"schema_version":"1.0"},"canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.023951Z","signature_b64":"BV+LF6iQ8iy65tP1HqobM2R/agfFfNSPQ+OYzNoYGL5wGlsDRQyadV0X3LDji/J2vsvzXdyMAlvgHMxPDIlRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","last_reissued_at":"2026-05-18T00:31:45.023359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.023359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06544","source_version":3,"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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1bmSfVPa7jCStMozbzB/U6dzABmVxwpOeQqu/DvZ6hX4r36SlFsuluUvCfl/cl5YpgTK/Angt+D+joyk6QbCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:51:22.206270Z"},"content_sha256":"b9856d136fbbfd466721404a8f86a3c581e8d6e3923bcf0bfa67684df6713579","schema_version":"1.0","event_id":"sha256:b9856d136fbbfd466721404a8f86a3c581e8d6e3923bcf0bfa67684df6713579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FC6D4TUWMAWBQL5DNAHYTOODMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust and Efficient Transfer Learning with Hidden-Parameter Markov Decision Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Finale Doshi-Velez, George Konidaris, Samuel Daulton, Taylor Killian","submitted_at":"2017-06-20T16:51:46Z","abstract_excerpt":"We introduce a new formulation of the Hidden Parameter Markov Decision Process (HiP-MDP), a framework for modeling families of related tasks using low-dimensional latent embeddings. Our new framework correctly models the joint uncertainty in the latent parameters and the state space. We also replace the original Gaussian Process-based model with a Bayesian Neural Network, enabling more scalable inference. Thus, we expand the scope of the HiP-MDP to applications with higher dimensions and more complex dynamics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06544","kind":"arxiv","version":3},"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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95zgeevtgxvgdA4p9hXByLrWxIvR76R5NWS7WgM9zU3LqWbIC3tPrbr8HmZN+JcYQZ192C9R4hCR7xDX4fJ/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:51:22.206927Z"},"content_sha256":"168091fa6dff3304d2349fd680d095a3cc0ca2430687901033115735de576b74","schema_version":"1.0","event_id":"sha256:168091fa6dff3304d2349fd680d095a3cc0ca2430687901033115735de576b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/bundle.json","state_url":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/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-27T21:51:22Z","links":{"resolver":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV","bundle":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/bundle.json","state":"https://pith.science/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FC6D4TUWMAWBQL5DNAHYTOODMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FC6D4TUWMAWBQL5DNAHYTOODMV","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":"01f75109fe0b6cf7302a4d5c00051ca44c2e46658a6f5fc5855303754e91f407","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","title_canon_sha256":"cdf98c8b1a3630e384c3f44ab41e7ee075dea9593e8638cc7b568880b22f4556"},"schema_version":"1.0","source":{"id":"1706.06544","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06544","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06544v3","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06544","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"FC6D4TUWMAWB","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FC6D4TUWMAWBQL5D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FC6D4TUW","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:168091fa6dff3304d2349fd680d095a3cc0ca2430687901033115735de576b74","target":"graph","created_at":"2026-05-18T00:31:45Z","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":"We introduce a new formulation of the Hidden Parameter Markov Decision Process (HiP-MDP), a framework for modeling families of related tasks using low-dimensional latent embeddings. Our new framework correctly models the joint uncertainty in the latent parameters and the state space. We also replace the original Gaussian Process-based model with a Bayesian Neural Network, enabling more scalable inference. Thus, we expand the scope of the HiP-MDP to applications with higher dimensions and more complex dynamics.","authors_text":"Finale Doshi-Velez, George Konidaris, Samuel Daulton, Taylor Killian","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","title":"Robust and Efficient Transfer Learning with Hidden-Parameter Markov Decision Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06544","kind":"arxiv","version":3},"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:b9856d136fbbfd466721404a8f86a3c581e8d6e3923bcf0bfa67684df6713579","target":"record","created_at":"2026-05-18T00:31:45Z","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":"01f75109fe0b6cf7302a4d5c00051ca44c2e46658a6f5fc5855303754e91f407","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-20T16:51:46Z","title_canon_sha256":"cdf98c8b1a3630e384c3f44ab41e7ee075dea9593e8638cc7b568880b22f4556"},"schema_version":"1.0","source":{"id":"1706.06544","kind":"arxiv","version":3}},"canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28bc3e4e96602c182fa3680f89b9c3654ea6e9f749bd55b3e186fa4987b2e1f1","first_computed_at":"2026-05-18T00:31:45.023359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:45.023359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BV+LF6iQ8iy65tP1HqobM2R/agfFfNSPQ+OYzNoYGL5wGlsDRQyadV0X3LDji/J2vsvzXdyMAlvgHMxPDIlRAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:45.023951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06544","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9856d136fbbfd466721404a8f86a3c581e8d6e3923bcf0bfa67684df6713579","sha256:168091fa6dff3304d2349fd680d095a3cc0ca2430687901033115735de576b74"],"state_sha256":"8312c9161397f55d6594779fdec86a376117a3cf586b94724b13bc28aa03c595"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEmuVsjWKUS8+9VWZ3LtSeJw7RnKDkGPEFmobsWBEYyV68A5owNWJmXUdc/i7+PNi46/nKAbv1eA7B7RSqk7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:51:22.210618Z","bundle_sha256":"2c1317d642e1ad0afa1f5b93e672c74f12e4c129cd5c01c5e70b26146a8d64b9"}}