{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BX7LO5MZJZTJKOEXZOMBSJDT3R","short_pith_number":"pith:BX7LO5MZ","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"},"canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","source":{"kind":"arxiv","id":"1210.2771","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2771","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2771v3","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2771","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"BX7LO5MZJZTJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BX7LO5MZJZTJKOEX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BX7LO5MZ","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BX7LO5MZJZTJKOEXZOMBSJDT3R","target":"record","payload":{"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"},"canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","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"},"source_kind":"arxiv","source_id":"1210.2771","source_version":3,"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-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FZOl0YKPSJW/CQ2PWR/OWb4DWpCCOcc3fkX/l3i52fHye8bCuuQgkUY7syCBmldmaIiJoM/tpttKwup4wujpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:45:06.681869Z"},"content_sha256":"099600debf1ad9e194a1ee0e10ed1e99f5982d4185dd64af6a65b4cda0b09579","schema_version":"1.0","event_id":"sha256:099600debf1ad9e194a1ee0e10ed1e99f5982d4185dd64af6a65b4cda0b09579"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BX7LO5MZJZTJKOEXZOMBSJDT3R","target":"graph","payload":{"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"},"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-18T03:27:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1V0zB4tb7s41FMHEV7K6IhAhLySPksMadV3mVxgzB+LIPpRXq1hRpozRiKFU/LSI+64ii/Ke3zlHeZBg7ekwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:45:06.682578Z"},"content_sha256":"f586d96f30e91e6ab3f9cecac824ade5dbce17e0101b89457ed361229184c34d","schema_version":"1.0","event_id":"sha256:f586d96f30e91e6ab3f9cecac824ade5dbce17e0101b89457ed361229184c34d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/bundle.json","state_url":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/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-10T10:45:06Z","links":{"resolver":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R","bundle":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/bundle.json","state":"https://pith.science/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BX7LO5MZJZTJKOEXZOMBSJDT3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BX7LO5MZJZTJKOEXZOMBSJDT3R","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":"28eede49cd64b79505b5c59c8a9897375bac87b84159c7f89ac3f72c862e92b3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-09T22:17:42Z","title_canon_sha256":"80596e094960668feda0d4cfd46c63ee202673f0e3290909eebb5491b4410374"},"schema_version":"1.0","source":{"id":"1210.2771","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.2771","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"arxiv_version","alias_value":"1210.2771v3","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2771","created_at":"2026-05-18T03:27:32Z"},{"alias_kind":"pith_short_12","alias_value":"BX7LO5MZJZTJ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BX7LO5MZJZTJKOEX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BX7LO5MZ","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:f586d96f30e91e6ab3f9cecac824ade5dbce17e0101b89457ed361229184c34d","target":"graph","created_at":"2026-05-18T03:27:32Z","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":"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 ","authors_text":"Kilian Q. Weinberger, Matt J. Kusner, Minmin Chen, Zhixiang Xu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-09T22:17:42Z","title":"Cost-Sensitive Tree of Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2771","kind":"arxiv","version":3},"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:099600debf1ad9e194a1ee0e10ed1e99f5982d4185dd64af6a65b4cda0b09579","target":"record","created_at":"2026-05-18T03:27:32Z","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":"28eede49cd64b79505b5c59c8a9897375bac87b84159c7f89ac3f72c862e92b3","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-09T22:17:42Z","title_canon_sha256":"80596e094960668feda0d4cfd46c63ee202673f0e3290909eebb5491b4410374"},"schema_version":"1.0","source":{"id":"1210.2771","kind":"arxiv","version":3}},"canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dfeb775994e66953897cb98192473dc5842408a6a03b1037f3e5f1d9ed86bd5","first_computed_at":"2026-05-18T03:27:32.612105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:32.612105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rnba9TD9nymwGixZLZ2JGWm9TRr0hSa6PwesbshbDl2xqMPJtwYHC6wGgnZ8aCIkH6mJwNxkJkRXN1Lnas2yDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:32.612860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.2771","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:099600debf1ad9e194a1ee0e10ed1e99f5982d4185dd64af6a65b4cda0b09579","sha256:f586d96f30e91e6ab3f9cecac824ade5dbce17e0101b89457ed361229184c34d"],"state_sha256":"2c16a1d4c9d5d6123c702d3b12b88c6b8a5bd8cfad4b0fcbe9292c0880b0ed32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyXVICTwsNHomXsp/k1WBp00DZC8BHsRstb0MDUN27lq4IV7j6lqFjgmdi/uMRD2zy6sTj17EYiABnFh8a1KBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:45:06.687200Z","bundle_sha256":"bdcdeea9a44b430826c0f2b469de347d14a8aeaa1976e3ede12a696d2ca52698"}}