{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VXPFGD5OXLRNP6AD5ODZ6XDHHG","short_pith_number":"pith:VXPFGD5O","schema_version":"1.0","canonical_sha256":"adde530faebae2d7f803eb879f5c6739a10e4e2365855e6fee4dc55101167a21","source":{"kind":"arxiv","id":"1508.04326","version":1},"attestation_state":"computed","paper":{"title":"Cascade Learning by Optimally Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jiale Cao, Xuelong Li, Yanwei Pang","submitted_at":"2015-08-18T14:12:45Z","abstract_excerpt":"Cascaded AdaBoost classifier is a well-known efficient object detection algorithm. The cascade structure has many parameters to be determined. Most of existing cascade learning algorithms are designed by assigning detection rate and false positive rate to each stage either dynamically or statically. Their objective functions are not directly related to minimum computation cost. These algorithms are not guaranteed to have optimal solution in the sense of minimizing computation cost. On the assumption that a strong classifier is given, in this paper we propose an optimal cascade learning algorit"},"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":"1508.04326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-08-18T14:12:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a8e911ab164d83a00129fff7463f858531733cf639b3ca63b1cc82f567e42c71","abstract_canon_sha256":"e74ace17b1fe826e6551fe418dd94adc40f2ffc6dfba62c3edbef097297d6113"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.485795Z","signature_b64":"QQytdHul25YnGlgyyXVvpyGLPClqVeaDYcx/5u1oH68Wu+BPul+XFWuohCq5fdfMBR92qkcykSCmHquYWLB/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adde530faebae2d7f803eb879f5c6739a10e4e2365855e6fee4dc55101167a21","last_reissued_at":"2026-05-18T01:04:50.485421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.485421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cascade Learning by Optimally Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jiale Cao, Xuelong Li, Yanwei Pang","submitted_at":"2015-08-18T14:12:45Z","abstract_excerpt":"Cascaded AdaBoost classifier is a well-known efficient object detection algorithm. The cascade structure has many parameters to be determined. Most of existing cascade learning algorithms are designed by assigning detection rate and false positive rate to each stage either dynamically or statically. Their objective functions are not directly related to minimum computation cost. These algorithms are not guaranteed to have optimal solution in the sense of minimizing computation cost. On the assumption that a strong classifier is given, in this paper we propose an optimal cascade learning algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04326","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":"1508.04326","created_at":"2026-05-18T01:04:50.485486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04326v1","created_at":"2026-05-18T01:04:50.485486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04326","created_at":"2026-05-18T01:04:50.485486+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXPFGD5OXLRN","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXPFGD5OXLRNP6AD","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXPFGD5O","created_at":"2026-05-18T12:29:47.479230+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/VXPFGD5OXLRNP6AD5ODZ6XDHHG","json":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG.json","graph_json":"https://pith.science/api/pith-number/VXPFGD5OXLRNP6AD5ODZ6XDHHG/graph.json","events_json":"https://pith.science/api/pith-number/VXPFGD5OXLRNP6AD5ODZ6XDHHG/events.json","paper":"https://pith.science/paper/VXPFGD5O"},"agent_actions":{"view_html":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG","download_json":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG.json","view_paper":"https://pith.science/paper/VXPFGD5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04326&json=true","fetch_graph":"https://pith.science/api/pith-number/VXPFGD5OXLRNP6AD5ODZ6XDHHG/graph.json","fetch_events":"https://pith.science/api/pith-number/VXPFGD5OXLRNP6AD5ODZ6XDHHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG/action/storage_attestation","attest_author":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG/action/author_attestation","sign_citation":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG/action/citation_signature","submit_replication":"https://pith.science/pith/VXPFGD5OXLRNP6AD5ODZ6XDHHG/action/replication_record"}},"created_at":"2026-05-18T01:04:50.485486+00:00","updated_at":"2026-05-18T01:04:50.485486+00:00"}