{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LBQA6WWRZ7R25PFO4EX3RP3DNX","short_pith_number":"pith:LBQA6WWR","schema_version":"1.0","canonical_sha256":"58600f5ad1cfe3aebcaee12fb8bf636deea809342f3dd7b152150ea924ea2fe0","source":{"kind":"arxiv","id":"1806.11202","version":1},"attestation_state":"computed","paper":{"title":"Quit When You Can: Efficient Evaluation of Ensembles with Ordering Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Maya Gupta, Serena Wang, Seungil You","submitted_at":"2018-06-28T21:29:23Z","abstract_excerpt":"Given a classifier ensemble and a set of examples to be classified, many examples may be confidently and accurately classified after only a subset of the base models in the ensemble are evaluated. This can reduce both mean latency and CPU while maintaining the high accuracy of the original ensemble. To achieve such gains, we propose jointly optimizing a fixed evaluation order of the base models and early-stopping thresholds. Our proposed objective is a combinatorial optimization problem, but we provide a greedy algorithm that achieves a 4-approximation of the optimal solution for certain cases"},"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":"1806.11202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-28T21:29:23Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a32f0999abde2f78bb30af2307dd5dc45d71afaa59ec23eeeed39ec4233b6b9d","abstract_canon_sha256":"912db7db4da17cdf799bb8068074ea423191777f490e61562fc500ec64069717"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:03.290203Z","signature_b64":"rRwgs7i9sjpSW9NUm7bz4rxVGTTr2OISsAs2cDXeFvunE6DmCdocTbFjxZrA6Ph7PFA1GHe8RoQHOOl2jvEWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58600f5ad1cfe3aebcaee12fb8bf636deea809342f3dd7b152150ea924ea2fe0","last_reissued_at":"2026-05-18T00:12:03.289625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:03.289625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quit When You Can: Efficient Evaluation of Ensembles with Ordering Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Maya Gupta, Serena Wang, Seungil You","submitted_at":"2018-06-28T21:29:23Z","abstract_excerpt":"Given a classifier ensemble and a set of examples to be classified, many examples may be confidently and accurately classified after only a subset of the base models in the ensemble are evaluated. This can reduce both mean latency and CPU while maintaining the high accuracy of the original ensemble. To achieve such gains, we propose jointly optimizing a fixed evaluation order of the base models and early-stopping thresholds. Our proposed objective is a combinatorial optimization problem, but we provide a greedy algorithm that achieves a 4-approximation of the optimal solution for certain cases"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.11202","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":"1806.11202","created_at":"2026-05-18T00:12:03.289733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.11202v1","created_at":"2026-05-18T00:12:03.289733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.11202","created_at":"2026-05-18T00:12:03.289733+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBQA6WWRZ7R2","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBQA6WWRZ7R25PFO","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBQA6WWR","created_at":"2026-05-18T12:32:33.847187+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/LBQA6WWRZ7R25PFO4EX3RP3DNX","json":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX.json","graph_json":"https://pith.science/api/pith-number/LBQA6WWRZ7R25PFO4EX3RP3DNX/graph.json","events_json":"https://pith.science/api/pith-number/LBQA6WWRZ7R25PFO4EX3RP3DNX/events.json","paper":"https://pith.science/paper/LBQA6WWR"},"agent_actions":{"view_html":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX","download_json":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX.json","view_paper":"https://pith.science/paper/LBQA6WWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.11202&json=true","fetch_graph":"https://pith.science/api/pith-number/LBQA6WWRZ7R25PFO4EX3RP3DNX/graph.json","fetch_events":"https://pith.science/api/pith-number/LBQA6WWRZ7R25PFO4EX3RP3DNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX/action/storage_attestation","attest_author":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX/action/author_attestation","sign_citation":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX/action/citation_signature","submit_replication":"https://pith.science/pith/LBQA6WWRZ7R25PFO4EX3RP3DNX/action/replication_record"}},"created_at":"2026-05-18T00:12:03.289733+00:00","updated_at":"2026-05-18T00:12:03.289733+00:00"}