{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:JAGGLH3PVP4S4BCXYGIKGFL27Z","short_pith_number":"pith:JAGGLH3P","canonical_record":{"source":{"id":"0912.1586","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-12-08T23:49:08Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"774708dd4eb6c3b96067ec9486b104a612750773767dec21dee8e7d4e908bb67","abstract_canon_sha256":"0d1db68eb5d887ef3c4db54fce3f9057b3b7a24867ee9d50ba2077df27877456"},"schema_version":"1.0"},"canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","source":{"kind":"arxiv","id":"0912.1586","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.1586","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"0912.1586v4","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1586","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"JAGGLH3PVP4S","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JAGGLH3PVP4S4BCX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JAGGLH3P","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:JAGGLH3PVP4S4BCXYGIKGFL27Z","target":"record","payload":{"canonical_record":{"source":{"id":"0912.1586","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-12-08T23:49:08Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"774708dd4eb6c3b96067ec9486b104a612750773767dec21dee8e7d4e908bb67","abstract_canon_sha256":"0d1db68eb5d887ef3c4db54fce3f9057b3b7a24867ee9d50ba2077df27877456"},"schema_version":"1.0"},"canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:05.154973Z","signature_b64":"9VU0xYcyPk4kA9a5bK08rmHuuj+1iFunGQ1EK85TtvXfbfwcx5xd+ENQw7lnoI1qxhgbXiYBVzMNhdb4Uy1/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","last_reissued_at":"2026-05-18T04:35:05.154537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:05.154537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.1586","source_version":4,"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-18T04:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4trzUJ/72c3bC5iZkFd1HQi8J6ej48umG9HQnwQVgrYwBWRbi4zO0G/HAiEmoUVFRcmvSyWJ0DmXMDIxKMnUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:59:23.644585Z"},"content_sha256":"44a35a21177ca98bdcb8645298969721b77e135e4ab7f2e54a85b8d0c1c66fac","schema_version":"1.0","event_id":"sha256:44a35a21177ca98bdcb8645298969721b77e135e4ab7f2e54a85b8d0c1c66fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:JAGGLH3PVP4S4BCXYGIKGFL27Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Trees for Learning and Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Matthew A. Taddy, Nicholas G. Polson, Robert B. Gramacy","submitted_at":"2009-12-08T23:49:08Z","abstract_excerpt":"Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the accumulation of new data, and provide particle learning algorithms that allow for the efficient on-line posterior filtering of tree-states. A major advantage of tree regression is that it allows for the use of very simple models within each partition. The model also facilitates a natural division of labor in our sequential particle-based inference: tree dynamics ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1586","kind":"arxiv","version":4},"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-18T04:35:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9WZuhrVCobZaBEvLq/L1HACbEt0g1zpuijLQGvz8NBc+FzrjpuKqLHfGG+Sc3Lqh19OJwe2moPDfeVER/sJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:59:23.644948Z"},"content_sha256":"55d9d3c49c52e0bf6258ca2aba1c1f76bc6726c6c62a8cf8d0fd52dc8e02ce67","schema_version":"1.0","event_id":"sha256:55d9d3c49c52e0bf6258ca2aba1c1f76bc6726c6c62a8cf8d0fd52dc8e02ce67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/bundle.json","state_url":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/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-06-07T03:59:23Z","links":{"resolver":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z","bundle":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/bundle.json","state":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:JAGGLH3PVP4S4BCXYGIKGFL27Z","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":"0d1db68eb5d887ef3c4db54fce3f9057b3b7a24867ee9d50ba2077df27877456","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-12-08T23:49:08Z","title_canon_sha256":"774708dd4eb6c3b96067ec9486b104a612750773767dec21dee8e7d4e908bb67"},"schema_version":"1.0","source":{"id":"0912.1586","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.1586","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"arxiv_version","alias_value":"0912.1586v4","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1586","created_at":"2026-05-18T04:35:05Z"},{"alias_kind":"pith_short_12","alias_value":"JAGGLH3PVP4S","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"JAGGLH3PVP4S4BCX","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"JAGGLH3P","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:55d9d3c49c52e0bf6258ca2aba1c1f76bc6726c6c62a8cf8d0fd52dc8e02ce67","target":"graph","created_at":"2026-05-18T04:35:05Z","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":"Dynamic regression trees are an attractive option for automatic regression and classification with complicated response surfaces in on-line application settings. We create a sequential tree model whose state changes in time with the accumulation of new data, and provide particle learning algorithms that allow for the efficient on-line posterior filtering of tree-states. A major advantage of tree regression is that it allows for the use of very simple models within each partition. The model also facilitates a natural division of labor in our sequential particle-based inference: tree dynamics ar","authors_text":"Matthew A. Taddy, Nicholas G. Polson, Robert B. Gramacy","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-12-08T23:49:08Z","title":"Dynamic Trees for Learning and Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.1586","kind":"arxiv","version":4},"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:44a35a21177ca98bdcb8645298969721b77e135e4ab7f2e54a85b8d0c1c66fac","target":"record","created_at":"2026-05-18T04:35:05Z","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":"0d1db68eb5d887ef3c4db54fce3f9057b3b7a24867ee9d50ba2077df27877456","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2009-12-08T23:49:08Z","title_canon_sha256":"774708dd4eb6c3b96067ec9486b104a612750773767dec21dee8e7d4e908bb67"},"schema_version":"1.0","source":{"id":"0912.1586","kind":"arxiv","version":4}},"canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","first_computed_at":"2026-05-18T04:35:05.154537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:35:05.154537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9VU0xYcyPk4kA9a5bK08rmHuuj+1iFunGQ1EK85TtvXfbfwcx5xd+ENQw7lnoI1qxhgbXiYBVzMNhdb4Uy1/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:35:05.154973Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.1586","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44a35a21177ca98bdcb8645298969721b77e135e4ab7f2e54a85b8d0c1c66fac","sha256:55d9d3c49c52e0bf6258ca2aba1c1f76bc6726c6c62a8cf8d0fd52dc8e02ce67"],"state_sha256":"f39fe2edb289f51bc42ad08253d535b3a5de1464d492989a4dbe366c222c0c46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/glGSVNk+jP3COJ7qxc90OJ/kEvD+nllrxVXFw6FoDEAOZbkcfVwIxgjHtir8SNcRICi0c7G+1AJCkJjd7UoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:59:23.646922Z","bundle_sha256":"62879d5ded1972c3a1c8b396f81073169c71c995512a7b5cb5378391aaca7507"}}