{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:JAGGLH3PVP4S4BCXYGIKGFL27Z","short_pith_number":"pith:JAGGLH3P","schema_version":"1.0","canonical_sha256":"480c659f6fabf92e0457c190a3157afe4d09e46ca09df048d663120093b5ad96","source":{"kind":"arxiv","id":"0912.1586","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0912.1586","created_at":"2026-05-18T04:35:05.154606+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.1586v4","created_at":"2026-05-18T04:35:05.154606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.1586","created_at":"2026-05-18T04:35:05.154606+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAGGLH3PVP4S","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAGGLH3PVP4S4BCX","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAGGLH3P","created_at":"2026-05-18T12:26:00.592388+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/JAGGLH3PVP4S4BCXYGIKGFL27Z","json":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z.json","graph_json":"https://pith.science/api/pith-number/JAGGLH3PVP4S4BCXYGIKGFL27Z/graph.json","events_json":"https://pith.science/api/pith-number/JAGGLH3PVP4S4BCXYGIKGFL27Z/events.json","paper":"https://pith.science/paper/JAGGLH3P"},"agent_actions":{"view_html":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z","download_json":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z.json","view_paper":"https://pith.science/paper/JAGGLH3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.1586&json=true","fetch_graph":"https://pith.science/api/pith-number/JAGGLH3PVP4S4BCXYGIKGFL27Z/graph.json","fetch_events":"https://pith.science/api/pith-number/JAGGLH3PVP4S4BCXYGIKGFL27Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/action/storage_attestation","attest_author":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/action/author_attestation","sign_citation":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/action/citation_signature","submit_replication":"https://pith.science/pith/JAGGLH3PVP4S4BCXYGIKGFL27Z/action/replication_record"}},"created_at":"2026-05-18T04:35:05.154606+00:00","updated_at":"2026-05-18T04:35:05.154606+00:00"}