{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DHBN6A3XAO5ZX2LS4PNATOYXAU","short_pith_number":"pith:DHBN6A3X","schema_version":"1.0","canonical_sha256":"19c2df037703bb9be972e3da09bb1705203aac8384a6acb4f8467956d1557999","source":{"kind":"arxiv","id":"1202.1523","version":1},"attestation_state":"computed","paper":{"title":"Information Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Maneesh Dewan, Stefano Soatto, Yiqiang Zhan, Zhao Yi","submitted_at":"2012-02-07T14:54:59Z","abstract_excerpt":"We describe Information Forests, an approach to classification that generalizes Random Forests by replacing the splitting criterion of non-leaf nodes from a discriminative one -- based on the entropy of the label distribution -- to a generative one -- based on maximizing the information divergence between the class-conditional distributions in the resulting partitions. The basic idea consists of deferring classification until a measure of \"classification confidence\" is sufficiently high, and instead breaking down the data so as to maximize this measure. In an alternative interpretation, Inform"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1202.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-07T14:54:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c6cf57fb0e060213f237b548f65035af7f3bc253788391ef6ea471fd96688d8c","abstract_canon_sha256":"a6fd0d23f191a9f47c587a8dc085a56218a49182d944fcf2a16cb631e1ab5717"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:18.042844Z","signature_b64":"lUw+bwx3Le9veE87SheT4Rj671DxalIlcOr5Al8STwDrbsIivelmChr3KGiYhuPohKYUzB/Q8YHjYsSk5J4SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19c2df037703bb9be972e3da09bb1705203aac8384a6acb4f8467956d1557999","last_reissued_at":"2026-05-18T02:21:18.042106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:18.042106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Maneesh Dewan, Stefano Soatto, Yiqiang Zhan, Zhao Yi","submitted_at":"2012-02-07T14:54:59Z","abstract_excerpt":"We describe Information Forests, an approach to classification that generalizes Random Forests by replacing the splitting criterion of non-leaf nodes from a discriminative one -- based on the entropy of the label distribution -- to a generative one -- based on maximizing the information divergence between the class-conditional distributions in the resulting partitions. The basic idea consists of deferring classification until a measure of \"classification confidence\" is sufficiently high, and instead breaking down the data so as to maximize this measure. In an alternative interpretation, Inform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.1523","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.1523","created_at":"2026-05-18T02:21:18.042242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.1523v1","created_at":"2026-05-18T02:21:18.042242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.1523","created_at":"2026-05-18T02:21:18.042242+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHBN6A3XAO5Z","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHBN6A3XAO5ZX2LS","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHBN6A3X","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU","json":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU.json","graph_json":"https://pith.science/api/pith-number/DHBN6A3XAO5ZX2LS4PNATOYXAU/graph.json","events_json":"https://pith.science/api/pith-number/DHBN6A3XAO5ZX2LS4PNATOYXAU/events.json","paper":"https://pith.science/paper/DHBN6A3X"},"agent_actions":{"view_html":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU","download_json":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU.json","view_paper":"https://pith.science/paper/DHBN6A3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.1523&json=true","fetch_graph":"https://pith.science/api/pith-number/DHBN6A3XAO5ZX2LS4PNATOYXAU/graph.json","fetch_events":"https://pith.science/api/pith-number/DHBN6A3XAO5ZX2LS4PNATOYXAU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU/action/storage_attestation","attest_author":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU/action/author_attestation","sign_citation":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU/action/citation_signature","submit_replication":"https://pith.science/pith/DHBN6A3XAO5ZX2LS4PNATOYXAU/action/replication_record"}},"created_at":"2026-05-18T02:21:18.042242+00:00","updated_at":"2026-05-18T02:21:18.042242+00:00"}