{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T435A6BLLIWAQB64NRGMLZZMQZ","short_pith_number":"pith:T435A6BL","canonical_record":{"source":{"id":"1507.06923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-24T17:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"160a5730011d6ddade2815038b6f6f95c15c11185fafa8506b6dc6a8ec96e6af","abstract_canon_sha256":"090a8bfdd976439cf4edea5c782353bd3c82b850b55ed47e40819313041dfc39"},"schema_version":"1.0"},"canonical_sha256":"9f37d0782b5a2c0807dc6c4cc5e72c8675a2f9f13d8dea4e4b53db8bcb781eb2","source":{"kind":"arxiv","id":"1507.06923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06923","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06923v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06923","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"T435A6BLLIWA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T435A6BLLIWAQB64","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T435A6BL","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T435A6BLLIWAQB64NRGMLZZMQZ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.06923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-24T17:22:17Z","cross_cats_sorted":[],"title_canon_sha256":"160a5730011d6ddade2815038b6f6f95c15c11185fafa8506b6dc6a8ec96e6af","abstract_canon_sha256":"090a8bfdd976439cf4edea5c782353bd3c82b850b55ed47e40819313041dfc39"},"schema_version":"1.0"},"canonical_sha256":"9f37d0782b5a2c0807dc6c4cc5e72c8675a2f9f13d8dea4e4b53db8bcb781eb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:21.667640Z","signature_b64":"85tL1+jjuetQxqgjCOMrSrml01PF5yLGksTNyU5y/ftlofj9fFf9Cg7QrNWJjvZbfyVu97P47yGOVYQqL8WRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f37d0782b5a2c0807dc6c4cc5e72c8675a2f9f13d8dea4e4b53db8bcb781eb2","last_reissued_at":"2026-05-18T01:36:21.667180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:21.667180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.06923","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nL873cOn6HjUgTLReniTcf61fI/VtySStJ7kGQZ8FV+uAevJUciWTiTYppX0iDcMsIhoRWlGHU2rldins798BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:50:26.542781Z"},"content_sha256":"aa6d280002742d023d87a4a8d10ad23dac0f20185e51444d9d8184cd826bb838","schema_version":"1.0","event_id":"sha256:aa6d280002742d023d87a4a8d10ad23dac0f20185e51444d9d8184cd826bb838"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T435A6BLLIWAQB64NRGMLZZMQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Reinforcement Learning Approach to Online Learning of Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Abhinav Garlapati, Aditi Raghunathan, Balaraman Ravindran, Vaishnavh Nagarajan","submitted_at":"2015-07-24T17:22:17Z","abstract_excerpt":"Online decision tree learning algorithms typically examine all features of a new data point to update model parameters. We propose a novel alternative, Reinforcement Learning- based Decision Trees (RLDT), that uses Reinforcement Learning (RL) to actively examine a minimal number of features of a data point to classify it with high accuracy. Furthermore, RLDT optimizes a long term return, providing a better alternative to the traditional myopic greedy approach to growing decision trees. We demonstrate that this approach performs as well as batch learning algorithms and other online decision tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06923","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:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XC337xHxJbgK09JUlnQBAS3qfCn17kY11SLOM/vpJisQYaHHhCyThOpxv71uv26YwnMNbV833sBXUpxDp9vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:50:26.543399Z"},"content_sha256":"0bc0b7297cad0bbb94ba44d24963993273a2e0ca73de827270bc9d89fe8b058f","schema_version":"1.0","event_id":"sha256:0bc0b7297cad0bbb94ba44d24963993273a2e0ca73de827270bc9d89fe8b058f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T435A6BLLIWAQB64NRGMLZZMQZ/bundle.json","state_url":"https://pith.science/pith/T435A6BLLIWAQB64NRGMLZZMQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T435A6BLLIWAQB64NRGMLZZMQZ/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-05-26T22:50:26Z","links":{"resolver":"https://pith.science/pith/T435A6BLLIWAQB64NRGMLZZMQZ","bundle":"https://pith.science/pith/T435A6BLLIWAQB64NRGMLZZMQZ/bundle.json","state":"https://pith.science/pith/T435A6BLLIWAQB64NRGMLZZMQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T435A6BLLIWAQB64NRGMLZZMQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T435A6BLLIWAQB64NRGMLZZMQZ","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":"090a8bfdd976439cf4edea5c782353bd3c82b850b55ed47e40819313041dfc39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-24T17:22:17Z","title_canon_sha256":"160a5730011d6ddade2815038b6f6f95c15c11185fafa8506b6dc6a8ec96e6af"},"schema_version":"1.0","source":{"id":"1507.06923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.06923","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1507.06923v1","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06923","created_at":"2026-05-18T01:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"T435A6BLLIWA","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T435A6BLLIWAQB64","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T435A6BL","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:0bc0b7297cad0bbb94ba44d24963993273a2e0ca73de827270bc9d89fe8b058f","target":"graph","created_at":"2026-05-18T01:36:21Z","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":"Online decision tree learning algorithms typically examine all features of a new data point to update model parameters. We propose a novel alternative, Reinforcement Learning- based Decision Trees (RLDT), that uses Reinforcement Learning (RL) to actively examine a minimal number of features of a data point to classify it with high accuracy. Furthermore, RLDT optimizes a long term return, providing a better alternative to the traditional myopic greedy approach to growing decision trees. We demonstrate that this approach performs as well as batch learning algorithms and other online decision tre","authors_text":"Abhinav Garlapati, Aditi Raghunathan, Balaraman Ravindran, Vaishnavh Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-24T17:22:17Z","title":"A Reinforcement Learning Approach to Online Learning of Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06923","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:aa6d280002742d023d87a4a8d10ad23dac0f20185e51444d9d8184cd826bb838","target":"record","created_at":"2026-05-18T01:36:21Z","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":"090a8bfdd976439cf4edea5c782353bd3c82b850b55ed47e40819313041dfc39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-24T17:22:17Z","title_canon_sha256":"160a5730011d6ddade2815038b6f6f95c15c11185fafa8506b6dc6a8ec96e6af"},"schema_version":"1.0","source":{"id":"1507.06923","kind":"arxiv","version":1}},"canonical_sha256":"9f37d0782b5a2c0807dc6c4cc5e72c8675a2f9f13d8dea4e4b53db8bcb781eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f37d0782b5a2c0807dc6c4cc5e72c8675a2f9f13d8dea4e4b53db8bcb781eb2","first_computed_at":"2026-05-18T01:36:21.667180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:21.667180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"85tL1+jjuetQxqgjCOMrSrml01PF5yLGksTNyU5y/ftlofj9fFf9Cg7QrNWJjvZbfyVu97P47yGOVYQqL8WRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:21.667640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.06923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa6d280002742d023d87a4a8d10ad23dac0f20185e51444d9d8184cd826bb838","sha256:0bc0b7297cad0bbb94ba44d24963993273a2e0ca73de827270bc9d89fe8b058f"],"state_sha256":"0628b9ec550844a1e3b2cc51bfe943cae77cf523061af01f4d2787e98be3d75b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P3l3WSrVtKtWn25mMNRQmhGdt2VEVBMobsPBbzCBluxUpMdIeo8S8Y9McHYrEvgwTgjeK5YCt4Wl2pJo0AbUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:50:26.546047Z","bundle_sha256":"0e452c01de09cee67aa6add49d1272ea58dadc16e10d36773a25cc0d8b564392"}}