{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S3IZTBF7FDL56OOUDBCTUKKDLB","short_pith_number":"pith:S3IZTBF7","canonical_record":{"source":{"id":"1710.09567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-26T07:33:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c2b393eb25e6b698a8057978d10b8ca715836a493ec5c18e744560363a46b01b","abstract_canon_sha256":"5a6cf79fa808bd5be6212ecbad67884ceaafc04f3410e596aba033456babeb39"},"schema_version":"1.0"},"canonical_sha256":"96d19984bf28d7df39d418453a2943587ab4253204f0c5c6932f00442e32f478","source":{"kind":"arxiv","id":"1710.09567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09567","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09567v1","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09567","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"S3IZTBF7FDL5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3IZTBF7FDL56OOU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3IZTBF7","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S3IZTBF7FDL56OOUDBCTUKKDLB","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-26T07:33:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c2b393eb25e6b698a8057978d10b8ca715836a493ec5c18e744560363a46b01b","abstract_canon_sha256":"5a6cf79fa808bd5be6212ecbad67884ceaafc04f3410e596aba033456babeb39"},"schema_version":"1.0"},"canonical_sha256":"96d19984bf28d7df39d418453a2943587ab4253204f0c5c6932f00442e32f478","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:56.881049Z","signature_b64":"S4JH1m1FTu0i/oanhy0VF1xEiyv6AzwqH990JGKYBBowrZaBSVkGJ1edhfWUOKWBa80DSnUG2O3RH8UK7slEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96d19984bf28d7df39d418453a2943587ab4253204f0c5c6932f00442e32f478","last_reissued_at":"2026-05-18T00:31:56.880686Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:56.880686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09567","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-18T00:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GtCxuTFmUB/GBR8pXoiHG92ZQJmscJH1jjC9nIaBAiCXcGGgBbgm7/1q1Edb/xZg+TaUnlHQLiHwkkFNoS6vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:19:45.829402Z"},"content_sha256":"19470fd5d0793015925db194861eb262ea2ed05c8915f91f6f3eabc8263eef9c","schema_version":"1.0","event_id":"sha256:19470fd5d0793015925db194861eb262ea2ed05c8915f91f6f3eabc8263eef9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S3IZTBF7FDL56OOUDBCTUKKDLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Big Data Classification Using Augmented Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Rajiv Sambasivan, Sourish Das","submitted_at":"2017-10-26T07:33:40Z","abstract_excerpt":"We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble methods, the models produced by the algorithm can be easily interpreted. The algorithm is based on a divide and conquer strategy and consists of two steps. The first step consists of using a decision tree to segment the large dataset. By construction, decision trees attempt to create homogeneous class distributions in their leaf nodes. However, non-homogeneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09567","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-18T00:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+0/NZxMn4am96HNoLAUNcWEYCvttFGjsrLMmM2+ByXxPj26PuiQwMQTlEaaGmUqDtRSGfk1+VKIXNvVspHODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T02:19:45.830031Z"},"content_sha256":"7c133427b7d42e87afe819e47032f8c5e3d461ed0cfde64076f8ff6f084f6874","schema_version":"1.0","event_id":"sha256:7c133427b7d42e87afe819e47032f8c5e3d461ed0cfde64076f8ff6f084f6874"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/bundle.json","state_url":"https://pith.science/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/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-12T02:19:45Z","links":{"resolver":"https://pith.science/pith/S3IZTBF7FDL56OOUDBCTUKKDLB","bundle":"https://pith.science/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/bundle.json","state":"https://pith.science/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3IZTBF7FDL56OOUDBCTUKKDLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S3IZTBF7FDL56OOUDBCTUKKDLB","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":"5a6cf79fa808bd5be6212ecbad67884ceaafc04f3410e596aba033456babeb39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-26T07:33:40Z","title_canon_sha256":"c2b393eb25e6b698a8057978d10b8ca715836a493ec5c18e744560363a46b01b"},"schema_version":"1.0","source":{"id":"1710.09567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09567","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09567v1","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09567","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"S3IZTBF7FDL5","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3IZTBF7FDL56OOU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3IZTBF7","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7c133427b7d42e87afe819e47032f8c5e3d461ed0cfde64076f8ff6f084f6874","target":"graph","created_at":"2026-05-18T00:31:56Z","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 present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble methods, the models produced by the algorithm can be easily interpreted. The algorithm is based on a divide and conquer strategy and consists of two steps. The first step consists of using a decision tree to segment the large dataset. By construction, decision trees attempt to create homogeneous class distributions in their leaf nodes. However, non-homogeneou","authors_text":"Rajiv Sambasivan, Sourish Das","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-26T07:33:40Z","title":"Big Data Classification Using Augmented Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09567","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:19470fd5d0793015925db194861eb262ea2ed05c8915f91f6f3eabc8263eef9c","target":"record","created_at":"2026-05-18T00:31:56Z","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":"5a6cf79fa808bd5be6212ecbad67884ceaafc04f3410e596aba033456babeb39","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-26T07:33:40Z","title_canon_sha256":"c2b393eb25e6b698a8057978d10b8ca715836a493ec5c18e744560363a46b01b"},"schema_version":"1.0","source":{"id":"1710.09567","kind":"arxiv","version":1}},"canonical_sha256":"96d19984bf28d7df39d418453a2943587ab4253204f0c5c6932f00442e32f478","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96d19984bf28d7df39d418453a2943587ab4253204f0c5c6932f00442e32f478","first_computed_at":"2026-05-18T00:31:56.880686Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:56.880686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S4JH1m1FTu0i/oanhy0VF1xEiyv6AzwqH990JGKYBBowrZaBSVkGJ1edhfWUOKWBa80DSnUG2O3RH8UK7slEDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:56.881049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19470fd5d0793015925db194861eb262ea2ed05c8915f91f6f3eabc8263eef9c","sha256:7c133427b7d42e87afe819e47032f8c5e3d461ed0cfde64076f8ff6f084f6874"],"state_sha256":"35c395a01f586c079e7e28623fb3650fe3e7d1d36c0de5628e4a5f9d9e46c0fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6meFEk1YPbSgzaTrA1enyOV43uXWPraUCONusxVwSyJYqv833vDTcs4kCdvdYyeNQeSyFiRM2bFsHf9CN1UWDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T02:19:45.833899Z","bundle_sha256":"27465aaba4bc10f491e579791f9598d35357319876352db576e927ad10216fd1"}}