{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BX7LO5MZJZTJKOEXZOMBSJDT3R","short_pith_number":"pith:BX7LO5MZ","schema_version":"1.0","canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","source":{"kind":"arxiv","id":"1210.2771","version":3},"attestation_state":"computed","paper":{"title":"Cost-Sensitive Tree of Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kilian Q. Weinberger, Matt J. Kusner, Minmin Chen, Zhixiang Xu","submitted_at":"2012-10-09T22:17:42Z","abstract_excerpt":"Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier accuracy in a principled fashion. The test-time cost of a classifier is often dominated by the computation required for feature extraction-which can vary drastically across eatures. We decrease this extraction time by constructing a tree of classifiers, through which test inputs "},"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":"1210.2771","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-09T22:17:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"80596e094960668feda0d4cfd46c63ee202673f0e3290909eebb5491b4410374","abstract_canon_sha256":"28eede49cd64b79505b5c59c8a9897375bac87b84159c7f89ac3f72c862e92b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:32.612860Z","signature_b64":"Rnba9TD9nymwGixZLZ2JGWm9TRr0hSa6PwesbshbDl2xqMPJtwYHC6wGgnZ8aCIkH6mJwNxkJkRXN1Lnas2yDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","last_reissued_at":"2026-05-18T03:27:32.612105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:32.612105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cost-Sensitive Tree of Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kilian Q. Weinberger, Matt J. Kusner, Minmin Chen, Zhixiang Xu","submitted_at":"2012-10-09T22:17:42Z","abstract_excerpt":"Recently, machine learning algorithms have successfully entered large-scale real-world industrial applications (e.g. search engines and email spam filters). Here, the CPU cost during test time must be budgeted and accounted for. In this paper, we address the challenge of balancing the test-time cost and the classifier accuracy in a principled fashion. The test-time cost of a classifier is often dominated by the computation required for feature extraction-which can vary drastically across eatures. We decrease this extraction time by constructing a tree of classifiers, through which test inputs "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2771","kind":"arxiv","version":3},"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":"1210.2771","created_at":"2026-05-18T03:27:32.612225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2771v3","created_at":"2026-05-18T03:27:32.612225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2771","created_at":"2026-05-18T03:27:32.612225+00:00"},{"alias_kind":"pith_short_12","alias_value":"BX7LO5MZJZTJ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BX7LO5MZJZTJKOEX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BX7LO5MZ","created_at":"2026-05-18T12:27:01.376967+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/BX7LO5MZJZTJKOEXZOMBSJDT3R","json":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R.json","graph_json":"https://pith.science/api/pith-number/BX7LO5MZJZTJKOEXZOMBSJDT3R/graph.json","events_json":"https://pith.science/api/pith-number/BX7LO5MZJZTJKOEXZOMBSJDT3R/events.json","paper":"https://pith.science/paper/BX7LO5MZ"},"agent_actions":{"view_html":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R","download_json":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R.json","view_paper":"https://pith.science/paper/BX7LO5MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2771&json=true","fetch_graph":"https://pith.science/api/pith-number/BX7LO5MZJZTJKOEXZOMBSJDT3R/graph.json","fetch_events":"https://pith.science/api/pith-number/BX7LO5MZJZTJKOEXZOMBSJDT3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/action/storage_attestation","attest_author":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/action/author_attestation","sign_citation":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/action/citation_signature","submit_replication":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/action/replication_record"}},"created_at":"2026-05-18T03:27:32.612225+00:00","updated_at":"2026-05-18T03:27:32.612225+00:00"}