{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GYVXD3BYKSGPBWN375UJM2MLUI","short_pith_number":"pith:GYVXD3BY","canonical_record":{"source":{"id":"1407.1079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"stat.ME","submitted_at":"2014-07-03T22:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"fcee24b4685e3d8ff508c70ea56c974610f774b7df77b066ada8ca5f38e27eb5","abstract_canon_sha256":"97858d3a785f3e73a4c6e50d91c6e333a0e4274c99ac32ad3289bffdc3b4df0a"},"schema_version":"1.0"},"canonical_sha256":"362b71ec38548cf0d9bbff6896698ba208937ea2509d561bbb4eff7c022a6334","source":{"kind":"arxiv","id":"1407.1079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1079","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1079v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1079","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"GYVXD3BYKSGP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYVXD3BYKSGPBWN3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYVXD3BY","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GYVXD3BYKSGPBWN375UJM2MLUI","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1079","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"stat.ME","submitted_at":"2014-07-03T22:26:39Z","cross_cats_sorted":[],"title_canon_sha256":"fcee24b4685e3d8ff508c70ea56c974610f774b7df77b066ada8ca5f38e27eb5","abstract_canon_sha256":"97858d3a785f3e73a4c6e50d91c6e333a0e4274c99ac32ad3289bffdc3b4df0a"},"schema_version":"1.0"},"canonical_sha256":"362b71ec38548cf0d9bbff6896698ba208937ea2509d561bbb4eff7c022a6334","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:18.794727Z","signature_b64":"V4R9bZj5xDi4XhY0/GYVWUsR66ZMjphhuvKjSmAnBYO0WxKx+DhTxPyu6I3iSUxldV1r0EdTogxjl7XVgeY0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362b71ec38548cf0d9bbff6896698ba208937ea2509d561bbb4eff7c022a6334","last_reissued_at":"2026-05-18T02:48:18.794152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:18.794152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1079","source_version":1,"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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7faH5z5UsaM8yFyOFt691dNNeDpakQX9CXRTesVINkMO+a+YZ79Dos9bwarnVu8xi7oyGj1Pn3Tt86gb3FcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:00:30.049426Z"},"content_sha256":"67e165059921905f5243a7c8b63d95307c0bf1268f610e21afeefea97ac6c6a9","schema_version":"1.0","event_id":"sha256:67e165059921905f5243a7c8b63d95307c0bf1268f610e21afeefea97ac6c6a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GYVXD3BYKSGPBWN375UJM2MLUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Building Consistent Regression Trees From Complex Sample Data","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Daniell Toth, John Eltinge","submitted_at":"2014-07-03T22:26:39Z","abstract_excerpt":"In the past several years a wide range of methods for the construction of regression trees and other estimators based on the recursive partitioning of samples have appeared in the statistics literature. Many applications involve data collected through a complex sample design. At present, however, relatively little is known regarding the properties of these methods under complex designs. This article proposes a method for incorporating information about the complex sample design when building a regression tree using a recursive partitioning algorithm. Sufficient conditions are established for a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1079","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"},"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-18T02:48:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BvicBDex0XwnsNVzQK77oKV0Q99EEFnECqOSSiblXJgqi9nGwhi6hOucoUS7+Jno2G2rsfUvl0WZExK6+lHzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:00:30.049781Z"},"content_sha256":"e0a152bce6b8c809b7ba251f65db1675e07e9d4c36b06bd557c5a53c80c7bc71","schema_version":"1.0","event_id":"sha256:e0a152bce6b8c809b7ba251f65db1675e07e9d4c36b06bd557c5a53c80c7bc71"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYVXD3BYKSGPBWN375UJM2MLUI/bundle.json","state_url":"https://pith.science/pith/GYVXD3BYKSGPBWN375UJM2MLUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYVXD3BYKSGPBWN375UJM2MLUI/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-11T12:00:30Z","links":{"resolver":"https://pith.science/pith/GYVXD3BYKSGPBWN375UJM2MLUI","bundle":"https://pith.science/pith/GYVXD3BYKSGPBWN375UJM2MLUI/bundle.json","state":"https://pith.science/pith/GYVXD3BYKSGPBWN375UJM2MLUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYVXD3BYKSGPBWN375UJM2MLUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GYVXD3BYKSGPBWN375UJM2MLUI","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":"97858d3a785f3e73a4c6e50d91c6e333a0e4274c99ac32ad3289bffdc3b4df0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"stat.ME","submitted_at":"2014-07-03T22:26:39Z","title_canon_sha256":"fcee24b4685e3d8ff508c70ea56c974610f774b7df77b066ada8ca5f38e27eb5"},"schema_version":"1.0","source":{"id":"1407.1079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1079","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1079v1","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1079","created_at":"2026-05-18T02:48:18Z"},{"alias_kind":"pith_short_12","alias_value":"GYVXD3BYKSGP","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GYVXD3BYKSGPBWN3","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GYVXD3BY","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:e0a152bce6b8c809b7ba251f65db1675e07e9d4c36b06bd557c5a53c80c7bc71","target":"graph","created_at":"2026-05-18T02:48:18Z","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":"In the past several years a wide range of methods for the construction of regression trees and other estimators based on the recursive partitioning of samples have appeared in the statistics literature. Many applications involve data collected through a complex sample design. At present, however, relatively little is known regarding the properties of these methods under complex designs. This article proposes a method for incorporating information about the complex sample design when building a regression tree using a recursive partitioning algorithm. Sufficient conditions are established for a","authors_text":"Daniell Toth, John Eltinge","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"stat.ME","submitted_at":"2014-07-03T22:26:39Z","title":"Building Consistent Regression Trees From Complex Sample Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1079","kind":"arxiv","version":1},"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:67e165059921905f5243a7c8b63d95307c0bf1268f610e21afeefea97ac6c6a9","target":"record","created_at":"2026-05-18T02:48:18Z","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":"97858d3a785f3e73a4c6e50d91c6e333a0e4274c99ac32ad3289bffdc3b4df0a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"stat.ME","submitted_at":"2014-07-03T22:26:39Z","title_canon_sha256":"fcee24b4685e3d8ff508c70ea56c974610f774b7df77b066ada8ca5f38e27eb5"},"schema_version":"1.0","source":{"id":"1407.1079","kind":"arxiv","version":1}},"canonical_sha256":"362b71ec38548cf0d9bbff6896698ba208937ea2509d561bbb4eff7c022a6334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"362b71ec38548cf0d9bbff6896698ba208937ea2509d561bbb4eff7c022a6334","first_computed_at":"2026-05-18T02:48:18.794152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:18.794152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4R9bZj5xDi4XhY0/GYVWUsR66ZMjphhuvKjSmAnBYO0WxKx+DhTxPyu6I3iSUxldV1r0EdTogxjl7XVgeY0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:18.794727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e165059921905f5243a7c8b63d95307c0bf1268f610e21afeefea97ac6c6a9","sha256:e0a152bce6b8c809b7ba251f65db1675e07e9d4c36b06bd557c5a53c80c7bc71"],"state_sha256":"16061f51a57c4d40cf2f21618c2cae395b2c3f3b1add8e306685a30d53b5dc6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spczP0+PDH13nbBFX0FIkgvTlRmAy6QU8yO8gwU/Z0PUgghdQ5ARGOBpSpeWY6fYEp5FFhDFS93O77P9ncwDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:00:30.051708Z","bundle_sha256":"c27991018abc93532dd17a0cc8cfc8dc64fbe85cc6385d5efe54c03cf24e6d5f"}}