{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3GZ5WYOM5KBPJAAJV5DVZU32SC","short_pith_number":"pith:3GZ5WYOM","canonical_record":{"source":{"id":"1411.0839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-04T09:55:40Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f04e39464c76ffa2da0ed416bc0b871b3ca77ccae2b07ecb140530db99289534","abstract_canon_sha256":"40e765a60894734344128486fa5997cc383077180e6a0ed68cdbdf9cb286775d"},"schema_version":"1.0"},"canonical_sha256":"d9b3db61ccea82f48009af475cd37a90a5e8d5fed710a19aa322d0eae7bfaa45","source":{"kind":"arxiv","id":"1411.0839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0839","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0839v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0839","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"3GZ5WYOM5KBP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GZ5WYOM5KBPJAAJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GZ5WYOM","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3GZ5WYOM5KBPJAAJV5DVZU32SC","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-04T09:55:40Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"f04e39464c76ffa2da0ed416bc0b871b3ca77ccae2b07ecb140530db99289534","abstract_canon_sha256":"40e765a60894734344128486fa5997cc383077180e6a0ed68cdbdf9cb286775d"},"schema_version":"1.0"},"canonical_sha256":"d9b3db61ccea82f48009af475cd37a90a5e8d5fed710a19aa322d0eae7bfaa45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:38.110561Z","signature_b64":"GtducZj55n03JQJ/Y+zPO0Tf/z5QtVUKhz0Aes9SYAu28PktrEq0TCEeexyW9oFb+4kLUbL0pprEeyELN7HaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b3db61ccea82f48009af475cd37a90a5e8d5fed710a19aa322d0eae7bfaa45","last_reissued_at":"2026-05-18T02:38:38.109880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:38.109880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0839","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPnMWsH1D+69C7X2mJfTWXVExl2qlt24G70aDK20j6hcmhdMrJhGoRx8SXE2etmC3wNqDiPj45Ob3fR74V/eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:16:22.637817Z"},"content_sha256":"89d531942fb02fb2780db751ba55d58383944f9cce26c11ee5524e2ba9c14c9f","schema_version":"1.0","event_id":"sha256:89d531942fb02fb2780db751ba55d58383944f9cce26c11ee5524e2ba9c14c9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3GZ5WYOM5KBPJAAJV5DVZU32SC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification algorithms using adaptive partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Albert Cohen, Peter Binev, Ronald DeVore, Wolfgang Dahmen","submitted_at":"2014-11-04T09:55:40Z","abstract_excerpt":"Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335-1353; Mach. Learn. 66 (2007) 209-242], we consider decorated trees, which allow us to derive higher or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0839","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:38:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fBP0Jf8nNuklpYg51ze46yap+dseY13bGfuaiPP00ZyFgYdpT7mwexcp9RNGv+AMR+Hmz69RM+ENxitY8jBwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:16:22.638167Z"},"content_sha256":"15db601f991d084e34e69163441e5118f8d3400ab3dfae51d10ff6062b5d5d13","schema_version":"1.0","event_id":"sha256:15db601f991d084e34e69163441e5118f8d3400ab3dfae51d10ff6062b5d5d13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/bundle.json","state_url":"https://pith.science/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/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-01T04:16:22Z","links":{"resolver":"https://pith.science/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC","bundle":"https://pith.science/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/bundle.json","state":"https://pith.science/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GZ5WYOM5KBPJAAJV5DVZU32SC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3GZ5WYOM5KBPJAAJV5DVZU32SC","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":"40e765a60894734344128486fa5997cc383077180e6a0ed68cdbdf9cb286775d","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-04T09:55:40Z","title_canon_sha256":"f04e39464c76ffa2da0ed416bc0b871b3ca77ccae2b07ecb140530db99289534"},"schema_version":"1.0","source":{"id":"1411.0839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0839","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0839v1","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0839","created_at":"2026-05-18T02:38:38Z"},{"alias_kind":"pith_short_12","alias_value":"3GZ5WYOM5KBP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3GZ5WYOM5KBPJAAJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3GZ5WYOM","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:15db601f991d084e34e69163441e5118f8d3400ab3dfae51d10ff6062b5d5d13","target":"graph","created_at":"2026-05-18T02:38:38Z","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":"Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335-1353; Mach. Learn. 66 (2007) 209-242], we consider decorated trees, which allow us to derive higher or","authors_text":"Albert Cohen, Peter Binev, Ronald DeVore, Wolfgang Dahmen","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-04T09:55:40Z","title":"Classification algorithms using adaptive partitioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0839","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:89d531942fb02fb2780db751ba55d58383944f9cce26c11ee5524e2ba9c14c9f","target":"record","created_at":"2026-05-18T02:38:38Z","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":"40e765a60894734344128486fa5997cc383077180e6a0ed68cdbdf9cb286775d","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-11-04T09:55:40Z","title_canon_sha256":"f04e39464c76ffa2da0ed416bc0b871b3ca77ccae2b07ecb140530db99289534"},"schema_version":"1.0","source":{"id":"1411.0839","kind":"arxiv","version":1}},"canonical_sha256":"d9b3db61ccea82f48009af475cd37a90a5e8d5fed710a19aa322d0eae7bfaa45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b3db61ccea82f48009af475cd37a90a5e8d5fed710a19aa322d0eae7bfaa45","first_computed_at":"2026-05-18T02:38:38.109880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:38.109880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GtducZj55n03JQJ/Y+zPO0Tf/z5QtVUKhz0Aes9SYAu28PktrEq0TCEeexyW9oFb+4kLUbL0pprEeyELN7HaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:38.110561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d531942fb02fb2780db751ba55d58383944f9cce26c11ee5524e2ba9c14c9f","sha256:15db601f991d084e34e69163441e5118f8d3400ab3dfae51d10ff6062b5d5d13"],"state_sha256":"a2edd554c126d9ba2d6a11d96e86e4e44fd7275b9c8ad1c935419d1ec494d7db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IQo9LD7K6Pwx+O6E/50lvp2BRckN9EtwnKvEsnNt4esOdoUOvWReEEEfpnLc+z1MbpGg9BgEP6l61dV0S7RBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:16:22.640280Z","bundle_sha256":"231bfcf0e556cd7abf3cb28b8c1004e8096b63d3c8d4f143e50b4bac53d98e8f"}}