{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DVBMSBW3GX7MOZKNDZOOIAKLMX","short_pith_number":"pith:DVBMSBW3","canonical_record":{"source":{"id":"1603.02578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-08T16:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"0377f54df18ea1d9b74f28838a4007c6b9eb1bd6d5de114300916002689f6a47","abstract_canon_sha256":"4249e3ba8beec3e356fc7b75d1cf24f0459d42cb11ea242e61501a0110021397"},"schema_version":"1.0"},"canonical_sha256":"1d42c906db35fec7654d1e5ce4014b65cdba3a3ec0337cde0ff2218fd81ca290","source":{"kind":"arxiv","id":"1603.02578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02578","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02578v1","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02578","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"DVBMSBW3GX7M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVBMSBW3GX7MOZKN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVBMSBW3","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DVBMSBW3GX7MOZKNDZOOIAKLMX","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-08T16:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"0377f54df18ea1d9b74f28838a4007c6b9eb1bd6d5de114300916002689f6a47","abstract_canon_sha256":"4249e3ba8beec3e356fc7b75d1cf24f0459d42cb11ea242e61501a0110021397"},"schema_version":"1.0"},"canonical_sha256":"1d42c906db35fec7654d1e5ce4014b65cdba3a3ec0337cde0ff2218fd81ca290","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:22.889680Z","signature_b64":"vZyX73VRcIGzRC528B3wrY6KU///eq8/jgBgha2RN2xXIgbFy5ALacfz0cFN5wQXbmfGX+D7U+feheutfPp7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d42c906db35fec7654d1e5ce4014b65cdba3a3ec0337cde0ff2218fd81ca290","last_reissued_at":"2026-05-18T01:19:22.889203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:22.889203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02578","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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nV3w6OVbcvOYWSjrcOBjvSNtHISjZsMr38L1StP64VU58lCtLUYqoOzNP5yddxpcBPvCWa3PizWLmqDzOtYTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:44.951719Z"},"content_sha256":"f2063e52bf3eef03daa9319461cb8d6fde1c9f5208923d9398b090653b04af75","schema_version":"1.0","event_id":"sha256:f2063e52bf3eef03daa9319461cb8d6fde1c9f5208923d9398b090653b04af75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DVBMSBW3GX7MOZKNDZOOIAKLMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Batched Lazy Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Artur Dubrawski, Mathieu Guillame-Bert","submitted_at":"2016-03-08T16:36:31Z","abstract_excerpt":"We introduce a batched lazy algorithm for supervised classification using decision trees. It avoids unnecessary visits to irrelevant nodes when it is used to make predictions with either eagerly or lazily trained decision trees. A set of experiments demonstrate that the proposed algorithm can outperform both the conventional and lazy decision tree algorithms in terms of computation time as well as memory consumption, without compromising accuracy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02578","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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AljEx2XB2/QAoaZHdHdl49Hoph3GBdiO6D6aYni5syZSMfEQLSJTRHG/QWFwYXT50WXpATqrE3dZkCu6j0lBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:24:44.952271Z"},"content_sha256":"f029ecaf3ee8c0203a224001b774f61f393c666c05a1cafb41bcd1bde3d74f48","schema_version":"1.0","event_id":"sha256:f029ecaf3ee8c0203a224001b774f61f393c666c05a1cafb41bcd1bde3d74f48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/bundle.json","state_url":"https://pith.science/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/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-05T01:24:44Z","links":{"resolver":"https://pith.science/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX","bundle":"https://pith.science/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/bundle.json","state":"https://pith.science/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVBMSBW3GX7MOZKNDZOOIAKLMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DVBMSBW3GX7MOZKNDZOOIAKLMX","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":"4249e3ba8beec3e356fc7b75d1cf24f0459d42cb11ea242e61501a0110021397","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-08T16:36:31Z","title_canon_sha256":"0377f54df18ea1d9b74f28838a4007c6b9eb1bd6d5de114300916002689f6a47"},"schema_version":"1.0","source":{"id":"1603.02578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02578","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02578v1","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02578","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"DVBMSBW3GX7M","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DVBMSBW3GX7MOZKN","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DVBMSBW3","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:f029ecaf3ee8c0203a224001b774f61f393c666c05a1cafb41bcd1bde3d74f48","target":"graph","created_at":"2026-05-18T01:19:22Z","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 batched lazy algorithm for supervised classification using decision trees. It avoids unnecessary visits to irrelevant nodes when it is used to make predictions with either eagerly or lazily trained decision trees. A set of experiments demonstrate that the proposed algorithm can outperform both the conventional and lazy decision tree algorithms in terms of computation time as well as memory consumption, without compromising accuracy.","authors_text":"Artur Dubrawski, Mathieu Guillame-Bert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-08T16:36:31Z","title":"Batched Lazy Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02578","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:f2063e52bf3eef03daa9319461cb8d6fde1c9f5208923d9398b090653b04af75","target":"record","created_at":"2026-05-18T01:19:22Z","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":"4249e3ba8beec3e356fc7b75d1cf24f0459d42cb11ea242e61501a0110021397","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-08T16:36:31Z","title_canon_sha256":"0377f54df18ea1d9b74f28838a4007c6b9eb1bd6d5de114300916002689f6a47"},"schema_version":"1.0","source":{"id":"1603.02578","kind":"arxiv","version":1}},"canonical_sha256":"1d42c906db35fec7654d1e5ce4014b65cdba3a3ec0337cde0ff2218fd81ca290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d42c906db35fec7654d1e5ce4014b65cdba3a3ec0337cde0ff2218fd81ca290","first_computed_at":"2026-05-18T01:19:22.889203Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:22.889203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vZyX73VRcIGzRC528B3wrY6KU///eq8/jgBgha2RN2xXIgbFy5ALacfz0cFN5wQXbmfGX+D7U+feheutfPp7CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:22.889680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2063e52bf3eef03daa9319461cb8d6fde1c9f5208923d9398b090653b04af75","sha256:f029ecaf3ee8c0203a224001b774f61f393c666c05a1cafb41bcd1bde3d74f48"],"state_sha256":"b9281f7f539979fd7fd40df51fcdfd254d56798448866727281523fc1e8902fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGTgsrYx5KqMjOoweB+UyU/hoPw2ZVuoriSpHQ6NaUnFluA0k3afLRhftyaJpq6kmim1Bpi963N2uJi7pdsyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:24:44.955092Z","bundle_sha256":"b2024dad3737030e5615147b3243ef8da4cb00ea88865129f77bdc06af43ba39"}}